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...
Автори: | Ghica, D, Murawski, A, Ong, L |
---|---|
Формат: | Journal article |
Мова: | English |
Опубліковано: |
Elsevier
2006
|
Предмети: |
Схожі ресурси
Схожі ресурси
-
Angelic semantics of fine-grained concurrency
за авторством: Ghica, D, та інші
Опубліковано: (2008) -
Games for complexity of second-order call-by-name programs
за авторством: Murawski, A
Опубліковано: (2005) -
Functions with local state: regularity and undecidability
за авторством: Murawski, A
Опубліковано: (2005) -
Third-order Idealized Algol with iteration is decidable
за авторством: Murawski, A, та інші
Опубліковано: (2008) -
Method of defining syntactic metalanguage
за авторством: 8096 British Standards Institution