506 search results - page 12 / 102 » Proving Properties about Lists Using Containers |
75
Voted
AAAI
1994
14 years 11 months ago
1994
In this paper we argue that for realistic applications involving default reasoning it is necessary to reason about the priorities of defaults. Existing approaches require the know...
ALT
2009
Springer
15 years 6 months ago
2009
Springer
Motivated by the principle of agnostic learning, we present an extension of the model introduced by Balcan, Blum, and Gupta [3] on computing low-error clusterings. The extended mod...
DAC
2001
ACM
15 years 10 months ago
2001
ACM
roperty Verification by Abstraction Refinement with Formal, Simulation and Hybrid Engines Dong Wang , Pei-Hsin Ho , Jiang Long , James Kukula Yunshan Zhu , Tony Ma , Robert D...
RAID
2004
Springer
15 years 3 months ago
2004
Springer
We present a formal framework for the analysis of intrusion detection systems (IDS) that employ declarative rules for attack recognition, e.g. specification-based intrusion detect...
84
Voted
GD
2004
Springer
15 years 3 months ago
2004
Springer
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...