Skip to search formSkip to main contentSkip to account menu

FAST: acceleration from theory to practice

From the underlying theory to the architecture choices, the tool Fast, a tool for the analysis of systems manipulating unbounded integer variables, is described, including a range of case studies from the literature.
View on Springer (opens in a new tab)

FAST: Fast Acceleration of Symbolikc Transition Systems

The underlying theory, the architecture choices that have been made in the tool design and the capabilities are compared with those of other tools are described.
View via Publisher (opens in a new tab)

FAST Extended Release

This work provides four implementations of the interface using Lash, Mona, Omega and a new shared automata package with computation cache, thus any Presburger arithmetics package can be plugged to the tool.
View via Publisher (opens in a new tab)

Refinement-Based CFG Reconstruction from Unstructured Programs

This paper addresses the issue of recovering a both safe and precise approximation of the Control Flow Graph of an unstructured program, typically an executable file, with a refinement-based static analysis working over finite sets of constant values.
View via Publisher (opens in a new tab)

Backward-Bounded DSE: Targeting Infeasibility Questions on Obfuscated Codes

Backward-Bounded DSE is presented, a generic, precise, efficient and robust method for solving infeasibility questions, andparse disassembly is proposed, a combination of Backward- bordered DSE and static disassembly able to enlarge dynamic disassembly in a guaranteed way, hence getting the best of dynamic andstatic disassembly.
View on IEEE (opens in a new tab)

FASTer Acceleration of Counter Automata in Practice

For functions defined by translations over a polyhedral domain, a new acceleration algorithm is given which is polynomial in the size of the function and exponential in its dimension, while the more generic algorithm is exponential in both the size and its dimension.
View via Publisher (opens in a new tab)

How to kill symbolic deobfuscation for free (or: unleashing the potential of path-oriented protections)

This work presents and studies a new class of anti-DSE protections coined as path-oriented protections targeting the weakest spot of DSE, namely path exploration, and demonstrates that these approaches critically counter symbolic deobfuscation while yielding only a very slight overhead.
View on ACM (opens in a new tab)

An Automated Deductive Verification Framework for Circuit-building Quantum Programs

Qbricks is proposed, a formal verification environment for circuit-building quantum programs, featuring both parametric specifications and a high degree of proof automation, and the main tool is developed, PPS, a parametric extension of the recently developed path sum semantics.
View PDF on arXiv (opens in a new tab)

Structural Testing of Executables

It is shown how "path-based" structural test data generation can be adapted from structured language to machine code, using both state-of-the-art technologies and innovative techniques.
View on IEEE (opens in a new tab)

Flat Acceleration in Symbolic Model Checking

A new framework for symbolic model checking with accelerations is developed and new symbolic algorithms using accelerations to compute reachability sets are proposed.
View via Publisher (opens in a new tab)
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)