3776 search results - page 211 / 756 » Partition-Based Logical Reasoning |
99
Voted
CADE
2008
Springer
16 years 4 months ago
2008
Springer
Abstract. The application area of security protocols raises several problems that are relevant to automated deduction. We describe in this note some of these challenges.
122
click to vote
CADE
2007
Springer
16 years 4 months ago
2007
Springer
We develop a formalization of the Size-Change Principle in Isabelle/HOL and use it to construct formally certified termination proofs for recursive functions automatically.
108
click to vote
CADE
2006
Springer
16 years 4 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...
101
click to vote
CADE
2004
Springer
16 years 4 months ago
2004
Springer
We describe a formalization of asymptotic O notation using the Isabelle/HOL proof assistant.
