Sciweavers

49 search results - page 4 / 10
» Clearing Restarting Automata
Sort
View
CSL
2009
Springer
15 years 5 months ago
Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata
Abstract. For deterministic tree automata, classical hierarchies, like MostowskiRabin (or index) hierarchy, Borel hierarchy, or Wadge hierarchy, are known to be decidable. However,...
Jacques Duparc, Alessandro Facchini, Filip Murlak
ACL
2009
14 years 8 months ago
Parsing Speech Repair without Specialized Grammar Symbols
This paper describes a parsing model for speech with repairs that makes a clear separation between linguistically meaningful symbols in the grammar and operations specific to spee...
Tim Miller, Luan Nguyen, William Schuler
MEMBRANE
2007
Springer
15 years 4 months ago
Modeling the Dynamics of HIV Infection with Conformon-P Systems and Cellular Automata
Abstract. Further results on the study of the dynamics of HIV infection with grids of conformon-P systems are reported. This study clearly shows a subdivision in two phases of the ...
Pierluigi Frisco, David W. Corne
139
Voted
SOSP
2009
ACM
15 years 7 months ago
Automatically patching errors in deployed software
We present ClearView, a system for automatically patching errors in deployed software. ClearView works on stripped Windows x86 binaries without any need for source code, debugging...
Jeff H. Perkins, Sunghun Kim, Samuel Larsen, Saman...
CAV
2006
Springer
105views Hardware» more  CAV 2006»
15 years 2 months ago
FAST Extended Release
Fast is a tool designed for the analysis of counter systems, i.e. automata extended with unbounded integer variables. Despite the reachability set is not recursive in general, Fast...
Sébastien Bardin, Jérôme Lerou...