4340 search results - page 634 / 868 » Formal Methods and Cryptography |
147
click to vote
JAPLL
2006
15 years 6 months ago
2006
Deduction chains represent a syntactic and in a certain sense constructive method for proving completeness of a formal system. Given a formula , the deduction chains of are built...
160
click to vote
ENTCS
2007
15 years 6 months ago
2007
We propose a process calculus to study the behavioural theory of Mobile Ad Hoc Networks. The operational semantics of our calculus is given both in terms of a Reduction Semantics ...
162
click to vote
ENTCS
2007
15 years 6 months ago
2007
The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support pr...
156
click to vote
JSAT
2006
15 years 6 months ago
2006
An analysis of the SAT 2005 sub-competition on random instances is given. This year this (sub-)competition set-up was geared to establish a basic setting, focusing on the instance...
201
click to vote
FUIN
2007
15 years 6 months ago
2007
We present a resolution calculus for first-order logic using a more concise formalism for representing sets of clauses. The idea is to represent the clause set at hand as a Direct...