Syntactic control of concurrency

We consider a finitary procedural programming language (finite data-types, no recursion) extended with parallel composition and binary semaphores. Having first shown that may-equivalence of second-order open terms is undecidable we set out to find a framework in which decidability can be regained wi...

Disgrifiad llawn

Manylion Llyfryddiaeth
Prif Awduron: Ghica, D, Murawski, A, Ong, L
Fformat: Journal article
Iaith:English
Cyhoeddwyd: Elsevier 2006
Pynciau:

Eitemau Tebyg