Object models with temporal constraints

Proceedings - 6th IEEE International Conference on Software Engineering and Formal Methods, SEFM 2008

Volumn , Issue , 2008, Pages 249-258

  Cimatti, Alessandro ^a   Roveri, Marco ^a   Susi, Angelo ^a   Tonetta, Stefano ^a  

^a ITC IRST   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL SIGNAL PROCESSING; FORMAL LOGIC; SOFTWARE ENGINEERING; TEMPORAL LOGIC;

CLASS DIAGRAMS; DEVELOPMENT PHASIS; DYNAMIC EVOLUTIONS; FIRST ORDER LOGICS; FORMAL REPRESENTATIONS; FORMAL VALIDATIONS; NEGATIVE IMPACTS; OBJECT MODELS; SATISFIABILITY; TEMPORAL CONSTRAINTS; TEMPORAL EVOLUTIONS; TEMPORAL LOGIC OPERATORS;

FORMAL METHODS;

EID: 58049151772     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SEFM.2008.23     Document Type: Conference Paper

References (30)

1. UML Version 2.1.2. http://www.omg.org/spec/UML/2.1.2/.
2. A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu. Symbolic Model Checking without BDDs. In TACAS, pages 193-207, 1999.
3. P. Bresciani, P. Giorgini, F. Giunchiglia, J. Mylopoulos, and A. Perini. Tropos: An Agent-Oriented Software Development Methodology. Autonomous Agents and Multi-Agent Systems, 8(3):203-236, 2004.
4. R. Bruttomesso, A. Cimatti, A. Franzn, A. Griggio, and R. Sebastiani. The MathSAT 4 SMT Solver. In CAV, pages 299-303, 2008.
5. R. E. Bryant, S. M. German, and M. N. Velev. Exploiting Positive Equality in a Logic of Equality with Uninterpreted Functions. In CAV, pages 470-482, 1999.
6. R. Cavada, A. Cimatti, A. Franzén, K. Kalyanasundaram, M. Roveri, and R. K. Shyamasundar. Computing predicate abstractions by integrating BDDs and SMT solvers. In FM-CAD, pages 69-76. IEEE, 2007.
7. A. Cimatti, E. M. Clarke, F. Giunchiglia, and M. Roveri. NuSMV: A new symbolic model checker. STTT, 2(4):410-425, 2000.
8. A. Cimatti, A. Griggio, and R. Sebastiani. Efficient Interpolant Generation in Satisfiability Modulo Theories. In TACAS, pages 397-412, 2008.
9. A. Cimatti, M. Roveri, V. Schuppan, and S. Tonetta. Boolean abstraction for temporal logic satisfiability. In CAV, volume 4590 of LNCS, pages 532-546. Springer, 2007.
10. A. Cimatti, M. Roveri, and S. Tonetta. PSL Symbolic Compilation. IEEE Trans. on CAD of Integrated Circuits and Systems, 2008. To appear.
11. E. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample- Guided Abstraction Refinement. In CAV, pages 154-169, 2000.
12. E. Clarke, A. Gupta, J. Kukula, and O. Strichman. SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques. In CAV, pages 265-279, 2002.
13. E. Clarke, D. Kroening, N. Sharygina, and K. Yorav. Predicate Abstraction of ANSI-C Programs Using SAT. Formal Methods in System Design, 25(2-3):105-127, 2004.
14. S. Demri, R. Lazic, and D. Nowak. On the freeze quantifier in Constraint LTL: Decidability and complexity. Inf. Comput., 205(1):2-24, 2007.
15. E. A. Emerson. Temporal and modal logic. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), pages 995-1072. 1990.
16. A. Fuxman, L. Liu, J. Mylopoulos, M. Roveri, and P. Traverso. Specifying and analyzing early requirements in Tropos. Requirements Engineering, 9(2):132-150, 2004.
17. S. Ghilardi, E. Nicolini, S. Ranise, and D. Zucchelli. Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems. In CADE, pages 362-378, 2007.
18. I. M. Hodkinson, F. Wolter, and M. Zakharyaschev. Decidable fragment of first-order temporal logics. Ann. Pure Appl. Logic, 106(1-3):85-134, 2000.
19. D. Jackson. Alloy: a lightweight object modelling notation. ACM Trans. Softw. Eng. Methodol., 11(2):256-290, 2002.
20. S. K. Lahiri, R. Nieuwenhuis, and A. Oliveras. SMT techniques for fast predicate abstraction. In CAV, LNCS, pages 424-437. Springer, 2006.
21. M. Lange. Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness. In CON-CUR, pages 90-104, 2007.
22. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems, Specification. Springer, 1992.
23. Z. Manna and A. Pnueli. Temporal verification of reactive systems: safety. Springer-Verlag New York, Inc., New York, NY, USA, 1995.
24. G. Nelson and D. C. Oppen. Fast Decision Procedures Based on Congruence Closure. J. ACM, 27(2):356-364, 1980.
25. OMG. Object Constraint Language: OMG available specification Version 2.0, 2006.
26. A. Pnueli. The temporal logic of programs. In Proceedings of 18th IEEE Symp. on Foundation of Computer Science, pages 46-57, 1977.
27. A. Pnueli, Y. Rodeh, O. Strichman, and M. Siegel. The small model property: How small can it be? Inf. Comput., 178(1):279-293, 2002.
28. R. Sebastiani, S. Tonetta, and M. Vardi. Property-Driven Partitioning for Abstraction Refinement. In TACAS, pages 389-404, 2007.
29. J. M. Spivey. The Z Notation: a reference manual, 2nd edition. Prentice Hall, 1992.
30. A. Susi, A. Perini, P. Giorgini, and J. Mylopoulos. The Tropos Metamodel and its Use. Informatica, 29(4):401-408, 2005.