Pages that link to "Item:Q2398172"

The following pages link to Rely-guarantee termination and cost analyses of loops with concurrent interleavings (Q2398172):

Displaying 2 items.

• Rely-guarantee bound analysis of parameterized concurrent shared-memory programs. With an application to proving that non-blocking algorithms are bounded lock-free (Q2058383) (← links)
• Types for complexity of parallel computation in pi-calculus (Q2233448) (← links)