Program derivation with verified transformations — a case study
From MaRDI portal
Publication:4884666
DOI10.1002/cpa.3160480906zbMath0853.68072MaRDI QIDQ4884666
No author found.
Publication date: 7 July 1996
Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/cpa.3160480906
68N15: Theory of programming languages
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Goals and benchmarks for automated map reasoning, Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Testing flow graph reducibility
- Constructive versions of Tarski's fixed point theorems
- A lattice-theoretical fixpoint theorem and its applications
- An Automatic Technique for Selection of Data Representations in SETL Programs
- Automatic data structure choice in a language of very high level
- A Transformation System for Developing Recursive Programs
- An algorithm for reduction of operator strength
- An axiomatic basis for computer programming