Verifying an infinite family of inductions simultaneously using data independence and FDR
- 1 January 1999
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Low-overhead time-triggered group membershipPublished by Springer Nature ,1997
- Verifying parameterized networks using abstraction and regular languagesPublished by Springer Nature ,1995
- Reasoning about Infinite ComputationsInformation and Computation, 1994
- Reasoning about systems with many processesJournal of the ACM, 1992
- Verifying properties of large sets of processes with network invariantsLecture Notes in Computer Science, 1990
- Reasoning about networks with many identical finite state processesInformation and Computation, 1989
- Avoiding the state explosion problem in temporal logic model checkingPublished by Association for Computing Machinery (ACM) ,1987