504 search results - page 88 / 101 » Reasoning about local properties in modal logic |
177
click to vote
CCS
2006
ACM
15 years 10 months ago
2006
ACM
Type systems for secure information flow aim to prevent a program from leaking information from variables classified as H to variables classified as L. In this work we extend such...
161
click to vote
ESOP
2012
Springer
14 years 2 months ago
2012
Springer
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
176
Voted
ECCV
2004
Springer
16 years 3 days ago
2004
Springer
ABSTRACT We describe theoretical principles of an imaging modality that uses the acoustic response of an object to a highly localized dynamic radiation force of an ultrasound field...
199
click to vote
TPHOL
2008
IEEE
16 years 1 months ago
2008
IEEE
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
137
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...