317 search results - page 37 / 64 » Deductive Program Repair |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. The basic aim of our study is to give a possible model for handling uncertain information. This model is worked out in the framework of DATALOG. At first the concept of f...
85
Voted
ENTCS
2008
14 years 9 months ago
2008
We automatically verify Back's atomicity refinement law and a classical data refinement law for action systems. Our novel approach mechanises a refinement calculus based on K...
103
click to vote
MSCS
2000
14 years 9 months ago
2000
This paper introduces a Hilbert system for lambda calculus called sequent combinators. Sequent combinators address many of the problems of Hilbert systems, which have led to the m...
OOPSLA
2010
Springer
14 years 8 months ago
2010
Springer
In logic metaprogramming, programs are not stored as plain textfiles but rather derived from a deductive database. While the benefits of this approach for metaprogramming are ob...
CPAIOR
2004
Springer
15 years 3 months ago
2004
Springer
To improve solution robustness, we introduce the concept of super solutions to constraint programming. An (a, b)-super solution is one in which if a variables lose their values, th...