Liveness and acceleration in parameterized verification

DOI10.1007/10722167_26MaRDI QIDQ2754094zbMATH OpenFDO

Authors Amir Pnueli, E. Shahar

Publication date 17 December 2001

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

Full work available at URL https://doi.org/10.1007/10722167_26

zbMATH Keywords

accelerationlivenessparametric systemsregular expressionssymbolic model checkingWS1S

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Model checking and abstraction to the aid of parameterized systems (a survey)
• Verification of parameterized protocols
• scientific article; zbMATH DE number 2086524
• Systematic Acceleration in Regular Model Checking
• scientific article; zbMATH DE number 1953016

Cited in

(23)

• Verification of duration systems using an approximation approach
• Spanning the spectrum from safety to liveness
• Iterating transducers
• Model checking and abstraction to the aid of parameterized systems (a survey)
• Temporal prophecy for proving temporal properties of infinite-state systems
• Compositional analysis for verification of parameterized systems
• Parametrized verification diagrams: temporal verification of symmetric parametrized concurrent systems
• Parameterised verification for multi-agent systems
• Exact acceleration of real-time model checking
• Automated formal analysis and verification: an overview
• Liveness Reasoning with Isabelle/HOL
• Learning Meets Verification
• scientific article; zbMATH DE number 1324660 (Why is no real title available?)
• Liveness of randomised parameterised systems under arbitrary schedulers
• Proving liveness of parameterized programs
• scientific article; zbMATH DE number 1834575 (Why is no real title available?)
• scientific article; zbMATH DE number 2102701 (Why is no real title available?)
• Regular model checking using widening techniques
• On the verification of livelock-freedom and self-stabilization on parameterized rings
• A Fast Verified Liveness Analysis in SSA Form
• On Verifying Fault Tolerance of Distributed Protocols
• An invariant-based approach to the verification of asynchronous parameterized networks
• Permutation rewriting and algorithmic verification

This page was built for publication: Liveness and acceleration in parameterized verification

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