Sciweavers

Share
CAV
2011
Springer
216views Hardware» more  CAV 2011»
7 years 9 months ago
Malware Analysis with Tree Automata Inference
Abstract. The underground malware-based economy is flourishing and it is evident that the classical ad-hoc signature detection methods are becoming insufficient. Malware authors ...
Domagoj Babic, Daniel Reynaud, Dawn Song
MST
2011
206views Hardware» more  MST 2011»
8 years 1 months ago
Weighted Logics for Unranked Tree Automata
: We define a weighted monadic second order logic for unranked trees and the concept of weighted unranked tree automata, and we investigate the expressive power of these two conce...
Manfred Droste, Heiko Vogler
IANDC
2011
129views more  IANDC 2011»
8 years 1 months ago
Rigid tree automata and applications
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
Florent Jacquemard, Francis Klay, Camille Vacher
JUCS
2002
91views more  JUCS 2002»
8 years 5 months ago
On Quasi-Products of Tree Automata
Abstract: In this paper we introduce the concept of the quasi-product of tree automata. In a quasi-product the inputs of the component tree automata are operational symbols in whic...
Ferenc Gécseg
JCSS
2007
107views more  JCSS 2007»
8 years 6 months ago
On the minimization of XML Schemas and tree automata for unranked trees
Automata for unranked trees form a foundation for XML schemas, querying and pattern languages. We study the problem of efficiently minimizing such automata. First, we study unrank...
Wim Martens, Joachim Niehren
IPL
2008
147views more  IPL 2008»
8 years 6 months ago
Streaming tree automata
Streaming validation and querying of XML documents are often based on automata for tree-like structures. We propose a new notion of streaming tree automata in order to unify the t...
Olivier Gauwin, Joachim Niehren, Yves Roos
DKE
2006
139views more  DKE 2006»
8 years 6 months ago
Information extraction from structured documents using k-testable tree automaton inference
Information extraction (IE) addresses the problem of extracting specific information from a collection of documents. Much of the previous work on IE from structured documents, suc...
Raymond Kosala, Hendrik Blockeel, Maurice Bruynoog...
CORR
2010
Springer
91views Education» more  CORR 2010»
8 years 6 months ago
Simulations of Weighted Tree Automata
Simulations of weighted tree automata (wta) are considered. It is shown how such simulations can be decomposed into simpler functional and dual functional simulations also called f...
Zoltán Ésik, Andreas Maletti
CORR
2010
Springer
142views Education» more  CORR 2010»
8 years 6 months ago
XPath Whole Query Optimization
Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown tha...
Sebastian Maneth, Kim Nguyen
ACTA
2010
191views more  ACTA 2010»
8 years 6 months ago
Automata-based verification of programs with tree updates
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Peter Habermehl, Radu Iosif, Tomás Vojnar
books