Results 1 - 10 of 2,117

Selective symbolic execution

by Vitaly Chipounov , Vlad Georgescu , Cristian Zamfir , George Candea - in Workshop on Hot Topics in Dependable Systems , 2009
"... Abstract Symbolic execution is a powerful ..."
Abstract - Cited by 11 (4 self) - Add to MetaCart
Abstract Symbolic execution is a powerful

Symbolic execution with separation logic

by Josh Berdine, Cristiano Calcagno, Peter W. O’hearn, Queen Mary - In APLAS , 2005
"... Abstract. We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method uses a form of symbolic execution, a decidable proof theory for symbolic heaps, and extraction of frame axiom ..."
Abstract - Cited by 144 (28 self) - Add to MetaCart
Abstract. We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method uses a form of symbolic execution, a decidable proof theory for symbolic heaps, and extraction of frame

Generalized Symbolic Execution for Model Checking and Testing

by Sarfraz Khurshid, Corina S. Pasareanu, Willem Visser , 2003
"... Modern software systems, which often are concurrent and manipulate complex data structures must be extremely reliable. We present a novel framework based on symbolic execution, for automated checking of such systems. We provide a two-fold generalization of traditional symbolic execution based ap ..."
Abstract - Cited by 232 (52 self) - Add to MetaCart
Modern software systems, which often are concurrent and manipulate complex data structures must be extremely reliable. We present a novel framework based on symbolic execution, for automated checking of such systems. We provide a two-fold generalization of traditional symbolic execution based

SYMBOLIC EXECUTION IN ALGORITHM DESIGN

by unknown authors
"... Our studies of how people design algorithms [14,15] reveal that symbolic execution is one of the principal design methods used in the absence of specific knowledge, 3 and we believe that symbolic execution will play an equally important role in the automatic ..."
Abstract - Add to MetaCart
Our studies of how people design algorithms [14,15] reveal that symbolic execution is one of the principal design methods used in the absence of specific knowledge, 3 and we believe that symbolic execution will play an equally important role in the automatic

Memoized Symbolic Execution

by Guowei Yang, Corina S. Păsăreanu, Sarfraz Khurshid
"... This paper introduces memoized symbolic execution (Memoise), a new approach for more efficient application of forward symbolic execution, which is a well-studied technique for systematic exploration of program behaviors based on bounded execution paths. Our key insight is that application of symboli ..."
Abstract - Cited by 12 (5 self) - Add to MetaCart
This paper introduces memoized symbolic execution (Memoise), a new approach for more efficient application of forward symbolic execution, which is a well-studied technique for systematic exploration of program behaviors based on bounded execution paths. Our key insight is that application

Directed incremental symbolic execution

by Suzette Person, Guowei Yang, Neha Rungta, Sarfraz Khurshid - In PLDI , 2011
"... The last few years have seen a resurgence of interest in the use of symbolic execution – a program analysis technique developed more than three decades ago to analyze program execution paths. Scaling symbolic execution and other path-sensitive analysis techniques to large systems remains challenging ..."
Abstract - Cited by 30 (8 self) - Add to MetaCart
The last few years have seen a resurgence of interest in the use of symbolic execution – a program analysis technique developed more than three decades ago to analyze program execution paths. Scaling symbolic execution and other path-sensitive analysis techniques to large systems remains

Compact Symbolic Execution?

by Jiri Slaby
"... Abstract. We present a generalisation of King’s symbolic execution technique called compact symbolic execution. It proceeds in two steps. First, we analyse cyclic paths in the control flow graph of a given pro-gram, independently from the rest of the program. Our goal is to compute a so called templ ..."
Abstract - Add to MetaCart
Abstract. We present a generalisation of King’s symbolic execution technique called compact symbolic execution. It proceeds in two steps. First, we analyse cyclic paths in the control flow graph of a given pro-gram, independently from the rest of the program. Our goal is to compute a so called

Directed symbolic execution.

by Khoo Kin-Keung Ma , Yit Phang , Jeffrey S Foster , Michael Hicks , 2011
"... Abstract. In this paper, we study the problem of automatically finding program executions that reach a particular target line. This problem arises in many debugging scenarios; for example, a developer may want to confirm that a bug reported by a static analysis tool on a particular line is a true p ..."
Abstract - Cited by 26 (2 self) - Add to MetaCart
positive. We propose two new directed symbolic execution strategies that aim to solve this problem: shortest-distance symbolic execution (SDSE) uses a distance metric in an interprocedural control flow graph to guide symbolic execution toward a particular target; and call-chain-backward symbolic execution

Using Symbolic Execution

by Andrei Arusoaie, Dorel Lucanu, Vlad Rusu, Andrei Arusoaie, Dorel Lucanu, Vlad Rusu, Inria Lille Nord Europe , 2013
"... Abstract: In this paper we present an automatic and language-independent program verification approach based on symbolic execution. The specification formalism we consider is Reachability Logic, a language-independent logic that constitutes an alternative to Hoare logics. Reachability Logic has a so ..."
Abstract - Add to MetaCart
Abstract: In this paper we present an automatic and language-independent program verification approach based on symbolic execution. The specification formalism we consider is Reachability Logic, a language-independent logic that constitutes an alternative to Hoare logics. Reachability Logic has a

BACKWARD SYMBOLIC EXECUTION of PROTOCOLS

by Gerard J. Holzmann - PROTOCOL SPECIFICATION, TESTING, AND VERIFICATION, IV , 1985
"... A traditional method to validate protocols by state space exploration is to use forward symbolic execution. One of the main problems of this approach is that to find all undesirable system states one has to generate all reachable states and evaluate all desirable system states as well. The paper d ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
A traditional method to validate protocols by state space exploration is to use forward symbolic execution. One of the main problems of this approach is that to find all undesirable system states one has to generate all reachable states and evaluate all desirable system states as well. The paper
Results 1 - 10 of 2,117