Sciweavers

827 search results - page 74 / 166
» Proof-Theoretic Soundness and Completeness
Sort
View
WOLLIC
2007
Springer
14 years 4 months ago
A Formal Calculus for Informal Equality with Binding
Abstract. In informal mathematical usage we often reason using languages with binding. We usually find ourselves placing capture-avoidance constraints on where variables can and c...
Murdoch Gabbay, Aad Mathijssen
DEXAW
2006
IEEE
111views Database» more  DEXAW 2006»
14 years 4 months ago
A Strongly Minimal Axiomatisation of Multivalued Dependencies in Incomplete Database Relations
We study inference rules for multivalued dependencies in relational databases with null values (NMVDs). The definition of NMVDs is dependent on the underlying relation schema and ...
Sebastian Link
CSFW
2005
IEEE
14 years 3 months ago
Reconstruction of Attacks against Cryptographic Protocols
We study an automatic technique for the verification of cryptographic protocols based on a Horn clause model of the protocol. This technique yields proofs valid for an unbounded ...
Xavier Allamigeon, Bruno Blanchet
ADBIS
2005
Springer
112views Database» more  ADBIS 2005»
14 years 3 months ago
Non-destructive Integration of Form-Based Views
Form documents or screen forms bring essential information on the data manipulated by an organization. They can be considered as different but often overlapping views of its whole...
Jan Hidders, Jan Paredaens, Philippe Thiran, Geert...
ASM
2005
ASM
14 years 3 months ago
AsmL Semantics in Fixpoint
AsmL is a novel executable specification language based on the theory of State Machines (ASMs). It represents one of the most powerful practical engines to write and execute ASMs...
Ali Habibi, Sofiène Tahar