Sciweavers

498 search results - page 73 / 100
» A Formal Foundation for XrML
Sort
View
ICFP
2005
ACM
15 years 9 months ago
Modular verification of concurrent assembly code with dynamic thread creation and termination
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...
Xinyu Feng, Zhong Shao
TLDI
2005
ACM
151views Formal Methods» more  TLDI 2005»
15 years 3 months ago
Strict bidirectional type checking
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...
Adam J. Chlipala, Leaf Petersen, Robert Harper
KR
2004
Springer
15 years 3 months ago
Evidence and Belief
We discuss the representation of knowledge and of belief from the viewpoint of decision theory. While the Bayesian approach enjoys general-purpose applicability and axiomatic foun...
Itzhak Gilboa, David Schmeidler
HICSS
1999
IEEE
115views Biometrics» more  HICSS 1999»
15 years 2 months ago
Focusing on Mobility
In this paper, we motivate the importance of the field of mobile computing and survey current practical and formal approaches. We argue that the existing formalisms are not suffic...
Klaus Bergner, Radu Grosu, Andreas Rausch, Alexand...
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 1 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts