Constraint-Based Analysis of Broadcast Protocols

Authors:
Giorgio Delzanno;Javier Esparza;Andreas Podelski
Affiliations:
-;-;-
Venue:
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Year:
1999

Citing 10
Cited 7

Automata-Theoretic techniques for modal logics of programs

Journal of Computer and System Sciences
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Model Checking in CLP

TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic

CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Symbolic Model Checking of Infinite State Systems Using Presburger Arithmetic

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
HYTECH: A Model Checker for Hybrid Systems

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
General decidability theorems for infinite-state systems

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
On Model Checking for Non-Deterministic Infinite-State Systems

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
On the Verification of Broadcast Protocols

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Parallel program schemata

Journal of Computer and System Sciences

Constraint-Based Model Checking for Parameterized Synchronous Systems

FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
Constraint-Based Verification of Client-Server Protocols

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Better is Better than Well: On Efficient Verification of Infinite-State Systems

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Goal-Directed Invariant Synthesis for Model Checking Modulo Theories

TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Program specialization for verifying infinite state systems: an experimental evaluation

LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
Automated termination in model checking modulo theories

RP'11 Proceedings of the 5th international conference on Reachability problems
Attacking the dimensionality problem of parameterized systems via bounded reachability graphs

FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Broadcast protocols are systems composed of a finite but arbitrarily large number of processes that communicate by rendezvous (two processes exchange a message) or by broadcast (a process sends a message to all other processes). The paper describes an optimized algorithm for the automatic verification of safety properties in broadcast protocols. The algorithm checks whether a property holds for any number of processes.