827 search results - page 12 / 166 » Proof-Theoretic Soundness and Completeness |
151
click to vote
CAV
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. We propose a novel, sound, and complete Simplex-based algorithm for solving linear inequalities over integers. Our algorithm, which can be viewed as a semantic generaliza...
126
click to vote
LICS
2007
IEEE
16 years 9 days ago
2007
IEEE
Typing of lambda-terms in Elementary and Light Affine Logic (EAL , LAL resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL ...
154
click to vote
CSL
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Security properties are profitably expressed using notions of contextual equivalence, and logical relations are a powerful proof technique to establish contextual equiva...
115
click to vote
FOSSACS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In order to study relative PCF-definability of boolean functions, we associate a hypergraph Hf to any boolean function f (following [3, 5]). We introduce the notion of t...
157
click to vote
DIAGRAMS
2000
Springer
15 years 10 months ago
2000
Springer
Spider diagram systems provide a visual language that extends the popular and intuitive Venn diagrams and Euler circles. Designed to complement object-oriented modelling notations ...