Synthesis of interface specifications for Java classes

ACM SIGPLAN Notices

Volumn 40, Issue 1, 2005, Pages 98-109

  Alur, Rajeev ^a   Madhusudan, P ^a   Černý, Pavol ^a   Nam, Wonhong ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Abstraction; Behavioral interfaces; Games; Learning regular languages; Model checking; Software components; Synthesis

Indexed keywords

BEHAVIORAL INTERFACES; GAMES; LEARNING REGULAR LANGUAGES; MODEL CHECKING; SOFTWARE COMPONENTS;

ABSTRACTING; DECISION MAKING; GRAPHIC METHODS; INFORMATION ANALYSIS; INTERFACES (COMPUTER); LIBRARIES; PROBLEM SOLVING;

JAVA PROGRAMMING LANGUAGE;

EID: 17044362578     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/1047659.1040314     Document Type: Conference Paper

References (32)

1. S. Abramsky. Semantics of interaction. Technical report, Oxford University, 2002.
2. R. Alur, T.A. Henzinger, and O. Kupferman. Alternating-time temporal logic. Journal of the ACM, 49(5):1-42, 2002.
3. G. Ammons, R. Bodík, and J. Larus. Mining specifications. In Proc. 29th ACM POPL, pages 4-16, 2002.
4. D. Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75:87-106, 1987.
5. T. Ball, R. Majumdar, T.D. Millstein, and S.K. Rajamani. Automatic predicate abstraction of C programs. In Proc. PLDI, ACM SIGPLAN Notices 36(5), pages 203-213, 2001.
6. T. Ball and S.K. Rajamani. The SLAM project: Debugging system software via static analysis. In Proc. 29th ACM POPL, pages 1-3, 2002.
7. H. Barringer, O.S. Pasareanu and D. Giannakopolou. Proof rules for automated compositional verification through learning. In Proc. of the 2nd Int'l Workshop on Specification and Verification of Component Based Systems, 2003.
8. T. Berg, B. Jonsson, M. Leucker, and M. Saksena. Insights to Angluin's learning. In Proc. of International Workshop on Software Verification and Validation, 2003.
9. A. Chakrabarti, L. de Alfaro, T.A. Henzinger, M. Jurdzinski, and F. Mang. Interface compatibility checking for software modules. In Proc. 14th CAV, LNCS 2404, Springer, pages 428-441, 2002.
10. A. Cimatti, E. Clarke, E. Giunchiglia, F. Giunchiglia, M. Pistore, M. Roveri, R. Sebastiani, and A. Tacchella. NuSMV Version 2: An Opensource tool for symbolic model checking. In Proc. 14th CAV, LNCS 2404, Springer, pages 359-364, 2002.
11. E.M. Clarke and E.A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. of Workshop on Logic of Programs, pages 52-71, 1981.
12. J.M. Cobleigh, D. Giannakopoulou, and C.S. Pasareanu. Learning assumptions for compositional verification. In Proc. 9th TACAS, LNCS 2619, Springer, pages 331-346, 2003.
13. J. Corbett, M. Dwyer, J. Hatcliff, S. Laubach, C.S. Pasareanu, Robby, and H. Zheng. Bandera: Extracting finite-state models from Java source code. In Proc. 22nd ICSE, pages 439-448, 2000.
14. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. 4th ACM POPL, pages 238-252, 1977.
15. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In Proc. 5th ACM POPL, pages 84-96, 1978.
16. L. de Alfaro and T.A. Henzinger. Interface automata. In Proc. 9th ACM FSE, pages 109-120, 2001.
17. R. DeLine and M. Fähndrich. Enforcing high-level protocols in low-level software. In Proc. ACM POPL, pages 59-69, 2001.
18. D. Giannakopoulou, C.S. Pasareanu and H. Barringer. Assumption generation for software component verification. In Proc. 17th ASE, pages 3-12, 2002.
19. S. Graf and H. Saidi. Construction of abstract state graphs with PVS. In Proc. 9th CAV, LNCS 1254, pages 72-83, 1997.
20. T.A. Henzinger, R. Jhala, R. Majumdar, K.L. McMillan. Abstractions from proofs. In Proc. 31st ACM POPL, pages 232-244, 2004.
21. T.A. Henzinger, R. Jhala, R. Majumdar, G. Necula, G. Sutre, and W. Weimer. Temporal-safety proofs for systems code. In Proc. of CAV, LNCS 2404, pages 526-538. Springer, 2002.
22. G. Holzmann and M. Smith. Software model checking -extracting verification models from source code. In Formal Methods for Protocol Engineering and Distributed Systems, pages 481-497, 1999.
23. F. Logozzo. Automatic inference of class invariants. In Proc. of VMCAI, LNCS 2937, pages 211-222, 2004.
24. J. Nimmer and M. Ernst. Automatic generation of program specification. In Proc. of ISSTA, pages 229-239, 2002.
25. G. Ramalingam, A. Warshavsky, J. Field, D. Goyal and M. Sagiv. Deriving specialized program analyses for certifying component-client conformance. In ACM PLDI, pages 83-94, 2002.
26. J.H. Reif. Universal games of incomplete information. In Proc. of the 11th ACM symposium on Theory of computing, pages 288-308. ACM Press, 1979.
27. R. L. Rivest and R. E. Schapire. Inference of finite automata using homing sequences. Information and Computation, 103(2):299-347, 1993.
28. W. Thomas. Infinite games and verification. In Proc. 14th CAV, LNCS 2404, pages 58-64. Springer, 2002.
29. O. Tkachuk, M.B. Dwyer, and C.S. Pasareanu. Automated environment generation for software model checking. In Proc. 18th ASE, pages 116-127, 2003.
30. R. Vallée-Rai, L. Hendren, V. Sundaresan, E.G. Patrick Lam, and P. Co. Soot - a Java optimization framework. In Proc. CASCON, pages 125-135, 1999.
31. D. Walker. A type system for expressive security policies. In Proc. 27th ACM POPL, pages 254-267, 2000.
32. J. Whaley, M.C. Martin, and M.S. Lam. Automatic extraction of object-oriented component interfaces. In Proc. ISSTA, pages 218-228, 2002.