Automated Protocol Validation in Argos: Assertion Proving and Scatter Searching

Authors:
Gerard J. Holzmann
Affiliations:
AT&T Bell Laboratories, Murray Hill, NJ
Venue:
IEEE Transactions on Software Engineering
Year:
1987

Citing 0
Cited 15

Combining Static Concurrency Analysis with Symbolic Execution

IEEE Transactions on Software Engineering
Protocol verification using reachability analysis: the state space explosion problem and relief strategies

SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
Rethinking the taxonomy of fault detection techniques

ICSE '89 Proceedings of the 11th international conference on Software engineering
t An Integrated Approach to Design of Protocol Specifications Using Protocol Validation and Synthesis

IEEE Transactions on Computers - Special issue on protocol engineering
Graph models for reachability analysis of concurrent programs

ACM Transactions on Software Engineering and Methodology (TOSEM)
Completeness and consistency analysis of state-based requirements

Proceedings of the 17th international conference on Software engineering
Completeness and Consistency in Hierarchical State-Based Requirements

IEEE Transactions on Software Engineering - Special issue: best papers of the 17th International Conference on Software Engineering (ICSE-17)
Application of Partial-Order Methods to Reactive Programswith Event Memorization

Real-Time Systems
Protocol Design: Redefining the State of the Art

IEEE Software
Protocol Validation for Large-Scale Applications

IEEE Software
Analyzing Encryption Protocols Using Formal Verification Authentication Schemes

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Improving the model development process: model testing: is it only a special case of software testing?

Proceedings of the 34th conference on Winter simulation: exploring new frontiers
Hierarchical Adaptive State Space Caching Based on Level Sampling

TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Search-order independent state caching

Transactions on Petri nets and other models of concurrency IV
Research: Designing bug-free protocols with SPIN

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Argos is a validation language for data communication protocols. To validate a protocol, a model in Argos is constructed consisting of a control flow specification and a formal description of the correctness requirements. This model can be compiled into a minimized lower level description that is based on a formal model of communicating finite state machines. An automated protocol validator trace uses these minimized descriptions to perform a partial symbolic execution of the protocol to establish its correctness for the given requirements.