46 search results - page 6 / 10 » Computational Soundness of Formal Indistinguishability and S... |
82
Voted
TODAES
1998
14 years 12 months ago
1998
Abstract State Machines (ASMs) provide a sound mathematical basis for the specification and verification of systems. An application of the ASM methodology to the verification of a ...
214
Voted
POPL
2005
ACM
16 years 16 days ago
2005
ACM
In traditional information-flow type systems, the security policy is often formalized as noninterference properties. However, noninterference alone is too strong to express securi...
TLCA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. This paper proposes two typing systems for session interactions in higherorder mobile processes. Session types for the HOπ-calculus capture high-level structures nicatio...
116
click to vote
ICFP
2003
ACM
16 years 5 days ago
2003
ACM
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
196
click to vote
POPL
2006
ACM
16 years 16 days ago
2006
ACM
This article investigates formal properties of a family of semantically sound flow-sensitive type systems for tracking information flow in simple While programs. The family is ind...