Decomposing refinement proofs using assume-guarantee reasoning
- 8 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Formal specification and verification of a dataflow processor arrayPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Reactive modulesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Circular Compositional Reasoning about LivenessPublished by Springer Nature ,1999
- The Formal Design of 1M-Gate ASICsPublished by Springer Nature ,1998
- An Assume-Guarantee Rule for Checking SimulationPublished by Springer Nature ,1998
- MOCHA: Modularity in model checkingPublished by Springer Nature ,1998
- Conjoining specificationsACM Transactions on Programming Languages and Systems, 1995
- Local liveness for compositional modeling of fair reactive systemsPublished by Springer Nature ,1995
- Composing specificationsACM Transactions on Programming Languages and Systems, 1993
- Proofs of Networks of ProcessesIEEE Transactions on Software Engineering, 1981