2000 search results - page 131 / 400 » Program Transformation and Proof Transformation |
123
Voted
APAL
2010
15 years 3 months ago
2010
This paper provides a sound and complete proof system for a language Le+Y that adds to Dynamic Epistemic Logic (DEL) a discrete previous-time operator as well as single symbol for...
128
click to vote
ENTCS
2002
15 years 3 months ago
2002
Once you have proved your refinement correct, that is not the end. Real products, and their accompanying specifications, develop over time, with new improved versions having added...
160
Voted
WWW
2005
ACM
15 years 9 months ago
2005
ACM
This paper proposes an incremental maintenance algorithm that efficiently updates the materialized XPath/XSLT views defined using XPath expressions in XP{[],∗,//,vars} . The al...
126
Voted
IFL
1997
Springer
15 years 7 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...
109
Voted
SPE
2008
15 years 3 months ago
2008
raction; Industrial Experiment Martin Ward, , Hussein Zedan