Results 11 to 20 of about 683 (202)
Towards Races in Linear Logic [PDF]
Logical Methods in Computer Science, 2020 Process calculi based in logic, such as $\pi$DILL and CP, provide a foundation for deadlock-free concurrent programming, but exclude non-determinism and races.
Wen Kokke +2 more
doaj +1 more source
Deadlock Freedom for Asynchronous and Cyclic Process Networks [PDF]
Electronic Proceedings in Theoretical Computer Science, 2021 In Proceedings ICE 2021, arXiv:2109.14908.
van den Heuvel, Bas, Pérez, Jorge A.
openaire +3 more sources
Refinement for Transition Systems with Responses [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 Motivated by the response pattern for property specifications and applications within flexible workflow management systems, we report upon an initial study of modal and mixed transition systems in which the must transitions are interpreted as must ...
Marco Carbone +3 more
doaj +1 more source
On Urgency in Asynchronous Timed Session Types [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 We study an urgent semantics of asynchronous timed session types, where input actions happen as soon as possible. We show that with this semantics we can recover to the timed setting an appealing property of untimed session types: namely, deadlock ...
Maurizio Murgia
doaj +1 more source
Deadlock freedom through object ownership [PDF]
International Workshop on Aliasing, Confinement and Ownership in Object-Oriented Programming, 2009 Active objects are an attractive method of introducing concurrency into Java-like languages by decoupling method execution from invocation. In this paper, we show how ownership is used in the Java [14] subset language CoJava [17] to prevent deadlock associated with active object method calls.
Kerfoot, E, McKeever, S, Torshizi, F
openaire +2 more sources
A Type System for Unstructured Locking that Guarantees Deadlock Freedom without Imposing a Lock Ordering [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Deadlocks occur in concurrent programs as a consequence of cyclic resource acquisition between threads. In this paper we present a novel type system that guarantees deadlock freedom for a language with references, unstructured locking primitives, and ...
Prodromos Gerakios +2 more
doaj +1 more source
Global and Local Deadlock Freedom in BIP [PDF]
ACM Transactions on Software Engineering and Methodology, 2017 We present a criterion for checking local and global deadlock freedom of finite state systems expressed in BIP: a component-based framework for constructing complex distributed systems. Our criterion is evaluated by model-checking a set of subsystems of the overall large system.
Paul C. Attie +5 more
openaire +3 more sources
A Message-Passing Interpretation of Adjoint Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We present a system of session types based on adjoint logic which generalize standard binary session types. Our system allows us to uniformly capture several new behaviors in the space of asynchronous message-passing communication, including multicast ...
Klaas Pruiksma, Frank Pfenning
doaj +1 more source
Static lock capabilities for deadlock freedom [PDF]
Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation, 2012 We present a technique --- lock capabilities --- for statically verifying that multithreaded programs with locks will not deadlock. Most previous work on deadlock prevention requires a strict total order on all locks held simultaneously by a thread, but such an invariant often does not hold with fine-grained locking, especially when data-structure ...
Colin S. Gordon +2 more
openaire +1 more source
Proof Reduction of Fair Stuttering Refinement of Asynchronous Systems and Applications [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 We present a series of definitions and theorems demonstrating how to reduce the requirements for proving system refinements ensuring containment of fair stuttering runs.
Rob Sumners
doaj +1 more source