Pages that link to "Item:Q5900554"
From MaRDI portal
The following pages link to Formal Methods at the Crossroads. From Panacea to Foundational Support (Q5900554):
Displaying 22 items.
- Name-passing calculi: from fusions to preorders and types (Q342734) (← links)
- Type systems for distributed programs: components and sessions (Q518894) (← links)
- A WSDL-based type system for asynchronous WS-BPEL processes (Q537948) (← links)
- Deadlock analysis of unbounded process networks (Q729810) (← links)
- Prioritise the best variation (Q2117016) (← links)
- \( \pi\) with leftovers: a mechanisation in Agda (Q2117018) (← links)
- Type theory based semantic verification for service composition in cloud computing environments (Q2200647) (← links)
- Types for complexity of parallel computation in pi-calculus (Q2233448) (← links)
- Undecidable equivalences for basic parallel processes (Q2389334) (← links)
- Session types revisited (Q2407105) (← links)
- A type system for lock-free processes (Q2497143) (← links)
- Comparing type systems for deadlock freedom (Q2667185) (← links)
- A Coq library for verification of concurrent programs (Q2871836) (← links)
- Context-Free Session Type Inference (Q2988669) (← links)
- (Q3105092) (← links)
- Type and behaviour reconstruction for higher-order concurrent programs (Q4358460) (← links)
- (Q5013868) (← links)
- A simple library implementation of binary sessions (Q5371999) (← links)
- Type system in programming languages (Q5942703) (← links)
- Minimal session types for the \(\pi\)-calculus (Q6124244) (← links)
- Separating Sessions Smoothly (Q6135771) (← links)
- Comparing session type systems derived from linear logic (Q6643467) (← links)