Sciweavers

2137 search results - page 404 / 428
» Proving Abstract Non-interference
Sort
View
CIAC
2003
Springer
98views Algorithms» more  CIAC 2003»
14 years 3 months ago
Improving Customer Proximity to Railway Stations
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
Evangelos Kranakis, Paolo Penna, Konrad Schlude, D...
HYBRID
2010
Springer
14 years 3 months ago
Safe compositional network sketches: formal framework
NetSketch is a tool for the specification of constrained-flow applications and the certification of desirable safety properties imposed thereon. NetSketch assists system integr...
Azer Bestavros, Assaf J. Kfoury, Andrei Lapets, Mi...
PLDI
2010
ACM
14 years 2 months ago
Line-up: a complete and automatic linearizability checker
Modular development of concurrent applications requires threadsafe components that behave correctly when called concurrently by multiple client threads. This paper focuses on line...
Sebastian Burckhardt, Chris Dern, Madanlal Musuvat...
PLDI
2010
ACM
14 years 2 months ago
Mint: Java multi-stage programming using weak separability
Multi-stage programming (MSP) provides a disciplined approach to run-time code generation. In the purely functional setting, it has been shown how MSP can be used to reduce the ov...
Edwin Westbrook, Mathias Ricken, Jun Inoue, Yilong...
CPAIOR
2010
Springer
14 years 2 months ago
Solving Connected Subgraph Problems in Wildlife Conservation
Abstract. We investigate mathematical formulations and solution techniques for a variant of the Connected Subgraph Problem. Given a connected graph with costs and profits associat...
Bistra N. Dilkina, Carla P. Gomes