Sciweavers

191 search results - page 27 / 39
» Second-Order Programs with Preconditions
Sort
View
FOSSACS
2006
Springer
13 years 11 months ago
A Logic of Reachable Patterns in Linked Data-Structures
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The ...
Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sag...
PLDI
2009
ACM
14 years 2 months ago
On PDG-based noninterference and its modular proof
We present the first machine-checked correctness proof for information flow control (IFC) based on program dependence graphs (PDGs). IFC based on slicing and PDGs is flow-sensi...
Daniel Wasserrab, Denis Lohner, Gregor Snelting
IJCAI
1997
13 years 8 months ago
Reasoning about Concurrent Execution Prioritized Interrupts, and Exogenous Actions in the Situation Calculus
As an alternative to planning, an approach to highlevel agent control based on concurrent program execution is considered. A formal definition in the situation calculus of such a ...
Giuseppe De Giacomo, Yves Lespérance, Hecto...
EOR
2008
70views more  EOR 2008»
13 years 7 months ago
Robust portfolio selection based on a multi-stage scenario tree
The aim of this paper is to apply the concept of robust optimization introduced by Bel-Tal and Nemirovski to the portfolio selection problems based on multi-stage scenario trees. ...
Ruijun Shen, Shuzhong Zhang
SAC
2010
ACM
13 years 5 months ago
A machine-checked soundness proof for an efficient verification condition generator
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...
Frédéric Vogels, Bart Jacobs 0002, F...