607 search results - page 2 / 122 » A Framework for Dynamic Constraint Reasoning using Procedura... |
CADE
2010
Springer
13 years 6 months ago
2010
Springer
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. To achieve this, pro...
FLOPS
1999
Springer
13 years 9 months ago
1999
Springer
We present a simple generic framework to solve constraints on any domain (finite or infinite) which has a lattice structure. The approach is based on the use of a single constrai...
ECAI
2004
Springer
13 years 10 months ago
2004
Springer
We present a framework for annotating dynamic scenes involving occlusion and other uncertainties. Our system comprises an object tracker, an object classifier and an algorithm for...
KBSE
2010
IEEE
13 years 3 months ago
2010
IEEE
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
IJCAI
1997
13 years 6 months ago
1997
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...