Automated test case generation with SMT-solving and abstract interpretation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6617 LNCS, Issue , 2011, Pages 298-312

  Peleska, Jan ^a   Vorobev, Elena ^a   Lapschies, Florian ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT INTERPRETATION TECHNIQUES; ABSTRACT INTERPRETATIONS; AUTOMATED TEST CASE GENERATION; BOUNDED MODEL CHECKING; CONSTRAINT TYPES; DENSE-TIME; MODEL STATE; MODEL-BASED TEST; SYNCHRONOUS REACTIVE SYSTEMS; TEST DATA GENERATION;

ABSTRACTING; AUTOMATA THEORY; FORMAL METHODS; NASA;

MODEL CHECKING;

EID: 79955041171     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20398-5_22     Document Type: Conference Paper

References (16)

1. Brillout, A., Kroening, D., Wahl, T.: Mixed Abstractions for Floating-Point Arithmetic. In: Proceedings of FMCAD 2009, pp. 69-76. IEEE, Los Alamitos (2009)
2. Brummayer, R.: Efficient SMT Solving for Bit-Vectors and the Extensional Theory of Arrays. Ph.D. thesis, Johannes Kepler University Linz, Austria (November 2009)
3. Bryant, R.E., Kroening, D., Ouaknine, J., Seshia, S.A., Strichman, O., Brady, B.: Deciding Bit-Vector Arithmetic with Abstraction. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 358-372. Springer, Heidelberg (2007)
4. Cousot, P.: Abstract interpretation: Theory and practice (April 11-13, 2000)
5. Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Conference Record of the Fourth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 238-252. ACM Press, New York (1977)
6. Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Miné, A., Monniaux, D., Rival, X.: Combination of abstractions in the ASTRÉE static analyzer. In: Okada, M., Satoh, I. (eds.) ASIAN 2006. LNCS, vol. 4435, pp. 272-300. Springer, Heidelberg (2008)
7. Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (2002)
8. Esterel Technologies: SCADE Suite Product Description, http://www.estereltechnologies.com
9. Fu, Z., Malik, S.: On solving the partial max-sat problem. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 252-265. Springer, Heidelberg (2006)
10. Harel, D., Naamad, A.: The statemate semantics of statecharts. ACM Transactions on Software Engineering and Methodology 5(4), 293-333 (1996)
11. Jain, H., Clarke, E.M.: Efficient SAT Solving for Non-Clausal Formulas using DPLL, Graphs, and Watched Cuts. In: 46th Design Automation Conference, DAC (2009)
12. Jaulin, L., Kieffer, M., Didrit, O., Walter, É.: Applied Interval Analysis. Springer, London (2001)
13. Jung, J., Sülflow, A., Wille, R., Drechsler, R.: SWORD v1.0. Tech. rep. (2009), sMTCOMP 2009: System Description
14. Ranise, S., Tinelli, C.: Satisfiability modulo theories. TRENDS and CONTRO VERSIES-IEEE Magazine on Intelligent Systems 21(6), 71-81 (2006)
15. Sörensson, N.: MiniSat 2.2 and MiniSat++ 1.1. Tech. rep. (2010), SAT-Race 2010: Solver Descriptions
16. Wille, R., Fey, G., Große, D., Eggersglüß, S., Drechsler, R.: SWORD: A SAT like Prover Using Word Level Information. In: Proceedings of VLSI-SoC 2007, pp. 88-93 (2007)