Sciweavers

1597 search results - page 139 / 320
» A Design Method for Object-Oriented Programming
Sort
View
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
15 years 7 months ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
PLDI
2006
ACM
15 years 9 months ago
Refactoring programs to secure information flows
Adding a sound information flow security policy to an existing program is a difficult task that requires major analysis of and changes to the program. In this paper we show how ...
Scott F. Smith, Mark Thober
ECOOP
2006
Springer
15 years 6 months ago
Demeter Interfaces: Adaptive Programming Without Surprises
Adaptive Programming (AP) allows for the separate definition of data structures and traversals with attached computations, performed during the traversal, that operate on these dat...
Therapon Skotiniotis, Jeffrey Palm, Karl J. Lieber...
AFP
2004
Springer
105views Formal Methods» more  AFP 2004»
15 years 8 months ago
Epigram: Practical Programming with Dependent Types
Abstraction and application, tupling and projection: these provide the ‘software engineering’ superstructure for programs, and our familiar type systems ensure that these opera...
Conor McBride
SAC
2003
ACM
15 years 8 months ago
TinyGALS: A Programming Model for Event-Driven Embedded Systems
Networked embedded systems such as wireless sensor networks are usually designed to be event-driven so that they are reactive and power efficient. Programming embedded systems wit...
Elaine Cheong, Judith Liebman, Jie Liu, Feng Zhao