261 search results - page 37 / 53 » Proof Normalization Modulo |
CMA
2010
14 years 9 months ago
2010
It is shown that the Clar number can be arbitrarily larger than the cardinality of a maximal alternating set. In particular, a maximal alternating set of a hexagonal system need n...
68
Voted
RAID
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. In order to detect a compromise of a running process based on it deviating from its program’s normal system-call behavior, an anomaly detector must first be trained wi...
103
click to vote
ICALP
2007
Springer
15 years 5 months ago
2007
Springer
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
107
click to vote
CSL
2005
Springer
15 years 5 months ago
2005
Springer
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
IGPL
2002
14 years 11 months ago
2002
This paper generalises and complements the work on combining temporal logics started by Finger and Gabbay [11, 10]. We present proofs of transference of soundness, completeness an...