Sciweavers

4725 search results - page 353 / 945
» Dependence-Based Program Analysis
Sort
View
PLDI
2004
ACM
16 years 21 days ago
The set constraint/CFL reachability connection in practice
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
John Kodumal, Alexander Aiken
SIGSOFT
2004
ACM
16 years 21 days ago
Verifying aspect advice modularly
Aspect-oriented programming has become an increasingly important means of expressing cross-cutting program abstractions. Despite this, aspects lack support for computeraided veri...
Shriram Krishnamurthi, Kathi Fisler, Michael Green...
DOCENG
2008
ACM
15 years 9 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, ...
VL
2010
IEEE
247views Visual Languages» more  VL 2010»
15 years 5 months ago
Cleanroom: Edit-Time Error Detection with the Uniqueness Heuristic
Many dynamic programming language features, such as implicit declaration, reflection, and code generation, make it difficult to verify the existence of identifiers through standar...
Andrew J. Ko, Jacob O. Wobbrock
OOPSLA
2001
Springer
15 years 11 months ago
Points-To Analysis for Java using Annotated Constraints
The goal of points-to analysis for Java is to determine the set of objects pointed to by a reference variable or a reference object field. This information has a wide variety of ...
Atanas Rountev, Ana Milanova, Barbara G. Ryder