Sciweavers

767 search results - page 103 / 154
» Logic for Mathematical Writing
Sort
View
ICLP
2009
Springer
14 years 8 months ago
A Language for Large Ensembles of Independently Executing Nodes
We address how to write programs for distributed computing systems in which the network topology can change dynamically. Examples of such systems, which we call ensembles, include ...
Michael P. Ashley-Rollman, Peter Lee, Seth Copen G...
PPOPP
2009
ACM
14 years 8 months ago
Serialization sets: a dynamic dependence-based parallel execution model
This paper proposes a new parallel execution model where programmers augment a sequential program with pieces of code called serializers that dynamically map computational operati...
Matthew D. Allen, Srinath Sridharan, Gurindar S. S...
POPL
2006
ACM
14 years 8 months ago
Small bisimulations for reasoning about higher-order imperative programs
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
Vasileios Koutavas, Mitchell Wand
POPL
2005
ACM
14 years 8 months ago
Automated soundness proofs for dataflow analyses and transformations via local rules
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
Sorin Lerner, Todd D. Millstein, Erika Rice, Craig...
ICCS
2009
Springer
14 years 2 months ago
Access Policy Design Supported by FCA Methods
Role Based Access Control (RBAC) is a methodology for providing users in an IT system specific permissions like write or read to t abstracts from specific users and binds permiss...
Frithjof Dau, Martin Knechtel