A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
Presburger arithmetic with unary predicates is P11 complete
Journal of Symbolic Logic
Evolving algebras 1993: Lipari guide
Specification and validation methods
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Automatic verification of Pipelined Microprocessor Control
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Exploiting Positive Equality in a Logic of Equality with Uninterpreted Functions
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Abstract State Machines: A Method for High-Level System Design and Analysis
Abstract State Machines: A Method for High-Level System Design and Analysis
Theoretical Computer Science - Formal methods for components and objects
Software Abstractions: Logic, Language, and Analysis
Software Abstractions: Logic, Language, and Analysis
Model-Based Software Testing and Analysis with C#
Model-Based Software Testing and Analysis with C#
Logics of Specification Languages (Monographs in Theoretical Computer Science. An EATCS Series)
Logics of Specification Languages (Monographs in Theoretical Computer Science. An EATCS Series)
Model-Based Quality Assurance of Windows Protocol Documentation
ICST '08 Proceedings of the 2008 International Conference on Software Testing, Verification, and Validation
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
An SMT Approach to Bounded Reachability Analysis of Model Programs
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Formal Modeling and Analysis of a Flash Filesystem in Alloy
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
On Bounded Reachability of Programs with Set Comprehensions
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Model based testing with labelled transition systems
Formal methods and testing
Model-based testing of object-oriented reactive systems with spec explorer
Formal methods and testing
What's decidable about arrays?
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Bounded model checking of software using SMT solvers instead of SAT solvers
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Hi-index | 0.00 |
Model programs are high-level behavioral specifications typically representing Abstract State Machines or ASMs. Conformance checking of model programs is the problem of deciding if the set of traces allowed by one model program forms a subset of the set of traces allowed by another model program. This is a foundational problem in the context of model-based testing, where one model program corresponds to an implementation and the other one to its specification. Here model programs are described using the ASM language AsmL. We assume a background ${\mathcal{T}}$ containing linear arithmetic, sets, and tuples. We introduce the Bounded Conformance Checking problem or BCC as a special case of the conformance checking problem when the length of traces is bounded and provide a mapping of BCC to a theorem proving problem in ${\mathcal{T}}$. BCC is shown to be highly undecidable in the general case but decidable for a class of model programs that are common in practice.