A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog

DOI10.1007/978-3-642-32211-2_16zbMath1377.68068OpenAlexW2113956592MaRDI QIDQ4909327

Thomas Ströder, Jürgen Giesl, Carsten Fuhs, Peter Schneider-Kamp, Fabian Emmes

Publication date: 13 March 2013

Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32211-2_16

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (5)

Concolic testing in logic programming ⋮ Reversible debugging in logic programming ⋮ Concolic Testing in CLP ⋮ An SMT-based concolic testing tool for logic programs ⋮ Selective Unification in (Constraint) Logic Programming*

This page was built for publication: A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog