Automatic Deductive Verification with Invisible Invariants
- 23 March 2001
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Control and data abstraction: the cornerstones of practical formal verificationInternational Journal on Software Tools for Technology Transfer, 2000
- Reducing Model Checking of the Many to the FewPublished by Springer Nature ,2000
- Handling Global Conditions in Parametrized System VerificationPublished by Springer Nature ,1999
- Verifying an infinite family of inductions simultaneously using data independence and FDRPublished by Springer Nature ,1999
- Automated verification of Szymanski's algorithmPublished by Springer Nature ,1998
- A proof of burns N-process mutual exclusion algorithm using abstractionPublished by Springer Nature ,1998
- A Structural Induction Theorem for ProcessesInformation and Computation, 1995
- Reasoning about ringsPublished by Association for Computing Machinery (ACM) ,1995
- An experience in proving regular networks of processes by modular model checkingActa Informatica, 1992
- Limits for automatic verification of finite-state concurrent systemsInformation Processing Letters, 1986