Single-exponential algorithm for simple grammar bisimilarity yields first polynomial-time equivalence check for context-free session types via linear-valuation conversion.
In: CIAA, Lecture Notes in Computer Science 4094, Springer, pp
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Derives query lower bounds matching lattice width for Tarski fixed point enumeration of isotone maps and gives poly-space algorithms for increasing/decreasing cases on lattices including binary relations.
Ultimate TreeAutomizer is a CHC solver based on trace abstraction, tree automata and tree interpolation, presented as a tool description for the CHC-COMP 2019 competition.
citing papers explorer
-
Simple grammar bisimilarity, with an application to session type equivalence
Single-exponential algorithm for simple grammar bisimilarity yields first polynomial-time equivalence check for context-free session types via linear-valuation conversion.
-
On the enumeration of Tarski fixed points
Derives query lower bounds matching lattice width for Tarski fixed point enumeration of isotone maps and gives poly-space algorithms for increasing/decreasing cases on lattices including binary relations.
-
Ultimate TreeAutomizer (CHC-COMP Tool Description)
Ultimate TreeAutomizer is a CHC solver based on trace abstraction, tree automata and tree interpolation, presented as a tool description for the CHC-COMP 2019 competition.