804 search results - page 101 / 161 » On the Termination of the Chase Algorithm |
146
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
167
click to vote
ECEASST
2008
15 years 6 months ago
2008
Abstract: Templates are a language feature of C++ and can be used for metaprogramming. The metaprogram is executed by the compiler and outputs source code which is then compiled. T...
141
click to vote
ENTCS
2008
15 years 6 months ago
2008
Traditional programming languages are algorithmic: they are best suited to writing programs that acquire all their inputs before executing and only produce a result on termination...
156
click to vote
ENTCS
2008
15 years 6 months ago
2008
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
215
click to vote
ENTCS
2006
15 years 6 months ago
2006
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...