Memory efficient algorithms for the verification of temporal properties
- 19 November 2005
- book chapter
- Published by Springer Nature
- p. 233-242
- https://doi.org/10.1007/bfb0023737
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Adding liveness properties to coupled finite-state machinesACM Transactions on Programming Languages and Systems, 1990
- On-line model-checking for finite linear temporal logic specificationsLecture Notes in Computer Science, 1990
- Unified verification theoryPublished by Springer Nature ,1989
- Protocol EngineeringPublished by Elsevier ,1989
- An improved protocol reachability analysis techniqueSoftware: Practice and Experience, 1988
- Network Protocols and Tools to Help Produce ThemAnnual Review of Computer Science, 1987
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- Checking that finite state concurrent programs satisfy their linear specificationPublished by Association for Computing Machinery (ACM) ,1985
- Tools for Verifying Network ProtocolsPublished by Springer Nature ,1985
- A Validation Technique for Tightly Coupled ProtocolsIEEE Transactions on Computers, 1982