Sciweavers

200 search results - page 9 / 40
» Tyrolean Termination Tool
Sort
View
ICLP
2005
Springer
14 years 1 months ago
Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
Manh Thang Nguyen, Danny De Schreye
RTA
2007
Springer
14 years 1 months ago
The Termination Competition
The third Termination Competition took place in June 2006. We present the background, results and conclusions of this competition. 1 Motivation and history In the past decades seve...
Claude Marché, Hans Zantema
ENTCS
2008
85views more  ENTCS 2008»
13 years 7 months ago
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
Salvador Lucas, Rafael Navarro-Marset
CORR
2010
Springer
121views Education» more  CORR 2010»
13 years 5 months ago
MiniAgda: Integrating Sized and Dependent Types
Sized types are a modular and theoretically well-understood tool for checking termination of recursive and productivity of corecursive definitions. The essential idea is to track ...
Andreas Abel
IJCAT
2008
72views more  IJCAT 2008»
13 years 7 months ago
Capacity analysis of container terminals using simulation techniques
Modeling and simulation are essential tools for the design and analysis of container terminals. A computer model can emulate the activities at various levels of details and captur...
Shell-Ying Huang, Wen-Jing Hsu, Chuanyu Chen, Rong...