Pages that link to "Item:Q1823657"
From MaRDI portal
The following pages link to Program derivation by fixed point computation (Q1823657):
Displaying 16 items.
- Transformational derivation of an improved alias analysis algorithm (Q815001) (← links)
- Least reflexive points of relations (Q815002) (← links)
- An NSF proposal (Q815007) (← links)
- Properties of data flow frameworks: A unified model (Q910237) (← links)
- Formal derivation of graph algorithmic programs using partition-and-recur (Q1273073) (← links)
- Program construction by verifying specification (Q1273080) (← links)
- Correctness of fixpoint transformations (Q1329743) (← links)
- A fixpoint theory for non-monotonic parallelism (Q1884887) (← links)
- Program schemes with constants (Q2432964) (← links)
- Solving Multiple Dataflow Queries Using WPDSs (Q3522064) (← links)
- Convergence of chaotic iterative least fixed point computations (Q3991126) (← links)
- (Q4437809) (← links)
- Iterate, Incrementalize, and Implement: A Systematic Approach to Efficiency Improvement and Guarantees (Q4916235) (← links)
- Static and dynamic processor allocation for higher-order concurrent languages (Q5096756) (← links)
- Letter to the Editor—-A Closed Form Solution of Certain Programming Problems (Q5610181) (← links)
- Computer Aided Verification (Q5716589) (← links)