Transitive Closures of Regular Relations for Verifying Infinite-State Systems
- 1 January 2000
- book chapter
- Published by Springer Nature
- p. 220-235
- https://doi.org/10.1007/3-540-46419-0_16
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Model-checking for real-time systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Handling Global Conditions in Parametrized System VerificationPublished by Springer Nature ,1999
- On-the-fly analysis of systems with unbounded, lossy FIFO channelsPublished by Springer Nature ,1998
- Verifying Programs with Unreliable ChannelsInformation and Computation, 1996
- Decidability of the termination problem for completely specified protocolsDistributed Computing, 1994
- Symbolic verification with periodic setsPublished by Springer Nature ,1994
- A really temporal logicPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- 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 fixpointsPublished by Association for Computing Machinery (ACM) ,1977