Inferring better contracts

Proceedings - International Conference on Software Engineering

Volumn , Issue , 2011, Pages 191-200

  Wei, Yi ^a   Furia, Carlo A ^a   Kazmin, Nikolay ^a   Meyer, Bertrand ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

contract inference; data mining; invariants; random testing

Indexed keywords

AUTOMATIC INFERENCE; DESIGN BY CONTRACTS; FORMAL SPECIFICATION; HASH TABLE; INFERENCE TOOLS; INVARIANTS; RANDOM TESTING; SUPPORTING TOOL;

DATA STRUCTURES; SOFTWARE ENGINEERING;

SOFTWARE RELIABILITY;

EID: 79959867950     PISSN: 02705257     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1985793.1985820     Document Type: Conference Paper

References (35)

1. G. Ammons, R. Bodík, and J. R. Larus. Mining specifications. In POPL, pages 4-16, 2002.
2. P. Chalin. Are practitioners writing contracts? In The RODIN Book, volume 4157 of LNCS, page 100, 2006.
3. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In POPL, pages 84-96, 1978.
4. C. Csallner and Y. Smaragdakis. Dynamically discovering likely interface invariants. In ICSE, pages 861-864, 2006.
5. C. Csallner, N. Tillmann, and Y. Smaragdakis. DySy: Dynamic symbolic execution for invariant inference. In ICSE, pages 281-290, 2008.
6. V. Dallmeier, C. Lindig, A. Wasylkowski, and A. Zeller. Mining object behavior with ADABU. In WODA, pages 17-24, May 2006.
7. B. Demsky, M. D. Ernst, P. J. Guo, S. McCamant, J. H. Perkins, and M. Rinard. Inference and enforcement of data structure consistency specifications. In ISSTA, pages 233-243, 2006.
8. N. Dodoo. Selecting predicates for conditional invariant detection using cluster analysis. Master's thesis, MIT EECS, 2002.
9. http://freeelks.svn.sourceforge.net.
10. M. D. Ernst, J. Cockrell, W. G. Griswold, and D. Notkin. Dynamically discovering likely program invariants to support program evolution. IEEE Trans. Software Eng., 27(2):99-123, 2001.
11. C. Flanagan and K. R. M. Leino. Houdini, an annotation assistant for ESC/Java. In FME, volume 2021 of LNCS, pages 500-517. Springer, 2001.
12. C. A. Furia and B. Meyer. Inferring loop invariants using postconditions. In Fields of Logic and Computation, volume 6300 of LNCS. Springer, 2010.
13. C. Ghezzi, A. Mocci, and M. Monga. Synthesizing intensional behavior models by graph transformation. In ICSE, pages 430-440, 2009.
14. N. Gupta and Z. V. Heidepriem. A new structural coverage criterion for dynamic detection of program invariants. In ASE, pages 49-59, 2003.
15. J. V. Guttag and J. J. Horning. The algebraic specification of abstract data types. Acta Inf., 10:27-52, 1978.
16. J. Henkel, C. Reichenbach, and A. Diwan. Discovering documentation for Java container classes. IEEE Trans. Software Eng., 33(8):526-543, 2007.
17. L. Kovács and A. Voronkov. Finding loop invariants for programs over arrays using a theorem prover. In FASE, volume 5503 of LNCS, pages 470-485, 2009.
18. N. Kuzmina and R. Gamboa. Extending dynamic constraint detection with polymorphic analysis. In WODA, pages 57-63, 2007.
19. N. Kuzmina, J. Paul, R. Gamboa, and J. Caldwell. Extending dynamic constraint detection with disjunctive constraints. In WODA, pages 57-63, 2008.
20. F. Logozzo. Automatic inference of class invariants. In VMCAI, volume 2937 of LNCS, pages 211-222. Springer, 2004.
21. D. Lorenzoli, L. Mariani, and M. Pezzè. Automatic generation of software behavioral models. In ICSE, pages 501-510, 2008.
22. B. Meyer. Object-Oriented Software Construction. Prentice Hall, 2nd edition, 1997.
23. B. Meyer, A. Fiva, I. Ciupa, A. Leitner, Y. Wei, and E. Stapf. Programs that test themselves. IEEE Software, pages 22-24, 2009.
24. R. O'Callahan and D. Jackson. Lackwit: A program understanding tool based on type inference. In ICSE, pages 338-348, 1997.
25. N. Polikarpova, I. Ciupa, and B. Meyer. A comparative study of programmer-written and automatically inferred contracts. In ISSTA, pages 93-104, 2009.
26. N. Polikarpova, C. A. Furia, and B. Meyer. Specifying reusable components. In VSTTE, 2010.
27. J. R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, 1993.
28. http://rapid-i.com/content/view/181/190.
29. A. Rountev and B. H. Connell. Object naming analysis for reverse-engineered sequence diagrams. In ICSE, pages 254-263, 2005.
30. N. Tillmann, F. Chen, and W. Schulte. Discovering likely method specifications. In ICFEM, volume 4260 of LNCS, pages 717-736. Springer, 2006.
31. Y. Wei, S. Gebhardt, M. Oriol, and B. Meyer. Satisfying test preconditions through guided object selection. In ICST, pages 303-312, 2010.
32. Y. Wei, Y. Pei, C. A. Furia, L. S. Silva, S. Buchholz, B. Meyer, and A. Zeller. Automated fixing of programs with contracts. In ISSTA, pages 61-72, 2010.
33. J. Whaley, M. C. Martin, and M. S. Lam. Automatic extraction of object-oriented component interfaces. In ISSTA, pages 218-228, 2002.
34. T. Xie, E. Martin, and H. Yuan. Automatic extraction of abstract-object-state machines from unit-test executions. In ICSE, pages 835-838, 2006.
35. K. Yessenov, R. Piskac, and V. Kuncak. Collections, cardinalities, and relations. In VMCAI, volume 5944 of LNCS, pages 380-395. Springer, 2010.