Mircea Octavian Sebe
YOU?
Author Swipe
View article: Nominal Matching Logic with Fixpoints
Nominal Matching Logic with Fixpoints Open
Matching logic is the foundation of the K semantic environment for the specification of programming languages and automated generation of evaluators and verification tools. NLML is a formalization of nominal logic, which facilitates specif…
View article: NLML formalization
NLML formalization Open
View article: A Logical Treatment of Finite Automata
A Logical Treatment of Finite Automata Open
We present a sound and complete axiomatization of finite words using matching logic. A unique feature of our axiomatization is that it gives a shallow embedding of regular expressions into matching logic, and a logical representation of fi…