Sciweavers

9841 search results - page 1570 / 1969
» Task-Centred Information Management
Sort
View
POPL
2007
ACM
16 years 7 months ago
Dynamic heap type inference for program understanding and debugging
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...
Ben Liblit, Chloë W. Schulze, Marina Polishch...
POPL
2006
ACM
16 years 7 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam
OSDI
2006
ACM
16 years 7 months ago
CRAMM: Virtual Memory Support for Garbage-Collected Applications
Existing virtual memory systems usually work well with applications written in C and C++, but they do not provide adequate support for garbage-collected applications. The performa...
Ting Yang, Emery D. Berger, Scott F. Kaplan, J. El...
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
16 years 7 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
2009
ACM
175views Database» more  SIGMOD 2009»
16 years 7 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes
« Prev « First page 1570 / 1969 Last » Next »