Interface theories for concurrency and data
DOI10.1016/J.TCS.2011.04.007zbMath1216.68187OpenAlexW2087192990MaRDI QIDQ549177
Sebastian S. Bauer, Martin Wirsing, Rolf Hennicker
Publication date: 7 July 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.04.007
compositionalityrefinementcompatibilitycomponent-based designinterface theorymodal input/output automatapre- and postcondition
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 (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On determinism in modal transition systems
- Causal message sequence charts
- Trustworthly global computing. 5th international symposium, TGC 2010, Munich, Germany, February 24--26, 2010. Revised selected papers
- Algebraic methods: theory, tools and applications. Workshop, held on June 9-11, 1987 in Passau, FRG. Proceedings
- Formal methods: foundations and applications. 13th Brazilian symposium on formal methods, SBMF 2010, Natal, Brazil, November 8--11, 2010. Revised selected papers
- Proof of correctness of data representations
- A Modal Interface Theory for Component-based Design
- A Modal Interface Theory with Data Constraints
- On Modal Refinement and Consistency
- On Weak Modal Compatibility, Refinement, and the MIO Workbench
- Institutions: abstract model theory for specification and programming
- An Interface Group for Process Components
- Frontiers of Combining Systems
- Modal I/O Automata for Interface and Product Line Theories
This page was built for publication: Interface theories for concurrency and data
