Вы здесь

Главная

завершение

Связанные издания:

A Complete Method for the Synthesis of Linear Ranking Functions
A complition procedure for globally finite term rewriting systems
A Construction of Distributed Reference Counting
A Domain for Concurrent Termination A Generalization of Mazurkiewicz Traces
A Framework of Directionality for Proving Termination of Logic Programs
A General Theorem on Termination of Rewriting
Algebraic Properties of Loop Invariants
An Abstract Analysis of the Probabilistic Termination of Programs
An Algebraic Semantics of Prolog Program Termination
An Improved General Path Order
Applying Rewriting Techniques to the Verification of Erlang Processes
A Solution to Zantema s Problem
A Termination Ordering for Higher Order Rewrite Systems
A Termination Test for Logic Programs
Automatic Inference of Norms: a Missing Link in Automatic Termination Analysis
Automatic Termination Analysis of Logic Programs
Automatic Termination Proofs with Transformation Orderings
Better Consumers for Deforestation (Extended Abstract)
Characterisations of Termination in Logic Programming
CLP(Q) for Proving Interargument Relations
Demand-driven and Constraint-based Automatic Left-termination Analysis for Logic Programs
Deriving Termination Proofs for Logic Programs, using Abstract Procedures
Detecting Distributed Termination in the Presence of Node Failure
Detecting Locally Stable Predicates Without Modifying Application Messages
Detecting Optimal Termination Conditions of Logic Programs
Distributed Termination of Parallel Applications in the Occam 2 Language
Generating Polynomial Orderings for Termination Proofs
Improving Homeomorphic Enbedding for Online Termination
Inferring and Compiling Termination for Constraint Logic Programs
Inferring Left-Terminating Classes of Queries for Constraint Logic Programs
Inheritance on Processes, Exemplified on Distributed Termination Detection
Interactive Theorem Proving: Proc./First International Conference, ITP 2010, Edinburgh, UK, July 2010
Loop Termination Prediction
Methodology for proving the termination of logic programs
Modularity of Simple Termination of term Rewritin Systems with Shared Constructors
Non-termination Inference for Constraint Logic Prog
Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings
On Lexicographic Termination Ordering with Space Bound Certifications
On Modularity of Termination and Confluence Properties of Conditional Rewrite Systems
On Termination of Constraint Logic Programs
On Termination of Logic Programs with Floating Point Computations
On the Inference of Natural Level Mappings
On the termination of the Knuth-Bendix completion algorithm
Pointwise Circunscription Is Equivalent to Predicate Completion (Sometimes)
Polynomials for Proving Termination of Context-Sensitive Rewriting
Preserving Termination of Tabled Logic Programs While Unfolding
Preserving Universal Termination through Unfold/Fold
Program Generation, Termination, and Binding-Time Analysis
Program Termination Analysis in Polynominal Time
Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming