Sciweavers

96 search results - page 8 / 20
» Diagnosing Java Programs with Static Abstractions of Data St...
Sort
View
TACS
1997
Springer
13 years 11 months ago
Type System for Specializing Polymorphism
Abstract. Flexibility of programming and efficiency of program execution are two important features of a programming language. Unfortunately, however, there is an inherent conflict...
Atsushi Ohori
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
13 years 6 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv
SAC
2004
ACM
14 years 1 months ago
Adding wildcards to the Java programming language
This paper describes wildcards, a new language construct designed to increase the flexibility of object-oriented type systems with parameterized classes. Based on the notion of v...
Mads Torgersen, Christian Plesner Hansen, Erik Ern...
ICSE
1997
IEEE-ACM
13 years 11 months ago
Lackwit: A Program Understanding Tool Based on Type Inference
By determining, statically, where the structure of a program requires sets of variables to share a common tation, we can identify abstract data types, detect ion violations, find ...
Robert O'Callahan, Daniel Jackson
ITA
2007
153views Communications» more  ITA 2007»
13 years 7 months ago
Deciding inclusion of set constants over infinite non-strict data structures
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
Manfred Schmidt-Schauß, David Sabel, Marko S...