203 search results - page 5 / 41 » Proof Reflection in Coq |
ESOP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lat...
CADE
2006
Springer
14 years 8 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...
TASE
2009
IEEE
14 years 2 months ago
2009
IEEE
Population protocols are an elegant model recently introduced for distributed algorithms running in large and unreliable networks of tiny mobile agents. Correctness proofs of such...
LPAR
2000
Springer
13 years 11 months ago
2000
Springer
We propose a new tactic language for the system goq, which is intended to enrich the current tactic combinators (tacticals). This language is based on a functional core with recurs...
TLCA
1993
Springer
13 years 11 months ago
1993
Springer
This paper describes formalizations of Tait’s normalization proof for the simply typed λ-calculus in the proof assistants Minlog, Coq and Isabelle/HOL. From the formal proofs p...