797 search results - page 54 / 160 » Eliminating Proofs from Programs |
120
Voted
JUCS
2006
15 years 20 days ago
2006
Abstract: We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-...
123
click to vote
CL
2000
Springer
15 years 5 months ago
2000
Springer
How to extract negative information from programs is an important issue in logic programming. Here we address the problem for functional logic programs, from a proof-theoretic pers...
95
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
118
Voted
ENTCS
2007
15 years 20 days ago
2007
In modern functional logic languages like Curry or Toy, programs are possibly non-confluent and nonterminating rewrite systems, defining possibly non-deterministic non-strict fu...
VSTTE
2005
Springer
15 years 6 months ago
2005
Springer
How close are we to a world in which mechanically verified software is commonplace? A world in which theorem proving technology is used routinely by both software developers and p...