Sciweavers

1017 search results - page 40 / 204
» Higher-Order Logic Programming Languages with Constraints: A...
Sort
View
68
Voted
ICFP
2004
ACM
15 years 9 months ago
Relating models of backtracking
Past attempts to relate two well-known models of backtracking computation have met with only limited success. We relate these two models using logical relations. We accommodate hi...
Mitchell Wand, Dale Vaillancourt
APLAS
2007
ACM
15 years 1 months ago
The Semantics of "Semantic Patches" in Coccinelle: Program Transformation for the Working Programmer
We rationally reconstruct the core of the Coccinelle system, used for automating and documenting collateral evolutions in Linux device drivers. A denotational semantics of the syst...
Neil D. Jones, René Rydhof Hansen
LPAR
1992
Springer
15 years 1 months ago
From the Past to the Future: Executing Temporal Logic Programs
We describe some of the techniques which have been used to implement METATEM, a programming language based on temporal logic, and address problems such as non-determinism and loopi...
Michael Fisher, Richard Owens
ML
2006
ACM
122views Machine Learning» more  ML 2006»
14 years 9 months ago
PRL: A probabilistic relational language
In this paper, we describe the syntax and semantics for a probabilistic relational language (PRL). PRL is a recasting of recent work in Probabilistic Relational Models (PRMs) into ...
Lise Getoor, John Grant
PLDI
2009
ACM
15 years 10 months ago
A decision procedure for subset constraints over regular languages
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
Pieter Hooimeijer, Westley Weimer