Theoretical Computer Science
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Bounded Model Checking Using Satisfiability Solving
Formal Methods in System Design
Bounded Model Checking for Timed Systems
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Short CNF in Finitely-Valued Logics
ISMIS '93 Proceedings of the 7th International Symposium on Methodologies for Intelligent Systems
Counterexample-guided abstraction refinement for symbolic model checking
Journal of the ACM (JACM)
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
Models and Temporal Logics for Timed Component Connectors
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
SAT-based Abstraction Refinement for Real-time Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Checking Equivalence for Reo Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Interpolant-based transition relation approximation
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Verification of context-dependent channel-based service models
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
Encoding context-sensitivity in Reo into non-context-sensitive semantic models
COORDINATION'11 Proceedings of the 13th international conference on Coordination models and languages
Formal modeling
Compositional construction of real-time dataflow networks
COORDINATION'10 Proceedings of the 12th international conference on Coordination Models and Languages
SAT-based verification for timed component connectors
Science of Computer Programming
Complete SAT solver based on set theory
ICICA'12 Proceedings of the Third international conference on Information Computing and Applications
From Timed Reo Networks to Networks of Timed Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Component-based software construction relies on suitable models underlying components, and in particular the coordinators which orchestrate component behaviour. Verifying correctness and safety of such systems amounts to model checking the underlying system model, where model checking techniques not only need to be correct but-since system sizes increase-also scalable and efficient. In this paper, we present a SAT-based approach for bounded model checking of Timed Constraint Automata. We present an embedding of bounded model checking into propositional logic with linear arithmetic, which overcomes the state explosion problem to deal with large systems by defining a product that is linear in the size of the system. To further improve model checking performance, we show how to embed our approach into an extension of counterexample guided abstraction refinement with Craig interpolants.