Sciweavers

624 search results - page 15 / 125
» The Complexity of Type Analysis of Object Oriented Programs
Sort
View
OOPSLA
1997
Springer
13 years 11 months ago
Query-Based Debugging of Object-Oriented Programs
Object relationships in modern software systems are becoming increasingly numerous and complex. Programmers who try to find violations of such relationships need new tools that al...
Raimondas Lencevicius, Urs Hölzle, Ambuj K. S...
ECOOP
1997
Springer
13 years 11 months ago
Subtyping Is Not a Good "Match" for Object-Oriented Languages
We present the design and rationale of a new statically-typed object-oriented language, LOOM. LOOM retains most of the features of the earlier language PolyTOIL. However the subtyp...
Kim B. Bruce, Leaf Petersen, Adrian Fiech
FASE
2000
Springer
13 years 11 months ago
Verification of Object Oriented Programs Using Class Invariants
A proof system is presented for the verification and derivation of object oriented programs with as main features strong typing, dynamic binding, and inheritance. The proof system...
Kees Huizing, Ruurd Kuiper
ICFP
2006
ACM
14 years 7 months ago
Towards an automatic complexity analysis for generic programs
Generic libraries, such as the C++ Standard Template Library (STL), provide flexible, high-performance algorithms and data types, along with functional specifications and performa...
Kyle D. Ross
OOPSLA
1989
Springer
13 years 11 months ago
Virtual Classes: A Powerful Mechanism in Object-Oriented Programming
The notions of class, subclass and virtual procedure are fairly well understood and recognized as some of the key concepts in object-oriented programming. The possibility of modif...
Ole Lehrmann Madsen, Birger Møller-Pedersen