Presburger arithmetic with unary predicates is P11 complete
Journal of Symbolic Logic
Evolving algebras 1993: Lipari guide
Specification and validation methods
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
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
Testing, Optimizaton, and Games
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Online testing with model programs
Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering
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
On Bounded Reachability of Programs with Set Comprehensions
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
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
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Alternating simulation and IOCO
ICTSS'10 Proceedings of the 22nd IFIP WG 6.1 international conference on Testing software and systems
Symbolic bounded conformance checking of model programs
PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
A theory of history dependent abstractions for learning interface automata
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
| Hi-index | 0.00 |
Model programs are used as high-level behavioral specifications typically representing abstract state machines. For modeling reactive systems, one uses input-output model programs, where the action vocabulary is divided between two conceptual players: the input player and the output player. The players share the action vocabulary and make moves that are labeled by actions according to their respective model programs. Conformance between the two model programs means that the output (input) player only makes output (input) moves that are allowed by the input (output) players model program. In a bounded game, the total number of moves is fixed. Here model programs use a background theory $\mathcal{T}$ containing linear arithmetic, sets, and tuples. We formulate the bounded game conformance checking problem, or BGC, as a theorem proving problem modulo $\mathcal{T}$ and analyze its complexity.