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
Using Coverage Criteria on RepOK to Reduce Bounded-Exhaustive Test Suites
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
This technique is based on the application of coverage criteria on the representation invariant of the structure for which the suite was produced. ...
In this paper, we propose a technique for reducing the size of bounded-exhaustive test suites. ...
Once one has decided the white-box criterion to be applied to repOK, one can use it to reduce bounded-exhaustive suites. The approach we followed for doing so is the following. ...
doi:10.1007/978-3-642-30473-6_4
fatcat:7powlkdrqbb4pmgdp3hcfupxw4
Incorporating Coverage Criteria in Bounded Exhaustive Black Box Test Generation of Structural Inputs
[chapter]
2011
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.
Various state of the art tools tackle this problem by bounded exhaustive exploration of potential test cases, using constraint solving mechanisms based on techniques such as search, model checking, symbolic ...
contexts using a filtering approach to test generation. ...
Acknowledgements The authors would like to thank Darko Marinov and the anonymous referees for their valuable comments. ...
doi:10.1007/978-3-642-21768-5_3
fatcat:3uk4pr45ojdclab44ufnjnvhg4
Improving Test Generation under Rich Contracts by Tight Bounds and Incremental SAT Solving
2013
2013 IEEE Sixth International Conference on Software Testing, Verification and Validation
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.
The proposed technique uses incremental SAT to build test suites targeting a specific testing criterion, amongst various black-box and white-box criteria. ...
As our experimental results show, the combination of tight bounds with incremental SAT, and the testing criterion driven approach implemented in our prototype tool FAJITA, enable us to effectively generate ...
Acknowledgements The authors would like to thank the anonymous referees for their helpful comments. ...
doi:10.1109/icst.2013.46
dblp:conf/icst/AbadABCFGMMRV13
fatcat:qo5zbj6htfeutdsmqcvcff6g5u
Test input generation with java PathFinder
2004
Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis - ISSTA '04
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 show how model checking and symbolic execution can be used to generate test inputs to achieve structural coverage of code that manipulates complex data structures. ...
We focus on obtaining branch-coverage during unit testing of some of the core methods of the red-black tree implementation in the Java TreeMap library, using the Java PathFinder model checker. ...
We would also like to thank the reviewers for their detailed comments that allowed us to greatly improve the paper. ...
doi:10.1145/1007512.1007526
dblp:conf/issta/VisserPK04
fatcat:geatkdkadbavzcxwu5t2akzsa4
Test input generation with java PathFinder
2004
Software engineering notes
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 show how model checking and symbolic execution can be used to generate test inputs to achieve structural coverage of code that manipulates complex data structures. ...
We focus on obtaining branch-coverage during unit testing of some of the core methods of the red-black tree implementation in the Java TreeMap library, using the Java PathFinder model checker. ...
We would also like to thank the reviewers for their detailed comments that allowed us to greatly improve the paper. ...
doi:10.1145/1013886.1007526
fatcat:ffzisnz2ezggdm3gyfwauhbdf4
Generalizing symbolic execution to library classes
2005
The 6th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering - PASTE '05
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 2011; you can also visit the original URL.
The file type is application/pdf.
Forward symbolic execution is a program analysis technique that allows using symbolic inputs to explore program executions. ...
The fundamental idea in Dianju is to perform symbolic execution of commonly used library classes (such as strings, sets and maps) at the abstract level rather than the representation level. ...
Dianju's symbolic execution then takes the form of bounded exhaustive testing where, say all sets up to a certain size will be explored. ...
doi:10.1145/1108792.1108817
dblp:conf/paste/KhurshidS05
fatcat:nk6llmsiezashhtrgkw7ptglvm
Generalizing symbolic execution to library classes
2006
Software engineering notes
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 2011; you can also visit the original URL.
The file type is application/pdf.
Forward symbolic execution is a program analysis technique that allows using symbolic inputs to explore program executions. ...
The fundamental idea in Dianju is to perform symbolic execution of commonly used library classes (such as strings, sets and maps) at the abstract level rather than the representation level. ...
Dianju's symbolic execution then takes the form of bounded exhaustive testing where, say all sets up to a certain size will be explored. ...
doi:10.1145/1108768.1108817
fatcat:5yq3q7vy6ffyvptdaldjkm7o4e
An Empirical Study of Structural Constraint Solving Techniques
[chapter]
2009
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 2013; you can also visit the original URL.
The file type is application/pdf.
Since enumerating all possible object graphs is prohibitively expensive, researchers have proposed a number of techniques for reducing the number of potential object graphs to consider as candidate solutions ...
It focussed on their relative abilities in expressing the constraints and formatting the output object graphs, and most importantly on their performance. ...
Bounded exhaustive testing has been used to successfully find bugs in a fault-tree analyzer [49] , a resource discovery architecture, and an XPath compiler. int repOk( struct bintree* b ) { struct listnode ...
doi:10.1007/978-3-642-10373-5_5
fatcat:qiy3hfo4izgd7onajc3ebvlkdm
TestEra: Specification-Based Testing of Java Programs Using SAT
2004
Automated Software Engineering : An International 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 2010; you can also visit the original URL.
The file type is application/pdf.
Using the method's pre-condition, TestEra automatically generates all nonisomorphic test inputs up to the given bound. ...
It executes the method on each test input, and uses the method postcondition as an oracle to check the correctness of each output. Specifications are first-order logic formulae. ...
Acknowledgements We would like to thank the anonymous referees for their comments that helped us significantly improve our exposition. ...
doi:10.1023/b:ause.0000038938.10589.b9
fatcat:xmy6mbca5rbe5otpvtrmzsarmy
Test input generation for java containers using state matching
2006
Proceedings of the 2006 international symposium on Software testing and analysis - ISSTA'06
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.
Exhaustive techniques use model checking with explicit or symbolic execution to explore all the possible test sequences up to predefined input sizes. ...
On the other hand, abstract matching turns out to be a powerful approach for generating test inputs to obtain high predicate coverage. ...
Rostra [32] also generates unit tests for Java classes, using bounded-exhaustive exploration of sequences with concrete arguments and abstraction mappings. ...
doi:10.1145/1146238.1146243
dblp:conf/issta/VisserPP06
fatcat:2x5dwej6u5es7ewwmva6au6msu
Advances on Improving Automation in Developer Testing
[chapter]
2012
Advances in Computers
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.
For test inputs, the techniques presented in our chapter are summarized from two main aspects: test efficiency (e.g., with a focus on cost) and test effectiveness (e.g., with a focus on benefit). ...
Existing developer testing tools include various techniques to address challenges of generating desirable test inputs and checking the behavior of the program unit under test (referred to as test oracles ...
Given a small bound on the length of sequences, bounded-exhaustive techniques generate sequences exhaustively up to lengths of the given bound. ...
doi:10.1016/b978-0-12-396526-4.00004-7
fatcat:i7m7mmpt4vc5reuyzval3bi3s4
Automatic Testing of Object-Oriented Software
[chapter]
2007
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.
The AutoTest unit testing framework automates both, by using Eiffel contracts -already present in the software -as test oracles, and generating objects and routine arguments to exercise all given classes ...
Effective testing involves preparing test oracles and test cases, two activities which are too tedious to be effectively performed by humans, yet for the most part remain manual. ...
Per Madsen provided useful suggestions on state partitioning. ...
doi:10.1007/978-3-540-69507-3_9
fatcat:x3varw5h6nbuvchyo2cchqpbxi
Automated Fixing of Programs with Contracts
2014
IEEE Transactions on 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 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2014 pre-print arXiv:1403.1117v2 fatcat:ywzaduszbjgivhbum6ho32mesiOther Versions
These figures compare favorably to the state of the art in automated program fixing, and demonstrate that the AutoFix approach is successfully applicable to reduce the debugging burden in real-world scenarios ...
To provide high-quality fix suggestions and to enable automation of the whole debugging process, AutoFix relies on the presence of simple specification elements in the form of contracts (such as pre- and ...
Silva contributed to an early implementation of AutoFix. ...
doi:10.1109/tse.2014.2312918
fatcat:z3zfwgg6ffbe7ohf2hxxvri5se
Systematic techniques for more effective fault localization and program repair
[article]
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 2022; you can also visit the original URL.
The file type is application/pdf.
We embody our thesis in a suite of integrated techniques based on propositional satisfiability solving, correctness specifications analysis, test spectra analysis, and rule-learning algorithms from machine ...
One, they lack accuracy to handle real programs. Two, they focus on automating only one of the two key steps, thereby leaving the other key step to the developer. ...
It contains 9 tests, each of which invokes the repOK on a doubly linked list input (some valid and some invalid) and checks if the repOK returns true on valid inputs and false on the invalid ones. ...
doi:10.15781/t2qt17
fatcat:zcdtqrv5kbgslaj5lhwfzskvxq
Weighted Statistical Testing based on Active Learning and Formal Verification Techniques for Software Reliability Assessment
2018
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.
The developed approach extends and combines theoretical sound approaches in a novel manner to systematically reduce the overhead of reliability assessment. ...
Recently published approaches such as [92] and [37] present techniques to accelerate statistical testing based on path coverage criteria. ...
Scope methods are used to specify bounds on the size of the input data structures and bounds on the de nition domain of the primitive elds of the data structure. ...
doi:10.5445/ksp/1000051517
fatcat:rswpm3dd7fhitoccmepqv5if6m
« Previous
Showing results 1 — 15 out of 18 results