Sciweavers

506 search results - page 67 / 102
» Where Is the Value in a Program Verifier
Sort
View
ICALP
2003
Springer
15 years 5 months ago
Quantitative Analysis of Probabilistic Lossy Channel Systems
Many protocols are designed to operate correctly even in the case where the underlying communication medium is faulty. To capture the behaviour of such protocols, lossy channel sy...
Alexander Moshe Rabinovich
112
Voted
SIGCOMM
2010
ACM
15 years 22 days ago
capDL: a language for describing capability-based systems
Capabilities provide an access control model that can be used to construct systems where safety of protection can be precisely determined. However, in order to be certain of the s...
Ihor Kuz, Gerwin Klein, Corey Lewis, Adam Walker
ENTCS
2007
100views more  ENTCS 2007»
15 years 14 days ago
Type-Safe Code Transformations in Haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
108
Voted
AAECC
2005
Springer
128views Algorithms» more  AAECC 2005»
15 years 13 days ago
The size-change principle and dependency pairs for termination of term rewriting
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
René Thiemann, Jürgen Giesl
CORR
2007
Springer
111views Education» more  CORR 2007»
15 years 10 days ago
A New Perspective on Multi-user Power Control Games in Interference Channels
This paper considers the problem of how to allocate power among competing users sharing a frequency-selective interference channel. We model the interaction between these selfish ...
Yi Su, Mihaela van der Schaar