\textsc{LTL} falsification in infinite-state systems
From MaRDI portal
Publication:2105460
Recommendations
- Automatic discovery of fair paths in infinite-state transition systems
- Proving the existence of fair paths in infinite-state systems
- Infinite-state liveness-to-safety via implicit abstraction and well-founded relations
- Falsification of LTL Safety Properties in Hybrid Systems
- Fairness modulo theory: a new approach to LTL software model checking
Cites work
- A compositional approach to CTL^* verification
- A constraint-based approach to solving games on infinite graphs
- A new look at the automatic synthesis of linear ranking functions
- A theory of timed automata
- Automatic discovery of fair paths in infinite-state transition systems
- Compositional reasoning
- Computer Aided Verification
- Formal Methods for the Design of Real-Time Systems
- Formal techniques for distributed systems. Joint 14th IFIP WG 6.1 international conference, FMOODS 2012 and 32nd IFIP WG 6.1 international conference, FORTE 2012, Stockholm, Sweden, June 13--16, 2012. Proceedings
- GUARANTEED TERMINATION IN THE VERIFICATION OF LTL PROPERTIES OF NON-LINEAR ROBUST DISCRETE TIME HYBRID SYSTEMS
- Geometric nontermination arguments
- Infinite-state liveness-to-safety via implicit abstraction and well-founded relations
- Model checking with strong fairness
- Monte-Carlo techniques for falsification of temporal properties of non-linear hybrid systems
- On the decidability of continuous time specification formalisms
- Proving non-termination
- Proving termination of programs automatically with AProVE
- Proving the existence of fair paths in infinite-state systems
- Ranking Templates for Linear Loops
- Region Stability Proofs for Hybrid Systems
- Temporal property verification as a program analysis task
- The MathSAT5 SMT solver
- The benefits of relaxing punctuality
- Tools and algorithms for the construction and analysis of systems. 14th international conference, TACAS 2008, held as part of the joint European conferences on theory and practice of software, ETAPS 2008, Budapest, Hungary, March 29--April 6, 2008. Procee
- Tools and algorithms for the construction and analysis of systems. 25 years of TACAS: TOOLympics, held as part of ETAPS 2019, Prague, Czech Republic, April 6--11, 2019. Proceedings. Part III
- Two Consequences of the Transposition Theorem on Linear Inequalities
- Verifying increasingly expressive temporal logics for infinite-state systems
Describes a project that uses
Uses Software
This page was built for publication: \textsc{LTL} falsification in infinite-state systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2105460)
