Translatability and Decidability Questions for Restricted Classes of Program Schemas

DOI10.1137/0208047MaRDI QIDQ3851586zbMATH OpenOpenAlexFDO

Authors 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

abstract programdecision problemsflowchart schemaprogram schematranslatability

Mathematics Subject Classification ID

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

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3851586)