✦ LIBER ✦

Is code equivalence easy to decide?

✍ Scribed by Petrank, E.; Roth, R.M.

Book ID: 114540809
Publisher: IEEE
Year: 1997
Tongue: English
Weight: 101 KB
Volume: 43
Category: Article
ISSN: 0018-9448
DOI: 10.1109/18.623157

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The logic-termal equivalence is polynomi

The logic-termal equivalence is polynomial-time decidable

✍ V.K. Sabelfeld 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 572 KB

The equivalence of pre-NTS grammars is d

The equivalence of pre-NTS grammars is decidable

✍ J. -M. Autebert; L. Boasson 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 743 KB

Not to decide is to decide: ignoring sus

Not to decide is to decide: ignoring susceptibility is not `good science'

✍ Adam M Finkel 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 270 KB

Bisimulation Equivalence Is Decidable fo

Bisimulation Equivalence Is Decidable for All Context-Free Processes

✍ S. Christensen; H. Huttel; C. Stirling 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 480 KB

Equivalence of conservative, free, linea

Equivalence of conservative, free, linear program schemas is decidable

✍ Michael R. Laurence; Sebastian Danicic; Mark Harman; Rob Hierons; John Howroyd 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 312 KB

A program schema deÿnes a class of programs, all of which have identical statement structures, but whose expressions may di er. We prove that given any two structured schemas which are conservative, linear and free, it is decidable whether they are equivalent.

Tree equivalence of linear recursive sch

Tree equivalence of linear recursive schemata is polynomial-time decidable

✍ V.K. Sabelfeld 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 856 KB