Sciweavers

8132 search results - page 43 / 1627
» Dependability, Abstraction, and Programming
Sort
View
PLDI
2009
ACM
15 years 4 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
VMCAI
2007
Springer
15 years 4 months ago
Better Under-Approximation of Programs by Hiding Variables
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...
Thomas Ball, Orna Kupferman
HPCN
1995
Springer
15 years 1 months ago
Using optimistic execution techniques as a parallelisation tool for general purpose computing
Abstract. Optimistic execution techniques are widely used in the field of parallel discrete event simulation. In this paper we discuss the use of optimism as a technique for paral...
Adam Back, Stephen Turner
IFIP
2010
Springer
14 years 4 months ago
Information Flow Analysis via Path Condition Refinement
We present a new approach to information flow control (IFC), ploits counterexample-guided abstraction refinement (CEGAR) technology. The CEGAR process is built on top of our existi...
Mana Taghdiri, Gregor Snelting, Carsten Sinz
FLOPS
2006
Springer
15 years 1 months ago
iData for the World Wide Web - Programming Interconnected Web Forms
Abstract. In this paper we present the iData Toolkit. It allows programmers to create interactive, dynamic web applications with state on evel of abstraction. The key element of th...
Rinus Plasmeijer, Peter Achten