Programming with Invariants

Authors:
R. Paige
Affiliations:
Rutgers University
Venue:
IEEE Software
Year:
1986

Citing 0
Cited 7

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

Journal of Symbolic Computation
Dynamic Programming via Static Incrementalization

ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
Solving Regular Tree Grammar Based Constraints

SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Solving Regular Path Queries

MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
From datalog rules to efficient programs with time and space guarantees

ACM Transactions on Programming Languages and Systems (TOPLAS)
Mechanical inference of invariants for FOR-loops

Journal of Symbolic Computation
Aspects and data refinement

MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction

Quantified Score

Hi-index	0.00

Visualization

Abstract

The use of a restricted class of invariants as part of a language supports both the accurate synthesis of high-level programs and their translation into efficient implementations.