Sciweavers

344 search results - page 68 / 69
» Some Theorems We Should Prove
Sort
View
CCS
2006
ACM
13 years 11 months ago
Safety and consistency in policy-based authorization systems
In trust negotiation and other distributed proving systems, networked entities cooperate to form proofs that are justified by collections of certified attributes. These attributes...
Adam J. Lee, Marianne Winslett
TIC
2000
Springer
137views System Software» more  TIC 2000»
13 years 11 months ago
Scalable Certification for Typed Assembly Language
Abstract. A type-based certifying compiler maps source code to machine code and target-level type annotations. The target-level annotations make it possible to prove easily that th...
Dan Grossman, J. Gregory Morrisett
COCOA
2010
Springer
13 years 5 months ago
Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives
The classical and well-studied group testing problem is to find d defectives in a set of n elements by group tests, which tell us for any chosen subset whether it contains defectiv...
Peter Damaschke, Azam Sheikh Muhammad
GRID
2006
Springer
13 years 7 months ago
Resource Allocation in Streaming Environments
This paper considers resource allocation algorithms for processing streams of events on computational grids. For example, financial trading applications are executed on large comp...
Lu Tian, K. Mani Chandy
SOFSEM
2012
Springer
12 years 2 months ago
Turing Machines for Dummies - Why Representations Do Matter
Abstract. Various methods exists in the literature for denoting the configuration of a Turing Machine. A key difference is whether the head position is indicated by some integer ...
Peter van Emde Boas