Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study

DOI10.1016/S0747-7171(87)80066-4zbMath0641.68025OpenAlexW2110272713MaRDI QIDQ1100879

B. George

Publication date: 1987

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(87)80066-4

zbMATH Keywords

fixed point iterationrelational databasesfinite differencingdata structure selectionattribute closureautomatic top-down approach to program developmentformal problem specificationlinear time solutionmechanical translationtransformational programming system

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

An algorithm for handling many relational calculus queries efficiently. ⋮ State-variable planning under structural restrictions: algorithms and complexity ⋮ Program construction by verifying specification ⋮ An NSF proposal

Uses Software

• MACSYMA
• REVE
• SETL

Cites Work

• A linear time solution to the single function coarsest partition problem
• A lattice-theoretical fixpoint theorem and its applications
• Proofs as programs
• The promotion and accumulation strategies in transformational programming
• Amortized Computational Complexity
• An Automatic Technique for Selection of Data Representations in SETL Programs
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Programming by Refinement, as Exemplified by the SETL Representation Sublanguage
• A Deductive Approach to Program Synthesis
• Some Observations Concerning Formal Differentiation of Set Theoretic Expressions
• Programming with Equations
• Finite Differencing of Computable Expressions
• Computer-assisted microanalysis of programs
• Experience with the SETL Optimizer
• Automatic data structure choice in a language of very high level
• A Transformation System for Developing Recursive Programs
• Program Improvement by Source-to-Source Transformation
• High level iterators and a method for automatically designing data structure representation
• Abstract data types and software validation
• A Machine-Oriented Logic Based on the Resolution Principle
• An axiomatic basis for computer programming
• A relational model of data for large shared data banks
• Program development by stepwise refinement
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study