Results 1 - 10 of 2,218

Some informational aspects of visual perception

by Fred Attneave - Psychol. Rev , 1954
"... The ideas of information theory are at present stimulating many different areas of psychological inquiry. In providing techniques for quantifying situations which have hitherto been difficult or impossible to quantify, they suggest new and more precise ways of conceptualizing these situations (see M ..."
Abstract - Cited by 643 (2 self) - Add to MetaCart
Miller [12] for a general discussion and bibliography). Events ordered in time are particularly amenable to informational analysis; thus language sequences are being extensively studied, and other sequences, such as those of music, plainly invite research. In this paper I shall indicate some of the ways

A unified approach to global program optimization

by Gary A. Kildall - In Conference Record of the ACM Symposium on Principles of Programming Languages , 1973
"... A technique is presented for global analysie of program structure in order to perform compile time optimization of object code generated for expressions. The global expression optimization presented includes constant propagation, common subexpression elimination, elimination of redundant register lo ..."
Abstract - Cited by 371 (0 self) - Add to MetaCart
A technique is presented for global analysie of program structure in order to perform compile time optimization of object code generated for expressions. The global expression optimization presented includes constant propagation, common subexpression elimination, elimination of redundant register

File System Design for an NFS File Server Appliance

by Dave Hitz, James Lau, Michael Malcolm , 1994
"... Network Appliance recently began shipping a new kind of network server called an NFS file server appliance, which is a dedicated server whose sole function is to provide NFS file service. The file system requirements for an NFS appliance are different from those for a general-purpose UNIX system, b ..."
Abstract - Cited by 338 (2 self) - Add to MetaCart
structures that WAFL uses to implement Snapshots™, which are read-only clones of the active file system. WAFL uses a copy-on-write technique to minimize the disk space that Snapshots consume. This paper also describes how WAFL uses Snapshots to eliminate the need for file system consistency checking after

Eliminating Array Bound Checking Through Dependent Types

by Hongwei Xi, Frank Pfennig - In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation , 1998
"... We present a type-based approach to eliminating array bound checking and list tag checking by conservatively extending Standard ML with a restricted form of dependent types. This enables the programmer to capture more invariants through types while type-checking remains decidable in theory and can s ..."
Abstract - Cited by 186 (24 self) - Add to MetaCart
We present a type-based approach to eliminating array bound checking and list tag checking by conservatively extending Standard ML with a restricted form of dependent types. This enables the programmer to capture more invariants through types while type-checking remains decidable in theory and can

Effective Partial Redundancy Elimination

by Preston Briggs, Keith D. Cooper - Proceedings of the ACM SIGPLAN '94 Conference on Programming Language Design and Implementation , 1994
"... Partial redundancy elimination is a code optimization with a long history of literature and implementation. In practice, its effectiveness depends on issues of naming and code shape. This paper shows that a combination of global reassociation and global value numbering can increase the effectiveness ..."
Abstract - Cited by 92 (13 self) - Add to MetaCart
, creating opportunities for other optimizations. The new algorithm generalizes earlier work that ordered FORTRAN array address expressions to improve optimization [25]. 1 Introduction Partial redundancy elimination is a powerful optimization that has been discussed in the literature for many years (e

ABCD: Eliminating Array Bounds Checks on Demand

by Rastislav Bodik, Rajiv Gupta, et al. , 2000
"... To guarantee execution, Java and other strongly typed languages require bounds checking of array accesses. Because bounds checks may raise exceptions, they block code motion of instructions with side effects, thus preventing many useful code optimizations, such as partial redundancy elimination or i ..."
Abstract - Cited by 148 (7 self) - Add to MetaCart
To guarantee execution, Java and other strongly typed languages require bounds checking of array accesses. Because bounds checks may raise exceptions, they block code motion of instructions with side effects, thus preventing many useful code optimizations, such as partial redundancy elimination

Elimination of Redundant Array Subscript Range Checks

by Priyadarshan Kolte, Michael Wolfe , 1995
"... This paper presents a compiler optimization algorithm to reduce the run time overhead of array subscript range checks in programs without compromising safety. The algorithm is based on partial redundancy elimination and it incorporates previously developed algorithms for range check optimization. We ..."
Abstract - Cited by 64 (0 self) - Add to MetaCart
This paper presents a compiler optimization algorithm to reduce the run time overhead of array subscript range checks in programs without compromising safety. The algorithm is based on partial redundancy elimination and it incorporates previously developed algorithms for range check optimization

The probability of duplicate gene preservation by subfunctionalization.

by Michael Lynch , Allan Force - Genetics , 2000
"... ABSTRACT It has often been argued that gene-duplication events are most commonly followed by a mutational event that silences one member of the pair, while on rare occasions both members of the pair are preserved as one acquires a mutation with a beneficial function and the other retains the origin ..."
Abstract - Cited by 261 (2 self) - Add to MetaCart
are periods of time suggests that some type of positive selecbelieved to be initially redundant in function, it is comtion must be offsetting the high rate of production of monly thought that one member of the pair will usually null alleles, and this is supported by frequent observabecome silenced

Bounded model checking

by Armin Biere , 2009
"... Besides Equivalence Checking [KK97, KPKG02] the most important industrial application of SAT is currently Bounded Model Checking (BMC) [BCCZ99]. Both techniques are used for formal hardware verification in the context of electronic design automation (EDA), but have successfully been applied to many ..."
Abstract - Cited by 165 (3 self) - Add to MetaCart
coverage holes, and disproving redundancy in designs. Most of the techniques discussed in this chapter transfer to this more general setting as well, even though our focus is on property

RedCard: Redundant Check Elimination For Dynamic Race Detectors

by Cormac Flanagan, Stephen N. Freund
"... Abstract. Precise dynamic race detectors report an error if and only if an observed program trace exhibits a data race. They must typically check for races on all memory accesses to ensure that they catch all races and generate no spurious warnings. However, a race check for a particular memory acce ..."
Abstract - Cited by 7 (0 self) - Add to MetaCart
access is guaranteed to be redundant if the accessing thread has already accessed that location within the same release-free span. A release-free span is any sequence of instructions containing no lock releases or other “release-like ” synchronization operations, such as notify or fork. We present a
Results 1 - 10 of 2,218