Mathematics of Program Construction: 12th International Conference, MPC 2015, Königswinter, Germany, June 29--July 1, 2015. Proceedings

336 Pages·2015·5.955 MB·English

by  Ralf Hinze, Janis Voigtländer (eds.)

Ralf Hinze
Janis Voigtländer (Eds.)
9
2
Mathematics
1
9

S
C of Program Construction
N
L
12th International Conference, MPC 2015
Königswinter, Germany, June 29 – July 1, 2015
Proceedings
123
Lecture Notes in Computer Science 9129
Commenced Publication in 1973
Founding and Former Series Editors:
Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen
Editorial Board
David Hutchison
Lancaster University, Lancaster, UK
Takeo Kanade
Carnegie Mellon University, Pittsburgh, PA, USA
Josef Kittler
University of Surrey, Guildford, UK
Jon M. Kleinberg
Cornell University, Ithaca, NY, USA
Friedemann Mattern
ETH Zurich, Zürich, Switzerland
John C. Mitchell
Stanford University, Stanford, CA, USA
Moni Naor
Weizmann Institute of Science, Rehovot, Israel
C. Pandu Rangan
Indian Institute of Technology, Madras, India
Bernhard Steffen
TU Dortmund University, Dortmund, Germany
Demetri Terzopoulos
University of California, Los Angeles, CA, USA
Doug Tygar
University of California, Berkeley, CA, USA
Gerhard Weikum
Max Planck Institute for Informatics, Saarbrücken, Germany
More information about this series at http://www.springer.com/series/7408
ä
Ralf Hinze Janis Voigtl nder (Eds.)
(cid:129)
Mathematics
of Program Construction
12th International Conference, MPC 2015
ö –
K nigswinter, Germany, June 29 July 1, 2015
Proceedings
123
Editors
Ralf Hinze Janis Voigtländer
University of Oxford University of Bonn
Oxford Bonn
UK Germany
ISSN 0302-9743 ISSN 1611-3349 (electronic)
Lecture Notesin Computer Science
ISBN 978-3-319-19796-8 ISBN978-3-319-19797-5 (eBook)
DOI 10.1007/978-3-319-19797-5
LibraryofCongressControlNumber:2015939987
LNCSSublibrary:SL2–ProgrammingandSoftwareEngineering
SpringerChamHeidelbergNewYorkDordrechtLondon
©SpringerInternationalPublishingSwitzerland2015
Thisworkissubjecttocopyright.AllrightsarereservedbythePublisher,whetherthewholeorpartofthe
material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation,
broadcasting, reproduction on microfilms or in any other physical way, and transmission or information
storageandretrieval,electronicadaptation,computersoftware,orbysimilarordissimilarmethodologynow
knownorhereafterdeveloped.
Theuseofgeneraldescriptivenames,registerednames,trademarks,servicemarks,etc.inthispublication
doesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevant
protectivelawsandregulationsandthereforefreeforgeneraluse.
Thepublisher,theauthorsandtheeditorsaresafetoassumethattheadviceandinformationinthisbookare
believedtobetrueandaccurateatthedateofpublication.Neitherthepublishernortheauthorsortheeditors
give a warranty, express or implied, with respect to the material contained herein or for any errors or
omissionsthatmayhavebeenmade.
Printedonacid-freepaper
SpringerInternationalPublishingAGSwitzerlandispartofSpringerScience+BusinessMedia
(www.springer.com)
Preface
ThisvolumecontainstheproceedingsofMPC2015,the12thInternationalConference
on the Mathematics of Program Construction. This conference series aims to promote
the development of mathematical principles and techniques that are demonstrably
practical and effective in the process of constructing computer programs, broadly
interpreted. The focus is on techniques that combine precision with conciseness,
enabling programs to be constructed by formal calculation.
The conference was held in Königswinter, Germany, during June 29–July 1, 2015.
The previouseleven conferences were held in 1989 inTwente,The Netherlands(with
proceedingspublishedasLNCS375);in1992inOxford,UK(LNCS669);in1995in
Kloster Irsee, Germany (LNCS 947); in 1998 in Marstrand, Sweden (LNCS 1422); in
2000inPontedeLima,Portugal(LNCS1837);in2002inDagstuhl,Germany(LNCS
2386); in 2004, in Stirling, UK (LNCS 3125); in 2006 in Kuressaare, Estonia (LNCS
4014); in 2008 in Marseille-Luminy, France (LNCS 5133); in 2010 in Lac-Beauport,
Canada (LNCS 6120); and in 2012 in Madrid, Spain (LNCS 7342).
The volume contains the abstracts of two invited talks, and 15 papers selected for
presentationbytheProgramCommitteefrom20submissions.Thequalityofthepapers
submitted to the conference was in general very high. However, the number of sub-
missionshasdecreasedcomparedtothepreviousconferencesintheseries.Eachpaper
wasrefereedbyatleastthreereviewers,andonaveragebyfour.Wearegratefultothe
members of the Program Committee and the external reviewers for their care and
diligenceinreviewingthesubmittedpapers.Thereviewprocessandcompilationofthe
proceedings were greatly helped by Andrei Voronkov’s EasyChair system, which we
can highly recommend.
June 2015 Ralf Hinze
Janis Voigtländer
Organization
Program Committee
Eerke Boiten University of Kent, UK
Jules Desharnais Université Laval, Canada
Lindsay Groves Victoria University of Wellington, New Zealand
Ralf Hinze University of Oxford, UK
Zhenjiang Hu National Institute of Informatics, Japan
Graham Hutton University of Nottingham, UK
Johan Jeuring Utrecht University and Open University,
The Netherlands
Jay McCarthy Vassar College, USA
Shin-Cheng Mu Academia Sinica, Taiwan
Bernhard Möller Universität Augsburg, Germany
Dave Naumann Stevens Institute of Technology, USA
Pablo Nogueira Universidad Politécnica de Madrid, Spain
Ulf Norell University of Gothenburg, Sweden
Bruno Oliveira The University of Hong Kong, Hong Kong,
SAR China
José Nuno Oliveira Universidade do Minho, Portugal
Alberto Pardo Universidad de la República, Uruguay
Christine Paulin-Mohring INRIA-Université Paris-Sud, France
Tom Schrijvers KU Leuven, Belgium
Emil Sekerinski McMaster University, Canada
Tim Sheard Portland State University, USA
Anya Tafliovich University of Toronto Scarborough, Canada
Tarmo Uustalu Institute of Cybernetics, Estonia
Janis Voigtländer Universität Bonn, Germany
Additional Reviewers
Bove, Ana Keuchel, Steven Roocks, Patrick
Gómez-Martínez, Elena Kozen, Dexter You, Shu-Hung
Karachalias, George Panangaden, Prakash Zelend, Andreas
Local Organizing Committee
Ralf Hinze University of Oxford, UK (Co-chair)
Janis Voigtländer Universität Bonn, Germany (Co-chair)
José Pedro Magalhães Standard Chartered Bank, UK
Nicolas Wu University of Bristol, UK
Maciej Piróg University of Oxford, UK
Invited Talks
A Nondeterministic Lattice of Information
Carroll Morgan
University of NewSouthWales, NSW 2052Australia
[email protected]
Abstract.In1993LandauerandRedmond[2]defineda“latticeofinformation,”
where a partition over the type of secret’s possible values could express the
securityresilienceofasequential,deterministicprogram:valueswithinthesame
cell of the partition are those that the programs does not allow an attacker to
distinguish.
That simple, compelling model provided not only a refinement order for
deterministic security (inverse refinement of set-partitions) but, since it is a
lattice,allowedtheconstructionofthe“least-securedeterministicprogrammore
secure than these other deterministic programs”, and its obvious dual. But
Landauer treated neither demonic nor probabilistic choice.
Later work of our own, and independently of others, suggested a
probabilistic generalisation of Landauer’s lattice [1, 3]—although it turned out
that the generalisation is only a partial order, not a lattice [5]. This talk looks
between the two structures above: I will combine earlier qualitatitve ideas [6]
with veryrecent quantitative results [4]in orderto explore
– What an appropriate purely demonic lattice of information might be, the
“meat in the sandwich” that lies between Landauer’s deterministic, quali-
tative latticeandour probabilistic partialorder.
– The importance ofcompositionality indetermining itsstructure.
– Thatitisindeedalattice,thatitgeneralises[2]andthatitisgeneralisedby
[1,3].
– Its operational significanceand, of course,
– Thoughtsonhow itmighthelp with constructing (secure) programs.
References
1.Alvim,M.S.,Chatzikokolakis,K.,Palamidessi,C.,Smith,G.:Measuringinformationleakage
using generalized gain functions. In: Proceedings of the 25th IEEE Computer Security
FoundationsSymposium (CSF 2012),pp. 265–279,June2012
2.Landauer,J.,Redmond,T.:Alatticeofinformation.In:Proceedingsofthe6thIEEEComputer
Security FoundationsWorkshop(CSFW 1993), pp.65–70, June1993
1 I am grateful for the support of the Australian ARC via its grant DP120101413, and of NICTA,
whichisfundedbytheAustralianGovernmentthroughtheDepartmentofCommunicationsandthe
AustralianResearchCouncilthroughtheICTCentre-of-ExcellenceProgram.
X C. Morgan
3. McIver, A.,Meinicke, L.,Morgan, C.: Compositional closure for bayes risk in probabilistic
noninterference.In:Abramsky,S.,Gavoille,C.,Kirchner,C.,aufderHeide,F.M.,Spirakis,
P.G.(eds.)ICALP2010,PartII.LNCS,vol.6199,pp.223–235.Springer,Heidelberg(2010)
4. McIver,A.,Meinicke,L.,Morgan,C.:AbstractHiddenMarkovModels:amonadicaccount
ofquantitative information flow.In: Proceedingsof the LiCS 2015(2015,to appear)
5. McIver, A., Morgan, C., Meinicke, L., Smith, G., Espinoza, B.: Abstract channels, gain
functions and the information order. In: FCS 2013 Workshop on Foundations of Computer
Security(2013).http://prosecco.gforge.inria.fr/personal/bblanche/fcs13/fcs13proceedings.pdf.
6. Morgan,C.:TheShadowKnows:refinementofignoranceinsequentialprograms.In:Uustalu,
T. (ed.) MPC2006. LNCS,vol.4014,pp. 359–378. Springer,Heidelberg (2006)