Pith. sign in

REVIEW 1 cited by

Verification of PCP-Related Computational Reductions in Coq

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1711.07023 v2 pith:UNYBT7ZM submitted 2017-11-19 cs.LO cs.FL

Yannick Forster , Edith Heiter , Gert Smolka This is my paper · ORCID
classification cs.LOcs.FL
keywords problemreductionscomputationalassistantconcerningcontext-freecorrectnesscorrespondence
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We formally verify several computational reductions concerning the Post correspondence problem (PCP) using the proof assistant Coq. Our verifications include a reduction of a string rewriting problem generalising the halting problem for Turing machines to PCP, and reductions of PCP to the intersection problem and the palindrome problem for context-free grammars. Interestingly, rigorous correctness proofs for some of the reductions are missing in the literature.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Undecidability of $D_{<:}$ and Its Decidable Fragments

    cs.PL 2019-08 conditional novelty 8.0 of 10

    D<: subtyping and typing are undecidable, but removing the bad-bounds rule and restricting comparison of function types yields decidable fragments with complete algorithms.

Pith tools