short-paper

A Perspective on the Dependency Core Calculus

Author:

Maximilian AlgehedAuthors Info & Claims

PLAS '18: Proceedings of the 13th Workshop on Programming Languages and Analysis for Security

Pages 24 - 28

https://doi.org/10.1145/3264820.3264823

Published: 15 January 2018 Publication History

Get Access

Abstract

This paper presents a simple but equally expressive vari- ant on the terminating fragment of the Dependency Core Calculus (DCC) of Abadi et al. [2]. DCC is a concise and elegant calculus for tracking dependency. The calculus has applications in, among other areas, information flow control, slicing, and binding time analysis. However, in this paper we show that it is possible to replace a core technical device in DCC with an alternative, simpler, formulation. The calculus has a denotational semantics in the same domain as DCC, using which we prove that the two calculi are equivalent. As a proof of concept to show that our calculus provides a simple analysis of dependency we implement it in Haskell, obtaining a simpler implementation compared to previous work [4].

References

[1]

Martín Abadi. 2007. Access control in a core calculus of dependency. Electronic Notes in Theoretical Computer Science 172 (2007), 5--31.

Digital Library

Google Scholar

[2]

Martín Abadi, Anindya Banerjee, Nevin Heintze, and Jon G Riecke. 1999. A core calculus of dependency. In Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages. ACM, 147--160.

Digital Library

Google Scholar

[3]

Alejandro Aguirre, Gilles Barthe, Marco Gaboardi, Deepak Garg, and Pierre-Yves Strub. 2017. A relational logic for higher-order programs. Proceedings of the ACM on Programming Languages 1, ICFP (2017), 21.

Digital Library

Google Scholar

[4]

Maximilian Algehed and Alejandro Russo. 2017. Encoding DCC in Haskell. In Proceedings of the 2017 Workshop on Programming Languages and Analysis for Security. ACM, 77--89.

Digital Library

Google Scholar

[5]

Robert Atkey. 2009. Parameterised notions of computation. Journal of functional programming 19, 3--4 (2009), 335--376.

Digital Library

Google Scholar

[6]

Ana Bove, Peter Dybjer, and Ulf Norell. 2009. A brief overview of Agda--a functional language with dependent types. In International Conference on Theorem Proving in Higher Order Logics. Springer, 73--78.

Digital Library

Google Scholar

[7]

William J Bowman and Amal Ahmed. 2015. Noninterference for free. ACM SIGPLAN Notices 50, 9 (2015), 101--113.

Digital Library

Google Scholar

[8]

Pablo Buiras, Dimitrios Vytiniotis, and Alejandro Russo. 2015. HLIO: Mixing static and dynamic typing for information-flow control in Haskell. In ACM SIGPLAN Notices, Vol. 50. ACM, 289--301.

Digital Library

Google Scholar

[9]

Marco Gaboardi, Shin-ya Katsumata, Dominic Orchard, Flavien Breuvart, and Tarmo Uustalu. 2016. Combining effects and coeffects via grading. In ACM SIGPLAN Notices, Vol. 51. ACM, 476--489.

Digital Library

Google Scholar

[10]

Paul Hudak, Simon Peyton Jones, Philip Wadler, Brian Boutel, Jon Fairbairn, Joseph Fasel, María M Guzmán, Kevin Hammond, John Hughes, Thomas Johnsson, et al. 1992. Report on the programming language Haskell: a non-strict, purely functional language version 1.2. ACM SigPlan notices 27, 5 (1992), 1--164.

Digital Library

Google Scholar

[11]

Benjamin C Pierce. 1991. Basic category theory for computer scientists. MIT press.

Digital Library

Google Scholar

[12]

Benjamin C Pierce. 2002. Types and programming languages. MIT press.

Digital Library

Google Scholar

[13]

Stephen Tse and Steve Zdancewic. 2004. Translating dependency into parametricity. In ACM SIGPLAN Notices, Vol. 39. ACM, 115--125.

Digital Library

Google Scholar

[14]

Philip Wadler. 1998. The marriage of effects and monads. In ACM SIGPLAN Notices, Vol. 34. ACM, 63--74.

