Assertion-based analysis via slicing withABETS(system description)

DOI10.1017/S1471068416000375zbMath1379.68088arXiv1608.01433OpenAlexW2963227324WikidataQ57978108 ScholiaQ57978108MaRDI QIDQ4593040

Julia Sapiña, Demis Ballis, Francisco Frechina, María Alpuente

Publication date: 9 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.01433

zbMATH Keywords

rewriting logicMaudeprogram diagnosis and debuggingdynamic program and trace slicingruntime assertion checking

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42) Logic programming (68N17)

Related Items (4)

Symbolic Analysis of Maude Theories with Narval ⋮ Optimizing Maude programs via program specialization ⋮ Efficient safety enforcement for Maude programs via program specialization in the \textsf{ÁTAME} system ⋮ ABETS

Uses Software

• Maude

Cites Work

• Exploring conditional rewriting logic computations
• Logic, rewriting, and concurrency. Essays dedicated to José Meseguer on the occasion of his 65th birthday
• Debugging Maude programs via runtime assertion checking and trace slicing
• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• Conditional rewriting logic as a unified model of concurrency
• Specification, algebra, and software. Essays dedicated to Kokichi Futatsugi
• A modular order-sorted equational generalization algorithm
• Built-in Variant Generation and Unification, and Their Applications in Maude 2.7

This page was built for publication: Assertion-based analysis via slicing withABETS(system description)