Proving non-termination

DOI10.1145/1328438.1328459MaRDI QIDQ3189834zbMATH OpenOpenAlexFDO

Authors Ashutosh Gupta, Rupak Majumdar, Andrey Rybalchenko, Ru-Gang Xu, Thomas A. Henzinger

Publication date 12 September 2014

Published in Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1328438.1328459

zbMATH Keywords

model checkingnon-terminationprogram verificationrecurrent setstesting

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Non-termination Checking for Imperative Programs
• TERMINATION ANALYSIS OF LINEAR LOOPS
• Proving non-termination by finite automata
• Alternation for termination
• Proving Liveness by Backwards Reachability

Cited in

(24)

• Loop detection by logically constrained term rewriting
• Convergence: integrating termination and abort-freedom
• \textsc{LTL} falsification in infinite-state systems
• Automatic discovery of fair paths in infinite-state transition systems
• Proving the existence of fair paths in infinite-state systems
• Discovering non-terminating inputs for multi-path polynomial programs
• A second-order formulation of non-termination
• Extended Nested Dual System Groups, Revisited
• Proving termination through conditional termination
• Proving the Correctness of the Implementation of a Control-Command Algorithm
• All-Termination(T)
• A non-termination criterion for binary constraint logic programs
• Alternation for termination
• Efficient CTL verification via Horn constraints solving
• A calculus for modular loop acceleration
• From invariant checking to invariant inference using randomized search
• Non-termination Checking for Imperative Programs
• Synthesising programs with non-trivial constants
• Local Nontermination Detection for Parallel C++ Programs
• Commutativity for concurrent program termination proofs
• Multiphase-linear ranking functions and their relation to recurrent sets
• Checking equivalence in a non-strict language
• Decision tree learning in CEGIS-based termination analysis
• Summarization for termination: No return!

This page was built for publication: Proving non-termination

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