804 search results - page 101 / 161 » On the Termination of the Chase Algorithm |
CORR
2010
Springer
15 years 22 days 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...
114
Voted
ECEASST
2008
15 years 21 days 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...
ENTCS
2008
15 years 21 days 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...
100
Voted
ENTCS
2008
15 years 21 days 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...
130
Voted
ENTCS
2006
15 years 20 days 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 ...