Compositionality for Tightly Coupled Systems: A New Application of the Propositions-as-Types Interpretation
Open Access
- 1 May 2006
- journal article
- research article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 159, 299-323
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Formal verification of concurrent programs using the Larch proverIEEE Transactions on Software Engineering, 1998
- A foundation for modular reasoning about safety and progress properties of state-based concurrent programsTheoretical Computer Science, 1997
- Invariants, composition, and substitutionActa Informatica, 1995
- The temporal logic of actionsACM Transactions on Programming Languages and Systems, 1994
- Derivation of concurrent programs: two examplesScience of Computer Programming, 1992
- Conditional rewriting logic as a unified model of concurrencyTheoretical Computer Science, 1992
- win and sin : predicate transformers for concurrencyACM Transactions on Programming Languages and Systems, 1990
- Mechanically verifying concurrent programs with the Boyer-Moore proverIEEE Transactions on Software Engineering, 1990
- Proving the Correctness of Multiprocess ProgramsIEEE Transactions on Software Engineering, 1977
- Verifying properties of parallel programsCommunications of the ACM, 1976