A case study in verification based on trace abstractions
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 341-373
- https://doi.org/10.1007/bfb0024435
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- STeP: The Stanford Temporal ProverLecture Notes in Computer Science, 1995
- The temporal logic of actionsACM Transactions on Programming Languages and Systems, 1994
- Proving Nondeterministically Specified Safety Properties Using Progress MeasuresInformation and Computation, 1993
- The concurrency workbenchACM Transactions on Programming Languages and Systems, 1993
- The existence of refinement mappingsTheoretical Computer Science, 1991
- Software for Analytical Development of Communications ProtocolsAT&T Technical Journal, 1990
- A unified approach for showing language containment and equivalence between various types of ω-automataPublished by Springer Nature ,1990
- On verifying that a concurrent program satisfies a nondeterministic specificationInformation Processing Letters, 1989
- Notes on Communicating Sequential SystemsPublished by Springer Nature ,1986
- Specifying Concurrent Program ModulesACM Transactions on Programming Languages and Systems, 1983