Results 1  10
of
184,189
Deterministic identity testing for sum of readonce oblivious arithmetic branching programs
 In 30th Conference on Computational Complexity, CCC 2015
"... A readonce oblivious arithmetic branching program (ROABP) is an arithmetic branching program (ABP) where each variable occurs in at most one layer. We give the first polynomial time whitebox identity test for a polynomial computed by a sum of constantly many ROABPs. We also give a corresponding bl ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
A readonce oblivious arithmetic branching program (ROABP) is an arithmetic branching program (ABP) where each variable occurs in at most one layer. We give the first polynomial time whitebox identity test for a polynomial computed by a sum of constantly many ROABPs. We also give a corresponding
Polynomial Identity Testing of ReadOnce Oblivious Algebraic Branching Programs
, 2014
"... We study the problem of obtaining efficient, deterministic, blackbox polynomial identity testing algorithms (PIT) for algebraic branching programs (ABPs) that are readonce and oblivious. This class has an efficient, deterministic, whitebox polynomial identity testing algorithm (due to Raz and Shp ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We study the problem of obtaining efficient, deterministic, blackbox polynomial identity testing algorithms (PIT) for algebraic branching programs (ABPs) that are readonce and oblivious. This class has an efficient, deterministic, whitebox polynomial identity testing algorithm (due to Raz
Readonce Polynomial Identity Testing
"... An arithmetic readonce formula (ROF for short) is a formula (a circuit in which the fanout of every gate is at most 1) in which the operations are {+, ×} and such that every input variable labels at most one leaf. In this paper we study the problems of identity testing and reconstruction of readon ..."
Abstract

Cited by 23 (6 self)
 Add to MetaCart
An arithmetic readonce formula (ROF for short) is a formula (a circuit in which the fanout of every gate is at most 1) in which the operations are {+, ×} and such that every input variable labels at most one leaf. In this paper we study the problems of identity testing and reconstruction of readonce
Pseudorandomness for multilinear readonce algebraic branching programs
 in any order. Electronic Colloquium on Computational Complexity (ECCC
"... We give deterministic blackbox polynomial identity testing algorithms for multilinear readonce oblivious algebraic branching programs (ROABPs), in nO(lg 2 n) time.1 Further, our algorithm is oblivious to the order of the variables. This is the first subexponential time algorithm for this model. F ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We give deterministic blackbox polynomial identity testing algorithms for multilinear readonce oblivious algebraic branching programs (ROABPs), in nO(lg 2 n) time.1 Further, our algorithm is oblivious to the order of the variables. This is the first subexponential time algorithm for this model
Quasipolynomialtime Identity Testing of NonCommutative and ReadOnce Oblivious Algebraic Branching Programs
, 2014
"... We study the problem of obtaining efficient, deterministic, blackbox polynomial identity testing algorithms (PIT) for algebraic branching programs (ABPs) that are readonce and oblivious. This class has an efficient, deterministic, whitebox polynomial identity testing algorithm (due to Raz and Sh ..."
Abstract
 Add to MetaCart
We study the problem of obtaining efficient, deterministic, blackbox polynomial identity testing algorithms (PIT) for algebraic branching programs (ABPs) that are readonce and oblivious. This class has an efficient, deterministic, whitebox polynomial identity testing algorithm (due to Raz
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
DART: Directed automated random testing
 In Programming Language Design and Implementation (PLDI
, 2005
"... We present a new tool, named DART, for automatically testing software that combines three main techniques: (1) automated extraction of the interface of a program with its external environment using static sourcecode parsing; (2) automatic generation of a test driver for this interface that performs ..."
Abstract

Cited by 823 (41 self)
 Add to MetaCart
We present a new tool, named DART, for automatically testing software that combines three main techniques: (1) automated extraction of the interface of a program with its external environment using static sourcecode parsing; (2) automatic generation of a test driver for this interface
Literate programming
 THE COMPUTER JOURNAL
, 1984
"... The author and his associates have been experimenting for the past several years with a programming language and documentation system called WEB. This paper presents WEB by example, and discusses why the new system appears to be an improvement over previous ones. ..."
Abstract

Cited by 549 (3 self)
 Add to MetaCart
The author and his associates have been experimenting for the past several years with a programming language and documentation system called WEB. This paper presents WEB by example, and discusses why the new system appears to be an improvement over previous ones.
Results 1  10
of
184,189