Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
Theoretical Computer Science
A formal specification of the MIDP 2.0 security model
FAST'06 Proceedings of the 4th international conference on Formal aspects in security and trust
Mechanized verification of CPS transformations
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Formalization of CTL* in calculus of inductive constructions
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
Journal of Automated Reasoning
Towards a certified and efficient computing of gröbner bases
EUROCAST'05 Proceedings of the 10th international conference on Computer Aided Systems Theory
Connecting a logical framework to a first-order logic prover
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
System description: ATS: a language that combines programming with theorem proving
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
TYPES'04 Proceedings of the 2004 international conference on Types for Proofs and Programs
A few constructions on constructors
TYPES'04 Proceedings of the 2004 international conference on Types for Proofs and Programs
Extending coq with imperative features and its application to SAT verification
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Automating induction with an SMT solver
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Proceedings of the 15th Workshop on Formal Techniques for Java-like Programs
Patterns for building dependable systems with trusted bases
Proceedings of the 17th Conference on Pattern Languages of Programs
| Hi-index | 0.00 |
A practical introduction to the development of proofs and certified programs using Coq. An invaluable tool for researchers, students, and engineers interested in formal methods and the development of zero-fault software.