2333 search results - page 291 / 467 » Recursive Computational Depth |
ISMVL
1997
IEEE
14 years 17 days ago
1997
IEEE
The composition tree of a given function, when it exists, provides a representation of the function revealing all possible disjunctive decompositions, thereby suggesting a realiza...
CAV
2007
Springer
14 years 10 days ago
2007
Springer
Abstract. Solvers for satisfiability modulo theories (SMT) check the satisfiability of first-order formulas containing operations from various theories such as the Booleans, bit-ve...
CAV
2006
Springer
14 years 2 days ago
2006
Springer
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...
TAPSOFT
1991
Springer
13 years 12 months ago
1991
Springer
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...
CAIP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In autonomous indoor navigation some number of localizations and orientations of the vehicle can be learned in advance. No artificial landmarks are required to exist. We...