2000 search results - page 302 / 400 » Program Transformation and Proof Transformation |
116
Voted
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
We reduce the approximation factor for Vertex Cover to 2 − Θ( 1√ log n ) (instead of the previous 2 − Θ(log log n log n ), obtained by Bar-Yehuda and Even [2], and by Moni...
102
Voted
SAS
2005
Springer
15 years 9 months ago
2005
Springer
The termination insensitive secure information flow problem can be reduced to solving a safety problem via a simple program transformation. Barthe, D’Argenio, and Rezk coined th...
147
Voted
UML
2005
Springer
15 years 9 months ago
2005
Springer
Refactoring of UML class diagrams is an emerging research topic and heavily inspired by refactoring of program code written in object-oriented implementation languages. Current cla...
135
Voted
EUROSPI
2004
Springer
15 years 9 months ago
2004
Springer
Post-mortem project reviews often yield useful lessons learned. These project reviews are mostly recorded in plain text. This makes it difficult to derive useful overall findings ...
141
click to vote
FLOPS
2004
Springer
15 years 9 months ago
2004
Springer
We propose a semantic framework for modelling the linear usage of continuations in typed call-by-name programming languages. On the semantic side, we introduce a construction for c...