Topology in process calculus : approximate correctness and infinite evolution of concurrent programs
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
0387950923
- Dimensions
-
24 cm
- Extent
-
VIII, 220 S.
- Language
-
Englisch
- Notes
-
Literaturverz. S. 213 - 218
- Keyword
-
Bisimulation
Prozessalgebra
Paralleles Programm
Korrektheit
Beweis
Prozessalgebra
- Event
-
Veröffentlichung
- (where)
-
New York, Berlin, Heidelberg, Barcelona, Hong Kong, London, Milan, Paris, Singapore, Tokyo
- (who)
-
Springer
- (when)
-
2001
- Creator
-
Ying, Mingsheng
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.06.2025, 2:27 PM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Ying, Mingsheng
- Springer
Time of origin
- 2001
Other Objects (12)
On correctness of buffer implementations in a concurrent lambda calculus with futures
On correctness of buffer implementations in a concurrent lambda calculus with futures
Infinite idealizations and approximate explanations in economics
Infinite approximate subgroups of soluble Lie groups
Algebras for iteration, infinite executions and correctness of sequential computations
Correctness and concurrent complexity of the Black-White Bakery Algorithm
Correctness and completeness of a categorical semantics of the calculus of constructions
Correctness and completeness of a categorical semantics of the calculus of constructions
Correctness and completeness of a categorical semantics of the calculus of constructions
Verifying correctness of persistent concurrent data structures: a sound and complete method
Program equivalence for a concurrent lambda calculus with futures
A structural operational semantics of a concurrent class calculus
On correctness of buffer implementations in a concurrent lambda calculus with futures
On correctness of buffer implementations in a concurrent lambda calculus with futures
Infinite idealizations and approximate explanations in economics
Infinite approximate subgroups of soluble Lie groups
Algebras for iteration, infinite executions and correctness of sequential computations
Correctness and concurrent complexity of the Black-White Bakery Algorithm
Correctness and completeness of a categorical semantics of the calculus of constructions
Correctness and completeness of a categorical semantics of the calculus of constructions
Correctness and completeness of a categorical semantics of the calculus of constructions
Verifying correctness of persistent concurrent data structures: a sound and complete method
Program equivalence for a concurrent lambda calculus with futures
A structural operational semantics of a concurrent class calculus
On correctness of buffer implementations in a concurrent lambda calculus with futures
On correctness of buffer implementations in a concurrent lambda calculus with futures
Infinite idealizations and approximate explanations in economics
Infinite approximate subgroups of soluble Lie groups
Algebras for iteration, infinite executions and correctness of sequential computations
Correctness and concurrent complexity of the Black-White Bakery Algorithm
Correctness and completeness of a categorical semantics of the calculus of constructions
Correctness and completeness of a categorical semantics of the calculus of constructions
Correctness and completeness of a categorical semantics of the calculus of constructions
Verifying correctness of persistent concurrent data structures: a sound and complete method
Program equivalence for a concurrent lambda calculus with futures