Syntactic control of concurrency

DOI10.1016/j.tcs.2005.10.032zbMath1086.68087OpenAlexW1981776739MaRDI QIDQ817845

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

zbMATH Keywords

model checkinggame semanticstype systems

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

Geometry of Synthesis II: From Games to Delay-Insensitive Circuits ⋮ Latent semantic analysis of game models using LSTM ⋮ Leafy automata for higher-order concurrency ⋮ Diagrammatic Reasoning for Delay-Insensitive Asynchronous Circuits

Uses Software

• Automath

Cites Work

• Functions with local state: regularity and undecidability
• Full abstraction for idealized Algol with passive expressions
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• Recursion and dynamic data-structures in bounded space
• Alternating-time temporal logic
• Regular-Language Semantics for a Call-by-Value Programming Language
• Tools and Algorithms for the Construction and Analysis of Systems
• Foundations of Software Science and Computation Structures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Syntactic control of concurrency