Heuristic-guided counterexample search in FLAVERS

Proceedings of the ACM SIGSOFT Symposium on the Foundations of Software Engineering

Volumn , Issue , 2004, Pages 201-210

  Tan, Jianbin ^a   Avrunin, George S ^a   Clarke, Lori A ^a   Zilberstein, Shlomo ^a   Leue, Stefan ^b  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

^b UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

Counterexamples; FLAVERS; Heuristic search

Indexed keywords

COMPUTER SOFTWARE; FAULT TOLERANT COMPUTER SYSTEMS; FINITE ELEMENT METHOD; HEURISTIC METHODS; MATHEMATICAL MODELS; STRATEGIC PLANNING;

COUNTEREXAMPLE SEARCH; FLAVERS; HEURISTIC SEARCH; MODEL CHECKING;

ONLINE SEARCHING;

EID: 12344304575     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1029894.1029922     Document Type: Conference Paper

References (26)

1. B. Alpern and F. B. Schneider. Recognizing safety and liveness. Distributed Computing, 2(3):117-126, 1987.
2. T. Ball, A. Podelski, and S. K. Rajamani. Relative completeness of abstraction refinement for software model checking. In 8th International Conference on Tools and Algorithms for Construction and Analysis of Systems, volume 2280 of LNCS, pages 158 - 172. Springer-Verlag, Apr. 2002.
3. T. Ball and S. K. Rajamani. Automatically validating temporal safety properties of interfaces. In Proceedings of the 8th International SPIN Workshop on Model Checking of Software, volume 2057 of LNCS, pages 103-122. Springer-Verlag, May 2001.
4. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In Proceedings of the 12th International Conference on Computer Aided Verification, volume 1855 of LNCS, pages 154-169. Springer-Verlag, Jul. 2000.
5. J. M. Cobleigh, L. A. Clarke, and L. J. Osterweil. The right algorithm at the right time: Comparing data flow analysis algorithms for finite state verification. In Proceedings of the 23rd International Conference on Software Engineering, pages 37-46, May 2001.
6. J. M. Cobleigh, L. A. Clarke, and L. J. Osterweil. FLAVERS: A finite state verification technique for software systems. IBM Systems Journal, 41(1):140-165, 2002.
7. J. C. Corbett, M. B. Dwyer, J. Hatcliff, S. Laubach, C. S. Pǎsǎreanu, Robby, and H. Zheng. Bandera: Extracting finite-state models from Java source code. In Proceedings of the 22nd International Conference on Software Engineering, pages 439-448, Jun. 2000.
8. M. B. Dwyer and L. A. Clarke. Data flow analysis for verifying properties of concurrent programs. In Proceedings of the 2nd ACM SIGSOFT Symposium on the Foundations of Software Engineering, pages 62-75, Dec. 1994.
9. S. Edelkamp, A. L. Lafuente, and S. Leue. Trail-directed model checking. In Proceedings of the Workshop on Software Model Checking, Electrical Notes in Theoretical Computer Science, volume 55, Jul. 2001.
10. S. Edelkamp, S. Leue, and A. Lluch-Lafuente. Directed explicit-state model checking in the validation of communication protocols. International Journal on Software Tools for Technology Transfer, 5(2-3):247-267, 2004.
11. P. Godefroid and S. Khurshid. Exploring very large state spaces using genetic algorithms. In 8th International Conference on Tools and Algorithms for Construction and Analysis of Systems, volume 2280 of LNCS, pages 266-280. Springer-Verlag, Apr. 2002.
12. C. Gomes and B. Selman. Hybrid search strategies for heterogeneous search spaces. International Journal on Artificial Intelligence Tools, 9(l):45-57, 2000.
13. A. Groce and W. Visser. Model checking Java programs using structural heuristics. In Proceedings of the International Symposium on Software Testing and Analysis, pages 12-21, Jul. 2002.
14. D. Habet, C. M. Li, L. Devendeville, and M. Vasquez. A hybrid approach for SAT. In Proceedings of the 8th International Conference on Principle and Practice of Constraint Programming, pages 172-184, Sep. 2002.
15. E. A. Hansen, S. Zilberstein, and V. A. Danilchenko. Anytime heuristic search: First results. TR UM-CS-1997-50, Department of Computer Science, University of Massachusetts Amherst, 1997.
16. P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4(2):100-107, 1968.
17. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In Proceedings of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 58-70, Jan. 2002.
18. G. J. Holzmann. The SPIN Model Checker. Addison-Wesley, Boston, 2004.
19. G. Naumovich and G. S. Avrunin. A conservative data flow algorithm for detecting all pairs of statements that may happen in parallel. In Proceedings of the 6th ACM SIGSOFT Symposium on the Foundations of Software Engineering, pages 24-34, Nov. 1998.
20. G. Naumovich, G. S. Avrunin, and L. A. Clarke. Data flow analysis for checking properties of concurrent Java programs. In Proceedings of the 21st International Conference on Software Engineering, pages 399-410, May 1999.
21. G. Naumovich, G. S. Avrunin, and L. A. Clarke. An efficient algorithm for computing MHP information for concurrent Java programs. In Proceedings of the 7th European Software Engineering Conference held jointly with the 7th ACM SIGSOFT International Symposium on Foundations of Software Engineering, pages 338-354. Springer-Verlag, Sep. 1999.
22. G. Rabideau, S. Chien, J. Willis, and T. Mann. Using iterative repair to automate planning and scheduling of shuttle payload operations. In Proceedings of the 11th Conference on Innovative Applications of Artificial Intelligence, pages 813-820, 1999.
23. D. Ratner and I. Pohl. Joint and LPA*: Combination of approximation and search. In Proceedings of the 5th National Conference on Artificial Intelligence, pages 173-177, 1986.
24. P. Shaw. Using constraint programming and local search methods to solve vehicle routing problems. In Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming, pages 417-431, 1998.
25. V. Tam and P. Stuckey. Improving evolutionary algorithms for efficient constraint satisfaction. International Journal on Artificial Intelligence Tools, 8(4):363-383, 1999.
26. C. H. Yang and D. L. Dill. Validation with guided search of the state space. In Proceedings of the 35th Design Automation Conference, pages 599-604, Jun. 1998.