Automata-Based Termination Proofs

DOI10.1007/978-3-642-02979-0_20zbMath1248.68148OpenAlexW1572650308MaRDI QIDQ3637353

Radu Iosif, Adam Rogalewicz

Publication date: 9 July 2009

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02979-0_20

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Automatically proving termination and memory safety for programs with pointer arithmetic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transition Invariants and Transition Predicate Abstraction for Program Termination
• Variance analyses from invariance analyses
• Proving Termination of Tree Manipulating Programs
• The Büchi Complementation Saga
• Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
• Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm
• The size-change principle for program termination
• Verifying properties of well-founded linked lists
• Verification, Model Checking, and Abstract Interpretation
• Automatic Termination Proofs for Programs with Shape-Shifting Heaps
• Programs with Lists Are Counter Automata
• Static Analysis
• Flat Parametric Counter Automata

This page was built for publication: Automata-Based Termination Proofs