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...
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 ...
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 ...
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...
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...