Sciweavers

27 search results - page 1 / 6
» Streams and strings in formal proofs
Sort
View
TCS
2002
13 years 5 months ago
Streams and strings in formal proofs
Streams are acyclic directed subgraphs of the logical ow graph of a proof representing bundles of paths with the same origin and the same end. The notion of stream is used to desc...
Alessandra Carbone
CIE
2006
Springer
13 years 9 months ago
Coinductive Proofs for Basic Real Computation
We describe two representations for real numbers, signed digit streams and Cauchy sequences. We give coinductive proofs for the correctness of functions converting between these tw...
Tie Hou
CSFW
1996
IEEE
13 years 9 months ago
An Immunological Approach to Change Detection: Theoretical Results
: This paper examines some of the theoretical foundations of the distributable change detection method introduced by Forrest et al. in [10], including fundamental bounds on some of...
Patrik D'haeseleer
CORR
2008
Springer
90views Education» more  CORR 2008»
13 years 5 months ago
Effective Complexity and its Relation to Logical Depth
Abstract--Effective complexity measures the information content of the regularities of an object. It has been introduced by M. Gell-Mann and S. Lloyd to avoid some of the disadvant...
Nihat Ay, Markus Mueller, Arleta Szkola
GLOBECOM
2010
IEEE
13 years 3 months ago
Independent Parallel Compact Finite Automatons for Accelerating Multi-String Matching
Multi-string matching is a key technique for implementing network security applications like Network Intrusion Detection Systems (NIDS) and anti-virus scanners. Existing DFA-based ...
Yi Tang, Junchen Jiang, Xiaofei Wang, Bin Liu, Yan...