Methods for proving termination of rewriting-based programming languages by transformation
DOI10.1016/J.ENTCS.2009.07.062zbMATH Open1337.68067OpenAlexW2011361820MaRDI QIDQ2808239FDOQ2808239
Salvador Lucas, José Meseguer, Francisco Durán
Publication date: 20 May 2016
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.07.062
Recommendations
Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42) Logic in computer science (03B70)
Cites Work
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- TPA: Termination Proved Automatically
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- Title not available (Why is that?)
- Title not available (Why is that?)
- CafeOBJ Report. The language, proof techniques, and methodologies for object-oriented algebraicspecification
- Title not available (Why is that?)
- Title not available (Why is that?)
- Operational termination of conditional term rewriting systems
- Proving operational termination of membership equational programs
- Semantic foundations for generalized rewrite theories
- MTT: The Maude Termination Tool (System Description)
- Title not available (Why is that?)
- Operational Termination of Membership Equational Programs: the Order-Sorted Way
- Tyrolean termination tool: techniques and features
- Specification and proof in membership equational logic
- Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
- Automated Termination Analysis for Logic Programs by Term Rewriting
- Context-sensitive rewriting strategies
- Title not available (Why is that?)
- ELAN from a rewriting logic point of view
- Title not available (Why is that?)
- Order-sorted termination: The unsorted way
Cited In (9)
- Twenty years of rewriting logic
- Strict coherence of conditional rewriting modulo axioms
- A Transformational Approach to Prove Outermost Termination Automatically
- Using well-founded relations for proving operational termination
- Proving termination of context-sensitive rewriting by transformation
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
- MTT: The Maude Termination Tool (System Description)
- Applications and extensions of context-sensitive rewriting
- Transformational methodology for proving termination of logic programs
Uses Software
This page was built for publication: Methods for proving termination of rewriting-based programming languages by transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808239)
