2920 search results - page 544 / 584 » Finite information logic |
POPL
2007
ACM
14 years 10 months ago
2007
ACM
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...
POPL
2006
ACM
14 years 10 months ago
2006
ACM
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...
CADE
2001
Springer
14 years 10 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
SIGMOD
2009
ACM
14 years 10 months ago
2009
ACM
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...
ICFP
2003
ACM
14 years 9 months ago
2003
ACM
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...