Combining runtime checking and slicing to improve Maude error diagnosis
From MaRDI portal
Publication:2945700
Recommendations
Cites work
- scientific article; zbMATH DE number 2043522 (Why is no real title available?)
- scientific article; zbMATH DE number 194907 (Why is no real title available?)
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- A Maude coherence checker tool for conditional order-sorted rewrite theories
- A modular order-sorted equational generalization algorithm
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Backward trace slicing for conditional rewrite theories
- Backward trace slicing for rewriting logic theories
- Conditional rewriting logic as a unified model of concurrency
- Debugging Maude programs via runtime assertion checking and trace slicing
- Dynamic program slicing
- Equality, types, modules, and (why not?) generics for logic programming
- Exploring conditional rewriting logic computations
- From rewriting logic, to programming language semantics, to program verification
- Inspecting rewriting logic computations (in a parametric and stepwise way)
- Invariant-driven specifications in Maude
- Rewriting logic bibliography by topic: 1990--2011
- Rewriting modulo SMT and open system analysis
- Semantic foundations for generalized rewrite theories
- Unification theory
This page was built for publication: Combining runtime checking and slicing to improve Maude error diagnosis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945700)