650 search results - page 109 / 130 » Logical Bisimulations and Functional Languages |
108
click to vote
ENTCS
2010
15 years 14 days ago
2010
This paper presents a formal framework for compositional reasoning about secure systems. A key insight is to view a trusted system in terms of the interfaces that the various comp...
108
Voted
ICSOC
2009
Springer
14 years 10 months ago
2009
Springer
Several activities in service oriented computing can benefit from knowing ahead of time future properties of a given service composition. In this paper we focus on how statically i...
105
Voted
POPL
2010
ACM
15 years 9 months ago
2010
ACM
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
200
Voted
POPL
2004
ACM
16 years 22 days ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
DRM
2007
Springer
15 years 6 months ago
2007
Springer
The goal of obfuscation is to transform a program, without affecting its functionality, such that some secret information within the program can be hidden for as long as possible...