Approximated parameterized verification of infinite-state processes with global conditions

DOI10.1007/s10703-008-0062-9zbMath1176.68110OpenAlexW2057593151MaRDI QIDQ1039841

Parosh Aziz Abdulla, Ahmed Rezine, Giorgio Delzanno

Publication date: 23 November 2009

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10703-008-0062-9

zbMATH Keywords

parameterized systemsover-approximationunbounded processes

Mathematics Subject Classification ID

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

Related Items (4)

Verification of Gap-Order Constraint Abstractions of Counter Systems ⋮ Verification of gap-order constraint abstractions of counter systems ⋮ Parametrized invariance for infinite state processes ⋮ Automatic Verification of Directory-Based Consistency Protocols

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A closed-form evaluation for Datalog queries with integer (gap)-order constraints
• Algorithmic analysis of programs with well quasi-ordered domains.
• Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
• Reasoning about systems with many processes
• A new solution of Dijkstra's concurrent programming problem
• Computer Aided Verification
• Parameterized Verification of Infinite-State Processes with Global Conditions
• Monotonic Abstraction in Action
• Verification, Model Checking, and Abstract Interpretation
• Computer Aided Verification
• Symbolic model checking with rich assertional languages

This page was built for publication: Approximated parameterized verification of infinite-state processes with global conditions