Sciweavers

54 search results - page 10 / 11
» Inference of Finite Automata Using Homing Sequences
Sort
View
ECAI
2008
Springer
13 years 10 months ago
A probabilistic analysis of diagnosability in discrete event systems
Abstract. This paper shows that we can take advantage of information about the probabilities of the occurrences of events, when this information is available, to refine the classic...
Farid Nouioua, Philippe Dague
POPL
2005
ACM
14 years 9 months ago
Synthesis of interface specifications for Java classes
While a typical software component has a clearly specified (static) interface in terms of the methods and the input/output types they support, information about the correct sequen...
P. Madhusudan, Pavol Cerný, Rajeev Alur, Wo...
APIN
2002
121views more  APIN 2002»
13 years 9 months ago
Applying Learning by Examples for Digital Design Automation
This paper describes a new learning by example mechanism and its application for digital circuit design automation. This mechanism uses finite state machines to represent the infer...
Ben Choi
ICSE
2001
IEEE-ACM
14 years 1 months ago
Encoding Program Executions
Dynamic analysis is based on collecting data as the program runs. However, raw traces tend to be too voluminous and too unstructured to be used directly for visualization and unde...
Steven P. Reiss, Manos Renieris
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
14 years 9 months ago
ZStream: a cost-based query processor for adaptively detecting composite events
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
Yuan Mei, Samuel Madden