133 search results - page 23 / 27 » Recognizing Mathematical Expressions Using Tree Transformati... |
126
Voted
ICFP
2005
ACM
16 years 2 months ago
2005
ACM
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...
114
Voted
TACAS
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. The Succinct Solver Suite offers two analysis engines for solving data and control flow problems expressed in clausal form in a large fragment of first order logic. Th...
117
Voted
ICDT
2007
ACM
15 years 8 months ago
2007
ACM
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
138
Voted
MOBIHOC
2007
ACM
16 years 2 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
118
Voted
CAV
1999
Springer
15 years 7 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...