An improved protocol reachability analysis technique

Software: Practice and Experience

Volumn 18, Issue 2, 1988, Pages 137-161

  Holzmann, Gerard J ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Protocol validation; Reachability analysis; State space scarching; Symbolic execution; Verification

Indexed keywords

COMPUTER NETWORKS - PROTOCOLS; MATHEMATICAL TECHNIQUES - STATE SPACE METHODS;

PROTOCOL REACHABILITY ANALYSIS; PROTOCOL VALIDATION; STATE SPACE SEARCHING; STATE VECTOR MODEL;

COMPUTER SYSTEMS, DIGITAL;

EID: 0023960738     PISSN: 00380644     EISSN: 1097024X     Source Type: Journal    
DOI: 10.1002/spe.4380180203     Document Type: Article

References (24)

1. Formal methods in communication protocol design
2. Protocol validation by duologue matrix analysis
3. Automated validation of a communications protocol: the CCITT X.21 recommendation
4. Verification of protocols using symbolic execution
5. Toward analyzing and synthesizing protocols
6. Applications and limitations of automated protocol validation
7. Tracing Protocols
8. General Technique for communications protocol validation
9. Limits for automatic verification of finite‐state concurrent systems
10. The Pandora system ‐ an interactive system for the design of data communication protocols
11. On Limits and Possibilities of Automated Protocol Analysis
12. Scatter Storage Techniques
13. Automated Protocol Validation in Argos, assertion proving and scatter searching
14. A note on reliable full‐duplex transmission over half‐duplex lines