Representation independence, confinement and access control [extended abstract]

DOI10.1145/503272.503289zbMath1323.68352OpenAlexW2030601112MaRDI QIDQ5178904

David A. Naumann, Anindya Banerjee

Publication date: 17 March 2015

Published in: Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/503272.503289

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Towards imperative modules: reasoning about invariants and sharing of mutable state, On assertion-based encapsulation for object invariants and simulations, A semantic model of confinement and locality theorem, Resources, concurrency, and local reasoning, Observational purity and encapsulation, Abstraction for concurrent objects, Universe Types for Topology and Encapsulation