Automated verification of Szymanski's algorithm
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 424-438
- https://doi.org/10.1007/bfb0054187
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Verifying invariants using theorem provingPublished by Springer Nature ,1996
- Preprocessing for invariant validationPublished by Springer Nature ,1996
- Automatic generation of invariants and intermediate assertionsPublished by Springer Nature ,1995
- CAVEAT: technique and tool for computer aided verification and transformationPublished by Springer Nature ,1995
- Concurrency without toil: a systematic method for parallel program designScience of Computer Programming, 1993
- Mechanically verifying concurrent programs with the Boyer-Moore proverIEEE Transactions on Software Engineering, 1990
- Limits for automatic verification of finite-state concurrent systemsInformation Processing Letters, 1986
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- Automatic discovery of linear restraints among variables of a programPublished by Association for Computing Machinery (ACM) ,1978
- Program invariants as fixed pointsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1977