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