Policy iteration-based conditional termination and ranking functions

DOI10.1007/978-3-642-54013-4_25MaRDI QIDQ2938083zbMATH OpenOpenAlexFDO

Authors Damien Massé

Publication date 13 January 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-54013-4_25

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Recommendations

• Proving termination by policy iteration
• Deciding conditional termination
• A new look at the automatic synthesis of linear ranking functions
• Automata, Languages and Programming
• scientific article; zbMATH DE number 1903370

Cited in

(6)

• Extended Nested Dual System Groups, Revisited
• Computing invariants with transformers: experimental scalability and accuracy
• Proving termination through conditional termination
• Proving termination by policy iteration
• First order Büchi automata and their application to verification of LTL specifications
• Inference of ranking functions for proving temporal properties by abstract interpretation

This page was built for publication: Policy iteration-based conditional termination and ranking functions

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