A Datalog Semantics for Paralocks
Paper in proceeding, 2013

Broberg and Sands (POPL’10) introduced a logic-based policy language, Paralocks, suitable for static information-flow control in programs. Although Paralocks comes with a precise information-flow semantics for programs, the logic-based semantics of policies, describing how policies are combined and compared, is less well developed. This makes the algorithms for policy comparison and computation ad-hoc, and their security guarantees less intuitive. In this paper we provide a new semantics for Paralocks policies based on Datalog. By doing so we are able to show that the ad-hoc semantics from earlier work coincides with the natural Datalog interpretation. Furthermore we show that by having a Datalog-inspired semantics, we can borrow language extensions and algorithms from Datalog for the benefit of Paralocks. We explore how these extensions and algorithms interact with the design and implementation of Paragon, a language combining Paralocks with Java.

security policy language


information flow


Bart van Delft

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Niklas Broberg

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

David Sands

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 7783 305-320
978-3-642-38003-7 (ISBN)

Areas of Advance

Information and Communication Technology

Subject Categories

Computer and Information Science





More information