Equational Abstractions for Reducing the State Space of Rewrite Theories

DOI10.1016/j.entcs.2009.05.017zbMath1347.68195OpenAlexW2077398822MaRDI QIDQ5179134

Lars Helge Haß, Thomas Noll

Publication date: 19 March 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.05.017

zbMATH Keywords

state-space reductionweak bisimilarityequational abstraction

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) 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 (1)

Automatic verification of reduction techniques in higher order logic

Uses Software

• Erlang
• McErlang

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conditional rewriting logic as a unified model of concurrency
• Rewriting logic: Roadmap and bibliography
• Abstraction and Model Checking of Core Erlang Programs in Maude
• State Space Reduction of Rewrite Theories Using Invisible Transitions
• Automated Deduction – CADE-19

This page was built for publication: Equational Abstractions for Reducing the State Space of Rewrite Theories