Syntactic control of concurrency
DOI10.1016/J.TCS.2005.10.032zbMATH Open1086.68087OpenAlexW1981776739MaRDI QIDQ817845FDOQ817845
Authors: N. E. Zubov 
Publication date: 20 March 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://ora.ox.ac.uk/objects/uuid:c9fcbd8b-2adc-43c6-951d-ed6a6efc76e4
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Alternating-time temporal logic
- Title not available (Why is that?)
- Full abstraction for idealized Algol with passive expressions
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- Functions with local state: regularity and undecidability
- Title not available (Why is that?)
- Title not available (Why is that?)
- Foundations of Software Science and Computation Structures
- Regular-Language Semantics for a Call-by-Value Programming Language
- Tools and Algorithms for the Construction and Analysis of Systems
- A type system for bounded space and functional in-place update
- Recursion and dynamic data-structures in bounded space: towards embedded ML programming
Cited In (7)
- Geometry of Synthesis II: From Games to Delay-Insensitive Circuits
- Diagrammatic Reasoning for Delay-Insensitive Asynchronous Circuits
- Latent semantic analysis of game models using LSTM
- Automata, Languages and Programming
- Disentangling parallelism and interference in game semantics
- Leafy automata for higher-order concurrency
- Automata, Languages and Programming
Uses Software
This page was built for publication: Syntactic control of concurrency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817845)
