Programming by Refinement, as Exemplified by the SETL Representation Sublanguage

DOI10.1145/357062.357064MaRDI QIDQ3914400zbMATH OpenOpenAlexFDO

Authors Robert B. K. Dewar, Arthur Grand, Ssu-Cheng Liu, Edmond Schonberg, Jacob T. Schwartz

Publication date 1979

Published in ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/357062.357064

zbMATH Keywords

automatic data structure choicehigh level languagesoptimizationset-theoretic languagesstepwise refinement

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Cited in

(4)

• Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study
• Sets with cardinality constraints in satisfiability modulo theories
• Transformational derivation of an improved alias analysis algorithm
• Deciding Boolean algebra with Presburger arithmetic

This page was built for publication: Programming by Refinement, as Exemplified by the SETL Representation Sublanguage

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