Results 1  10
of
2,549,557
Indexing StraightLine Programs
, 2008
"... Straightline programs offer powerful text compression by representing a text T[1, u] in terms of a contextfree grammar of n rules, so that T can be recovered in O(u) time. However, the problem of operating the grammar in compressed form has not been studied much. We present the first grammar repre ..."
Abstract
 Add to MetaCart
Straightline programs offer powerful text compression by representing a text T[1, u] in terms of a contextfree grammar of n rules, so that T can be recovered in O(u) time. However, the problem of operating the grammar in compressed form has not been studied much. We present the first grammar
Probabilistic algorithms for deciding equivalence of straightline programs
 J. ACM
, 1983
"... Let Q be any algebraic structure and ~the set of all total programs over Q using the instruction set {z,, 1, z,, x + y, z,, x y, z ~ x * y, z ~ x/y}. (A program is total if no division by zero occurs during any computation) Let the equivalence problem for ~ be the problem of deciding for tw ..."
Abstract

Cited by 47 (1 self)
 Add to MetaCart
Let Q be any algebraic structure and ~the set of all total programs over Q using the instruction set {z,, 1, z,, x + y, z,, x y, z ~ x * y, z ~ x/y}. (A program is total if no division by zero occurs during any computation) Let the equivalence problem for ~ be the problem of deciding
The StraightLine Automatic Programming Problem
, 2003
"... superoptimization, code generation, straightline automatic programming problem The paper presents a design for the Denali2 superoptimizer, which will generate minimuminstructionlength machine code for realistic machine architectures using automatic theoremproving technology: specifically, usin ..."
Abstract
 Add to MetaCart
superoptimization, code generation, straightline automatic programming problem The paper presents a design for the Denali2 superoptimizer, which will generate minimuminstructionlength machine code for realistic machine architectures using automatic theoremproving technology: specifically
Monotone Complexity
, 1990
"... We give a general complexity classification scheme for monotone computation, including monotone spacebounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a simple ..."
Abstract

Cited by 2837 (11 self)
 Add to MetaCart
We give a general complexity classification scheme for monotone computation, including monotone spacebounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a
Learning to Schedule StraightLine Code
 In Proceedings of Neural Information Processing Symposium
, 1997
"... Program execution speed on modern computers is sensitive, by a factor of two or more, to the order in which instructions are presented to the processor. To realize potential execution efficiency, an optimizing compiler must employ a heuristic algorithm for instruction scheduling. Such algorithms are ..."
Abstract

Cited by 28 (4 self)
 Add to MetaCart
are painstakingly handcrafted, which is expensive and timeconsuming. We show how to cast the instruction scheduling problem as a learning task, obtaining the heuristic scheduling algorithm automatically. Our focus is the narrower problem of scheduling straightline code (also called basic blocks of instructions
Straightline programs in geometric elimination theory
 J. Pure Appl. Algebra
, 1998
"... Dedicated to Volker Strassen for his work on complexity We present a new method for solving symbolically zero–dimensional polynomial equation systems in the affine and toric case. The main feature of our method is the use of problem adapted data structures: arithmetic networks and straight–line prog ..."
Abstract

Cited by 65 (17 self)
 Add to MetaCart
Dedicated to Volker Strassen for his work on complexity We present a new method for solving symbolically zero–dimensional polynomial equation systems in the affine and toric case. The main feature of our method is the use of problem adapted data structures: arithmetic networks and straight–line
Parameterized Complexity
, 1998
"... the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs ..."
Abstract

Cited by 1218 (75 self)
 Add to MetaCart
the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs
KLEE: Unassisted and Automatic Generation of HighCoverage Tests for Complex Systems Programs
"... We present a new symbolic execution tool, KLEE, capable of automatically generating tests that achieve high coverage on a diverse set of complex and environmentallyintensive programs. We used KLEE to thoroughly check all 89 standalone programs in the GNU COREUTILS utility suite, which form the cor ..."
Abstract

Cited by 541 (14 self)
 Add to MetaCart
We present a new symbolic execution tool, KLEE, capable of automatically generating tests that achieve high coverage on a diverse set of complex and environmentallyintensive programs. We used KLEE to thoroughly check all 89 standalone programs in the GNU COREUTILS utility suite, which form
Perspectives on Program Analysis
, 1996
"... eing analysed. On the negative side, the semantic correctness of the analysis is seldom established and therefore there is often no formal justification for the program transformations for which the information is used. The semantics based approach [1; 5] is often based on domain theory in the form ..."
Abstract

Cited by 678 (35 self)
 Add to MetaCart
eing analysed. On the negative side, the semantic correctness of the analysis is seldom established and therefore there is often no formal justification for the program transformations for which the information is used. The semantics based approach [1; 5] is often based on domain theory
Abduction in Logic Programming
"... Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas of Computer Science. This paper aims to chart out the main developments of the field over th ..."
Abstract

Cited by 616 (76 self)
 Add to MetaCart
Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas of Computer Science. This paper aims to chart out the main developments of the field over
Results 1  10
of
2,549,557