Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleJanuary 2001
Modules, abstract types, and distributed versioning
POPL '01: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languagesJanuary 2001, Pages 236–247https://doi.org/10.1145/360204.360225In a wide-area distributed system it is often impractical to synchronise software updates, so one must deal with many coexisting versions. We study static typing support for modular wide-area programming, modelling separate compilation/linking and ...
Also Published in:
ACM SIGPLAN Notices: Volume 36 Issue 3March 2001 - ArticleJanuary 2001
Avoiding exponential explosion: generating compact verification conditions
POPL '01: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languagesJanuary 2001, Pages 193–205https://doi.org/10.1145/360204.360220Current verification condition (VC) generation algorithms, such as weakest preconditions, yield a VC whose size may be exponential in the size of the code fragment being checked. This paper describes a two-stage VC generation algorithm that generates ...
Also Published in:
ACM SIGPLAN Notices: Volume 36 Issue 3March 2001 - ArticleJanuary 2001
Stratified operational semantics for safety and correctness of the region calculus
POPL '01: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languagesJanuary 2001, Pages 155–165https://doi.org/10.1145/360204.360217The region analysis of Tofte and Talpin is an attempt to determine statically the life span of dynamically allocated objects. But the calculus is at once intuitively simple, yet deceptively subtle, and previous theoretical analyses have been ...
Also Published in:
ACM SIGPLAN Notices: Volume 36 Issue 3March 2001 - ArticleJanuary 2001
Oracle-based checking of untrusted software
POPL '01: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languagesJanuary 2001, Pages 142–154https://doi.org/10.1145/360204.360216We present a variant of Proof-Carrying Code (PCC) in which the trusted inference rules are represented as a higherorder logic program, the proof checker is replaced by a nondeterministic higher-order logic interpreter and the proof by an oracle ...
Also Published in:
ACM SIGPLAN Notices: Volume 36 Issue 3March 2001 - ArticleJanuary 2001
A generic type system for the Pi-calculus
POPL '01: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languagesJanuary 2001, Pages 128–141https://doi.org/10.1145/360204.360215We propose a general, powerful framework of type systems for the π-calculus, and show that we can obtain as its instances a variety of type systems guaranteeing non-trivial properties like deadlock-freedom and race-freedom. A key idea is to express ...
Also Published in:
ACM SIGPLAN Notices: Volume 36 Issue 3March 2001 -
- ArticleJanuary 2001
The size-change principle for program termination
POPL '01: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languagesJanuary 2001, Pages 81–92https://doi.org/10.1145/360204.360210The "size-change termination" principle for a first-order functional language with well-founded data is: a program terminates on all inputs if every infinite call sequence (following program control flow) would cause an infinite descent in some data ...
Also Published in:
ACM SIGPLAN Notices: Volume 36 Issue 3March 2001 - ArticleJanuary 2001
Verifying safety properties of concurrent Java programs using 3-valued logic
POPL '01: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languagesJanuary 2001, Pages 27–40https://doi.org/10.1145/360204.360206We provide a parametric framework for verifying safety properties of concurrent Java programs. The framework combines thread-scheduling information with information about the shape of the heap. This leads to error-detection algorithms that are more ...
Also Published in:
ACM SIGPLAN Notices: Volume 36 Issue 3March 2001 - ArticleJanuary 2001
Programming language methods in computer security
POPL '01: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languagesJanuary 2001, Pages 1–26https://doi.org/10.1145/360204.360205This invited talk will give a personal view of the field of computer security and summarize some ways that methods from the study of programming language principles can be applied to problems in computer security. Some background information is provided ...
Also Published in:
ACM SIGPLAN Notices: Volume 36 Issue 3March 2001