Some techniques for reasoning automatically on co-inductive data structures

DOI10.1093/LOGCOM/EXAD028MaRDI QIDQ7010951zbMATH OpenFDO

Authors Nicolas Peltier

Publication date 19 March 2025

Published in Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/LOGCOM/EXAD028

Mathematics Subject Classification ID

Data structures (68P05) Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65)

Cites work

• scientific article; zbMATH DE number 976360 (Why is no real title available?)
• scientific article; zbMATH DE number 1765694 (Why is no real title available?)
• A theorem prover for a computational logic
• Automata on infinite trees with equality and disequality constraints between siblings
• Automated Reasoning with Analytic Tableaux and Related Methods
• CIRC: A Circular Coinductive Prover
• Co-Logic Programming: Extending Logic Programming with Coinduction
• Combining induction and saturation-based theorem proving
• Copatterns, programming infinite structures by observations
• Deciding context unification
• Foundational (co)datatypes and (co)recursion for higher-order logic
• Induction for SMT solvers
• Integrating induction and coinduction via closure operators and proof cycles
• Introduction to bisimulation and coinduction
• Resolution theorem proving
• Rewrite-based Equational Theorem Proving with Selection and Simplification
• Rewriting Induction + Linear Arithmetic = Decision Procedure
• Superposition with datatypes and codatatypes
• Superposition with structural induction
• The automation of proof by mathematical induction
• Types for Proofs and Programs

This page was built for publication: Some techniques for reasoning automatically on co-inductive data structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7010951)