Digital Library

Google Scholar

Cited By

View all

Choudhury P(2022)Monadic and comonadic aspects of dependency analysisProceedings of the ACM on Programming Languages10.1145/35633356:OOPSLA2(1320-1348)Online publication date: 31-Oct-2022
https://dl.acm.org/doi/10.1145/3563335
Algehed MBernardy JHriţcu C(2021)Dynamic IFC Theorems for Free!2021 IEEE 34th Computer Security Foundations Symposium (CSF)10.1109/CSF51468.2021.00005(1-14)Online publication date: Jun-2021
https://doi.org/10.1109/CSF51468.2021.00005
Abel ABernardy J(2020)A unified view of modalities in type systemsProceedings of the ACM on Programming Languages10.1145/34089724:ICFP(1-28)Online publication date: 3-Aug-2020
https://dl.acm.org/doi/10.1145/3408972
Show More Cited By

Index Terms

A Perspective on the Dependency Core Calculus
1. Security and privacy
  1. Formal methods and theory of security
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types
        Functional languages

Recommendations

A core calculus of dependency
POPL '99: Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Notions of program dependency arise in many settings: security, partial evaluation, program slicing, and call-tracking. We argue that there is a central notion of dependency common to these settings that can be captured within a single calculus, the ...
Translating dependency into parametricity
ICFP '04

Abadi et al. introduced the dependency core calculus (DCC) as a unifying framework to study many important program analyses such as binding time, information flow, slicing, and function call tracking. DCC uses a lattice of monads and a nonstandard ...
Translating dependency into parametricity
ICFP '04: Proceedings of the ninth ACM SIGPLAN international conference on Functional programming

Abadi et al. introduced the dependency core calculus (DCC) as a unifying framework to study many important program analyses such as binding time, information flow, slicing, and function call tracking. DCC uses a lattice of monads and a nonstandard ...

Comments

Information & Contributors

Information

Published In

PLAS '18: Proceedings of the 13th Workshop on Programming Languages and Analysis for Security

October 2018

59 pages

ISBN:9781450359931

DOI:10.1145/3264820

General Chairs:
Mário S. Alvim
UFMG, Brazil
,
Stéphanie Delaune
Univ Rennes, CNRS, IRISA, France

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 January 2018

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Short-paper

Conference

CCS '18

Sponsor:

SIGSAC

CCS '18: 2018 ACM SIGSAC Conference on Computer and Communications Security

October 15 - 19, 2018

Toronto, Canada

Acceptance Rates

PLAS '18 Paper Acceptance Rate 2 of 4 submissions, 50%;

Overall Acceptance Rate 43 of 77 submissions, 56%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
205
Total Downloads

Downloads (Last 12 months)13
Downloads (Last 6 weeks)2

Reflects downloads up to 14 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Choudhury P(2022)Monadic and comonadic aspects of dependency analysisProceedings of the ACM on Programming Languages10.1145/35633356:OOPSLA2(1320-1348)Online publication date: 31-Oct-2022
https://dl.acm.org/doi/10.1145/3563335
Algehed MBernardy JHriţcu C(2021)Dynamic IFC Theorems for Free!2021 IEEE 34th Computer Security Foundations Symposium (CSF)10.1109/CSF51468.2021.00005(1-14)Online publication date: Jun-2021
https://doi.org/10.1109/CSF51468.2021.00005
Abel ABernardy J(2020)A unified view of modalities in type systemsProceedings of the ACM on Programming Languages10.1145/34089724:ICFP(1-28)Online publication date: 3-Aug-2020
https://dl.acm.org/doi/10.1145/3408972
Algehed MBernardy J(2019)Simple noninterference from parametricityProceedings of the ACM on Programming Languages10.1145/33416933:ICFP(1-22)Online publication date: 26-Jul-2019
https://dl.acm.org/doi/10.1145/3341693

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

A core calculus of dependency

Translating dependency into parametricity

Translating dependency into parametricity

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Index Terms

Recommendations

A core calculus of dependency

Translating dependency into parametricity

Translating dependency into parametricity

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations