1452 search results - page 137 / 291 » Algorithmic Analysis of Array-Accessing Programs |
PLDI
2004
ACM
15 years 6 months ago
2004
ACM
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...
93
Voted
SIGSOFT
2004
ACM
15 years 6 months ago
2004
ACM
Aspect-oriented programming has become an increasingly important means of expressing cross-cutting program abstractions. Despite this, aspects lack support for computeraided veriï...
144
Voted
DOCENG
2008
ACM
15 years 2 months ago
2008
ACM
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...
95
Voted
IPPS
1995
IEEE
15 years 4 months ago
1995
IEEE
Abstract. To e ectively parallelize real programs, parallelizing compilers need powerful symbolic analysis techniques 13, 6 . In previous work we have introduced an algorithm calle...
102
Voted
LCPC
1995
Springer
15 years 4 months ago
1995
Springer
Abstract. To e ectively parallelize real programs, parallelizing compilers need powerful symbolic analysis techniques 13, 6]. In previous work we have introduced an algorithm calle...