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...
Autori principali: | Ghica, D, Murawski, A, Ong, L |
---|---|
Natura: | Journal article |
Lingua: | English |
Pubblicazione: |
Elsevier
2006
|
Soggetti: |
Documenti analoghi
Documenti analoghi
-
Angelic semantics of fine-grained concurrency
di: Ghica, D, et al.
Pubblicazione: (2008) -
Games for complexity of second-order call-by-name programs
di: Murawski, A
Pubblicazione: (2005) -
Functions with local state: regularity and undecidability
di: Murawski, A
Pubblicazione: (2005) -
Third-order Idealized Algol with iteration is decidable
di: Murawski, A, et al.
Pubblicazione: (2008) -
Method of defining syntactic metalanguage
di: 8096 British Standards Institution