Sciweavers

Share
POPL
2006
ACM
9 years 11 months ago
Hybrid type checking
Traditional static type systems are very effective for verifying basic interface specifications, but are somewhat limited in the kinds specificationsthey support. Dynamically-chec...
Cormac Flanagan
POPL
2006
ACM
9 years 11 months ago
The next 700 data description languages
In the spirit of Landin, we present a calculus of dependent types to serve as the semantic foundation for a family of languages called data description languages. Such languages, ...
Kathleen Fisher, Yitzhak Mandelbaum, David Walker
POPL
2006
ACM
9 years 11 months ago
A virtual class calculus
Virtual classes are class-valued attributes of objects. Like virtual methods, virtual classes are defined in an object's class and may be redefined within subclasses. They re...
Erik Ernst, Klaus Ostermann, William R. Cook
POPL
2006
ACM
9 years 11 months ago
N-synchronous Kahn networks: a relaxed model of synchrony for real-time systems
Albert Cohen, Marc Duranton, Christine Eisenbeis, ...
POPL
2006
ACM
9 years 11 months ago
Certified assembly programming with embedded code pointers
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
Zhaozhong Ni, Zhong Shao
POPL
2006
ACM
9 years 11 months ago
Harmless advice
This paper defines an object-oriented language with harmless aspect-oriented advice. A piece of harmless advice is a computation that, like ordinary aspect-oriented advice, execut...
Daniel S. Dantas, David Walker
POPL
2006
ACM
9 years 11 months ago
Adventures in time and space
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
Norman Danner, James S. Royer
POPL
2006
ACM
9 years 11 months ago
Fast and loose reasoning is morally correct
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...
Nils Anders Danielsson, John Hughes, Patrik Jansso...
POPL
2006
ACM
9 years 11 months ago
A logic for information flow in object-oriented programs
This paper specifies, via a Hoare-like logic, an interprocedural and flow sensitive (but termination insensitive) information flow analysis for object-oriented programs. Pointer a...
Torben Amtoft, Sruthi Bandhakavi, Anindya Banerjee
POPL
2006
ACM
9 years 11 months ago
A fixpoint calculus for local and global program flows
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan
books