Repair of boolean programs with an application to C

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4144 LNCS, Issue , 2006, Pages 358-371

  Griesmayer, Andreas ^a   Bloem, Roderick ^a   Cook, Byron ^b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGORITHMS; C (PROGRAMMING LANGUAGE); DATA STORAGE EQUIPMENT; ERROR CORRECTION; GAME THEORY;

FAULTY WINDOWS DEVICE DRIVERS; MEMORY LESS STRATEGY; SLAM; STACK CONTENTS;

BOOLEAN FUNCTIONS;

EID: 33749854187     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817963_33     Document Type: Conference Paper

References (19)

1. R. Alur and T. A. Henzinger. Reactive modules. Formal Methods in System Design, 15:7-48, 1999.
2. R. Alur, S. La Torre, and P. Madhusudan. Modular strategies for recursive game graphs. In Tools and Algorithms for the Construction and the Analysis of Systems (TACAS'03), pages 363-378, 2003.
3. T. Ball, E. Bounimova, B. Cook, V. Levin, J. Lichtenberg, C. McGarvey, B. Ondrusek, S. K. Rajamani, and A. Ustuner. Thorough static analysis of device drivers. In European Systems Conference (EuroSys'06), 2006.
4. T. Ball, M. Naik, and S. K. Rajamani. From symptom to cause: Localizing errors in counterexample traces. In 30th Symposium on Principles of Programming Languages (POPL 2003), pages 97-105, 2003.
5. T. Ball and S. K. Rajamani. Bebop: A symbolic model checker for Boolean programs. In SPIN 00: SPIN Workshop, pages 113-130. 2000.
6. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model checking. In Proc. 8th Int. Conf. on Concurrency Theory (CONCUR'97), pages 135-150. 1997.
7. R. E. Bryant. Symbolic boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys, 24:293-318, 1992.
8. S. Chaki, A. Groce, and O. Strichman. Explaining abstract counterexamples. In Proc. of the International Symposium on Foundations of Software Engineering, pages 73-82, 2004.
9. B. Demsky and M. Rinard. Automatic detection and repair of errors in data structures. In Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA'03), pages 78-95, 2003.
10. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithms for model checking pushdown systems. In Twelfth Conference on Computer Aided Verification (CAV'00), pages 324-336. Springer-Verlag, 2000.
11. S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. In Ninth Conference on Computer Aided Verification (CAV'97), pages 72-83. 1997.
12. A. Groce. Error explanation with distance metrics. In Tools and Algorithms for Construction and Analysis of Systems (TACAS'04), pages 108-122, 2004.
13. B. Jobstmann, A. Griesmayer, and R. Bloem. Program repair as a game. In 17th Conference on Computer Aided Verification (CAV'05), pages 226-238 2005.
14. S. Khurshid, I. García, and Y. Suen. Repairing structurally complex data. In SPIN Workshop on Model Checking of Software (SPIN'05), pages 123-138, 2005.
15. T. Reps, S. Horwitz, and S. Sagiv. Precise Intel-procedural dataflow analysis via graph reachability. In Symposium on Principles of Programming Languages, pages 49-61, 1995.
16. F. Somenzi. CUDD: CU Decision Diagram Package. University of Colorado at Boulder, ftp://vlsi.colorado.edu/pub/.
17. S. Staber, B. Jobstmann, and R. Bloem. Finding and fixing faults. In 13th Conference on Correct Hardware Design and Verification Methods (CHARME '05), pages 35-49. 2005.
18. I. Walukiewicz. Pushdown processes: Games and model-checking. Information and Computation, 157:234-263, 2000.
19. A. Zeller. Isolating cause-effect chains from computer programs. In 10th Int. Symp. on the Foundations of Software Engineering (FSE-10), pages 1-10, November 2002.