Symbolic mining of temporal specifications

Proceedings - International Conference on Software Engineering

Volumn , Issue , 2008, Pages 51-60

  Gabel, Mark ^a   Su, Zhendong ^a  

^a University of California   (United States)

Author keywords

Dynamic analysis; Formal specifications; Specification mining

Indexed keywords

BINARY DECISIONS; FINITE STATE AUTOMATON; FORMAL SPECIFICATIONS; HIGH SPACE COMPLEXITY; NP-COMPLETE; ORDERS OF MAGNITUDES; PROGRAM COMPONENTS; PROGRAM SPECIFICATIONS; REAL SYSTEMS; RELEASE PATTERNS; RESOURCE ACQUISITIONS; RUN-TIME; SOFTWARE DEVELOPMENT PROCESS; SOFTWARE SYSTEMS; SPECIFICATION MINING; SPECIFICATION PATTERNS; SYMBOLIC ALGORITHMS; SYSTEM COMPONENTS; TEMPORAL PROPERTIES; TEMPORAL SPECIFICATIONS; TIME AND SPACES; COMPLEX TASK; DECISION DIAGRAM; FINITE STATE AUTOMATA; NP COMPLETE; ORDERS OF MAGNITUDE; PROGRAM SPECIFICATION; RELEASE PATTERN; RESOURCE ACQUISITION; RUNTIME; TEMPORAL PROPERTY; TEMPORAL SPECIFICATION; TIME AND SPACE;

AUTOMATA THEORY; BINARY DECISION DIAGRAMS; DATA STRUCTURES; DYNAMIC ANALYSIS; MINING; SOFTWARE ENGINEERING; COMPUTER SOFTWARE; FINITE AUTOMATA;

SPECIFICATIONS;

EID: 57349134461     PISSN: 02705257     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1368088.1368096     Document Type: Conference Paper

References (26)

1. R. Alur, P. Černý, P. Madhusudan, and W. Nam. Synthesis of interface specifications for Java classes. In POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages.
2. G. Ammons, R. Bodík, and J. R. Larus. Mining specifications. In POPL '02: Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages.
3. T. Ball and S. K. Rajamani. Automatically validating temporal safety properties of interfaces. In SPIN '01: Proceedings of the 8th international SPIN workshop on Model checking of software.
4. M. Berndl, O. Lhoták, F. Qian, L. Hendren, and N. Umanee. Points-to analysis using BDDs. In Proceedings of PLDI, pages 103-114, 2003.
5. B. Bollig and I. Wegener. Improving the variable ordering of OBDDs is NP-complete. IEEE Trans. Comput, 45(9):993-1002, 1996.
6. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput., 35(8):677-691, 1986.
7. H. Chen and D. Wagner. MOPS: an infrastructure for examining security properties of software. In CCS '02: Proceedings of the 9th ACM conference on Computer and communications security.
8. C. Csallner and Y. Smaragdakis. Dynamically discovering likely interface invariants. In Proceedings of'ICSE, pages 861-864, 2006.
9. M. Das, S. Lemer, and M. Seigle. ESP: Path-sensitive program verification in polynomial time. In PLDI '02: Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation.
10. D. Engler, D. Y. Chen, S. Hallem, A. Chou, and B. Chelf. Bugs as deviant behavior: a general approach to inferring errors in systems code. In SOSP '01: Proceedings of the eighteenth ACM symposium on Operating systems principles.
11. M. D. Ernst, A. Czeisler, W. G. Griswold, and D. Notkin. Quickly detecting relevant program invariants. In Proceedings of ICSE, pages 449-458, 2000.
12. C. Flanagan, K. R. M. Leino, M. Lillibridge, G. Nelson, J. B. Saxe, and R. Stata. Extended static checking for Java. In Proceedings of PLDI, pages 234-245, 2002.
13. S. Hangal and M. S. Lam. Tracking down software bugs using automatic anomaly detection. In Proceedings of'ICSE, pages 291-301, 2002.
14. D. Hovemeyer and W. Pugh. Finding bugs is easy. In OOPSLA '04: Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications, pages 132-136, 2004.
15. R. Karp. Reducibility among combinatorial problems. In Complexity of Computer Computations. New York.
16. T. Kremenek, P. Twohey, G. Back, A. Ng, and D. Engler. From uncertainty to belief: inferring the specification within. In USENIX'06: Proceedings of the 7th conference on USENIX Symposium on Operating Systems Design and Implementation, pages 12-12, 2006.
17. Z. Li and Y. Zhou. PR-Miner: automatically extracting implicit programming rules and detecting violations in large software code. In Proceedings of ESEC/FSE-13, pages 306-315, 2005.
18. M. K. Ramanathan, A. Grama, and S. Jagannathan. Path-sensitive inference of function precedence protocols. In Proceedings of ICSE, pages 240-250, 2007.
19. M. K. Ramanathan, A. Grama, and S. Jagannathan. Static specification inference using predicate mining. In Proceedings of PLDI, pages 123-134, 2007.
20. S. Shoham, E. Yahav, S. Fink, and M. Pistoia. Static specification mining using automata-based abstractions. In Proceedings of ISSTA, pages 174-184, 2007.
21. W. Weimer and G. Necula. Mining temporal specifications for error detection. In Proceedings of TACAS, pages 461-476, 2005.
22. J. Whaley and M. S. Lam. Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In Proceedings of PLDI, pages 131-144, 2004.
23. J. Whaley, M. C. Martin, and M. S. Lam. Automatic extraction of object-oriented component interfaces. In ISSTA '02: Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis, pages 218-228, 2002.
24. Y. Xie and A. Aiken. Scalable error detection using Boolean satisfiability. In POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages.
25. J. Yang, D. Evans, D. Bhardwaj, T. Bhat, and M. Das. Perracotta: Mining temporal API rules from imperfect traces. In Proceedings of ICSE, pages 282-291, 2006.
26. X. Zhang, R. Gupta, and Y. Zhang. Efficient forward computation of dynamic slices using reduced ordered binary decision diagrams. In Proceedings of ICSE, 2004.