Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first ord...
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
Recently Bowers et al. [1] analyzed triplet logic relationships among 4873 Clusters of Orthologous Groups (COGS) from 67 fully sequenced organisms by calculating how well logic re...
We provide a logical model of biochemical reactions and show how hypothesis generation using weakest sufficient and strongest necessary conditions may be used to provide addition...
Patrick Doherty, Steve Kertes, Martin Magnusson, A...
We present a (the rst?) sound and relatively complete Hoare logic for a simple imperative programming language including mutually recursive procedures with call-by-value parameters...