This article develops a proof theory for low-level code languages. We first define a proof system, which we refer to as the sequential sequent calculu...

Interpreters designed for efficiency execute a huge number of indirect branches and can spend more than half of the execution time in indirect branch...

Interprocedural data flow analysis extends the scope of analysis across procedure boundaries in search of increased optimization opportunities. Call s...

One proposal for automatic construction of proofs about programs is to combine Hoare logic and abstract interpretation. Constructing proofs is in Hoar...

Despite significant progress in the theory and practice of program analysis, analyzing properties of heap data has not reached the same level of matur...