Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
A computational logic handbook
A computational logic handbook
1st international workshop on Conditional Term Rewriting Systems
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS
IEEE Transactions on Software Engineering
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Deciding Combinations of Theories
Journal of the ACM (JACM)
An axiomatic basis for computer programming
Communications of the ACM
Computer-Aided Reasoning: An Approach
Computer-Aided Reasoning: An Approach
Java Program Verification via a Hoare Logic with Abrupt Termination
FASE '00 Proceedings of the Third Internationsl Conference on Fundamental Approaches to Software Engineering: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
RRL: A Rewrite Rule Laboratory
Proceedings of the 9th International Conference on Automated Deduction
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Trust and Automation in Verification Tools
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Automated deduction for verification
ACM Computing Surveys (CSUR)
The reliable algorithmic software challenge RASC
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
A tutorial on satisfiability modulo theories
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Industrial-strength certified SAT solving through verified SAT proof checking
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
A self-verifying theorem prover
A self-verifying theorem prover
Inference systems for logical algorithms
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Advanced Lectures on Software Engineering
Hi-index | 0.00 |
Rewriting is a form of inference, and one that interacts in several ways with other forms of inference such as decision procedures and proof search. We discuss a range of issues at the intersection of rewriting and inference. How can other inference procedures be combined with rewriting? Can rewriting be used to describe inference procedures? What are some of the theoretical challenges and practical applications of combining rewriting and inference? How can rewriters, decision procedures, and their combination be certified? We discuss these problems in the context of our ongoing effort to use PVS as a metatheoretic framework to construct a proof kernel for justifying the claims of theorem provers, rewriters, model checkers, and satisfiability solvers.