Pages that link to "Item:Q1155605"
From MaRDI portal
The following pages link to Proving total correctness of nondeterministic programs in infinitary logic (Q1155605):
Displaying 11 items.
- Formalizing Dijkstra's predicate transformer wp in weak second-order logic (Q673132) (← links)
- A simple fixpoint argument without the restriction to continuity (Q1075045) (← links)
- While-programs with nondeterministic assignments and the logic ALNA (Q1082808) (← links)
- A calculus of refinements for program derivations (Q1111362) (← links)
- A continuous semantics for unbounded nondeterminism (Q1171370) (← links)
- A logic of recursion (Q1262303) (← links)
- Verifiable properties of database transactions (Q1281498) (← links)
- Stratified least fixpoint logic (Q1331926) (← links)
- The Rely-Guarantee method for verifying shared variable concurrent programs (Q1362776) (← links)
- In praise of algebra (Q1941861) (← links)
- Combining dynamic and static slicing for analysing assembler (Q2266945) (← links)