1032 search results - page 52 / 207 » Extended Computation Tree Logic |
DELTA
2004
IEEE
15 years 1 months ago
2004
IEEE
Complex arithmetic computations, especially if derived from bit-level software descriptions, can be very inefficient if implemented directly in hardware (e.g., by translation of t...
99
Voted
CONCUR
2009
Springer
15 years 2 months ago
2009
Springer
We define an extension of forest algebra for -forests. We show how the standard algebraic notions (free object, syntactic algebra, morphisms, etc.) extend to the infinite case. To ...
74
Voted
VLDB
1999
ACM
15 years 2 months ago
1999
ACM
We present an external-memory algorithm for computing a minimum-cost edit script between two rooted, ordered, labeled trees. The I/O, RAM, and CPU costs of our algorithm are, resp...
LICS
2003
IEEE
15 years 3 months ago
2003
IEEE
Given a regular collection of Mazurkiewicz traces, which can be seen as the behaviours of a finite-state concurrent system, one can associate with it a canonical regular event st...
IJDAR
2002
14 years 9 months ago
2002
Abstract. In this paper, we present a logical representation for form documents to be used for identification and retrieval. A hierarchical structure is proposed to represent the s...