Proving Reachability Using FShell - (Competition Contribution).

Proving Reachability Using FShell - (Competition Contribution).

FShell is an automated white-box test-input generator for C programs, computing test data with respect to user-specified code coverage criteria. The pillars of FShell are the declarative specification language FQL (FShell Query Language), an efficient back end for computing test data, and a mathemat...

Bibliografske podrobnosti
Main Authors:	Holzer, A, Kroening, D, Schallhart, C, Tautschnig, M, Veith, H
Drugi avtorji:	Flanagan, C
Format:	Journal article
Jezik:	English
Izdano:	Springer 2012

Podobne knjige/članki

FShell: Systematic Test Case Generation for Dynamic Analysis and Measurement.
od: Holzer, A, et al.
Izdano: (2008)

FShell: Systematic Test Case Generation for Dynamic Analysis and Measurement
od: Holzer, A, et al.
Izdano: (2008)

An Introduction to Test Specification in FQL.
od: Holzer, A, et al.
Izdano: (2010)

Query-Driven Program Testing.
od: Holzer, A, et al.
Izdano: (2009)

How did you specify your test suite ?
od: Holzer, A, et al.
Izdano: (2010)

Query−Driven Program Testing
od: Holzer, A, et al.
Izdano: (2009)

How did you specify your test suite.
od: Holzer, A, et al.
Izdano: (2010)

An Introduction to Test Specification in FQL
od: Holzer, A, et al.
Izdano: (2011)

Seamless Testing for Models and Code.
od: Holzer, A, et al.
Izdano: (2011)

Seamless Testing for Models and Code
od: Holzer, A, et al.
Izdano: (2015)

Proving the Correctness of Pipelined Micro−Architectures
od: Kroening, D, et al.
Izdano: (2000)

Proving the Correctness of Processors with Delayed Branch using Delayed PC
od: Mueller, S, et al.
Izdano: (2000)

Accurate Theorem Proving for Program Verification
od: Cook, B, et al.
Izdano: (2006)

Cogent: Accurate theorem proving for program verification
od: Cook, B, et al.
Izdano: (2005)

Proving safety with trace automata and bounded model checking
od: Kroening, D, et al.
Izdano: (2015)

Functional Reachability
od: Ong, C, et al.
Izdano: (2009)

CBMC – C bounded model checker
od: Kroening, D, et al.
Izdano: (2014)

Proving predatory pricing in European Union Competition law
od: Ana Pošćić
Izdano: (2012-01-01)

On affine reachability problems
od: Jaax, S, et al.
Izdano: (2020)

Reachability Switching Games
od: John Fearnley, et al.
Izdano: (2021-04-01)

Constraint-based reachability
od: Arnaud Gotlieb, et al.
Izdano: (2013-02-01)

Expected Reachability-Time Games.
od: Forejt, V, et al.
Izdano: (2010)

Expected Reachability−Time Games
od: Forejt, V, et al.
Izdano: (2010)

Expected reachability-time games
od: Forejt, V, et al.
Izdano: (2016)

Reachability Analysis for Annotated Code
od: Janota, M, et al.
Izdano: (2007)

Minimal Reachability is Hard to Approximate
od: Jadbabaie, A, et al.
Izdano: (2023)

Verification Across Intellectual Property Boundaries.
od: Chaki, S, et al.
Izdano: (2007)

Proactive Detection of Computer Worms Using Model Checking.
od: Kinder, J, et al.
Izdano: (2010)

Reachability in pushdown register automata
od: Murawski, A, et al.
Izdano: (2017)

Revisiting reachability in timed automata
od: Quaas, K, et al.
Izdano: (2017)

Reachability Analysis for Nonlinear Analog/Mixed-Signal Circuits With Trajectory-Based Reachable Sets
od: Seyoung Kim, et al.
Izdano: (2023-01-01)

Don't care in SMT: building flexible yet efficient abstraction/refinement solvers.
od: Bauer, A, et al.
Izdano: (2010)

Don't care in SMT—Building flexible yet efficient abstraction/refinement solvers
od: Bauer, A, et al.
Izdano: (2007)

Don't care in SMT—Building flexible yet efficient abstraction/refinement solvers
od: Bauer, A, et al.
Izdano: (2010)

Adding Edges for Maximizing Weighted Reachability
od: Federico Corò, et al.
Izdano: (2020-03-01)

Reachability−Time Games on Timed Automata
od: Jurdzinski, M, et al.
Izdano: (2007)

V2c – A Verilog to C translator
od: Mukherjee, R, et al.
Izdano: (2016)

Partial orders for efficient bounded model checking of concurrent software
od: Alglave, J, et al.
Izdano: (2013)

Reachability and liveness in parametric timed automata
od: Étienne André, et al.
Izdano: (2022-02-01)

All-Path Reachability Logic
od: Andrei Stefanescu, et al.
Izdano: (2019-04-01)