SAT-based Verification for Timed Component Connectors

Electronic Notes in Theoretical Computer Science

Volumn 255, Issue , 2009, Pages 103-118

  Kemper, Stephanie ^a  

^a CWI   (Netherlands)

Author keywords

Abstraction Refinement; Component based Software Engineering; Model Checking; SAT; Timed Constraint Automata

Indexed keywords

ABSTRACTION REFINEMENT; BOUNDED MODEL CHECKING; COMPONENT BASED SOFTWARE; COMPONENT BEHAVIOUR; COMPONENT CONNECTORS; COMPONENT-BASED SOFTWARE ENGINEERING; COUNTEREXAMPLE-GUIDED ABSTRACTION REFINEMENT; CRAIG INTERPOLANTS; LARGE SYSTEM; LINEAR ARITHMETIC; MODEL-CHECKING TECHNIQUES; PROPOSITIONAL LOGIC; STATE EXPLOSION PROBLEMS; SYSTEM SIZE; TIMED CONSTRAINT AUTOMATON; UNDERLYING COMPONENTS; UNDERLYING SYSTEMS;

ABSTRACTING; AUTOMATA THEORY; COMPUTER SOFTWARE; MODEL STRUCTURES; ROBOTS; TRANSLATION (LANGUAGES);

MODEL CHECKING;

EID: 71849106582     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2009.10.027     Document Type: Article

References (17)

1. Alur R. Timed automata. In: Halbwachs N., and Peled D. (Eds). CAV. LNCS volume 1633 (1999), Springer 8-22
2. Alur R., and Dill D.L. A theory of timed automata. Theoretical Computer Science 126 2 (1994) 183-235
3. Arbab F. Reo: a channel-based coordination model for component composition. Mathematical Structures in Comp. Sci. 14 3 (2004) 329-366
4. Farhad Arbab, Christel Baier, Frank S. de Boer, and Jan J. M. M. Rutten. Models and temporal logics for timed component connectors. In SEFM, pages 198-207. IEEE Computer Society, 2004
5. Arbab F., Baier C., Rutten J.J.M.M., and Sirjani M. Modeling component connectors in Reo by constraint automata (extended abstract). Electr. Notes Theor. Comput. Sci. 97 (2004) 25-46
6. Audemard G., Cimatti A., Kornilowicz A., and Sebastiani R. Bounded model checking for timed systems. In: Peled D., and Vardi M.Y. (Eds). International Conference on Formal Techniques for Networked and Distributed Systems. (FORTE). LNCS volume 2529 (November 2002), Springer 243-259
7. Blechmann T., and Baier C. Checking equivalence for Reo networks. Electr. Notes Theor.Comput. Sci. 215 (2008) 209-226
8. Clarke E.M., Biere A., Raimi R., and Zhu Y. Bounded model checking using satisfiability solving. Formal Methods in System Design 19 1 (2001) 7-34
9. Clarke E.M., Grumberg O., Jha S., Lu Y., and Veith H. Counterexample-guided abstraction refinement for symbolic model checking. Journal of the ACM 50 5 (2003) 752-794
10. Eclipse Coordination Tools. http://reo.project.cwi.nl/
11. Hähnle R. Short CNF in finitely-valued logics. In: Komorowski H.J., and Ras Z.W. (Eds). ISMIS. Lecture Notes in Computer Science volume 689 (1993), Springer 49-58
12. Henzinger T.A., Jhala R., Majumdar R., and McMillan K.L. Abstractions from proofs. In: Jones N.D., and Leroy X. (Eds). POPL (2004), ACM 232-244
13. Jhala R., and McMillan K.L. Interpolant-based transition relation approximation. In: Etessami K., and Rajamani S.K. (Eds). CAV. Lecture Notes in Computer Science volume 3576 (2005), Springer 39-51
14. Kemper S., and Platzer A. SAT-based abstraction refinement for real-time systems. Electr. Notes Theor. Comput. Sci. 182 (2007) 107-122
15. The MathSAT 4 SMT solver. http://mathsat4.disi.unitn.it/index.html
16. McMillan K.L. An interpolating theorem prover. In: Jensen K., and Podelski A. (Eds). TACAS. Lecture Notes in Computer Science volume 2988 (2004), Springer 16-30
17. Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: Engineering an efficient SAT solver. In DAC, pages 530-535. ACM, 2001