Pages that link to "Item:Q3914400"
From MaRDI portal
The following pages link to Programming by Refinement, as Exemplified by the SETL Representation Sublanguage (Q3914400):
Displaying 4 items.
- Transformational derivation of an improved alias analysis algorithm (Q815001) (← links)
- Deciding Boolean algebra with Presburger arithmetic (Q861705) (← links)
- Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study (Q1100879) (← links)
- Sets with Cardinality Constraints in Satisfiability Modulo Theories (Q3075499) (← links)
