Dynamic Verification of C++ Generic Algorithms
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Mechanical Verification of Adder Circuits using Rewrite RuleLaboratory
Formal Methods in System Design
User-Extensible SimplificationType-Based Optimizer Generators
CC '01 Proceedings of the 10th International Conference on Compiler Construction
System Description: RDL : Rewrite and Decision Procedure Laboratory
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Constraint contextual rewriting
Journal of Symbolic Computation - Special issue: First order theorem proving
Essential language support for generic programming
Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation
GPCE '08 Proceedings of the 7th international conference on Generative programming and component engineering
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
Electronic Notes in Theoretical Computer Science (ENTCS)
Hiproofs: A Hierarchical Notion of Proof Tree
Electronic Notes in Theoretical Computer Science (ENTCS)
Capturing hiproofs in HOL light
CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics
| Hi-index | 0.01 |
The Tecton proof system is an experimental tool for constructingproofs of first-order logic formulas and of program specificationsexpressed using formulas in Hoare's axiomatic formalism. It is designedto make interactive proof construction easier than with previous tools,by maintaining multiple proof attempts internally in a structured formcalled a proof forest; displaying them in an easy to comprehend form,using a combination of tabular formats, graphical representations, andhypertext links; and automating substantial parts of proofs throughrewriting, induction, case analysis, and generalization inferencemechanisms, along with a linear arithmetic decision procedure.—From the Authors' Abstract