Sciweavers

1205 search results - page 26 / 241
» Program Extraction from Large Proof Developments
Sort
View
ICFP
2010
ACM
14 years 8 hour ago
VeriML: typed computation of logical terms inside a language with effects
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
Antonis Stampoulis, Zhong Shao
TPHOL
1999
IEEE
14 years 3 months ago
Three Tactic Theorem Proving
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
Don Syme
CL
2000
Springer
14 years 3 months ago
Proving Failure in Functional Logic Programs
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...
Francisco Javier López-Fraguas, Jaime S&aac...
AMAST
2004
Springer
14 years 4 months ago
A Generic Software Safety Document Generator
Abstract. Formal certification is based on the idea that a mathematical proof of some property of a piece of software can be regarded as a certificate of correctness which, in pr...
Ewen Denney, Ram Prasad Venkatesan
SIGMOD
2009
ACM
190views Database» more  SIGMOD 2009»
14 years 11 months ago
Optimizing complex extraction programs over evolving text data
Most information extraction (IE) approaches have considered only static text corpora, over which we apply IE only once. Many real-world text corpora however are dynamic. They evol...
Fei Chen 0002, Byron J. Gao, AnHai Doan, Jun Yang ...