6554 search results - page 69 / 1311 » Constraint Logic Programming |
158
click to vote
CADE
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
238
click to vote
CORR
2004
Springer
15 years 5 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
194
click to vote
PLANX
2007
15 years 7 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
162
click to vote
EMSOFT
2008
Springer
15 years 7 months ago
2008
Springer
We focus on decomposition of hard-masking real-time faulttolerant programs (where safety, timing constraints, and liveness are preserved in the presence of faults) that are design...
139
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
Naive parallel implementation of nondeterministic systems (such as a theorem proving system) and languages (such as a logic, constraint, or a concurrent constraint language)can re...