827 search results - page 41 / 166 » Proof-Theoretic Soundness and Completeness |
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
We present MiniCount, the first efficient sound and complete algorithm for finding maximally contained rewritings of conjunctive queries with count, using conjunctive views with c...
ECOOP
2009
Springer
14 years 8 months ago
2009
Springer
Software frameworks impose constraints on how plugins may interact with them. Many of hese constraints involve multiple objects, are temporal, and depend on runtime values. Additi...
VMCAI
2009
Springer
14 years 2 months ago
2009
Springer
Abstract There is an intimate link between program structure and behaviour. Exploiting this link to phrase program correctness problems in terms of the structural properties of a p...
TIME
2009
IEEE
14 years 2 months ago
2009
IEEE
Morris, Muscettola and Vidal (MMV) presented an algorithm for checking the dynamic controllability (DC) of temporal networks in which certain temporal durations are beyond the con...
SEFM
2006
IEEE
14 years 1 months ago
2006
IEEE
tic analysis tools based on abstraction are sound but not complete. Several practical static analysis tools are heuristic in nature —they are neither sound nor complete, but have...