CoLoR
From MaRDI portal
swMATH9806MaRDI QIDQ21785FDOQ21785
Author name not available (Why is that?)
Official website: https://github.com/fblanqui/color
Cited In (70)
- WANDA
- Formally verifying the solution to the Boolean Pythagorean triples problem
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- Tuple interpretations for termination of term rewriting
- A framework for developing stand-alone certifiers
- Multi-dimensional interpretations for termination of term rewriting
- Title not available (Why is that?)
- Certification of Proving Termination of Term Rewriting by Matrix Interpretations
- Automatic Termination
- Coq formalization of the higher-order recursive path ordering
- An effective proof of the well-foundedness of the multiset path ordering
- Certification of Termination Proofs Using CeTA
- Acyclic Preferences and Existence of Sequential Nash Equilibria: A Formal and Constructive Equivalence
- NaTT
- Title not available (Why is that?)
- Modeling Permutations in Coq for Coccinelle
- Certifying a Termination Criterion Based on Graphs, without Graphs
- An efficient Coq tactic for deciding Kleene algebras
- Proving termination of programs automatically with AProVE
- Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant
- A formalization of the Knuth-Bendix(-Huet) critical pair theorem
- Certification of classical confluence results for left-linear term rewrite systems
- Max/Plus tree automata for termination of term rewriting
- CeTA
- HOCL
- AProVE
- Tyrolean
- RALL
- CSI
- CiME
- Jambox
- IsaFoR
- Matchbox
- Saigawa
- TPA
- CoLL
- KITTeL
- Point-free, set-free concrete linear algebra
- Preface to the special issue: Interactive theorem proving and the formalization of mathematics
- A3PAT
- ConCon
- Nagoya Termination Tool
- SparrowBerry
- CoCoWeb
- Cops
- ATBR
- Equations
- FELIX
- Knuth Bendix Orders
- Haskell Show Class
- Lambda Free RPOs
- SAEPTUM
- Coccinelle
- RRL
- Xml
- Certification_Monads
- Automatically proving termination and memory safety for programs with pointer arithmetic
- A formalization of Newman's and Yokouchi's lemmas in a higher-order language
- Certifying confluence of quasi-decreasing strongly deterministic conditional term rewrite systems
- Certifying safety and termination proofs for integer transition systems
- A PVS theory for term rewriting systems
- Solving graph partitioning problems with parallel metaheuristics
- Syntactic soundness proof of a type-and-capability system with hidden state
- A Lambda-Free Higher-Order Recursive Path Order
- Formally proving size optimality of sorting networks
- Mechanically certifying formula-based Noetherian induction reasoning
- Termination of Isabelle functions via termination of rewriting
- Deciding Kleene algebras in \texttt{Coq}
- Certified subterm criterion and certified usable rules
- Generalized and formalized uncurrying
This page was built for software: CoLoR
