FShell provides a versatile testing environment for C programs which supports both interactive explorative use and a rich scripting language. More than a frontend for software model checkers, FShell is designed as a database engine which dispatches queries about the program to program analysis tools.
Such queries are expressed in FQL (FShell Query Language).
FQL specifications enable the user to formulate test specifications which range from local code-specific requirements (“cover all decisions in function `foo` using only calls from function `bar` to `foo`”) to generic code-independent requirements (e.g., “condition coverage”). We have designed FQL as a specification language which is easy to read – it is based on regular expressions – but has an expressive and precise semantics.

FShell was initially developed as part of the DFG funded project FORTAS (Formal Timing Analysis Suite for Real Time Programs) and will be further improved within the WWTF funded project “PROSEED: Proof Seeding for Software Verification”. FShell is available for download as binary for several platforms under the following licensing terms.

For further questions concerning FShell please don’t hesitate to contact Michael Tautschnig.

Latest News

Helmut Veith Stipend 2017

Outstanding female students in the field of computer science who pursue (or plan to pursue) one of the master‘s programs in Computer Science at TU Wien taught in English are invited to apply for the Helmut Veith Stipend

Continue reading

Helmut Veith Stipend

The first recipient of the Helmut Veith Stipend for excellent female master’s students in computer science will be presented on March 14 at the following event: "More female students in computer science. Who cares?" Panel discussion with renowned scientists about diversity in STEM Studies March 14, 5:30pm, TU Wien The Helmut Veith Stipend is dedicated […]

Continue reading

WAIT 2016 in Vienna

The third WAIT workshop on induction is held between 17-18 November at the TU Wien. Details are available on the workshop page.

Continue reading

Two papers at POPL’17

Two papers co-authored by researchers from our group have been accepted for POPL’17: “Coming to Terms with Quantified Reasoning” by Simon Robillard, Andrei Voronkov, and Laura Kovacs; and “A Short Counterexample Property for Safety and Liveness Verification of Fault-tolerant Distributed Algorithms” by Igor Konnov, Marijana Lazic, Helmut Veith, and Josef Widder

Continue reading

Full news archive