Translatability and Decidability Questions for Restricted Classes of Program Schemas

DOI10.1137/0208047zbMath0418.68014OpenAlexW2044030666MaRDI QIDQ3851586

Elaine J. Weyuker

Publication date: 1979

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0208047

zbMATH Keywords

decision problemstranslatabilityprogram schemaabstract programflowchart schema

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

The applicability of program schema results to programs ⋮ Equivalence of conservative, free, linear program schemas is decidable

This page was built for publication: Translatability and Decidability Questions for Restricted Classes of Program Schemas