Rewriting, Inference, and Proof

  title={Rewriting, Inference, and Proof},
  author={Natarajan Shankar},
  • N. Shankar
  • Published in WRLA 20 March 2010
  • Computer Science
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… 
Certification for μ-calculus with winning strategies Category : Research Paper
Memory-efficient certificates for μ-calculus model checking problems based on the well-known correspondence of μ-Calculus modelchecking with winning certain parity games are defined and a prototypical implementation of a μ- Calculus model checker generating these certificates has been developed.
Certification for μ-Calculus with Winning Strategies
This work instrument the usual fixpoint iteration of \(\mu \)-calculus model checking so that it produces evidence in the form of a winning strategy; this work yields a new, simpler, and immediate constructive proof of the correspondence between \(\mu -calculus and parity games.


Deciding Combinations of Theories
A method is given for deciding formulas in combinations of unquatified first-order theories that makes use of a single, uniform procedure that minimizes the code needed to accommodate each additional theory.
Validating SAT solvers using an independent resolution-based checker: practical implementations and other applications
  • Lintao Zhang, S. Malik
  • Computer Science
    2003 Design, Automation and Test in Europe Conference and Exhibition
  • 2003
The implementation of an independent resolution-based checking procedure that can check the validity of unsatisfiable claims produced by the SAT solver zchaff is described and Experimental results show low overhead for the checking process.
Metafunctions: Proving Them Correct and Using Them Efficiently as New Proof Procedures.
It is demonstrated that if the statement of correctness for a given 'metafunction' is proved, then the code derived from function's definition can be used as a new proof procedure, and how the actual application of a metafunction is as efficient as hand-coded procedures in the implementation language is explained.
The Maude System
Maude is a high-performance language and system supporting both equational and rewriting logic computation for a wide range of applications, including development of theorem proving tools, language
Non-Resolution Theorem Proving
Certifying and Synthesizing Membership Equational Proofs
This work presents a general method to certify and synthesize proofs in membership equational logic, where the synthesis may involve generating full proofs from proof traces modulo combinations of associativity, commutativity, and identity axioms.
Verifying the Unification Algorithm in LCF
A self-verifying theorem prover
The highest-level proof checker, Level 11, can be thought of as a simplified version of the ACL2 or NQTHM theorem provers, and one contribution of this work is to show how such systems can be verified.
A Lightweight Approach for Loop Summarization
This work uses inference rules to compute summaries of loop summaries and was able to verify safety properties for many examples which are out of the scope of several existing tools.
Inference Systems for Logical Algorithms
This paper presents inference systems for algorithms such as resolution, the Davis–Putnam–Logemann–Loveland procedure, equivalence and congruence closure, and satisfiability modulo theories, and presents a uniform framework for formalizing logical algorithms based on inference systems.