Sciweavers

58 search results - page 11 / 12
» Soft Constraint Propagation and Solving in Constraint Handli...
Sort
View
CORR
2011
Springer
187views Education» more  CORR 2011»
14 years 4 months ago
The Language Features and Architecture of B-Prolog
B-Prolog is a high-performance implementation of the standard Prolog language with several extensions including matching clauses, action rules for event handling, finite-domain c...
Neng-Fa Zhou
CSCLP
2006
Springer
15 years 1 months ago
Complexity of a CHR Solver for Existentially Quantified Conjunctions of Equations over Trees
Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language. One of the first CHR programs is the classic constraint solver for syntactic equal...
Marc Meister, Khalil Djelloul, Thom W. Frühwi...
TIME
1994
IEEE
15 years 1 months ago
Using Constrained Resolution for Abductive Temporal Reasoning
We describe in this article an abductive procedure based on a constrained resolution principle. The choice of constrained resolution is motivated by the whish to gain full advanta...
Nicolas Chleq
CAV
2004
Springer
151views Hardware» more  CAV 2004»
15 years 1 months ago
QB or Not QB: An Efficient Execution Verification Tool for Memory Orderings
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
Ganesh Gopalakrishnan, Yue Yang, Hemanthkumar Siva...
TACAS
2012
Springer
316views Algorithms» more  TACAS 2012»
13 years 5 months ago
Compositional Termination Proofs for Multi-threaded Programs
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...
Corneliu Popeea, Andrey Rybalchenko