Localized Operational Termination in General Logics
From MaRDI portal
Publication:5256340
DOI10.1007/978-3-319-15545-6_9zbMath1453.68053OpenAlexW73179560MaRDI QIDQ5256340
Publication date: 22 June 2015
Published in: Software, Services, and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-15545-6_9
Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (3)
José Meseguer: Scientist and Friend Extraordinaire ⋮ Modularity of Ontologies in an Arbitrary Institution ⋮ Normal forms and normal theories in conditional rewriting
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The rewriting logic semantics project: a progress report
- Mechanizing and improving dependency pairs
- Operational termination of conditional term rewriting systems
- Structured algebraic specifications: A kernel language
- A formal approach to object-oriented software engineering
- Proving operational termination of membership equational programs
- Local Termination: theory and practice
- Strong and Weak Operational Termination of Order-Sorted Rewrite Theories
- Proving Termination Properties with mu-term
- What Is a Multi-modeling Language?
- Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
- MTT: The Maude Termination Tool (System Description)
- The Dependency Triple Framework for Termination of Logic Programs
- On the algebraic definition of programming languages
- Termination of logic programs: the never-ending story
- A semantic basis for the termination analysis of logic programs
- Termination Analysis of Logic Programs Based on Dependency Graphs
- A general framework for automatic termination analysis od logic programs
This page was built for publication: Localized Operational Termination in General Logics
