Sciweavers

3796 search results - page 402 / 760
» Presentations by Programmers for Programmers
Sort
View
137
Voted
ICSE
1999
IEEE-ACM
15 years 8 months ago
Dynamically Discovering Likely Program Invariants to Support Program Evolution
ÐExplicitly stated program invariants can help programmers by identifying program properties that must be preserved when modifying code. In practice, however, these invariants are...
Michael D. Ernst, Jake Cockrell, William G. Griswo...
ISCA
1998
IEEE
123views Hardware» more  ISCA 1998»
15 years 8 months ago
Weak Ordering - A New Definition
A memory model for a shared memory, multiprocessor commonly and often implicitly assumed by programmers is that of sequential consistency. This model guarantees that all memory ac...
Sarita V. Adve, Mark D. Hill
136
Voted
CHI
1998
ACM
15 years 8 months ago
Scripting Graphical Applications by Demonstration
Writing scripts (often called “macros”) can be helpful for automating repetitive tasks. Scripting facilities for text editors like Emacs and Microsoft Word have been widely us...
Brad A. Myers
ECOOP
1998
Springer
15 years 8 months ago
Wrappers to the Rescue
Wrappers are mechanisms for introducing new behavior that is executed before and/or after, and perhaps even in lieu of, an existing method. This paper examines several ways to impl...
John Brant, Brian Foote, Ralph E. Johnson, Don Rob...
AADEBUG
1997
Springer
15 years 8 months ago
Application of Dynamic Slicing in Program Debugging
A dynamic program slice is an executable part of a program whose behavior is identical, for the same program input, to that of the original program with respect to a variable(s) o...
Bogdan Korel, Juergen Rilling