Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Sebastian Hunt"'
Publikováno v:
Proceedings of the ACM on Programming Languages. 7:1987-2016
This paper proposes a reconciliation of two different theories of information. The first, originally proposed in a lesser-known work by Claude Shannon, describes how the information content of channels can be described qualitatively, but still abstra
Autor:
David Sands, Sebastian Hunt
Publikováno v:
CSF
Information flow properties are the semantic cornerstone of a wide range of program transformations, program analyses, and security properties. The variety of information that can be transmitted from inputs to outputs in a deterministic system can be
Autor:
Sebastian Hunt, David Sands
Publikováno v:
From Lambda Calculus to Cybersecurity Through Program Analysis ISBN: 9783030411022
From Lambda Calculus to Cybersecurity Through Program Analysis
From Lambda Calculus to Cybersecurity Through Program Analysis
Static program analysis, once seen primarily as a tool for optimising programs, is now increasingly important as a means to provide quality guarantees about programs. One measure of quality is the extent to which programs respect the privacy of user
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0c45a9112256a16ea312fbfe98f1b916
https://doi.org/10.1007/978-3-030-41103-9_10
https://doi.org/10.1007/978-3-030-41103-9_10
Publikováno v:
Journal of Computer Security
We propose an approach to quantify interference in a simple imperative language that includes a looping construct. In this paper we focus on a particular case of this definition of interference: leakage of information from private variables to public
Autor:
David Sands, Sebastian Hunt
Publikováno v:
POPL
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 indexed by the choice of flow lattice.By choosing the flow lattice to be t
Publikováno v:
Journal of Logic and Computation. 15:181-199
This paper uses Shannon's information theory to give a quantitative definition of information flow in systems that transform inputs to outputs. For deterministic systems, the definition is shown to specialize to a simpler form when the information so
Publikováno v:
Computer Languages, Systems & Structures. 28:3-28
In this paper we present an approach to information flow analysis for a family of languages. We start with a simple imperative language. We present an information flow analysis using a flow logic. The paper contains detailed correctness proofs for th
Autor:
Sebastian Hunt, Chris Hankin
Publikováno v:
ESOP
Much of the earlier development of abstract interpretation, and its application to imperative programming languages, has concerned techniques for finding fixed points in large (often infinite) lattices. The standard approach in the abstract interpret
Publikováno v:
Information Systems Security ISBN: 9783642255595
ICISS
ICISS
We consider the problem of logical data erasure, contrasting with physical erasure in the same way that end-to-end information flow control contrasts with access control. We present a semantic hierarchy for erasure policies, using a possibilistic kno
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::369f93079ccdd88c2ec85f3d55822395
https://doi.org/10.1007/978-3-642-25560-1_24
https://doi.org/10.1007/978-3-642-25560-1_24
Autor:
Sebastian Hunt, Chris Hankin
Publikováno v:
Journal of Functional Programming. 1:91-120
Abstract interpretation is the collective name for a family of semantics-based techniques for compile-time analysis of programs. One of the most costly operations in automating such analyses is the computation of fixed points. The frontiers algorithm