Sciweavers

349 search results - page 49 / 70
» The Finite and the Infinite
Sort
View
FATES
2004
Springer
14 years 1 months ago
Test Generation Based on Symbolic Specifications
Abstract. Classical state-oriented testing approaches are based on simple machine models such as Labelled Transition Systems (LTSs), in which data is represented by concrete values...
Lars Frantzen, Jan Tretmans, Tim A. C. Willemse
JGT
2006
60views more  JGT 2006»
13 years 10 months ago
Spanning subgraphs of graphs partitioned into two isomorphic pieces
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...
Anthony Bonato
NIPS
2001
13 years 11 months ago
Latent Dirichlet Allocation
We describe latent Dirichlet allocation (LDA), a generative probabilistic model for collections of discrete data such as text corpora. LDA is a three-level hierarchical Bayesian m...
David M. Blei, Andrew Y. Ng, Michael I. Jordan
ESORICS
2002
Springer
14 years 9 months ago
Analysing a Stream Authentication Protocol Using Model Checking
Abstract. In this paper, we consider how one can analyse a stream authentication protocol using model checking techniques. In particular, we will be focusing on the Timed Efficient...
Philippa J. Broadfoot, Gavin Lowe
ACSD
2010
IEEE
215views Hardware» more  ACSD 2010»
13 years 8 months ago
A Formal Semantics of Clock Refinement in Imperative Synchronous Languages
The synchronous model of computation divides the execution of a program into an infinite sequence of socalled macro steps, which are further divided into finitely many micro steps....
Mike Gemunde, Jens Brandt, Klaus Schneider