CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

A Datalog Semantics for Paralocks

Bart van Delft (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)) ; Niklas Broberg (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)) ; David Sands (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers))
8th International Workshop, STM 2012, Pisa, Italy, September 13-14, 2012, Revised Selected Papers (0302-9743). Vol. 7783 (2013), p. 305-320.
[Konferensbidrag, refereegranskat]

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.

Nyckelord: information flow, security policy language, datalog

Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2014-01-08. Senast ändrad 2017-09-14.
CPL Pubid: 191855


Läs direkt!

Länk till annan sajt (kan kräva inloggning)