2608 search results - page 76 / 522 » Subjects, Models, Languages, Transformations |
181
click to vote
POPL
2009
ACM
16 years 16 days ago
2009
ACM
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, an...
POPL
2010
ACM
15 years 3 days ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
AI
2000
Springer
14 years 11 months ago
2000
Springer
Credal networks are models that extend Bayesian nets to deal with imprecision in probability, and can actually be regarded as sets of Bayesian nets. Evidence suggests that credal ...
POPL
2012
ACM
13 years 7 months ago
2012
ACM
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
BTW
2007
Springer
15 years 6 months ago
2007
Springer
: Information integration requires manipulating data and metadata in ways that in general go beyond a single existing transformation formalism. As a result, a complete source-to-ta...