Symbolic reasoning methods in rewriting logic and Maude

DOI10.1007/978-3-662-57669-4_2OpenAlexW2810927195MaRDI QIDQ1799269

Yanyan Li

Publication date: 18 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-662-57669-4_2

zbMATH Keywords

symbolic computationrewriting logicMaude

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Related Items (6)

Symbolic Analysis of Maude Theories with Narval ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Programming and symbolic computation in Maude ⋮ A Generic Framework for Higher-Order Generalizations. ⋮ Equational unification and matching, and symbolic reachability analysis in Maude 3.2 (system description)

This page was built for publication: Symbolic reasoning methods in rewriting logic and Maude