This paper presents K-Java, a complete executable formal semantics of Java 1.4. K-Java
was extensively tested with a test suite developed alongside the project, following the Test …

This paper presents KJS, the most complete and throughly tested formal semantics of
JavaScript to date. Being executable, KJS has been tested against the ECMAScript 5.1 …

We present a``negative''semantics of the C11 language---a semantics that does not just give
meaning to correct programs, but also rejects undefined programs. We investigate …

We present a method for automatically generating verification conditions for a class of
imperative programs and safety properties. Our method is parametric with respect to the …

The formal semantics of a programming language and its implementation are typically
separately defined, with the risk of divergence such that properties of the formal semantics …

Over the past three decades, a variety of meta-reasoning systems which support reasoning
about higher-order abstract specifications have been designed and developed. In this …

We propose a logic and a deductive system for stating and automatically proving the
equivalence of programs written in languages having a rewriting-based operational …

Rewriting Logic is a simply, flexible, and powerful framework for specifying and analysing
concurrent systems. Reachability Logic is a recently introduced formalism, which is currently …

Rewriting logic has proven to be an excellent formalism to define executable semantics of
programming languages, concurrent or not, and then to derive formal analysis tools for the …

This paper presents matching logic, a first-order logic (FOL) variant for specifying and
reasoning about structure by means of patterns and pattern matching. Its sentences, the …