Repair of boolean programs with an application to c

Authors:
Andreas Griesmayer;Roderick Bloem;Byron Cook
Affiliations:
Graz University of Technology;Graz University of Technology;Microsoft Research
Venue:
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Year:
2006

Citing 17
Cited 15

Symbolic Boolean manipulation with ordered binary-decision diagrams

ACM Computing Surveys (CSUR)
Precise interprocedural dataflow analysis via graph reachability

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reactive Modules

Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
Pushdown processes: games and model-checking

Information and Computation - Special issue on FLOC '96
Isolating cause-effect chains from computer programs

Proceedings of the 10th ACM SIGSOFT symposium on Foundations of software engineering
From symptom to cause: localizing errors in counterexample traces

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bebop: A Symbolic Model Checker for Boolean Programs

Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
Reachability Analysis of Pushdown Automata: Application to Model-Checking

CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Construction of Abstract State Graphs with PVS

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Efficient Algorithms for Model Checking Pushdown Systems

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Automatic detection and repair of errors in data structures

OOPSLA '03 Proceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications
Explaining abstract counterexamples

Proceedings of the 12th ACM SIGSOFT twelfth international symposium on Foundations of software engineering
Thorough static analysis of device drivers

Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
Modular strategies for recursive game graphs

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Program repair as a game

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Repairing structurally complex data

SPIN'05 Proceedings of the 12th international conference on Model Checking Software
Finding and fixing faults

CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods

Automated Fault Localization for C Programs

Electronic Notes in Theoretical Computer Science (ENTCS)
Program Repair Suggestions from Graphical State-Transition Specifications

FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Automatic generation of local repairs for Boolean programs

Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
From program verification to program synthesis

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Abstraction-guided synthesis of synchronization

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Foundations of Tree-like Local Model Updates

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Local model update with an application to sliding window protocol

KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part IV
Evolutionary repair of faulty software

Applied Soft Computing
Finding and fixing faults

Journal of Computer and System Sciences
Automated error localization and correction for imperative programs

Proceedings of the International Conference on Formal Methods in Computer-Aided Design
Whodunit? causal analysis for counterexamples

ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Modular and verified automatic program repair

Proceedings of the ACM international conference on Object oriented programming systems languages and applications
Program repair without regret

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Repair with on-the-fly program analysis

HVC'12 Proceedings of the 8th international conference on Hardware and Software: verification and testing
A constraint-based approach to solving games on infinite graphs

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Quantified Score

Hi-index	0.01

Visualization

Abstract

We show how to find and fix faults in Boolean programs by extending the program to a game. In the game, the protagonist can select an alternative implementation for an incorrect statement. If the protagonist can do so successfully using a memoryless strategy that does not depend on the stack contents, we have found a correction for the Boolean program. We present a symbolic algorithm that localizes possibly faulty statements and provides corrections. If the Boolean program is an abstraction of a C program, the repair for the Boolean program suggests a repair for the original C program. This yields a correct but incomplete approach to repairing C programs. We have applied this approach to Boolean programs that are produced as abstractions by SLAM and have thus successfully patched several faulty Windows device drivers.