Automatic program verification and symbolic model checking tools interface with theorem
proving technologies that check satisfiability of formulas. A theme pursued in the past years …

Differential game logic (dG L) is a logic for specifying and verifying properties of hybrid
games, ie, games that combine discrete, continuous, and adversarial dynamics. Unlike …

In this paper, we study the problem of generating inputs to a higher-order program causing it
to error. We first approach the problem in the setting of PCF, a typed, core functional …

Kleene algebra (KA) is an algebraic system that captures completely the laws of
equivalence for regular expressions. It is also useful for reasoning about a multitude of …

We study a propositional variant of Hoare logic that can be used for reasoning about
programs that exhibit both angelic and demonic nondeterminism. We work in an …

Formal verification of concurrent programs still poses a major challenge in computer
science. Our approach is an adaptation of the modular rely/guarantee methodology in …

This paper provides the first program logic for homogeneous generative run-time meta-
programming---using a variant of MiniML by Davies and Pfenning as its underlying meta …

Recent advances in the areas of automated reasoning and first-order theorem proving
paved the way to the developing of effective tools for the rigorous formal analysis of …

The use of an intermediate single-assignment form is central in the design of major modern
program verification tools, from deductive verifiers like Boogie and Why3 to automated tools …

Program proofs can be done informally [47] as most mathematical reasonings or as an
application of a formal method. The formal method is a “recipe” to make the prove. In …