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...

Cur síos iomlán

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí:	Holzer, A, Kroening, D, Schallhart, C, Tautschnig, M, Veith, H
Rannpháirtithe:	Flanagan, C
Formáid:	Journal article
Teanga:	English
Foilsithe / Cruthaithe:	Springer 2012

Míreanna comhchosúla

FShell: Systematic Test Case Generation for Dynamic Analysis and Measurement.
de réir: Holzer, A, et al.
Foilsithe / Cruthaithe: (2008)

FShell: Systematic Test Case Generation for Dynamic Analysis and Measurement
de réir: Holzer, A, et al.
Foilsithe / Cruthaithe: (2008)

An Introduction to Test Specification in FQL.
de réir: Holzer, A, et al.
Foilsithe / Cruthaithe: (2010)

Query-Driven Program Testing.
de réir: Holzer, A, et al.
Foilsithe / Cruthaithe: (2009)

How did you specify your test suite ?
de réir: Holzer, A, et al.
Foilsithe / Cruthaithe: (2010)

Query−Driven Program Testing
de réir: Holzer, A, et al.
Foilsithe / Cruthaithe: (2009)

How did you specify your test suite.
de réir: Holzer, A, et al.
Foilsithe / Cruthaithe: (2010)

An Introduction to Test Specification in FQL
de réir: Holzer, A, et al.
Foilsithe / Cruthaithe: (2011)

Seamless Testing for Models and Code.
de réir: Holzer, A, et al.
Foilsithe / Cruthaithe: (2011)

Seamless Testing for Models and Code
de réir: Holzer, A, et al.
Foilsithe / Cruthaithe: (2015)

Proving the Correctness of Pipelined Micro−Architectures
de réir: Kroening, D, et al.
Foilsithe / Cruthaithe: (2000)

Proving the Correctness of Processors with Delayed Branch using Delayed PC
de réir: Mueller, S, et al.
Foilsithe / Cruthaithe: (2000)

Accurate Theorem Proving for Program Verification
de réir: Cook, B, et al.
Foilsithe / Cruthaithe: (2006)

Cogent: Accurate theorem proving for program verification
de réir: Cook, B, et al.
Foilsithe / Cruthaithe: (2005)

Proving safety with trace automata and bounded model checking
de réir: Kroening, D, et al.
Foilsithe / Cruthaithe: (2015)

Functional Reachability
de réir: Ong, C, et al.
Foilsithe / Cruthaithe: (2009)

CBMC – C bounded model checker
de réir: Kroening, D, et al.
Foilsithe / Cruthaithe: (2014)

Proving predatory pricing in European Union Competition law
de réir: Ana Pošćić
Foilsithe / Cruthaithe: (2012-01-01)

On affine reachability problems
de réir: Jaax, S, et al.
Foilsithe / Cruthaithe: (2020)

Reachability Switching Games
de réir: John Fearnley, et al.
Foilsithe / Cruthaithe: (2021-04-01)

Constraint-based reachability
de réir: Arnaud Gotlieb, et al.
Foilsithe / Cruthaithe: (2013-02-01)

Expected Reachability-Time Games.
de réir: Forejt, V, et al.
Foilsithe / Cruthaithe: (2010)

Expected Reachability−Time Games
de réir: Forejt, V, et al.
Foilsithe / Cruthaithe: (2010)

Expected reachability-time games
de réir: Forejt, V, et al.
Foilsithe / Cruthaithe: (2016)

Reachability Analysis for Annotated Code
de réir: Janota, M, et al.
Foilsithe / Cruthaithe: (2007)

Minimal Reachability is Hard to Approximate
de réir: Jadbabaie, A, et al.
Foilsithe / Cruthaithe: (2023)

Verification Across Intellectual Property Boundaries.
de réir: Chaki, S, et al.
Foilsithe / Cruthaithe: (2007)

Reachability in pushdown register automata
de réir: Murawski, A, et al.
Foilsithe / Cruthaithe: (2017)

Revisiting reachability in timed automata
de réir: Quaas, K, et al.
Foilsithe / Cruthaithe: (2017)

Proactive Detection of Computer Worms Using Model Checking.
de réir: Kinder, J, et al.
Foilsithe / Cruthaithe: (2010)

Don't care in SMT: building flexible yet efficient abstraction/refinement solvers.
de réir: Bauer, A, et al.
Foilsithe / Cruthaithe: (2010)

Don't care in SMT—Building flexible yet efficient abstraction/refinement solvers
de réir: Bauer, A, et al.
Foilsithe / Cruthaithe: (2007)

Don't care in SMT—Building flexible yet efficient abstraction/refinement solvers
de réir: Bauer, A, et al.
Foilsithe / Cruthaithe: (2010)

Reachability Analysis for Nonlinear Analog/Mixed-Signal Circuits With Trajectory-Based Reachable Sets
de réir: Seyoung Kim, et al.
Foilsithe / Cruthaithe: (2023-01-01)

V2c – A Verilog to C translator
de réir: Mukherjee, R, et al.
Foilsithe / Cruthaithe: (2016)

Partial orders for efficient bounded model checking of concurrent software
de réir: Alglave, J, et al.
Foilsithe / Cruthaithe: (2013)

Adding Edges for Maximizing Weighted Reachability
de réir: Federico Corò, et al.
Foilsithe / Cruthaithe: (2020-03-01)

Reachability−Time Games on Timed Automata
de réir: Jurdzinski, M, et al.
Foilsithe / Cruthaithe: (2007)

Reachability and liveness in parametric timed automata
de réir: Étienne André, et al.
Foilsithe / Cruthaithe: (2022-02-01)

Reachability and the sense of embodiment in amputees using prostheses
de réir: Adrienne Gouzien, et al.
Foilsithe / Cruthaithe: (2017-07-01)