Sciweavers

282 search results - page 56 / 57
» Propositional Fusion Rules
Sort
View
PPDP
2005
Springer
14 years 29 days ago
Formal validation of pattern matching code
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....
Claude Kirchner, Pierre-Etienne Moreau, Antoine Re...
JELIA
2000
Springer
13 years 11 months ago
An Algorithmic Approach to Recover Inconsistent Knowledge-Bases
Abstract. We consider an algorithmic approach for revising inconsistent data and restoring its consistency. This approach detects the\spoiled" part of the data (i.e., the set ...
Ofer Arieli
CADE
2011
Springer
12 years 7 months ago
Experimenting with Deduction Modulo
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
Guillaume Burel
ICC
2009
IEEE
176views Communications» more  ICC 2009»
14 years 2 months ago
Error Resilient Non-Asymmetric Slepian-Wolf Coding
Abstract—We consider non-asymmetric distributed source coding (DSC) that achieves any point in the Slepian-Wolf (SW) region. We study the error propagation phenomena and propose ...
Cédric Herzet, Velotiaray Toto-Zarasoa, Ali...
ICFP
1999
ACM
13 years 11 months ago
Type Inference Builds a Short Cut to Deforestation
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
Olaf Chitil