Coffeestrainer: Statically-checked constraints on the definition and use of types in java

10Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Usually, programming languages are used according to conventions and rules. Although general rules can be enforced by lint-like tools, there is a large class of rules that cannot be built into such tools because they result from particular design decisions or the reuse of existing software. This paper presents a system, called CoffeeStrainer, that statifically checks programmer-specified constraints on Java programs. Unlike previous approaches, which only support constraints that apply to definitions of types, CoffeeStrainer additionally supports a second class of constraints which apply to all uses of a type. Both classes of constraints play an important role for object-oriented class libraries and frameworks, which often make assumptions on their correct use. © Springer-Verlag Berlin Heidelberg 1999.

Cite

CITATION STYLE

APA

Bokowski, B. (1999). Coffeestrainer: Statically-checked constraints on the definition and use of types in java. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1687 LNCS, pp. 355–374). Springer Verlag. https://doi.org/10.1007/3-540-48166-4_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free