Non-termination Checking for Imperative Programs

DOI10.1007/978-3-540-79124-9_11zbMath1138.68460OpenAlexW1503406871MaRDI QIDQ5458816

Philipp Rümmer, Helga Velroyen

Publication date: 24 April 2008

Published in: Tests and Proofs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79124-9_11

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (7)

A Dynamic Logic with Traces and Coinduction ⋮ Convergence: integrating termination and abort-freedom ⋮ simpA: an agent-oriented approach for programming concurrent applications on top of Java ⋮ Proving Termination Through Conditional Termination ⋮ Extended Nested Dual System Groups, Revisited ⋮ Abstract Interpretation of Symbolic Execution with Explicit State Updates ⋮ Discovering non-terminating inputs for multi-path polynomial programs

This page was built for publication: Non-termination Checking for Imperative Programs