Unification in matching logic

DOI10.1007/978-3-030-30942-8_30zbMATH Open1539.68057MaRDI QIDQ6535966

Andrei Arusoaie, Dorel Lucanu

Publication date: 14 March 2024

zbMATH Keywords

certificationmatching logicsemantic unificationsyntactic term unification

Mathematics Subject Classification ID

Theory of programming languages (68N15) Logic in computer science (03B70) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Title not available (Why is that?)
• Symbolic execution based on language transformation
• Program verification by coinduction
• K-Java: a complete semantics of Java
• Proving Reachability-Logic Formulas Incrementally
• Verifying Reachability-Logic Properties on Rewriting-Logic Specifications
• An Efficient Unification Algorithm
• Matching Logic
• From Hoare Logic to Matching Logic Reachability
• All-Path Reachability Logic
• One-Path Reachability Logic
• Coming to terms with quantified reasoning
• Unification theory

This page was built for publication: Unification in matching logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535966)