804 search results - page 16 / 161 » On the Termination of the Chase Algorithm |
ACSC
2004
IEEE
15 years 1 months ago
2004
IEEE
This paper introduces a repeatable and constructive approach to the analysis of loop progress and termination conditions in imperative programs. It is applicable to all loops for ...
117
Voted
WFLP
2009
Springer
15 years 4 months ago
2009
Springer
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
124
Voted
TACAS
2012
Springer
13 years 5 months ago
2012
Springer
Abstract. Automated verification of multi-threaded programs is difficult. Direct treatment of all possible thread interleavings by reasoning about the program globally is a prohib...
MP
2006
14 years 10 months ago
2006
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
82
Voted
INFORMATICALT
2002
14 years 9 months ago
2002
The goal of the paper is to create a model for investigating the character of relationships between the freedom and restrictions in the terrorism context, in order to find out how ...