Article

Free access

The SLam calculus: programming with secrecy and integrity

Authors:

Jon G. RieckeAuthors Info & Claims

POPL '98: Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Pages 365 - 377

https://doi.org/10.1145/268946.268976

Published: 21 January 1998 Publication History

Abstract

The SLam calculus is a typed λ-calculus that maintains security information as well as type information. The type system propagates security information for each object in four forms: the object's creators and readers, and the object's indirect creators and readers (i.e., those agents who, through flow-of-control or the actions of other agents, can influence or be influenced by the content of the object). We prove that the type system prevents security violations and give some examples of its power.

References

[1]

M. Abadi. Secrecy by typing in security protocols. In Theoretical Aspects of Computer Software: Third Internationa~ S),mpositun, volume 1281 of Lect. Notes in Computer Sci. Springer-Verlag, 1997.

Digital Library

[2]

M. Abadi and A. E). Gordon. A calculus for cryptographle protocols: The spi calculus. In Proceedings of the 4th ACM Conference on Computer and Commun&ations Secu. r/ty, pages 36--47, 1997.

Digital Library

[3]

G. Andrews and.R. Reitman. An axiomatic approach to information flow in programs. A CM Trans. Programming Lan. guages and Systems, 2(1):56--76, 1980.

Digital Library

[4]

J. Banatre, C. Bryce, and D. L. Met~iyer. Compile-time detection of information flow in sequential programs, in Europearl Symposium oa Research in Computer Security, number 875 in Leer. Notes in Computer Sei., pages 55-73. Springer- Verlag, i994.

Digital Library

[5]

L. Cardelli. Amber. In Combinators and f, nctional programming languages, Proceedings of the 13th Sn~mner School of the LITP, volume 242 of Leer. Notes in Compu;er ScL Spfinger-Ver{ag, 1986.

Digital Library

[6]

D. Denning. Secure Information Flow in Computer Systems, Phi) thesis, Purdue University, 1975.

Digital Library

[7]

