Results 181 to 190 of about 683 (202)
Some of the next articles are maybe not open access.
A type-theoretic approach to deadlock-freedom of asynchronous systems
1997We present a type-based technique for the verification of deadlock-freedom in asynchronous concurrent systems. Our general approach is to start with a simple interaction category, in which objects are types containing safety specifications and morphisms are processes.
Samson Abramsky +2 more
openaire +1 more source
Verification system for freedom from deadlock of communicating sequential processes
Systems and Computers in Japan, 1987AbstractThe communicating sequential processes (CSP) proposed by Hoare are a model for parallel computation in which the processes do not share a variable and perform the interprocess information exchange and synchronization by the communication instruction function.
Masaki Murakami, Yasuyoshi Inagaki
openaire +1 more source
Deadlock-freedom of large transactions in object management systems
Information Systems, 1989Abstract Different sorts of large transactions can be found in object management systems, i.e. databases for engineering design systems. Examples are design transactions, tool executions and operations on complex objects. Such transactions should not run into deadlocks because their rollback is very expensive. We propose a solution which is based on
openaire +1 more source
A multi-core version of FreeRTOS verified for datarace and deadlock freedom
2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE), 2014We present the design of a multicore version of FreeRTOS, a popular open source real-time operating system for embedded applications. We generalize the scheduling policy of FreeRTOS to schedule the n highest-priority longest-waiting tasks, for an n-core processsor.
Prakash Chandrasekaran +4 more
openaire +1 more source
Freedom from deadlock of locked transactions in a distributed database
Proceedings of the second annual ACM symposium on Principles of distributed computing - PODC '83, 1983We examine the problem of determining whether a given set of locked transactions, accessing a distributed database, is free from deadlock. A deadlock graph is used to derive a new characterization for deadlock-free two-transaction systems in a distributed environment.
openaire +1 more source
Efficiently Verifiable Conditions for Deadlock-Freedom of Large Concurrent Programs
2005We present two polynomial-time algorithms for automatic verification of deadlock-freedom of large finite-state concurrent programs. We consider shared-memory concurrent programs in which a process can nondeterministically choose amongst several (enabled) actions at any step.
Paul C. Attie, Hana Chockler
openaire +1 more source
A polynomial-time test for the deadlock-freedom of computer systems
1977We call a system of n processes sharing m reusable resources deadlock-free, if and only if the allocation policy which automatically grants any request that can be granted with currently free resource units never leads to a deadlock. The best known test for deadlock-freedom is essentially enumerative.
openaire +1 more source
Checking deadlock-freedom of parametric component-based systems
Journal of Logical and Algebraic Methods in Programming, 2021Marius Bozga +2 more
exaly
Connectivity graphs: a method for proving deadlock freedom based on separation logic
2022Jules Jacobs +2 more
exaly
Locking policies: Safety and freedom from deadlock
20th Annual Symposium on Foundations of Computer Science (sfcs 1979), 1979Mihalis Yannakakis +2 more
openaire +1 more source