Sciweavers

4340 search results - page 379 / 868
» Formal Methods and Cryptography
Sort
View
DCC
2008
IEEE
16 years 6 months ago
Re-pair Achieves High-Order Entropy
Re-Pair is a dictionary-based compression method invented in 1999 by Larsson and Moffat. Although its practical performance has been established through experiments, the method ha...
Gonzalo Navarro, Luís M. S. Russo
158
Voted
ICCS
2007
Springer
16 years 28 days ago
Using FCA for Encoding Closure Operators into Neural Networks
After decades of concurrent development of symbolic and connectionist methods, recent years have shown intensifying efforts of integrating those two paradigms. This paper contribu...
Sebastian Rudolph
CAV
2005
Springer
135views Hardware» more  CAV 2005»
16 years 10 days ago
Linear Ranking with Reachability
We present a complete method for synthesizing lexicographic linear ranking functions supported by inductive linear invariants for loops with linear guards and transitions. Proving ...
Aaron R. Bradley, Zohar Manna, Henny B. Sipma
FMCO
2005
Springer
16 years 9 days ago
Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
We present a method for decomposing modal formulas for processes with the internal action τ. To decide whether a process algebra term satisfies a modal formula, one can check whe...
Wan Fokkink, Rob J. van Glabbeek, Paulien de Wind
IAW
2003
IEEE
16 years 2 days ago
Static Verification of Worm and virus Behavior in binary Executables using Model Checking
- Use offormal methods in any application scenario requires a precise characterization and representation of the properties that need to be verified The target, which is desired ri...
Prabhat K. Singh, Arun Lakhotia