Results 1 to 10 of about 624 (143)
Comparing type systems for deadlock freedom [PDF]
Journal of Logical and Algebraic Methods in Programming, 2022 39 pages, plus appendices. Extended and revised version of an EXPRESS/SOS'15 paper (https://doi.org/10.4204/EPTCS.190.1)
Ornela Dardha, Jorge A Perez
exaly +3 more sources
Port Protocols for Deadlock-Freedom of Component Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 In component-based development, approaches for property verification exist that avoid building the global system behavior of the component model.
Christian Lambertz +1 more
doaj +4 more sources
Security verification framework for NDN access control [PDF]
Scientific ReportsNamed Data Networking (NDN) presents a promising alternative to TCP/IP, but its access control design poses challenges for cybersecurity. Addressing this, the paper introduces the Security Verification Framework for NDN Access Control (SVF-NDN).
Yuan Fei, Jiaqi Yin, Lijun Yan
doaj +2 more sources
The pursuit of deadlock freedom
Information and Computation, 1987 We introduce some combinatorial techniques for establishing the deadlock freedom of concurrent systems which are similar to the variant/invariant method of proving loop termination. Our methods are based on the local analysis of networks, which is combinatorially far easier than analysing all global states.
A W Roscoe
exaly +4 more sources
Manifest Deadlock-Freedom for Shared Session Types [PDF]
Lecture Notes in Computer Science, 2019 Shared session types generalize the Curry-Howard correspondence between intuitionistic linear logic and the session-typed \(\pi \)-calculus with adjoint modalities that mediate between linear and shared session types, giving rise to a programming model where shared channels must be used according to a locking discipline of acquire-release.
Stephanie Balzer +2 more
exaly +2 more sources
Distributed Explicit State Model Checking of Deadlock Freedom [PDF]
Lecture Notes in Computer Science, 2013 This paper presents a practical method and associated tool for verifying deadlock freedom properties in guarded command systems. Such properties are expressed in CTL as AGEFi¾? q where q is a set of quiescent states. We require the user to provide transitions of the system that are "helpful" in reaching quiescent states.
Brad D. Bingham +3 more
exaly +2 more sources
Modeling and Verification of Asynchronous Systems Using Timed Integrated Model of Distributed Systems [PDF]
Sensors, 2022 In modern computer systems, distributed systems play an increasingly important role, and modeling and verification are crucial in their development. The specificity of many systems requires taking this into account in real time, as time dependencies ...
Wiktor B. Daszczuk
doaj +2 more sources
Prioritise the Best Variation [PDF]
Logical Methods in Computer Science, 2023 Binary session types guarantee communication safety and session fidelity, but alone they cannot rule out deadlocks arising from the interleaving of different sessions.
Wen Kokke, Ornela Dardha
doaj +1 more source
Separating Sessions Smoothly [PDF]
Logical Methods in Computer Science, 2023 This paper introduces Hypersequent GV (HGV), a modular and extensible core calculus for functional programming with session types that enjoys deadlock freedom, confluence, and strong normalisation.
Simon Fowler +4 more
doaj +1 more source
IEEE Access, 2021 Static deadlock analyses might be able to verify the absence of deadlock. However, they are usually not able to detect its presence. Moreover, when a potential deadlock is detected, they provide little (and often no) information that can help the user in
Miguel Gomez-Zamalloa, Miguel Isabel
doaj +1 more source