Proving Termination of Tree Manipulating Programs

DOI10.1007/978-3-540-75596-8_12zbMath1141.68469OpenAlexW1814719004MaRDI QIDQ3510793

Tomáš Vojnar, Peter Habermehl, Radu Iosif, Adam Rogalewicz

Publication date: 3 July 2008

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75596-8_12

Mathematics Subject Classification ID

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

Related Items

Automatically proving termination and memory safety for programs with pointer arithmetic, Programs with lists are counter automata, Automata-Based Termination Proofs

Uses Software

• BLAST
• SLAM