277 search results - page 19 / 56 » Towards an automatic complexity analysis for generic program... |
POPL
1994
ACM
13 years 11 months ago
1994
ACM
ions of abstract domains for logic programming: open product and generic pattern construction Agostino Cortesia; , Baudouin Le Charlierb , Pascal Van Hentenryckc aDipartimento di I...
APLAS
2005
ACM
14 years 1 months ago
2005
ACM
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
SAS
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
EUROPAR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Understanding program behavior is at the foundation of program optimization. Techniques for automatic recognition of program constructs (from now on, computational kernel...
TPHOL
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract We present the generic system framework of Isabelle/Isar underlying recent versions of Isabelle. Among other things, Isar provides an infrastructure for Isabelle plug-ins,...