1023 search results - page 108 / 205 » A Formal Method for Program Slicing |
109
click to vote
TLDI
2010
ACM
15 years 10 months ago
2010
ACM
Reasoning about the correctness of multithreaded programs is complicated by the potential for unexpected interference between threads. Previous work on controlling thread interfer...
133
Voted
FMICS
2009
Springer
15 years 8 months ago
2009
Springer
Most modern safety-critical control programs, such as those embedded in fly-by-wire control systems, perform a lot of floating-point computations. The well-known pitfalls of IEEE...
105
click to vote
SAS
2004
Springer
15 years 7 months ago
2004
Springer
We describe data structures and algorithms for performing a path-sensitive program analysis to discover equivalences of expressions involving linear arithmetic or uninterpreted fun...
120
Voted
SAS
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
110
click to vote
IFL
1997
Springer
15 years 5 months ago
1997
Springer
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...