Sciweavers

373 search results - page 53 / 75
» Analysis of Recursive State Machines
Sort
View
ALT
2004
Springer
15 years 6 months ago
Comparison of Query Learning and Gold-Style Learning in Dependence of the Hypothesis Space
Different formal learning models address different aspects of learning. Below we compare learning via queries—interpreting learning as a one-shot process in which the learner i...
Steffen Lange, Sandra Zilles
CORR
2004
Springer
177views Education» more  CORR 2004»
14 years 9 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard
WCRE
2006
IEEE
15 years 3 months ago
Extracting Output Formats from Executables
We describe the design and implementation of FFE/x86 (File-Format Extractor for x86), an analysis tool that works on stripped executables (i.e., neither source code nor debugging ...
Junghee Lim, Thomas W. Reps, Ben Liblit
ICDAR
2009
IEEE
15 years 4 months ago
Recognition of Degraded Handwritten Characters Using Local Features
The main problems of Optical Character Recognition (OCR) systems are solved if printed latin text is considered. Since OCR systems are based upon binary images, their results are ...
Markus Diem, Robert Sablatnig
FORTE
2010
14 years 11 months ago
On Efficient Models for Model Checking Message-Passing Distributed Protocols
Abstract. The complexity of distributed algorithms, such as state machine replication, motivates the use of formal methods to assist correctness verification. The design of the for...
Péter Bokor, Marco Serafini, Neeraj Suri