Combining runtime checking and slicing to improve Maude error diagnosis
From MaRDI portal
Publication:2945700
DOI10.1007/978-3-319-23165-5_3zbMATH Open1321.68325DBLPconf/birthday/AlpuenteBFS15OpenAlexW2294492308WikidataQ57978115 ScholiaQ57978115MaRDI QIDQ2945700FDOQ2945700
Authors: María Alpuente, D. Ballis, Francisco Frechina, Julia Sapiña
Publication date: 14 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10251/61075
Recommendations
Cites Work
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Unification theory
- Title not available (Why is that?)
- Dynamic program slicing
- Conditional rewriting logic as a unified model of concurrency
- Semantic foundations for generalized rewrite theories
- Rewriting modulo SMT and open system analysis
- Title not available (Why is that?)
- Backward trace slicing for conditional rewrite theories
- Exploring conditional rewriting logic computations
- A Maude coherence checker tool for conditional order-sorted rewrite theories
- Inspecting rewriting logic computations (in a parametric and stepwise way)
- Equality, types, modules, and (why not?) generics for logic programming
- Title not available (Why is that?)
- Rewriting logic bibliography by topic: 1990--2011
- A modular order-sorted equational generalization algorithm
- From rewriting logic, to programming language semantics, to program verification
- Backward trace slicing for rewriting logic theories
- Debugging Maude programs via runtime assertion checking and trace slicing
- Invariant-driven specifications in Maude
Cited In (1)
Uses Software
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)