Sciweavers

1391 search results - page 264 / 279
» Completeness of Neighbourhood Logic
Sort
View
POPL
2005
ACM
14 years 10 months ago
Precise interprocedural analysis using random interpretation
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
Sumit Gulwani, George C. Necula
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
14 years 10 months ago
A comparison of flexible schemas for software as a service
A multi-tenant database system for Software as a Service (SaaS) should offer schemas that are flexible in that they can be extended for different versions of the application and d...
Stefan Aulbach, Dean Jacobs, Alfons Kemper, Michae...
SIGMOD
2008
ACM
120views Database» more  SIGMOD 2008»
14 years 10 months ago
Muse: a system for understanding and designing mappings
Schema mappings are logical assertions that specify the relationships between a source and a target schema in a declarative way. The specification of such mappings is a fundamenta...
Bogdan Alexe, Laura Chiticariu, Renée J. Mi...
POPL
2010
ACM
14 years 7 months ago
Pure Subtype Systems
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...
DeLesley S. Hutchins
POPL
2010
ACM
14 years 7 months ago
Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno