Algebraic Methodology and Software Technology

DOI10.1007/B98770zbMATH Open1108.68379OpenAlexW2973096144MaRDI QIDQ5312973FDOQ5312973

Authors: Magali Contensin, Laurence Pierre 

Publication date: 25 August 2005

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

Full work available at URL: https://doi.org/10.1007/b98770

Recommendations

• scientific article; zbMATH DE number 2182497
• Bounded model checking of infinite state systems
• scientific article; zbMATH DE number 1487866
• Model-Checking Large Finite-State Systems and Beyond
• Bounded model checking and induction: From refutation to verification (extended abstract, Category A)

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cited In (3)

• On model checking data-independent systems with arrays without reset
• Formal Approaches to Software Testing
• Symbolic Execution Based Model Checking of Open Systems with Unbounded Variables

Uses Software

• ACL2
• PVS
• HOL
• InVeSt
• MOCHA

This page was built for publication: Algebraic Methodology and Software Technology

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