Sciweavers

317 search results - page 31 / 64
» Deductive Program Repair
Sort
View
WLP
1997
Springer
15 years 1 months ago
Extending Homeomorphic Embedding in the Context of Logic Programming
Recently well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure the termination of program analysis, specialisation and transform...
Michael Leuschel
ENTCS
2008
101views more  ENTCS 2008»
14 years 9 months ago
Imperative LF Meta-Programming
Logical frameworks have enjoyed wide adoption as meta-languages for describing deductive systems. While the techniques for representing object languages in logical frameworks are ...
Aaron Stump
AGP
2010
IEEE
15 years 2 months ago
Proof-Theoretic and Higher-Order Extensions of Logic Programming
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstr...
Alberto Momigliano, Mario Ornaghi
JAR
2008
98views more  JAR 2008»
14 years 9 months ago
A Mechanical Analysis of Program Verification Strategies
We analyze three proof strategies commonly used in deductive verification of deterministic sequential programs formalized with operational semantics. The strategies are: (i) stepw...
Sandip Ray, Warren A. Hunt Jr., John Matthews, J. ...
AMAI
2006
Springer
14 years 9 months ago
Possibilistic uncertainty handling for answer set programming
In this work, we introduce a new framework able to deal with a reasoning that is at the same time non monotonic and uncertain. In order to take into account a certainty level assoc...
Pascal Nicolas, Laurent Garcia, Igor Stépha...