Sciweavers

624 search results - page 54 / 125
» The Complexity of Type Analysis of Object Oriented Programs
Sort
View
PLDI
2012
ACM
11 years 10 months ago
The implicit calculus: a new foundation for generic programming
Generic programming (GP) is an increasingly important trend in programming languages. Well-known GP mechanisms, such as type classes and the C++0x concepts proposal, usually combi...
Bruno C. d. S. Oliveira, Tom Schrijvers, Wontae Ch...
SCIA
2005
Springer
174views Image Analysis» more  SCIA 2005»
14 years 1 months ago
Object Localization with Boosting and Weak Supervision for Generic Object Recognition
Abstract. This paper deals, for the first time, with an analysis of localization capabilities of weakly supervised categorization systems. Most existing categorization approaches ...
Andreas Opelt, Axel Pinz
APLAS
2006
ACM
14 years 1 months ago
A Bytecode Logic for JML and Types
This document contains the Isabelle/HOL sources underlying our paper A bytecode logic for JML and types [2], updated to Isabelle 2008. We present a program logic for a subset of s...
Lennart Beringer, Martin Hofmann
OOPSLA
2007
Springer
14 years 1 months ago
Inferring aliasing and encapsulation properties for java
There are many proposals for language techniques to control aliasing and encapsulation in object oriented programs, typically based on notions of object ownership and pointer uniq...
Kin-Keung Ma, Jeffrey S. Foster
ENTCS
2006
137views more  ENTCS 2006»
13 years 7 months ago
Coalgebraic Description of Generalized Binary Methods
We extend the Reichel-Jacobs coalgebraic account of specification and refinement of objects and classes in Object Oriented Programming to (generalized) binary methods. These are m...
Furio Honsell, Marina Lenisa, Rekha Redamalla