Results 11  20
of
5,959
EXE: Automatically generating inputs of death
 In Proceedings of the 13th ACM Conference on Computer and Communications Security (CCS
, 2006
"... This article presents EXE, an effective bugfinding tool that automatically generates inputs that crash real code. Instead of running code on manually or randomly constructed input, EXE runs it on symbolic input initially allowed to be anything. As checked code runs, EXE tracks the constraints on ea ..."
Abstract

Cited by 349 (21 self)
 Add to MetaCart
This article presents EXE, an effective bugfinding tool that automatically generates inputs that crash real code. Instead of running code on manually or randomly constructed input, EXE runs it on symbolic input initially allowed to be anything. As checked code runs, EXE tracks the constraints
The equational compatibility problem for the real line
"... Abstract. Walter Taylor proved recently that there is no algorithm for deciding of a finite set of equations whether it is topologically compatible with the real line in the sense that it has a model with universe R and with basic operations which are all continuous with respect to the usual topolog ..."
Abstract
 Add to MetaCart
topology of the real line. Taylor’s account used operation symbols suitable for the theory of rings with unit together with three unary operation symbols intended to name trigonometric functions supplemented finally by a countably infinite list of constant symbols. We refine Taylor’s work to apply
Learning by Watching: Extracting Reusable Task Knowledge from Visual Observation of Human Performance
 IEEE Transactions on Robotics and Automation
, 1994
"... A novel task instruction method for future intelligent robots is presented. In our method, a robot learns reusable task plans by watching a human perform assembly tasks. Functional units and working algorithms for visual recognition and analysis of human action sequences are presented. The overall s ..."
Abstract

Cited by 298 (6 self)
 Add to MetaCart
system is model based and integrated at the symbolic level. Temporal segmentation of a continuous task performance into meaningful units and identification of each operation is processed in real time by concurrent recognition processes under active attention control. Dependency among assembly operations
Structure and Complexity in Planning with Unary Operators
 Journal of Artificial Intelligence Research
, 2003
"... Unary operator domains  i.e., domains in which operators have a single effect  arise naturally in many control problems. In its most general form, the problem of strips planning in unary operator domains is known to be as hard as the general strips planning problem  both are pspacecomplete. H ..."
Abstract

Cited by 53 (10 self)
 Add to MetaCart
Unary operator domains  i.e., domains in which operators have a single effect  arise naturally in many control problems. In its most general form, the problem of strips planning in unary operator domains is known to be as hard as the general strips planning problem  both are pspace
Spectra with Only Unary Function Symbols
, 1997
"... The spectrum of a firstorder sentence is the set of cardinalities of its finite models. This paper is concerned with spectra of sentences over languages that contain only unary function symbols. In particular, it is shown that a set S of natural numbers is the spectrum of a sentence over the langua ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
The spectrum of a firstorder sentence is the set of cardinalities of its finite models. This paper is concerned with spectra of sentences over languages that contain only unary function symbols. In particular, it is shown that a set S of natural numbers is the spectrum of a sentence over
HOMOMORPHIC IMAGES OF FINITE SUBDIRECTLY IRREDUCIBLE UNARY ALGEBRAS
"... We prove that a finite unary algebra with at least two operation symbols is a homomorphic image of a (finite) subdirectly irreducible algebra if and only if the intersection of all its subalgebras which have at least two elements is nonempty. ..."
Abstract
 Add to MetaCart
We prove that a finite unary algebra with at least two operation symbols is a homomorphic image of a (finite) subdirectly irreducible algebra if and only if the intersection of all its subalgebras which have at least two elements is nonempty.
A Static Analyzer for Large SafetyCritical Software
, 2003
"... We show that abstract interpretationbased static program analysis can be made e#cient and precise enough to formally verify a class of properties for a family of large programs with few or no false alarms. This is achieved by refinement of a general purpose static analyzer and later adaptation to p ..."
Abstract

Cited by 271 (54 self)
 Add to MetaCart
to particular programs of the family by the enduser through parametrization. This is applied to the proof of soundness of data manipulation operations at the machine level for periodic synchronous safety critical embedded software. The main novelties are the design principle of static analyzers by refinement
Arithmetic coding
 IBM J. Res. Develop
, 1979
"... Arithmetic coding is a data compression technique that encodes data (the data string) by creating a code string which represents a fractional value on the number line between 0 and 1. The coding algorithm is symbolwise recursive; i.e., it operates upon and encodes (decodes) one data symbol per itera ..."
Abstract

Cited by 266 (1 self)
 Add to MetaCart
Arithmetic coding is a data compression technique that encodes data (the data string) by creating a code string which represents a fractional value on the number line between 0 and 1. The coding algorithm is symbolwise recursive; i.e., it operates upon and encodes (decodes) one data symbol per
Nondeterministic Space is Closed Under Complementation
, 1988
"... this paper we show that nondeterministic space s(n) is closed under complementation, for s(n) greater than or equal to log n. It immediately follows that the contextsensitive languages are closed under complementation, thus settling a question raised by Kuroda in 1964 [9]. See Hartmanis and Hunt [4 ..."
Abstract

Cited by 262 (14 self)
 Add to MetaCart
showed that NSPACE[log n] is equal to (FO + pos TC), i.e. firstorder logic with ordering, plus a transitive closure operation, in which the transitive closure operator does not appear within any negation symbols [7]. Now we have returned to the issue of complementation in the light of recent results
HOMOMORPHIC IMAGES OF FINITE SUBDIRECTLY IRREDUCIBLE UNARY ALGEBRAS
"... Abstract. We prove that a finite unary algebra with at least two operation symbols is a homomorphic image of a (finite) subdirectly irreducible algebra if and only if the intersection of all its subalgebras which have at least two elements is nonempty. We are concerned with the following question: W ..."
Abstract
 Add to MetaCart
Abstract. We prove that a finite unary algebra with at least two operation symbols is a homomorphic image of a (finite) subdirectly irreducible algebra if and only if the intersection of all its subalgebras which have at least two elements is nonempty. We are concerned with the following question
Results 11  20
of
5,959