Sciweavers

624 search results - page 37 / 125
» The Complexity of Type Analysis of Object Oriented Programs
Sort
View
CORR
2006
Springer
86views Education» more  CORR 2006»
13 years 7 months ago
Improving Precision of Type Analysis Using Non-Discriminative Union
This paper presents a new type analysis for logic programs. The analysis is performed with a priori type definitions; and type expressions are formed from a fixed alphabet of type...
Lunjin Lu
SERP
2003
13 years 9 months ago
Polymorphism in Object-Oriented Contract Verification
The role that design by contract plays in the specification, monitoring, and reuse of classes is of increasing importance in the OO community. Although recognizably useful, neverth...
Isabel Nunes
ENTCS
2008
175views more  ENTCS 2008»
13 years 7 months ago
AGAPIA v0.1: A Programming Language for Interactive Systems and Its Typing System
A model (consisting of rv-systems), a core programming language (for developing rv-programs), several specification and analysis techniques appropriate for modeling, programming a...
Cezara Dragoi, Gheorghe Stefanescu
ICALP
2000
Springer
13 years 11 months ago
Average Bit-Complexity of Euclidean Algorithms
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
Ali Akhavi, Brigitte Vallée
ER
1995
Springer
152views Database» more  ER 1995»
13 years 11 months ago
A Logic Framework for a Semantics of Object-Oriented Data Modeling
We describe a (meta) formalism for defining a variety of (object oriented) data models in a unified framework based on a variation of first-order logic. As specific example we use...
Olga De Troyer, Robert Meersman