Sciweavers

1882 search results - page 286 / 377
» Transformational Programming and Forests
Sort
View
132
Voted
ICALP
2005
Springer
15 years 10 months ago
A Better Approximation Ratio for the Vertex Cover Problem
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...
George Karakostas
SAS
2005
Springer
15 years 10 months ago
Secure Information Flow as a Safety Problem
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...
Tachio Terauchi, Alexander Aiken
UML
2005
Springer
15 years 10 months ago
Refactoring OCL Annotated UML Class Diagrams
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...
Slavisa Markovic, Thomas Baar
149
Voted
EUROSPI
2004
Springer
15 years 10 months ago
Discovering the Relation Between Project Factors and Project Success in Post-mortem Evaluations
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 ...
Joost J. P. Schalken, Sjaak Brinkkemper, Hans van ...
156
Voted
FLOPS
2004
Springer
15 years 10 months ago
Semantics of Linear Continuation-Passing in Call-by-Name
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...
Masahito Hasegawa