119 search results - page 9 / 24 » Completion Is an Instance of Abstract Canonical System Infer... |
FMOODS
2008
13 years 10 months ago
2008
This paper proposes a semantics-based automatic null pointer analysis for inferring non-null annotations of fields in objectoriented programs. The analysis is formulated for a mini...
CSL
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. For a reasonable sound and complete proof calculus for firstorder logic consider the problem to decide, given a sentence of firstorder logic and a natural number n, whet...
JCDL
2006
ACM
14 years 2 months ago
2006
ACM
Citation matching, or the automatic grouping of bibliographic references that refer to the same document, is a data management problem faced by automatic digital libraries for sci...
FORTE
2009
13 years 6 months ago
2009
Abstract. Building complex component-based software systems, for instance communication systems based on the Click, Coyote, Appia, or Dream frameworks, can lead to subtle assemblag...
POPL
1994
ACM
14 years 15 days ago
1994
ACM
An important implementation decision in polymorphically typed functional programming languages is whether to represent data in boxed or unboxed form and when to transform them fro...