Bounded model checking (BMC) of C and C++ programs is challenging due to the complex
and intricate syntax and semantics of these programming languages. The BMC tool LLBMC …

This paper proposes rewriting modulo SMT, a new technique that combines the power of
SMT solving, rewriting modulo theories, and model checking. Rewriting modulo SMT is …

Context: Memory error vulnerabilities have been consequential and several well-known,
open-source memory error vulnerability detectors exist, built on static and/or dynamic code …

Formal verification of cyber-physical systems (CPS) is challenging because it has to
consider real-time and concurrency aspects that are often absent in ordinary software …

A new notion of generalized rewrite theory suitable for symbolic reasoning and generalizing
the standard notion in [19] is motivated and defined. Also, new requirements for symbolic …

Synthetic biology focuses on the re-engineering of living organisms for useful purposes
while DNA computing targets the construction of therapeutics and computational circuits …

This paper proposes rewriting modulo SMT, a new technique that combines the power of
SMT solving, rewriting modulo theories, and model checking. Rewriting modulo SMT is …

For an unconditional equational theory (Σ, E) whose oriented equations E→ are confluent
and terminating, narrowing provides an E-unification algorithm. This has been generalized …

Large organizations like banks suffer from the ever growing complexity of their systems.
Evolving the software becomes harder and harder since a single change can affect a much …

Our aim is to enable software to take full advantage of the capabilities of emerging
microprocessor designs without modifying the compiler. Towards this end, we propose a …