Rewriting logic is a simple computational logic that can naturally express both concurrent
computation and logical deduction with great generality. This paper provides a gentle …

Automatically generated tools can significantly improve programmer productivity. For
example, parsers and dataflow analyzers can be automatically generated from declarative …

This paper describes an executable formal semantics of C. Being executable, the semantics
has been thoroughly tested against the GCC torture test suite and successfully passes …

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 …

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 …

This paper presents a verification framework that is parametric in a (trusted) operational
semantics of some programming language. The underlying proof system is language …

Rewriting logic is an executable logical framework well suited for the semantic definition of
languages. Any such framework has to be judged by its effectiveness to bridge the existing …

This paper gives an overview of the tool-supported K framework for semantics-based
programming language design and formal analysis. K provides a convenient notation for …

Matching logic reachability has been recently proposed as an alternative program
verification approach. Unlike Hoare logic, where one defines a language-specific proof …

This dissertation shows that complex, real programming languages can be completely
formalized in the [special characters omitted] Framework, yielding interpreters and analysis …