Memory-efficient algorithms for the verification of temporal properties
- 1 October 1992
- journal article
- research article
- Published by Springer Nature in Formal Methods in System Design
- Vol. 1 (2-3), 275-288
- https://doi.org/10.1007/bf00121128
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Unified verification theoryLecture Notes in Computer Science, 1989
- On the relation of programs and computations to models of temporal logicPublished by Springer Nature ,1989
- Protocol EngineeringPublished by Elsevier ,1989
- 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
- General Technique for Communications Protocol ValidationIBM Journal of Research and Development, 1978
- Automated Validation of a Communications Protocol: the CCITT X.21 RecommendationIBM Journal of Research and Development, 1978