Automatic verification for a class of proof obligations with SMT-solvers

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

Volumn 5977 LNCS, Issue , 2010, Pages 217-230

  Déharbe, David ^a  

^a FEDERAL UNIVERSITY OF RIO GRANDE DO NORTE   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC VERIFICATION; DEGREE OF AUTOMATION; EVENT-B; INTEGER ARITHMETIC; PROOF OBLIGATIONS; SOFTWARE DEVELOPMENT; THEOREM PROVERS;

ABSTRACTING; CONTOUR FOLLOWERS;

THEOREM PROVING;

EID: 77950799087     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11811-1_17     Document Type: Conference Paper

References (12)

1. ClearSy: Atelier B User Manual Version 4.0. Clearsy System Engineering (2009), http://www.atelierb.eu
2. Coleman, J., Jones, C., Oliver, I., Romanovsky, A.: E.Troubitsyna: RODIN (rigorous open development environment for complex systems). In: Fifth European Dependable Computing Conference: EDCC-5 supplementary volume, pp. 23-26 (2005)
3. Nelson, G., Oppen, D.: Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems 1(2), 245-257 (1979)
4. Nieuwenhuis, R., Oliveras, A.: DPLL(T) with exhaustive theory propagation and its application to difference logic. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.3576, pp. 321-334. Springer, Heidelberg (2005)
5. Ranise, S., Tinelli, C.: The SMT-LIB standard: Version 1.2 (August 2006)
6. Kröning, D., Rümmer, P., Weissenbacher, G.: A proposal for a theory of finite sets, lists, and maps for the SMT-LIB standard. In: Informal proceedings, 7th International Workshop on Satisfiability Modulo Theories at CADE 22 (2009)
7. Bruun, H., Damm, F., Dawes, J., Hansen, B., Larsen, P., Parkin, G., Plat, N., Toetenel, H.: A formal definition of VDM-SL. Technical Report Technical Report 1998/9, University of Leicester (1998)
8. Couchot, J.F., Déharbe, D., Giorgetti, A., Ranise, S.: Scalable automated proving and debugging of set-based specifications. Journal of the Brazilian Computer Society 9(2), 17-36 (2003)
9. Hurlin, C., Chaieb, A., Fontaine, P., Merz, S., Weber, T.: Practical proof reconstruction for first-order logic and set-theoretical constructions. In: Dixon, L., Johansson, M. (eds.) The Isabelle Workshop 2007, Bremen, July 16 (2007)
10. Bouton, T., de Oliveira, D.C.B., Déharbe, D., Fontaine, P.: verit: An open, trustable and efficient smt-solver. In: Schmidt, R.A. (ed.) CADE 2009. LNCS, vol.5663, pp. 151-156. Springer, Heidelberg (2009)
11. Pierce, B.C.: Types and Programming Languages. MIT Press, Cambridge (2002)
12. Fontaine, P.: Combinations of theories for decidable fragments of first-order logic. In: Ghilardi, S. (ed.) FroCoS 2009. LNCS, vol.5749, pp. 263-278. Springer, Heidelberg (2009)