Sciweavers

1597 search results - page 167 / 320
» A Design Method for Object-Oriented Programming
Sort
View
PLDI
2004
ACM
15 years 8 months ago
Cloning-based context-sensitive pointer alias analysis using binary decision diagrams
This paper presents the first scalable context-sensitive, inclusionbased pointer alias analysis for Java programs. Our approach to context sensitivity is to create a clone of a m...
John Whaley, Monica S. Lam
WEA
2007
Springer
158views Algorithms» more  WEA 2007»
15 years 9 months ago
A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree...
Markus Behle, Michael Jünger, Frauke Liers
ENTCS
2008
73views more  ENTCS 2008»
15 years 3 months ago
Invariants for Non-Hierarchical Object Structures
We present a Hoare-style specification and verification approach for invariants in sequential OO programs. It allows invariants over nonhierarchical object structures, in which upd...
Ronald Middelkoop, Cornelis Huizing, Ruurd Kuiper,...
PLDI
2003
ACM
15 years 8 months ago
Static array storage optimization in MATLAB
An adaptation of the classic register allocation algorithm to the problem of array storage optimization in MATLAB is presented. The method involves the decomposition of an interfe...
Pramod G. Joisha, Prithviraj Banerjee
OOPSLA
2010
Springer
15 years 1 months ago
Task types for pervasive atomicity
Atomic regions are an important concept in correct concurrent programming: since atomic regions can be viewed as having executed in a single step, atomicity greatly reduces the nu...
Aditya Kulkarni, Yu David Liu, Scott F. Smith