Sciweavers

2111 search results - page 102 / 423
» How to Program Pervasive Systems
Sort
View
222
Voted
POPL
2004
ACM
16 years 29 days 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
89
Voted
INFSOF
1998
72views more  INFSOF 1998»
15 years 9 days ago
Validation of measurement software as an application of slicing and constraint solving
We show how to combine program slicing and constraint solving in order to obtain better slice accuracy. The method is used in the VALSOFT slicing system. One particular applicatio...
Jens Krinke, Gregor Snelting
CSFW
1998
IEEE
15 years 4 months ago
Probabilistic Noninterference in a Concurrent Language
In previous work [16], we give a type system that guarantees that well-typed multithreaded programs are possibilistically noninterfering. If thread scheduling is probabilistic, ho...
Dennis M. Volpano, Geoffrey Smith
84
Voted
ICML
2008
IEEE
16 years 1 months ago
Space-indexed dynamic programming: learning to follow trajectories
We consider the task of learning to accurately follow a trajectory in a vehicle such as a car or helicopter. A number of dynamic programming algorithms such as Differential Dynami...
J. Zico Kolter, Adam Coates, Andrew Y. Ng, Yi Gu, ...
POPL
2006
ACM
16 years 29 days ago
On flow-sensitive security types
This article investigates formal properties of a family of semantically sound flow-sensitive type systems for tracking information flow in simple While programs. The family is ind...
Sebastian Hunt, David Sands