438 search results - page 10 / 88 » On theorem proving in annotated logics |
TPHOL
2002
IEEE
14 years 11 days ago
2002
IEEE
g Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 ...
CADE
2006
Springer
14 years 7 months ago
2006
Springer
We describe here a formal proof in the Coq system of the structure theorem for subresultants, which allows to prove formally the correctness of our implementation of the subresulta...
FMCAD
2008
Springer
13 years 9 months ago
2008
Springer
We present a method for verifying information flow properties of software programs using inductive assertions and theorem proving. Given a program annotated with information flow a...
TABLEAUX
2005
Springer
14 years 28 days ago
2005
Springer
The Intuitionistic Logic Theorem Proving (ILTP) Library provides a platfom for testing and benchmarking theorem provers for first-order intuitionistic logic. It includes a collect...
FASE
2000
Springer
13 years 11 months ago
2000
Springer
We present a family of tools for program development and verification, comprising the transformation system TAS and the theorem proving interface IsaWin. Both are based on the theo...