20 citations · 75 across the 15 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.PL2017
Variant-Based Decidable Satisfiability in Initial Algebras with Predicates
Raúl Gutiérrez, José Meseguer
Decision procedures can be either theory-specific, e.g., Presburger arithmetic, or theory-generic, applying to an infinite number of user-definable theories. Variant satisfiability…
cs.PL2017
A Constructor-Based Reachability Logic for Rewrite Theories
Stephen Skeirik, Andrei Stefanescu, José Meseguer
Reachability logic has been applied to rewrite-rule-based language definitions as a language-generic logic of programs. To be able to verify not just code but also dis…