Automatic verification of counter systems with ranking function

DOI10.1016/J.ENTCS.2009.05.032MaRDI QIDQ5179052zbMATH OpenOpenAlexFDO

Authors Emmanuelle Encrenaz, Alain Finkel

Publication date 19 March 2015

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2009.05.032

zbMATH Keywords

ranking functionautomatic verificationconvex counter systemsfinal termination propertyparametric protocol ZCSP

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Ranking Functions for Size-Change Termination II
• A new look at the automatic synthesis of linear ranking functions
• scientific article; zbMATH DE number 1701751
• MODULAR RANKING ABSTRACTION
• scientific article; zbMATH DE number 1903370

Cites work

• scientific article; zbMATH DE number 1954380 (Why is no real title available?)
• A well-structured framework for analysing Petri net extensions
• CONCUR 2005 – Concurrency Theory
• Flat Parametric Counter Automata
• Tools and Algorithms for the Construction and Analysis of Systems
• Towards a Model-Checker for Counter Systems
• Verification, Model Checking, and Abstract Interpretation

Cited in

(1)

• Ranking function synthesis for bit-vector relations

Describes a project that uses

Uses Software

• FAST

This page was built for publication: Automatic verification of counter systems with ranking function

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