797 search results - page 60 / 160 » Eliminating Proofs from Programs |
109
Voted
LICS
2006
IEEE
15 years 6 months ago
2006
IEEE
Hoare logic is bedevilled by complex but coarse side conditions on the use of variables. We define a logic, free of side conditions, which permits more precise statements of a pr...
181
Voted
Book
"Constructive Type theory has been a topic of research interest to computer
scientists, mathematicians, logicians and philosophers for a number of years.
For computer scient...
102
Voted
ESOP
2009
Springer
15 years 4 months ago
2009
Springer
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
116
click to vote
TPHOL
2008
IEEE
15 years 7 months ago
2008
IEEE
Slicing is a widely-used technique with applications in e.g. compiler technology and software security. Thus verification of algorithms in these areas is often based on the correc...
ICDAR
2009
IEEE
15 years 7 months ago
2009
IEEE
In this paper, we make an attempt to use Inductive Logic Programming (ILP) to automatically learn non trivial descriptions of symbols, based on a formal description. This work is ...