Sciweavers

1392 search results - page 10 / 279
» Dynamic Data Structure Analysis for Java Programs
Sort
View
PLDI
2012
ACM
13 years 1 days ago
Scalable and precise dynamic datarace detection for structured parallelism
Existing dynamic race detectors suffer from at least one of the following three limitations: (i) space overhead per memory location grows linearly with the number of parallel thre...
Raghavan Raman, Jisheng Zhao, Vivek Sarkar, Martin...
110
Voted
DOCENG
2008
ACM
14 years 11 months ago
A concise XML binding framework facilitates practical object-oriented document engineering
Semantic web researchers tend to assume that XML Schema and OWL-S are the correct means for representing the types, structure, and semantics of XML data used for documents and int...
Andruid Kerne, Zachary O. Toups, Blake Dworaczyk, ...
73
Voted
SODA
2004
ACM
82views Algorithms» more  SODA 2004»
14 years 11 months ago
Dynamizing static algorithms, with applications to dynamic trees and history independence
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
Umut A. Acar, Guy E. Blelloch, Robert Harper, Jorg...
ECOOP
1999
Springer
15 years 1 months ago
Inlining of Virtual Methods
We discuss aspects of inlining of virtual method invocations. First, we introduce a new method test to guard inlinings of such invocations, with a di erent set of tradeo s from the...
David Detlefs, Ole Agesen
PLDI
2004
ACM
15 years 3 months ago
Jedd: a BDD-based relational extension of Java
In this paper we present Jedd, a language extension to Java that supports a convenient way of programming with Binary Decision Diagrams (BDDs). The Jedd language abstracts BDDs as...
Ondrej Lhoták, Laurie J. Hendren