Sciweavers

3742 search results - page 608 / 749
» On the Use of Formal Techniques for Validation
Sort
View
ICDM
2008
IEEE
99views Data Mining» more  ICDM 2008»
16 years 26 days ago
Finding Good Itemsets by Packing Data
The problem of selecting small groups of itemsets that represent the data well has recently gained a lot of attention. We approach the problem by searching for the itemsets that c...
Nikolaj Tatti, Jilles Vreeken
RTAS
2007
IEEE
16 years 21 days ago
A Programming Model for Time-Synchronized Distributed Real-Time Systems
Discrete-event (DE) models are formal system specifications that have analyzable deterministic behaviors. Using a global, consistent notion of time, DE components communicate via...
Yang Zhao, Jie Liu, Edward A. Lee
ADBIS
2007
Springer
98views Database» more  ADBIS 2007»
16 years 18 days ago
CUDL Language Semantics, Liven Up the FDB Data Model
The semantics of a new language (CUDL – Conceptual Universal Database Language), designed to manage dynamic database environments, are presented. This language conforms to the FD...
Nikitas Karanikolas, Maria Nitsiou, Emmanuel J. Ya...
ESORICS
2007
Springer
16 years 17 days ago
SilentKnock: Practical, Provably Undetectable Authentication
Port knocking is a technique first introduced in the blackhat and trade literature to prevent attackers from discovering and exploiting potentially vulnerable services on a networ...
Eugene Y. Vasserman, Nicholas Hopper, John Laxson,...
IFL
2007
Springer
141views Formal Methods» more  IFL 2007»
16 years 17 days ago
Partial Parsing: Combining Choice with Commitment
Abstract. Parser combinators, often monadic, are a venerable and widelyused solution to read data from some external format. However, the capability to return a partial parse has, ...
Malcolm Wallace