Concurrent program schemes and their logics

DOI10.1016/0304-3975(87)90088-0zbMath0631.68016OpenAlexW1991008756MaRDI QIDQ1094866

David Peleg

Publication date: 1987

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90088-0

zbMATH Keywords

decidabilityaxiomatizationdynamic logicsgoto schemesstructured schemes

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decidability of finite probabilistic propositional dynamic logics
• Alternating tree automata
• Communication in concurrent dynamic logic
• An elementary proof of the completeness of PDL
• Definability in dynamic logic
• Theory of program structures: Schemes, semantics, verification
• Finiteness is mu-ineffable
• Propositional dynamic logic of regular programs
• Parallel program schemata
• The correctness of nondeterministic programs
• Propositional dynamic logic of flowcharts
• A programming language for the inductive sets, and applications
• Concurrent dynamic logic
• On folk theorems
• Alternation

This page was built for publication: Concurrent program schemes and their logics