D. Denning. A lattice model of seeureinformat{on flow, Commun. ACM, I9(5):236-242, 1976.

Digital Library

[8]

D. Denning and P. Denning. Certification of programs for secure ~nformation flow. Commun. ACbl, 20(7):504--513, 1977,

Digital Library

[9]

M. Felleisen. The theory and practice of first-class prompts. In Conference Record of the Fifteenth Annual A CM Symposium on Principles of Programming Langt~ages, pages 180-- 190. ACM, 1988.

Digital Library

[10]

D. McCullough. Noninterference and the composabillty of security properties. In 19881EEE Symposium on SecuriJy and Privacy, pages 177-186, 1988.

[11]

R. Milner, M. Torte, R. Harper, and D. MaeQueen. Tl~e Deft. n ition of Standard ML (Revised). MIT Press, 1997.

Digital Library

[12]

J. C. Mitchell. Foundations for Programming Lang~ages, MIT Press, 1996.

Digital Library

[13]

A. C. Myers and B. Liskov. A decentralized model for information flow control. In Proceedings of the Sixteenth ACM Symposiwn on Operating Systems Principles. ACM Press, 1997.

Digital Library

[14]

J. Palsberg and P. ~rba~k. Trust in the X-calculus. In Proceedings of the 1995 Static Analysis Symposium, number 983 hL Leer. Notes in Computer $ci. Spdnger-Verlag, 1995.

[15]

A. M. Pitts. Relational properties of domains. Information and Computation, t27:66-90, 1996.

[16]

G. D. Plotkin. A structural appr6aeh to operational semantics. Technical Report DAIMI FN-19, Aarhus Univ., Com. puti~r Science Dept., Denmark, 1981.

[17]

G. D. Plotkin. (Towards a) logic for computable functions, Unpublished manuscript, CSLI Summer School Notes, 1985,

[18]

J. C. Reynolds. Types, abstraction and parametric polyrnorphism. In R. E. A. Mason, editor, Information Processing 83, pages 513-523. Noah Holland, Amsterdam, 1983.

[19]

G. Smith and D. Volpana. Secure information flow in a multithreaded imperative language. In Conference Record of the Twenty-Fifth Annual ACM Sympo.~hun on Principles of Pro. gramming Languages. ACM, 1998.

Digital Library

[20]

J.-P. Talpin and P. Jouvelot. Polymorphie type, region and effect inference. Journal of Functional Programming, 2:245- 271, 1992.

[21]

D. Volpano and G. Smith. Eliminating covert flows with minimum typings. In Proceedings of the Tenth IEEE Computer Security Foundations Workshop. IEEE Computer Society, 1997.

Digital Library

[22]

D. Volpano and G. Smith. A type-based approach to program security. In TAPSOFT'97: Theory and Practice of Software Development, volume 1214 of Lect. Notes b~ Computer Sci. Springer-Vedag, 1997.

Digital Library

[23]

D. Volpano, G. Smith, and 12. Irvine. A sound type system for secure flow analysis. Journal of Computer Security, 4(3):1- 21, 1995.

Digital Library

Cited By

Parolini FMiné A(2024)Sound Abstract Nonexploitability AnalysisVerification, Model Checking, and Abstract Interpretation10.1007/978-3-031-50521-8_15(314-337)Online publication date: 15-Jan-2024
https://dl.acm.org/doi/10.1007/978-3-031-50521-8_15
Xu YZhang MWang XChen JLiang RZhen YZhen C(2024)A Review of Code Vulnerability Detection Techniques Based on Static AnalysisComputational and Experimental Simulations in Engineering10.1007/978-3-031-44947-5_21(251-272)Online publication date: 25-Jan-2024
https://doi.org/10.1007/978-3-031-44947-5_21
Zakhour GWeisenburger PSalvaneschi G(2023)Type-Checking CRDT ConvergenceProceedings of the ACM on Programming Languages10.1145/35912767:PLDI(1365-1388)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591276
Show More Cited By

Recommendations

Label dependent lambda calculus and gradual typing

Dependently-typed programming languages are gaining importance, because they can guarantee a wide range of properties at compile time. Their use in practice is often hampered because programmers have to provide very precise types. Gradual typing is a ...
Java bytecode as a typed term calculus
PPDP '02: Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming

We propose a type system for the Java bytecode language, prove the type soundness, and develop a type inference algorithm. In contrast to the existing proposals, our type system yields a typed term calculus similar to type systems of lambda calculi. ...
Interpretations of the gradually-typed lambda calculus
Scheme '12: Proceedings of the 2012 Annual Workshop on Scheme and Functional Programming

Gradual typing is an approach to integrating static and dynamic type checking within the same language [Siek and Taha 2006]. Given the name "gradual typing", one might think that the most interesting aspect is the type system. It turns out that the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

POPL '98: Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

January 1998

403 pages

ISBN:0897919793

DOI:10.1145/268946

Chairmen:
David B. MacQueen
Bell Labs
,
Luca Cardelli
Digital Equipment Corp.

Copyright © 1998 ACM.

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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 January 1998

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

POPL98

Sponsor:

POPL98: Symposium on Principles of Programming Languages

January 19 - 21, 1998

California, San Diego, USA

Acceptance Rates

POPL '98 Paper Acceptance Rate 32 of 175 submissions, 18%;

Overall Acceptance Rate 824 of 4,130 submissions, 20%

Upcoming Conference

POPL '25

Sponsor:
sigplan

The 52nd Annual ACM SIGPLAN Symposium on Principles of Programming Languages

January 19 - 25, 2025

Denver , CO , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

343
Total Citations
View Citations
283
Total Downloads

Downloads (Last 12 months)82
Downloads (Last 6 weeks)6

Reflects downloads up to 27 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

Parolini FMiné A(2024)Sound Abstract Nonexploitability AnalysisVerification, Model Checking, and Abstract Interpretation10.1007/978-3-031-50521-8_15(314-337)Online publication date: 15-Jan-2024
https://dl.acm.org/doi/10.1007/978-3-031-50521-8_15
Xu YZhang MWang XChen JLiang RZhen YZhen C(2024)A Review of Code Vulnerability Detection Techniques Based on Static AnalysisComputational and Experimental Simulations in Engineering10.1007/978-3-031-44947-5_21(251-272)Online publication date: 25-Jan-2024
https://doi.org/10.1007/978-3-031-44947-5_21
Zakhour GWeisenburger PSalvaneschi G(2023)Type-Checking CRDT ConvergenceProceedings of the ACM on Programming Languages10.1145/35912767:PLDI(1365-1388)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591276
Surbatovich MSpargo NJia LLucia B(2023)A Type System for Safe Intermittent ComputingProceedings of the ACM on Programming Languages10.1145/35912507:PLDI(736-760)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591250
Hainry EPéchoux R(2023)A General Noninterference Policy for Polynomial TimeProceedings of the ACM on Programming Languages10.1145/35712217:POPL(806-832)Online publication date: 11-Jan-2023
https://dl.acm.org/doi/10.1145/3571221
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
Accetti CYing RLiu P(2022)Structured Combinators for Efficient Graph ReductionIEEE Computer Architecture Letters10.1109/LCA.2022.319884421:2(73-76)Online publication date: 1-Jul-2022
https://doi.org/10.1109/LCA.2022.3198844
Choudhury PEades HWeirich S(2022)A Dependent Dependency CalculusProgramming Languages and Systems10.1007/978-3-030-99336-8_15(403-430)Online publication date: 29-Mar-2022
https://doi.org/10.1007/978-3-030-99336-8_15
Brant CShrestha PMixon-Baca BChen KVarlioglu SElsayed NJin YCrandall JOliveira D(2021)Challenges and Opportunities for Practical and Effective Dynamic Information Flow TrackingACM Computing Surveys10.1145/348379055:1(1-33)Online publication date: 23-Nov-2021
https://dl.acm.org/doi/10.1145/3483790
Hirsch ACecchetti E(2021)Giving semantics to program-counter labels via secure effectsProceedings of the ACM on Programming Languages10.1145/34343165:POPL(1-29)Online publication date: 4-Jan-2021
https://dl.acm.org/doi/10.1145/3434316
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents