Sciweavers

407 search results - page 33 / 82
» Automatic Correctness Proofs for Logic Program Transformatio...
Sort
View
PPDP
2009
Springer
14 years 2 months ago
An embedded declarative data transformation language
We introduce a logic programming framework for data type transformations based on isomorphisms between elementary data types (natural numbers, finite functions, sets and permutat...
Paul Tarau
ESOP
2010
Springer
14 years 5 months ago
Faulty Logic: Reasoning about Fault Tolerant Programs
Transient faults are single-shot hardware errors caused by high energy particles from space, manufacturing defects, overheating, and other sources. Such faults can be devastating f...
Matthew L. Meola and David Walker
PPDP
2010
Springer
13 years 5 months ago
Semantics-preserving translations between linear concurrent constraint programming and constraint handling rules
The Constraint Simplification Rules (CSR) subset of CHR and the flat subset of LCC, where agent nesting is restricted, are very close syntactically and semantically. The first con...
Thierry Martinez
CC
2010
Springer
172views System Software» more  CC 2010»
14 years 2 months ago
Verifying Local Transformations on Relaxed Memory Models
The problem of locally transforming or translating programs without altering their semantics is central to the construction of correct compilers. For concurrent shared-memory progr...
Sebastian Burckhardt, Madanlal Musuvathi, Vasu Sin...
DKE
2008
114views more  DKE 2008»
13 years 7 months ago
Proof explanation for a nonmonotonic Semantic Web rules language
In this work, we present the design and implementation of a system for proof explanation in the Semantic Web, based on defeasible reasoning. Trust is a vital feature for Semantic ...
Grigoris Antoniou, Antonis Bikakis, Nikos Dimaresi...