Sciweavers

1715 search results - page 241 / 343
» Domain-Specific Program Checking
Sort
View
PLDI
2000
ACM
15 years 6 months ago
Field analysis: getting useful and low-cost interprocedural information
We present a new limited form of interprocedural analysis called field analysis that can be used by a compiler to reduce the costs of modern language features such as objectorien...
Sanjay Ghemawat, Keith H. Randall, Daniel J. Scale...
PLDI
2000
ACM
15 years 6 months ago
Translation validation for an optimizing compiler
We describe a translation validation infrastructure for the GNU C compiler. During the compilation the infrastructure compares the intermediate form of the program before and afte...
George C. Necula
CAV
2010
Springer
179views Hardware» more  CAV 2010»
15 years 6 months ago
Generating Litmus Tests for Contrasting Memory Consistency Models
Well-defined memory consistency models are necessary for writing correct parallel software. Developing and understanding formal specifications of hardware memory models is a chal...
Sela Mador-Haim, Rajeev Alur, Milo M. K. Martin
96
Voted
ENTCS
2006
135views more  ENTCS 2006»
15 years 2 months ago
Initializing Mutually Referential Abstract Objects: The Value Recursion Challenge
zing Mutually Referential Abstract Objects: The Value Recursion Challenge Don Syme 1 Microsoft Research, Cambridge, U.K. Mutual dependencies between objects arise frequently in pr...
Don Syme
IJFCS
2006
119views more  IJFCS 2006»
15 years 2 months ago
Enforcing Concurrent Temporal Behaviors
The outcome of verifying software is often a `counterexample', i.e., a listing of the actions and states of a behavior not satisfying the specification. In order to understan...
Doron Peled, Hongyang Qu