Sciweavers

858 search results - page 104 / 172
» Abstract Interpretation Based Verification of Logic Programs
Sort
View
TCS
2011
14 years 10 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
ML
2008
ACM
150views Machine Learning» more  ML 2008»
15 years 3 months ago
Learning probabilistic logic models from probabilistic examples
Abstract. We revisit an application developed originally using Inductive Logic Programming (ILP) by replacing the underlying Logic Program (LP) description with Stochastic Logic Pr...
Jianzhong Chen, Stephen Muggleton, José Car...
CADE
2000
Springer
15 years 7 months ago
The Nuprl Open Logical Environment
Abstract. The Nuprl system is a framework for reasoning about mathematics and programming. Over the years its design has been substantially improved to meet the demands of large-sc...
Stuart F. Allen, Robert L. Constable, Richard Eato...
CORR
2011
Springer
170views Education» more  CORR 2011»
14 years 9 months ago
A Model for Coherent Distributed Memory For Race Condition Detection
—We present a new model for distributed shared memory systems, based on remote data accesses. Such features are offered by network interface cards that allow one-sided operations...
Franck Butelle, Camille Coti
LISP
2008
96views more  LISP 2008»
15 years 3 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal