Transitive Closures of Regular Relations for Verifying Infinite-State Systems
Authors:
- 1 January 2000
- book chapter
- Published by Springer Nature
- p. 220-235
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Model-checking for real-time systems2002
- Handling Global Conditions in Parametrized System Verification1999
- On-the-fly analysis of systems with unbounded, lossy FIFO channelsLecture Notes in Computer Science, 1998
- Verifying Programs with Unreliable ChannelsInformation and Computation, 1996
- Decidability of the termination problem for completely specified protocolsDistributed Computing, 1994
- Symbolic verification with periodic sets1994
- A really temporal logic1989
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Derivation of a termination detection algorithm for distributed computationsInformation Processing Letters, 1983
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints1977