Sciweavers

393 search results - page 19 / 79
» The Program Decision Logic Approach to Predicated Execution
Sort
View
ICFP
2010
ACM
13 years 7 months ago
ReCaml: execution state as the cornerstone of reconfigurations
Most current techniques fail to achieve the dynamic update of recursive functions. A focus on execution states appears to be essential in order to implement dynamic update in this...
Jérémy Buisson, Fabien Dagnat
AGP
2003
IEEE
14 years 25 days ago
Time Equations for Lazy Functional (Logic) Languages
There are very few approaches to measure the execution costs of lazy functional (logic) programs. The use of a lazy execution mechanism implies that the complexity of an evaluation...
Elvira Albert, Josep Silva, Germán Vidal
VMCAI
2009
Springer
14 years 2 months ago
Towards Automatic Stability Analysis for Rely-Guarantee Proofs
The Rely-Guarantee approach is a well-known compositional method for proving Hoare logic properties of concurrent programs. In this approach, predicates in the proof must be proved...
Hasan Amjad, Richard Bornat
ICLP
1995
Springer
13 years 11 months ago
Operational Semantics of Constraint Logic Programs with Coroutining
The semantics of constraint logic programming languages with coroutining facilities (\freeze," suspension, residuation, etc.) cannot be fully declarative; thus, an operationa...
Andreas Podelski, Gert Smolka
JMLR
2006
112views more  JMLR 2006»
13 years 7 months ago
Kernels on Prolog Proof Trees: Statistical Learning in the ILP Setting
We develop kernels for measuring the similarity between relational instances using background knowledge expressed in first-order logic. The method allows us to bridge the gap betw...
Andrea Passerini, Paolo Frasconi, Luc De Raedt