1716 search results - page 31 / 344 » Proving Conditional Termination |
ENTCS
2007
13 years 8 months ago
2007
Reasoning about graph and model transformation systems is an important means to underpin model-driven software engineering, such as Model-Driven Architecture (MDA) and Model Integ...
LOPSTR
2007
Springer
14 years 2 months ago
2007
Springer
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
CN
2010
13 years 8 months ago
2010
Overload in a packet-based network can be prevented by admitting or blocking new flows depending on its load conditions. However, overload can occur in spite of admission control ...
ICLP
1997
Springer
14 years 24 days ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
SAC
2010
ACM
14 years 3 months ago
2010
ACM
Program bugs remain a major challenge for software developers and various tools have been proposed to help with their localization and elimination. Most present-day tools are base...