Automatic discovery of fair paths in infinite-state transition systems
From MaRDI portal
Publication:2147176
DOI10.1007/978-3-030-88885-5_3zbMATH Open1497.68290OpenAlexW3207031131MaRDI QIDQ2147176FDOQ2147176
Alberto Griggio, Alessandro Cimatti, Enrico Magnago
Publication date: 22 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-88885-5_3
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Cites Work
- Title not available (Why is that?)
- Formal Methods for the Design of Real-Time Systems
- The MathSAT5 SMT Solver
- Geometric nontermination arguments
- A compositional approach to CTL\(^*\) verification
- Temporal property verification as a program analysis task
- Proving non-termination
- Infinite-State Liveness-to-Safety via Implicit Abstraction and Well-Founded Relations
- Two Consequences of the Transposition Theorem on Linear Inequalities
- Ranking Templates for Linear Loops
- Termination of triangular Integer loops is decidable
- Model checking with strong fairness
- Proving the existence of fair paths in infinite-state systems
- Proving Termination of Programs Automatically with AProVE
- Verifying Increasingly Expressive Temporal Logics for Infinite-State Systems
- SMT-Based Induction Methods for Timed Systems
Cited In (2)
Uses Software
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Logic for Programming, Artificial Intelligence, and Reasoning 👍 👎
- Fairness for pushdown automata. 👍 👎
- Diagnosability of fair transition systems 👍 👎
- Program refinement in fair transition systems 👍 👎
- Proving the existence of fair paths in infinite-state systems 👍 👎
- Fairness for Infinite-State Systems 👍 👎
This page was built for publication: Automatic discovery of fair paths in infinite-state transition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147176)
