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.
Filters
Targeted program transformations for symbolic execution
2015
Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering - ESEC/FSE 2015
Preserved Fulltext
Second, we argue for the design of testability transformations specifically targeted toward more scalable symbolic execution. ...
Semantics-preserving program transformations, such as refactorings and optimisations, can have a significant impact on the effectiveness of symbolic execution testing and analysis. ...
I thank Mark Harman and Paul Marinescu for their feedback, and the EPSRC for supporting this research through an EPSRC Early-Career Fellowship. ...
doi:10.1145/2786805.2803205
dblp:conf/sigsoft/Cadar15
fatcat:gm4g35qnibbarpytldyhrjk5t4
Symbolic Execution with Invariant Inlay: Evaluating the Potential
2018
2018 25th Australasian Software Engineering Conference (ASWEC)
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.
Dynamic symbolic execution (DSE) is a nonstandard execution mechanism which, loosely, executes a program symbolically and, simultaneously, on concrete input. ...
To capitalise fully on a static analyzer, invariant inlay applies certain instrumentations and testability transformations to the program source. ...
A program transformation that improves a program's runtime behaviour may simultaneously hamper its symbolic execution. ...
doi:10.1109/aswec.2018.00012
dblp:conf/aswec/AlatawiMS18
fatcat:c5qzizewxjcmnlbe5hfh3gkjbi
Symbolic execution of high-level transformations
2016
Proceedings of the 2016 ACM SIGPLAN International Conference on Software Language Engineering - SLE 2016
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.
We evaluate this symbolic execution technique on a collection of refactoring and model transformation programs, showing that the white-box test generation tool based on symbolic execution obtains better ...
We take a step towards that goal, by developing a general symbolic execution technique that handles programs written in these high-level transformation languages. ...
An overview of our symbolic execution technique for transformations is presented in Fig. 3 . ...
doi:10.1145/2997364.2997382
fatcat:nhzu4kkuvfbqbfixwiiudjnjba
Learning to Accelerate Symbolic Execution via Code Transformation
2018
European Conference on Object-Oriented Programming
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.
Orthogonal to refined symbolic execution, in this paper we propose to accelerate symbolic execution through semantic-preserving code transformation on the target programs. ...
for symbolic execution. ...
For instance, through code transformation, a program is transformed into an easy-to-analyze target program, and then various optimized symbolic execution techniques can be applied to this new target program ...
doi:10.4230/lipics.ecoop.2018.6
dblp:conf/ecoop/ChenHZHK018
fatcat:4f7uciggoneulmfsgi3kve3zly
A path-sensitively sliced control flow graph
2014
Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering - FSE 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 2014; you can also visit the original URL.
The file type is application/pdf.
We present a new graph representation of programs with specified target variables. ...
These programs are intended to be processed by third-party applications querying target variables such as testers and verifiers. The representation embodies two concepts. ...
The backward dependency computation process starts from end with a set of "target variables" V ⊆ Vars, for which the program transformation is being performed. ...
doi:10.1145/2635868.2635884
dblp:conf/sigsoft/JaffarM14
fatcat:73qnqiqaoncnbeoigphcijbk5u
Scalable Certification Framework for Behavioral Synthesis Front-End
2014
Proceedings of the The 51st Annual Design Automation Conference on Design Automation Conference - DAC '14
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.
Our approach makes use of dual-rail symbolic simulation of the input and output of a transformation, together with identification and inductive verification of their loop structures. ...
Our tool can automatically validate more than 75 percent of the total of 1008 compiler transformations applied, taking an average time of 1.5 seconds per transformation. ...
We use symbolic execution technique to explore (possibly all) paths of the source and target programs of each transformation. ...
doi:10.1145/2593069.2593209
dblp:conf/dac/YangHCLRX14
fatcat:7yysj4cryndd5mvoz3z3yierqu
Scalable certification framework for behavioral synthesis front-end
2014
2014 51st ACM/EDAC/IEEE Design Automation Conference (DAC)
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.
Our approach makes use of dual-rail symbolic simulation of the input and output of a transformation, together with identification and inductive verification of their loop structures. ...
Our tool can automatically validate more than 75 percent of the total of 1008 compiler transformations applied, taking an average time of 1.5 seconds per transformation. ...
We use symbolic execution technique to explore (possibly all) paths of the source and target programs of each transformation. ...
doi:10.1109/dac.2014.6881476
fatcat:2m5g6lvrwnec7hyxlng4q7e644
Augmented dynamic symbolic execution
2012
Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering - ASE 2012
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.
Dynamic symbolic execution (DSE) can efficiently explore all simple paths through a program, reliably determining whether there are any program crashes or violations of assertions or code contracts. ...
In this paper, we present augmented dynamic symbolic execution, which aims to produce representative test sets by augmenting path conditions with additional conditions that enforce target criteria such ...
Dynamic symbolic execution (DSE) overcomes these limitations by interleaving program execution with symbolic execution, systematically exploring uncovered code branches. ...
doi:10.1145/2351676.2351716
dblp:conf/kbse/JamrozikFTH12
fatcat:jpe2abidlzdbzipqfsr55gkhwa
Equivalence checking for compiler transformations in behavioral synthesis
2013
2013 IEEE 31st International Conference on Computer Design (ICCD)
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.
Our approach is based on dual-rail symbolic simulation of the input and output design representations of a transformation. ...
We present a scalable equivalence checking framework to validate the correctness of compiler transformations employed by behavioral synthesis. ...
We thank Disha Puri, Naren Narasimhan, and Jin Yang for their advice and help. ...
doi:10.1109/iccd.2013.6657090
dblp:conf/iccd/YangHCRX13
fatcat:c2ni4fbm6zdq3hjefowfxpdqgq
Improving Structural Testing of Object-Oriented Programs via Integrating Evolutionary Testing and Symbolic Execution
2008
2008 23rd IEEE/ACM International Conference on Automated Software Engineering
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 2014; you can also visit the original URL.
The file type is application/pdf.
symbolic execution (used to generate desirable method arguments). ...
Previous work has developed the symbolic execution technique and the evolutionary testing technique to address these two challenges, respectively. ...
Symbolic Execution For Java programs, Sen and Agha [3] developed jCUTE, a symbolic execution tool for combining concrete and symbolic execution. ...
doi:10.1109/ase.2008.40
dblp:conf/kbse/InkumsahX08
fatcat:c3ow7duhz5fkbkrxjcxc5yzif4
Backward propagation of code refinements on transformational code generation environments
2013
2013 7th International Workshop on Traceability in Emerging Forms of Software Engineering (TEFSE)
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.
Our conceptual framework is based on static and symbolic execution analysis, and aims to contribute to the maintenance and evolution challenges of model-driven development. ...
It advocates the modeling of common and variable features in software-system families with domain-specific languages, and the specification of transformation compositions for successively refining the ...
ACKNOWLEDGEMENTS We would like to thank Suzette Person from NASA Langley for her helpful guidance on exploring differential symbolic execution techniques. ...
doi:10.1109/tefse.2013.6620155
dblp:conf/icse/GuanaS13
fatcat:q2vi3hrqwrcpvlhl5fz37qbtji
On the Correctness of Transformations in Compiler Back-Ends
[chapter]
2006
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.
Compiler back-ends transform intermediate languages into code of the target machine. Back-end generators allow to generate compiler backends from a set of transformation rules. ...
On the Correctness of Transformations in Compiler Back-Ends 75 compiler. We consider classical basic-block oriented intermediate languages and sequential register based target machines. ...
I thank the two anonymous referees for their helpful comments. I'm grateful to all colleagues of the Verifix project in Karlsruhe, Kiel, and Ulm for the inspiring and fruitful discussions. ...
doi:10.1007/11925040_6
fatcat:75vck4657jeuji42bzsqf5jnra
Evacon
2007
Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering - ASE '07
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 2008; you can also visit the original URL.
The file type is application/pdf.
First, some branches involve complex program logics and generating tests to cover them requires deep knowledge of the program structure and semantics. ...
Previous work has developed the concolic testing technique (a combination of concrete and symbolic testing techniques) and the evolutionary testing technique to address these two challenges, respectively ...
They use concrete input graphs for concrete inputs and symbolic states for symbolic variables, and execute the program under test simultaneously on both concrete and symbolic inputs with the symbolic execution ...
doi:10.1145/1321631.1321700
dblp:conf/kbse/InkumsahX07
fatcat:bpc7ypsy3ve47mjsjyeghy6ady
SCORE
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 2017; you can also visit the original URL.
The file type is application/pdf.
One main task of concolic testing is to extract symbolic information from a concrete execution of a target program at runtime. ...
We have developed a Scalable COncolic testing tool for REliable embedded software (SCORE) that targets embedded C programs. ...
We would like to thank Matt Staats for his feedback and comments. ...
doi:10.1145/2025113.2025180
dblp:conf/sigsoft/KimK11
fatcat:52njv4nl7ffjrbkfacjucrlfxe
HI-CFG: Construction by Binary Analysis and Application to Attack Polymorphism
[chapter]
2013
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.
Structural knowledge allows our approach to scale to applications that are infeasible with monolithic symbolic execution. ...
We apply the HI-CFG to find the parts of the program that implement each transformation, and then generate new attack inputs under a user-specified combination of transformations. ...
We thank László Szekeres and Lenx Tao Wei for suggestions and help related to the experiments and previous papers. ...
doi:10.1007/978-3-642-40203-6_10
fatcat:uwwzkptmnrctdomhzwhnshz4ni
« Previous
Showing results 1 — 15 out of 110,527 results