Localized operational termination in general logics

DOI10.1007/978-3-319-15545-6_9MaRDI QIDQ5256340zbMATH OpenOpenAlexFDO

Authors Salvador Lucas, José Meseguer

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

zbMATH Keywords

general logicsoperational terminationprogram termination

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Recommendations

• Use of logical models for proving operational termination in general logics
• Termination proofs for logic programs
• Local termination: theory and practice
• Using well-founded relations for proving operational termination
• scientific article; zbMATH DE number 3924108

Cites work

• A formal approach to object-oriented software engineering
• A general framework for automatic termination analysis od logic programs
• A semantic basis for the termination analysis of logic programs
• Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
• scientific article; zbMATH DE number 439891 (Why is no real title available?)
• scientific article; zbMATH DE number 1142323 (Why is no real title available?)
• scientific article; zbMATH DE number 753777 (Why is no real title available?)
• Local termination: theory and practice
• Mechanizing and improving dependency pairs
• MTT: The Maude Termination Tool (System Description)
• On the algebraic definition of programming languages
• Operational termination of conditional term rewriting systems
• Proving operational termination of membership equational programs
• Proving termination properties with \textsc{mu-term}
• Strong and weak operational termination of order-sorted rewrite theories
• Structured algebraic specifications: A kernel language
• Termination Analysis of Logic Programs Based on Dependency Graphs
• Termination of logic programs: the never-ending story
• The dependency triple framework for termination of logic programs
• The rewriting logic semantics project: a progress report
• What Is a Multi-modeling Language?

Cited in

(6)

• Using well-founded relations for proving operational termination
• Use of logical models for proving operational termination in general logics
• José Meseguer: scientist and friend extraordinaire
• Modularity of ontologies in an arbitrary institution
• A local termination property for term rewriting systems
• Normal forms and normal theories in conditional rewriting

Describes a project that uses

Uses Software

• Maude
• Haskell
• MTT

This page was built for publication: Localized operational termination in general logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5256340)