The logic-termal equivalence is polynomial-time decidable

DOI10.1016/S0020-0190(80)90074-5zbMath0443.68032OpenAlexW1977115070MaRDI QIDQ1144374

Viktor K. Sabelfeld

Publication date: 1980

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(80)90074-5

zbMATH Keywords

program schemelogic-termal equivalencelogical graphspolynomial-time decidable

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

On complexity of the anti-unification problem, Tree equivalence of linear recursive schemata is polynomial-time decidable, Mixed computation: potential applications and problems for study, Analysis of the equality relations for the program terms

Cites Work

• Äquivalente Transformationen für Flußdiagramme
• On formalised computer programs
• Unnamed Item
• Unnamed Item
• Unnamed Item