2000 search results - page 66 / 400 » Program Transformation and Proof Transformation |
119
click to vote
ESOP
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. The Bayesian approach to machine learning amounts to inferring posterior distributions of random variables from a probabilistic model of how the variables are related (th...
ICSR
2000
Springer
15 years 1 months ago
2000
Springer
A serious problem of most transformation-based generators is that they are trying to achieve three mutually antagonistic goals simultaneously: 1) deeply factored operators and oper...
JAR
2006
14 years 10 months ago
2006
The dependency pair technique [1, 11, 12] is a powerful method for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates ...
103
click to vote
XSYM
2004
Springer
15 years 3 months ago
2004
Springer
We show that it is possible to extend a general-purpose programming language with a convenient high-level data-type for manipulating XML documents while permitting (1) precise stat...
107
click to vote
PLDI
2006
ACM
15 years 4 months ago
2006
ACM
Constructing correct concurrent garbage collection algorithms is notoriously hard. Numerous such algorithms have been proposed, implemented, and deployed – and yet the relations...