Sciweavers

51 search results - page 5 / 11
» Flow Logic for Imperative Objects
Sort
View
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 7 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner
SLOGICA
2008
101views more  SLOGICA 2008»
13 years 7 months ago
A Dynamic-Logical Perspective on Quantum Behavior
In this paper we show how recent concepts from Dynamic Logic, and in particular from Dynamic Epistemic logic, can be used to model and interpret quantum behavior. Our main thesis ...
Alexandru Baltag, Sonja Smets
POPL
2004
ACM
14 years 7 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
TLDI
2010
ACM
198views Formal Methods» more  TLDI 2010»
13 years 7 months ago
Verifying event-driven programs using ramified frame properties
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...
Neel R. Krishnaswami, Lars Birkedal, Jonathan Aldr...
ASPDAC
2007
ACM
129views Hardware» more  ASPDAC 2007»
13 years 11 months ago
ECO-system: Embracing the Change in Placement
In a realistic design flow, circuit and system optimizations must interact with physical aspects of the design. For example, improvements in timing and power may require replacing ...
Jarrod A. Roy, Igor L. Markov