Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJanuary 2025
Nominal Matching Logic with Fixpoints
CPP '25: Proceedings of the 14th ACM SIGPLAN International Conference on Certified Programs and ProofsPages 17–33https://doi.org/10.1145/3703595.3705872Matching 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 specification and ...
Generating Proof Certificates for a Language-Agnostic Deductive Program Verifier
Proceedings of the ACM on Programming Languages (PACMPL), Volume 7, Issue OOPSLA1Article No.: 77, Pages 56–84https://doi.org/10.1145/3586029Previous work on rewriting and reachability logic establishes a vision for a language-agnostic program verifier, which takes three inputs: a program, its formal specification, and the formal semantics of the programming language in which the program is ...
- research-articleSeptember 2022
Nominal Matching Logic
PPDP '22: Proceedings of the 24th International Symposium on Principles and Practice of Declarative ProgrammingArticle No.: 5, Pages 1–15https://doi.org/10.1145/3551357.3551375We introduce Nominal Matching Logic (NML) as an extension of Matching Logic with names and binding following the Gabbay-Pitts nominal approach. Matching logic is the foundation of the framework, used to specify programming languages and automatically ...
- ArticleOctober 2019
Unification in Matching Logic
AbstractMatching Logic is a framework for specifying programming language semantics and reasoning about programs. Its formulas are called patterns and are built with variables, symbols, connectives and quantifiers. A pattern is a combination of structural ...