Skip to search formSkip to main contentSkip to account menu
Log auditing through model-checking
TLDR
It is argued that this is naturally expressed as a model-checking problem against linear Kripke models, and an efficient on-line algorithm is described, making the approach attractive for complex log auditing tasks.
View on IEEE
Non-Hausdorff topology and domain theory
1. Introduction 2. Elements of set theory 3. A first tour of topology: metric spaces 4. Topology 5. Approximation, and function spaces 6. Metrics, quasi-metrics, hemi-metrics 7. Completeness 8. Sober…
Cryptographic Protocol Analysis on Real C Code
TLDR
This work describes how cryptographic protocol verification techniques based on solving clause sets can be applied to detect vulnerabilities of C programs in the Dolev-Yao model, statically.
View via Publisher
Forward analysis for WSTS, part I: completions
TLDR
This work defines adequate notions of completions of well-quasi-orders, and more generally, of Noetherian spaces, and argues that the required completions must be ideal completions, that is, spaces of irreducible closed subsets.
View on Cambridge Press
Karp-Miller Trees for a Branching Extension of VASS
TLDR
BVASS (Branching VASS) which extend VASS by allowing addition transitions that merge two configurations is studied, showing that the construction of Karp-Miller trees for VASS can be extended to BVASS and that the coverability set for BV ASS is computable.
View Paper
The Orchids Intrusion Detection Tool
TLDR
Orchids is an intrusion detection tool based on techniques for fast, on-line model-checking that checks temporal formulae against merged network and system event flows, which together form a linear Kripke structure.
View via Publisher
Detecting Subverted Cryptographic Protocols by Entropy Checking
TLDR
This work proposes a simple, yet efficient technique to detect most of such attacks, by computing the entropy of the flow and comparing it against known thresholds.
Deciding H1 by resolution
View via Publisher
A Smell of Orchids
TLDR
This paper explains the salient features of the basic model-checking algorithm in an intuitive way, as a form of dynamically-spawned monitors, and corrects a small, but definitely annoying bug in its core algorithm, as it was published in 2001.
View via Publisher
On Noetherian Spaces
TLDR
The starting point is that this notion generalizes that of well-quasi order, in the sense that an Alexandroff-discrete space is Noetherian iff its specialization quasi-ordering is well, which opens the way to verifying infinite transition systems based on non-well quasi ordered sets, but where the preimage operator satisfies an additional continuity assumption.
View on IEEE
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License