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

Deskribapen osoa

Xehetasun bibliografikoak
Egile Nagusiak:	Holzer, A, Kroening, D, Schallhart, C, Tautschnig, M, Veith, H
Beste egile batzuk:	Flanagan, C
Formatua:	Journal article
Hizkuntza:	English
Argitaratua:	Springer 2012

Antzeko izenburuak

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

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

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

Query-Driven Program Testing.
nork: Holzer, A, et al.
Argitaratua: (2009)

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

Query−Driven Program Testing
nork: Holzer, A, et al.
Argitaratua: (2009)

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

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

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

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

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

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

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

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

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

Functional Reachability
nork: Ong, C, et al.
Argitaratua: (2009)

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

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

On affine reachability problems
nork: Jaax, S, et al.
Argitaratua: (2020)

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

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

Expected Reachability-Time Games.
nork: Forejt, V, et al.
Argitaratua: (2010)

Expected Reachability−Time Games
nork: Forejt, V, et al.
Argitaratua: (2010)

Expected reachability-time games
nork: Forejt, V, et al.
Argitaratua: (2016)

Reachability Analysis for Annotated Code
nork: Janota, M, et al.
Argitaratua: (2007)

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

Verification Across Intellectual Property Boundaries.
nork: Chaki, S, et al.
Argitaratua: (2007)

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

Reachability in pushdown register automata
nork: Murawski, A, et al.
Argitaratua: (2017)

Revisiting reachability in timed automata
nork: Quaas, K, et al.
Argitaratua: (2017)

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

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

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

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

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

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

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

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

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

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