Effect-polymorphic behaviour inference for deadlock checking
DOI10.1016/J.JLAMP.2016.05.003zbMATH Open1392.68148OpenAlexW2394951157MaRDI QIDQ338624FDOQ338624
Authors: Martin Steffen, Volker Stolz, Ka I Pun 
Publication date: 7 November 2016
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2016.05.003
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- A theory of type polymorphism in programming
- Goblint: path-sensitive data race analysis
- Title not available (Why is that?)
- A Deadlock-Free Semantics for Shared Memory Concurrency
- Dynamic inference of polymorphic lock types
- Type-based information flow analysis for the \(\pi\)-calculus
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Basis for Verifying Multi-threaded Programs
- Title not available (Why is that?)
- Deadlock checking by a behavioral effect system for lock handling
- Polymorphic type, region and effect inference
- Deadlock detection in linear recursive programs
- Type-base flow analysis
- The Principal Type-Scheme of an Object in Combinatory Logic
- Title not available (Why is that?)
- A New Type System for Deadlock-Free Processes
Cited In (3)
Uses Software
This page was built for publication: Effect-polymorphic behaviour inference for deadlock checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q338624)
