Sciweavers

1452 search results - page 81 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
132
Voted
ENTCS
2002
134views more  ENTCS 2002»
15 years 4 days ago
Implementing Compositional Analysis Using Intersection Types With Expansion Variables
A program analysis is compositional when the analysis result for a particular program fragment is obtained solely from the results for its immediate subfragments via some composit...
Assaf J. Kfoury, Geoffrey Washburn, Joe Wells
APLAS
2006
ACM
15 years 6 months ago
XML Validation for Context-Free Grammars
String expression analysis conservatively approximates the possible string values generated by a program. We consider the validation of a context-free grammar obtained by the analy...
Yasuhiko Minamide, Akihiko Tozawa
POPL
2006
ACM
16 years 20 days ago
A fixpoint calculus for local and global program flows
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan
117
Voted
WEBDB
2010
Springer
173views Database» more  WEBDB 2010»
15 years 5 months ago
Manimal: Relational Optimization for Data-Intensive Programs
The MapReduce distributed programming framework is very popular, but currently lacks the optimization techniques that have been standard with relational database systems for many ...
Michael J. Cafarella, Christopher Ré
DBPL
2007
Springer
103views Database» more  DBPL 2007»
15 years 4 months ago
Datalog Programs over Infinite Databases, Revisited
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
Sara Cohen, Joseph Gil, Evelina Zarivach