Constraint-based analysis of broadcast protocols

DOI10.1007/3-540-48168-0_5MaRDI QIDQ4945217zbMATH OpenFDO

Authors Giorgio Delzanno, Javier Esparza, Andreas Podelski

Publication date 23 March 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48168-0_5

zbMATH Keywords

broadcast protocols

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Parameterized verification and model checking for distributed broadcast protocols
• Verification of consensus algorithms using satisfiability solving
• Formal modeling and analysis of a narrow bandwidth protocol for establishing and terminating connections
• Compositional verification of a communication protocol for a remotely operated aircraft
• Temporal Verification of Fault-Tolerant Protocols

Cited in

(9)

• Cardinality constraints for arrays (decidability results and applications)
• Higher-order quantifier elimination, counter simulations and fault-tolerant systems
• Assumption-based analysis of distance-bounding protocols with \textsc{cpsa}
• Compositional verification of a communication protocol for a remotely operated aircraft
• Analysis of meeting protocols by formalisation, simulation, and verification
• Program specialization for verifying infinite state systems: an experimental evaluation
• An extension of lazy abstraction with interpolation for programs with arrays
• SMT-based verification of data-aware processes: a model-theoretic approach
• Formal modeling and analysis of a narrow bandwidth protocol for establishing and terminating connections

Describes a project that uses

Uses Software

• HyTech

This page was built for publication: Constraint-based analysis of broadcast protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4945217)