Constraint Solving and Symbolic Execution

Authors:
Jian Zhang
Affiliations:
State Key Laboratory of Computer Science Institute of Software, Chinese Academy of Sciences, Beijing, China 100080
Venue:
Verified Software: Theories, Tools, Experiments
Year:
2005

Citing 11
Cited 3

A static analyzer for finding dynamic programming errors

Software—Practice & Experience
Symbolic execution and program testing

Communications of the ACM
Extended static checking for Java

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
The verifying compiler: A grand challenge for computing research

Journal of the ACM (JACM)
Assertions in Modern Software Engineering Practice

COMPSAC '02 Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment
SELECT—a formal system for testing and debugging programs by symbolic execution

Proceedings of the international conference on Reliable software
Symbolic Execution of Program Paths Involving Pointer and Structure Variables

QSIC '04 Proceedings of the Quality Software, Fourth International Conference
Testing static analysis tools using exploitable buffer overflows from open source code

Proceedings of the 12th ACM SIGSOFT twelfth international symposium on Foundations of software engineering
Path-Oriented Test Data Generation Using Symbolic Execution and Constraint Solving Techniques

SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Simplify: a theorem prover for program checking

Journal of the ACM (JACM)
The ASTREÉ analyzer

ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems

An integrated search-based approach for automatic testing from extended finite state machine (EFSM) models

Information and Software Technology
Symbolic execution of Reo circuits using constraint automata

Science of Computer Programming
Performance estimation using symbolic data

Theories of Programming and Formal Methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

For many decades, the correctness of programs has been a concern for computer scientists and software engineers. At present, it is still not easy to ensure the correctness of nontrivial programs, although many researchers have made various attempts in this direction.Recently, the Verifying Compiler is proposed as a grand challenge in computing research [7]. But its goal can be achieved incrementally. The following is quoted from Hoare (page 68 of [7]):The progress of the project can be assessed by the number of lines of code that have been verified, and the level of annotation and verification that has been achieved. The relevant levels of annotations are: structural integrity, partial functional specification, total specification. The relevant levels of verification are: by testing, by human proof, by machine assistance, and fully automatic.