A Lightweight Deadlock Analysis for Programs With Threads and Reentrant Locks

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-95582-7_36
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

A Lightweight Deadlock Analysis for Programs With Threads and Reentrant Locks

Science of Computer Programming
Software
2019English

Context-Bounded Analysis for Concurrent Programs With Dynamic Creation of Threads

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

A Transformation to Provide Deadlock-Free Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Deadlock Models and a General Algorithm for Distributed Deadlock Detection

Journal of Parallel and Distributed Computing
Computer NetworksHardwareCommunicationsArchitectureTheoretical Computer ScienceArtificial IntelligenceSoftware
1995English

Finding Suitable Programs: Semantic Search With Incomplete and Lightweight Specifications

2012English

On Spin Locks in AUTOSAR: Blocking Analysis of FIFO, Unordered, and Priority-Ordered Spin Locks

2013English

An Analysis and Improvement of Probe-Based Algorithm for Distributed Deadlock Detection

Lecture Notes on Software Engineering
2015English

Verifying a Compiler for Java Threads

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Software for Computer-Aided Development of Control Programs for Multipass Cutting of Worm Threads on NC Machines

Proceedings of Higher Educational Institutions. Маchine Building
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy