Sciweavers

967 search results - page 71 / 194
» Probabilistic Predicative Programming
Sort
View
ILP
2000
Springer
15 years 6 months ago
Bayesian Logic Programs
First-order probabilistic models are recognized as efficient frameworks to represent several realworld problems: they combine the expressive power of first-order logic, which serv...
Kristian Kersting, Luc De Raedt
ECOOP
1999
Springer
15 years 6 months ago
Wide Classes
Abstract. This paper introduces the concepts of wide classes and widening as extensions to the object model of class-based languages such as Java and Smalltalk. Widening allows an ...
Manuel Serrano
ICALP
2010
Springer
15 years 7 months ago
Compositional Closure for Bayes Risk in Probabilistic Noninterference
We give a quantitative sequential model for noninterference security with probability (but not demonic choice), and a novel refinement order that we prove to be the greatest compo...
Annabelle McIver, Larissa Meinicke, Carroll Morgan
125
Voted
ESOP
2005
Springer
15 years 8 months ago
A Type System Equivalent to a Model Checker
ite-state abstraction scheme such as predicate abstraction. The type system, which is also parametric, type checks exactly those programs that are accepted by the model checker. It...
Mayur Naik, Jens Palsberg
ICTAC
2009
Springer
15 years 9 months ago
The Secret Art of Computer Programming
“Classical” program development by refinement [12, 2, 3] is a technique for ensuring that source-level program code remains faithful to the semantic goals set out in its corre...
Annabelle McIver