This tutorial provides a programmer's introduction to the Satisfiability Modulo Theories
Solver Z3. It describes how to use Z3 through scripts, provided in the Python scripting …

Python is an interpreted programming language that has been widely used in many fields.
The successful execution of a Python program depends on both the correctness of Python …

We propose a new static software analysis principle called Abstract Execution, generalizing
Symbolic Execution: While the latter analyzes all possible execution paths of a specific …

Computer systems use many scheduling heuristics to allocate resources. Understanding
their performance properties is hard because it requires a representative workload and …

Smart contracts are programs deployed on a blockchain. They are executed for a monetary
fee paid in gas—a clear optimization target for smart contract compilers. Because smart …

Modern compilers, such as LLVM, are complex pieces of software. Due to their complexity,
manual testing is unlikely to suffice, yet formal verification is difficult to scale. End-to-end …

Abstract programs contain schematic placeholders representing potentially infinitely many
concrete programs. They naturally occur in multiple areas of computer science concerned …

Just-in-time (JIT) compilers make JavaScript run efficiently by replacing slow JavaScript
interpreter code with fast machine code. However, this efficiency comes at a cost: bugs in JIT …

Abstract is a workbench for modeling statement-level transformation rules on programs with
the aim to formally verify their correctness. It is based on Abstract Execution, a verification …

We propose an abstract completion procedure for logically constrained term rewrite systems
(LCTRSs). This procedure can be instantiated to both standard Knuth-Bendix completion …