Sciweavers

1716 search results - page 57 / 344
» Proving Conditional Termination
Sort
View
ENTCS
2006
116views more  ENTCS 2006»
13 years 8 months ago
Semantics of Visual Models in a Rule-based Setting
In this paper, some fundamental aspects of the semantics of rule-based systems are sketched and related to the semantics of visual models. A rule-based system comprises a set of r...
Hans-Jörg Kreowski, Karsten Hölscher, Pe...
CVPR
1996
IEEE
14 years 27 days ago
What is the set of images of an object under all possible lighting conditions?
The appearance of a particular object depends on both the viewpoint from which it is observed and the light sources by which it is illuminated. If the appearance of two objects is...
Peter N. Belhumeur, David J. Kriegman
CADE
2007
Springer
14 years 9 months ago
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
Yeting Ge, Clark Barrett, Cesare Tinelli
CADE
2007
Springer
14 years 9 months ago
Predictive Labeling with Dependency Pairs Using SAT
This paper combines predictive labeling with dependency pairs and reports on its implementation. Our starting point is the method of proving termination of rewrite systems using se...
Adam Koprowski, Aart Middeldorp
SOFSEM
2010
Springer
14 years 5 months ago
Mixing Coverability and Reachability to Analyze VASS with One Zero-Test
We study Vector Addition Systems with States (VASS) extended in such a way that one of the manipulated integer variables can be tested to zero. For this class of system, it has bee...
Alain Finkel, Arnaud Sangnier