Deadlock Detection in Linear Recursive Programs

DOI10.1007/978-3-319-07317-0_2zbMath1445.68052arXiv1310.7449OpenAlexW2152197427MaRDI QIDQ5175772

Elena Giachino, Cosimo Laneve

Publication date: 25 February 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.7449

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Effect-polymorphic behaviour inference for deadlock checking ⋮ Deadlock analysis of unbounded process networks

Uses Software

• PIPER
• ABS
• TyPiCal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A calculus of communicating systems
• A calculus of mobile processes. II
• A generic type system for the pi-calculus
• Analysis of recursively parallel programs
• Asynchronous and deterministic objects
• The Must Preorder Revisited
• Automata and Logics for Words and Trees over an Infinite Alphabet
• A Theory of Communicating Sequential Processes
• Types as models
• Types and typechecking for Communicating Quantum Processes
• Depth-First Search and Linear Graph Algorithms
• A New Type System for Deadlock-Free Processes

This page was built for publication: Deadlock Detection in Linear Recursive Programs