Cryptographic algorithms play a key role in computer security and the formal analysis of their
robustness is of utmost importance. Yet, logic and automated reasoning tools are seldom …

We compare two prominent decision procedures for propositional logic: Ordered Binary
Decision Diagrams (Obdd s) and the Davis-Putnam procedure. Experimental results indicate …

Tableau and sequent calculi are the basis for most popular interactive theorem provers for
formal verification. Yet, when it comes to automatic proof search, tableaux are often slower …

Many key verification problems such as boundedmodel-checking, circuit verification and
logical cryptanalysis are formalized with combined clausal and affine logic (ie clauses with …

This paper presents in some detail the systematic derivation of a static bit-level parallel
algorithm to implement multiplication of integers, that is to say one which might be …

Logical cryptanalysis has been introduced by Massacci and Marraro as a general framework
for encoding properties of crypto-algorithms into SAT problems, with the aim of generating …

The relative advantages offered by the use of dependent types (rather than polymorphic
ones) in a higher-order logic used for reasoning about digital systems are explored …

This paper describes how to model and solve boolean satisfiability problems with the
constraint logic programming language CHIP. Although CHIP has not been developed as a …

A language of relations and combining forms is presented in which to describe both the
behaviour of circuits and the speci cations which they must meet. We illustrate a design …

This report explores the influences of hardware on verifiable secure system design and
envisions a mutually beneficial collaboration between the hardware verification and security …