Compositional dynamic test generation

Godefroid, Patrice

doi:10.1145/1190216.1190226

Cited by 292 publications

(143 citation statements)

References 19 publications

Supporting

Mentioning

143

Contrasting

Order By: Relevance

“…In the future, we plan to investigate a combination of our current exhaustive test case generation approach with symbolic execution, as a way of increasing the power of the former, and enabling the application of the latter for aerospace code. Moreover, we intend to investigate compositional symbolic execution techniques [21,23], in order to address the scalability issues that we experienced.…”

Section: Discussionmentioning

confidence: 99%

“…A similar process would then need to be applied in order to eventually generate inputs for the TSAFE prototype itself. Compositional symbolic execution [21,23] aims at addressing the problem of combining local solutions into solutions for larger pieces of code, but it is still an open research area that we intend to further investigate in the future.…”

Section: Application Of Spf To Tsafementioning

confidence: 99%

“…Inputs for alternative branches will be computed by using constraint solvers to solve the path constraints, similarly to symbolic execution. Compositional techniques [21,23] have also been proposed for increasing the scalability of symbolic execution, as mentioned in the previous section.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Formal testing for separation assurance

Giannakopoulou

Bushnell

Schumann

et al. 2011

Ann Math Artif Intell

View full text Add to dashboard Cite

In order to address the rapidly increasing load of air traffic operations, innovative algorithms and software systems must be developed for the next generation air traffic control. Extensive verification of such novel algorithms is key for their adoption by industry. Separation assurance algorithms aim at predicting if two aircraft will get closer to each other than a minimum safe distance; if loss of separation is predicted, they also propose a change of course for the aircraft to resolve this potential conflict. In this paper, we report on our work towards developing an advanced testing framework for separation assurance. Our framework supports automated test case generation and testing, and defines test oracles that capture algorithm requirements. We discuss three different approaches to testcase generation, their application to a separation assurance prototype, and their respective strengths and weaknesses. We also present an approach for statistical analysis of the large numbers of test results obtained from our framework.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Application Of Spf To Tsafementioning

confidence: 99%

See 1 more Smart Citation

Formal testing for separation assurance

Giannakopoulou

Bushnell

Schumann

et al. 2011

Ann Math Artif Intell

View full text Add to dashboard Cite

show abstract

“…Random-symbolic testing has been widely investigated recently to automate test input generation [18,19,25]. It alternates concrete and symbolic execution to alleviate their main limitations.…”

Section: Related Workmentioning

confidence: 99%

Randomized constraint solvers: a comparative study

Takaki

Cavalcanti

Gheyi

et al. 2010

Innovations Syst Softw Eng

View full text Add to dashboard Cite

The complexity of constraints is a major obstacle for constraint-based software verification. Automatic constraint solvers are fundamentally incomplete: input constraints often build on some undecidable theory or some theory the solver does not support. This paper proposes and evaluates several randomized solvers to address this issue. We compared the effectiveness of a symbolic solver (CVC3), a random solver, two heuristic search solvers, and seven hybrid solvers (i.e. mix of random, symbolic, and heuristic solvers). We evaluated the solvers on a benchmark generated with a concolic execution of 9 subjects. The performance of each solver was measured by its precision, which is the fraction of constraints that the solver can find solution out of the total number of constraints that some solver can find solution. As expected, symbolic solving subsumes the other approaches for the 4 subjects that only generate decidable constraints. For the remaining 5 subjects, which contain undecidable constraints, the hybrid solvers achieved the highest precision (fraction of constraints that a solver can find a solution out of the total number of satisfiable constraints). We also observed that the solvers were complementary, which suggests that one should alternate their use in iterations of a concolic execution driver.

show abstract

“…More recent tools [30,31] are able to generate relevant sets of data in addition to schedulings, or to manage cyclic programs [32]; integrating these techniques in our tool should be helpful for the validation of TL models.…”

Section: Algorithms For Partial-order Reductionmentioning

confidence: 99%

Full simulation coverage for SystemC transaction-level models of systems-on-a-chip

Helmstetter

Maraninchi

Maillet-Contoz

2009

Form Methods Syst Des

View full text Add to dashboard Cite

International audienceTransaction-Level Models (TLM) are used for the early validation of embedded software. A TL model is a virtual prototype of the hardware part of a System-on-a-Chip (SoC). When using SystemC for transaction level modeling, the main parallel entities of the hardware platform (processors, DMAs, bus arbiters, etc.) are modeled by asynchronous processes, which are scheduled at simulation time. The specification of this scheduling mechanism is non-deterministic; the set of all possible schedulings of the parallel activities represents the physical parallelism faithfully. Moreover TL models may contain loose timing annotations (intervals for instance), and the set of all possible values of time in these intervals is also meant to represent the hardware behaviors faithfully. However, any simulation engine is built on a deterministic scheduler, and at runtime will use specific values in the time intervals. This means that only a very small subset of all the possible schedulings and timings are exhibited during simulation. Some bugs may be missed if they are due to some behaviors of the hardware that are represented by other schedulings or timings. For a given finite test scenario, the set of valid schedulings and timings of a model is finite, but far too large to be explored fully. We present a solution to cover the set of schedulings and timings efficiently. Our solution is based on dynamic partial order reduction and constraint solving techniques. It gives a complete scheduling and timing set, which guarantees the detection of all local errors and deadlocks for a fixed test scenario

show abstract

Compositional dynamic test generation

Cited by 292 publications

References 19 publications

Formal testing for separation assurance

Formal testing for separation assurance

Randomized constraint solvers: a comparative study

Full simulation coverage for SystemC transaction-level models of systems-on-a-chip

Contact Info

Product

Resources

About