Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleDecember 2008
Verified interoperable implementations of security protocols
ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 31, Issue 1Article No.: 5, Pages 1–61https://doi.org/10.1145/1452044.1452049We present an architecture and tools for verifying implementations of security protocols. Our implementations can run with both concrete and symbolic implementations of cryptographic algorithms. The concrete implementation is for production and ...
- research-articleOctober 2008
Verifying policy-based web services security
ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 30, Issue 6Article No.: 30, Pages 1–59https://doi.org/10.1145/1391956.1391957WS-SecurityPolicy is a declarative language for configuring web services security mechanisms. We describe a formal semantics for WS-SecurityPolicy and propose a more abstract language for specifying secure links between web services and their clients. ...
- articleAugust 2007
A type discipline for authorization policies
ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 29, Issue 5Pages 25–eshttps://doi.org/10.1145/1275497.1275500Distributed systems and applications are often expected to enforce high-level authorization policies. To this end, the code for these systems relies on lower-level security mechanisms such as digital signatures, local ACLs, and encrypted communications. ...
- articleJanuary 2006
Computability classes for enforcement mechanisms
ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 28, Issue 1Pages 175–205https://doi.org/10.1145/1111596.1111601A precise characterization of those security policies enforceable by program rewriting is given. This also exposes and rectifies problems in prior work, yielding a better characterization of those security policies enforceable by execution monitors as ...
- articleJanuary 2004
Access control for mobile agents: The calculus of boxed ambients
ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 26, Issue 1Pages 57–124https://doi.org/10.1145/963778.963781Boxed Ambients are a variant of Mobile Ambients that result from dropping the open capability and introducing new primitives for ambient communication. The new model of communication is faithful to the principles of distribution and location-awareness ...
- articleMay 2003
Stack inspection: Theory and variants
ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 25, Issue 3Pages 360–399https://doi.org/10.1145/641909.641912Stack inspection is a security mechanism implemented in runtimes such as the JVM and the CLR to accommodate components with diverse levels of trust. Although stack inspection enables the fine-grained expression of access control policies, it has rather ...
- articleApril 1985
Detecting global variables in denotational specifications
ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 7, Issue 2Pages 299–310https://doi.org/10.1145/3318.3323Sufficient criteria are given for replacing all occurrences of the store argument in a Scott-Strachey denotational definition of a programming language by a single global variable. The criteria and transformation are useful for transforming denotational ...
- articleApril 1985
CIRCAL and the representation of communication, concurrency, and time
ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 7, Issue 2Pages 270–298https://doi.org/10.1145/3318.3322The CIRCAL calculus is presented as a mathematical framework in which to describe and analyze concurrent systems, whether hardware or software.
The dot operator is used to compose CIRCAL descriptions, and it is this operator which permits the natural ...
- articleJanuary 1985
On convergence toward a database of program transformations
ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 7, Issue 1Pages 1–9https://doi.org/10.1145/2363.2364Several fairly large sets of programming rules have been developed recently. It is natural to ask whether the process of developing such rule bases may converge. Having developed sets of rules for specific programming tasks and domains, will they be ...