A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
BLISS: Improved Symbolic Execution by\\ Bounded Lazy Initialization with SAT Support
2015
IEEE Transactions on Software Engineering
Preserved Fulltext
SPF combines symbolic execution with model checking and constraint solving, to systematically explore program paths for verification, as well as for automated test input generation by solving the path ...
Java PathFinder (JPF) is a well-known tool based on this technique, that targets Java source code and, through an extension called Symbolic PathFinder (SPF), is able to automatically generate test cases ...
SPF combines symbolic execution with model checking and constraint solving, to systematically explore program paths for verification, as well as for automated test input generation by solving the path ...
doi:10.1109/tse.2015.2389225
fatcat:6vyxbn74m5e2dpcjtd25dcdwfu
Automatic structural testing with abstraction refinement and coarsening
2011
Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering - SIGSOFT/FSE '11
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
static and dynamic analysis techniques, and that it is possible to manage the combinatorial explosion of execution models by identifying and remove elements of the execution models when not needed anymore ...
yet executed or to prove the infeasibility of the elements not yet covered. ...
Symbolic and concolic execution are well known techniques for generating test cases, and are implemented in several robust tools. ...
doi:10.1145/2025113.2025173
dblp:conf/sigsoft/Baluda11
fatcat:iwr7xm4hwzer7nuysqbxhp752q
Abstracting Symbolic Execution with String Analysis
2007
Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION (TAICPART-MUTATION 2007)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Forward symbolic execution is a technique for program analysis that explores the execution paths of a program by maintaining a symbolic representation of the program state. ...
We demonstrate the ability to symbolically execute a commonly used library class, specifically a string, at an abstract level. ...
Background Forward symbolic execution is a technique for executing a program on symbolic values [16] . ...
doi:10.1109/taicpart.2007.4344094
fatcat:mnjfjfzmvvh5tgd6r4dopdwcla
Abstracting Symbolic Execution with String Analysis
2007
Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION (TAICPART-MUTATION 2007)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Forward symbolic execution is a technique for program analysis that explores the execution paths of a program by maintaining a symbolic representation of the program state. ...
We demonstrate the ability to symbolically execute a commonly used library class, specifically a string, at an abstract level. ...
Background Forward symbolic execution is a technique for executing a program on symbolic values [16] . ...
doi:10.1109/taic.part.2007.34
fatcat:wwid5s7nxnanbktz6bgjwmrkfi
Scaling symbolic execution using ranged analysis
2012
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
This paper introduces a novel approach to scale symbolic execution-a program analysis technique for systematic exploration of bounded execution paths-for test input generation. ...
We present ranged symbolic execution, which embodies this insight and uses two test inputs to define a range, i.e., the beginning and end, for a symbolic execution run. ...
Acknowledgments We thank Lingming Zhang and the anonymous reviewers for detailed and helpful comments. ...
doi:10.1145/2398857.2384654
fatcat:36xmf3ibxjanfpu3fie7nwnk3a
Scaling symbolic execution using ranged analysis
2012
Proceedings of the ACM international conference on Object oriented programming systems languages and applications - OOPSLA '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
This paper introduces a novel approach to scale symbolic execution-a program analysis technique for systematic exploration of bounded execution paths-for test input generation. ...
We present ranged symbolic execution, which embodies this insight and uses two test inputs to define a range, i.e., the beginning and end, for a symbolic execution run. ...
Acknowledgments We thank Lingming Zhang and the anonymous reviewers for detailed and helpful comments. ...
doi:10.1145/2384616.2384654
dblp:conf/oopsla/SiddiquiK12
fatcat:tbsembqssrgh3ad2iva6mncwqa
User-Defined Sandbox Behavior For Dynamic Symbolic Execution
2017
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
One of the techniques is dynamic symbolic execution (DSE) that combines concrete executions with symbolic ones. ...
The mature state of research in DSE allowed the technique to be transferred for industrial use. ...
Symbolic execution [1] is one of these techniques, as it is able to generate tests based on source code by using symbolic variables instead of concrete ones. ...
doi:10.5281/zenodo.291898
fatcat:cjtwqjumfrg37nylzdu5zfdvhu
Concolic testing: a decade later (keynote)
2015
Proceedings of the 13th International Workshop on Dynamic Analysis - WODA 2015
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Symbolic execution for software testing has witnessed renewed interest in the recent years due to its ability to generate highcoverage test suites and find deep errors in software systems. ...
In this talk, I will give an overview of a modern symbolic execution technique, called concolic testing, discuss its key challenges in terms of path exploration, and introduce MultiSE, a new technique ...
In this talk I will describe MultiSE [7] , a new technique for merging states incrementally during symbolic execution, without using auxiliary variables. ...
doi:10.1145/2823363.2823364
dblp:conf/oopsla/Sen15
fatcat:rfiaau5rgneazjawpch5nv6bmu
Abstract Analysis of Symbolic Executions
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Novel characteristics of this method are (a) constructing under-approximating models via symbolic execution with abstract matching and (b) proving safety using underapproximating models. ...
In this paper, we look at the problem of reasoning about concurrent systems with infinite data domains and non-deterministic input, and develop a method for verification and falsification of safety properties ...
for the fuitful discussions. ...
doi:10.1007/978-3-642-14295-6_43
fatcat:fudqfplpljhdvnb7pubzqaj7v4
On the Integration of Software Testing and Formal Analysis
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Undergoing efforts include concolic execution, testing-based correctness prove, execution driven abstract interpretation and dynamic invariant generation. ...
It provides a roadmap for future research. ...
The authors are solely responsible for the content of this paper. ...
doi:10.1007/978-3-642-25231-0_4
fatcat:no3u2cdsdjhx5oa67nix42xnf4
Timed Symbolic Testing Framework for Executable Models Using High-Level Scenarios
[chapter]
2015
Complex Systems Design & Management
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, we show how test data are extracted from sequence diagrams using symbolic execution and how they are used as inputs to test system activities in the standardized fUML virtual machine. ...
Refining high-level system scenarios into executable models is often not automatic and subject to implementation choices. ...
Diversity uses symbolic execution techniques to compute a symbolic tree representing all the possible executions of a TIOSTS. ...
doi:10.1007/978-3-319-11617-4_19
dblp:conf/csdm/ArnaudBCGGL14
fatcat:p6elpb773na5no7aunrn7qtfwy
The Auspicious Couple: Symbolic Execution and WCET Analysis
2013
Worst-Case Execution Time Analysis
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We have recently shown that symbolic execution together with the implicit path enumeration technique can successfully be applied for the Worst-Case Execution Time (WCET) analysis of programs. ...
Therefore, for applying symbolic execution in the timing analysis of programs, we propose to use WCET analysis as a guidance for symbolic execution in order to avoid full symbolic coverage of the program ...
In the proposed application of symbolic execution in r-TuBound we generate test-cases only for program executions along the WCET trace candidate paths(s). ...
doi:10.4230/oasics.wcet.2013.53
dblp:conf/wcet/BiereKKZ13
fatcat:a6tl7qtp6ffmzljyjlxvlwuxl4
Enhancing structural software coverage by incrementally computing branch executability
2011
Software quality journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The algorithm combines symbolic analysis, abstraction refinement, and a novel technique named coarsening, to execute unexplored branches, identify infeasible ones, and mitigate the state space explosion ...
In this paper, we propose a technique that both generates test cases that execute yet uncovered branches and identifies infeasible branches that can be eliminated from the computation of the branch coverage ...
For more details about lightweight symbolic execution, the reader may refer to Beckman et al (2010) . ...
doi:10.1007/s11219-011-9150-y
fatcat:rvluvrfgc5e5xn5aihpprgaxbi
Feedback-driven dynamic invariant discovery
2014
Proceedings of the 2014 International Symposium on Software Testing and Analysis - ISSTA 2014
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The instrumented code is executed symbolically to generate new test cases that are fed back to Daikon to help further refine the set of candidate invariants. ...
In this work, we introduce iDiscovery, a technique which leverages symbolic execution to improve the quality of dynamically discovered invariants computed by Daikon. ...
An initial set of test inputs is generated for the update method using symbolic execution. ...
doi:10.1145/2610384.2610389
dblp:conf/issta/ZhangYRPK14
fatcat:idyoz6xgivarbfetvgcnavzrxa
Structural coverage of feasible code
2010
Proceedings of the 5th Workshop on Automation of Software Test - AST '10
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The technique can also generate new test cases that execute uncovered elements, thus increasing the structural coverage of the program. ...
Infeasible execution paths reduce the precision of structural testing coverage and limit the industrial applicability of structural testing criteria. ...
These data provide initial empirical evidence of the advantages of our technique with respect to both random testing and directed testing based on either concolic or symbolic execution. ...
doi:10.1145/1808266.1808275
dblp:conf/icse/BaludaBDP10
fatcat:e267vbuxsnhwvlhvpyapbb54em
« Previous
Showing results 1 — 15 out of 77,255 results