Sciweavers

581 search results - page 6 / 117
» An Automata Model for Trees with Ordered Data Values
Sort
View
ACTA
2010
191views more  ACTA 2010»
14 years 9 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
CONCUR
2006
Springer
14 years 11 months ago
Model Checking Quantified Computation Tree Logic
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
Arend Rensink
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
15 years 9 months ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...
FUIN
2008
92views more  FUIN 2008»
14 years 9 months ago
Translation of Timed Promela to Timed Automata with Discrete Data
The aim of the work is twofold. In order to face the problem of modeling time constraints in Promela, a timed extension of the language is presented. Next, timed Promela is transla...
Wojciech Nabialek, Agata Janowska, Pawel Janowski
WIDM
2004
ACM
15 years 2 months ago
Measuring similarity between collection of values
In this paper, we propose a set of similarity metrics for manipulating collections of values occuring in XML documents. Following the data model presented in TAX algebra, we treat...
Carina F. Dorneles, Carlos A. Heuser, Andrei E. N....