2000 search results - page 316 / 400 » Program Transformation and Proof Transformation |
116
Voted
CONCUR
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
129
Voted
SAIG
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Functional languages are particularly well-suited to the implementation of interpreters for domain-specific embedded languages (DSELs). We describe an implemented techniq...
123
click to vote
ICFP
1997
ACM
15 years 7 months ago
1997
ACM
An interprocedural flow analysis can justify inlining in higher-order languages. In principle, more inlining can be performed as analysis accuracy improves. This paper compares fo...
111
Voted
ICLP
1997
Springer
15 years 7 months ago
1997
Springer
Array updates in single assignment languages generally require some copying of the array, and thus tend to be more expensive than in imperative languages. As a result, programs in...
119
Voted
CCS
2008
ACM
15 years 5 months ago
2008
ACM
Current taint tracking systems suffer from high overhead and a lack of generality. In this paper, we solve both of these issues with an extensible system that is an order of magni...