Automatically Inferring Temporal Properties

3. PROBLEM STATAMENT Temporal properties specify constraints on the order in which a program’s state changes. Satisfying certain temporal properties is essential for a program to be correct. Many formal verification tools have been developed to check certain temporal properties. Researchers have demonstrated the practical value of these tools in some domains (e.g. verifying the safety of device drivers) [8, 17].

[1]  James R. Larus,et al.  Mining specifications , 2002, POPL '02.

[2]  David Evans,et al.  Automatically inferring temporal properties for program evolution , 2004, 15th International Symposium on Software Reliability Engineering.

[3]  James R. Larus,et al.  Debugging temporal specifications with concept analysis , 2003, PLDI '03.

[4]  David Evans,et al.  Dynamically inferring temporal properties , 2004, PASTE.

[5]  Stephan Merz,et al.  Model Checking , 2000 .

[6]  Michael D. Ernst,et al.  Improving test suites via operational abstraction , 2003, 25th International Conference on Software Engineering, 2003. Proceedings..

[7]  Alexander L. Wolf,et al.  Discovering models of behavior for concurrent workflows , 2004, Comput. Ind..

[8]  Monica S. Lam,et al.  Automatic extraction of object-oriented component interfaces , 2002, ISSTA '02.

[9]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[10]  George S. Avrunin,et al.  Patterns in property specifications for finite-state verification , 1999, Proceedings of the 1999 International Conference on Software Engineering (IEEE Cat. No.99CB37002).

[11]  James R. Larus,et al.  Righting software , 2004, IEEE Software.

[12]  E. Mark Gold,et al.  Complexity of Automaton Identification from Given Data , 1978, Inf. Control..

[13]  Gerard J. Holzmann,et al.  The logic of bugs , 2002, SIGSOFT '02/FSE-10.

[14]  E. Mark Gold,et al.  Language Identification in the Limit , 1967, Inf. Control..

[15]  Sarfraz Khurshid,et al.  Software assurance by bounded exhaustive testing , 2004, IEEE Transactions on Software Engineering.

[16]  William G. Griswold,et al.  Dynamically discovering likely program invariants to support program evolution , 1999, Proceedings of the 1999 International Conference on Software Engineering (IEEE Cat. No.99CB37002).

[17]  Elaine J. Weyuker,et al.  Theories of Program Testing and the Application of Revealing Subdomains , 1980, IEEE Transactions on Software Engineering.

[18]  David A. Wagner,et al.  MOPS: an infrastructure for examining security properties of software , 2002, CCS '02.