Concurrent control with “readers” and “writers”

Courtois, Pierre; Heymans, F.; Parnas, David Lorge

doi:10.1145/362759.362813

Cited by 455 publications

(176 citation statements)

References 4 publications

Supporting

Mentioning

171

Contrasting

Unclassified

Order By: Relevance

“…In this problem, originally introduced in [6], there are two types of processes: reader processes and writer processes.…”

Section: An Example: Concurrent Readers and Writersmentioning

confidence: 99%

Language representability of finite place/transition Petri nets

Gorrieri

2015

Vietnam J Comput Sci

View full text Add to dashboard Cite

Finite-net multi-CCS is a CCS-like calculus which is able to model atomic sequences of actions and, together with parallel composition, also multi-party synchronization. This calculus is equipped with a labeled transition system semantics and also with an unsafe P/T Petri net semantics, which is sound w.r.t. the transition system semantics. For any process p of the calculus, the net associated to p by the semantics has always a finite number of places, but it has a finite number of transitions only for so-called well-formed processes. The main result of the paper is that well-formed finite-net multi-CCS processes are able to represent all finite, statically reduced, P/T Petri nets.

show abstract

“…In this problem, originally introduced in [6], there are two types of processes: reader processes and writer processes.…”

Section: An Example: Concurrent Readers and Writersmentioning

confidence: 99%

Language representability of finite place/transition Petri nets

Gorrieri

2015

Vietnam J Comput Sci

View full text Add to dashboard Cite

show abstract

“…The readers and writers algorithm [CHP71], for example, allows many readers access to a shared variable whilst giving writers exclusive access. A formal treatment of that algorithm is sketched in [BCOP05], using the notion of partial permissions and showing it in two forms: fractional permission and counting permission.…”

Section: Permissionsmentioning

confidence: 99%

Inter-process buffers in separation logic with rely-guarantee

Bornat

Amjad

2010

Form. Asp. Comput.

View full text Add to dashboard Cite

Abstract. Separation logic allows simple proofs of concurrent algorithms which use blocking mechanisms such as semaphores. It can even deal with non-blocking algorithms. With the addition of mechanisms borrowed from rely-guarantee, we can make reasonably simple proofs of some simple non-blocking algorithms. We show that it extends to proofs of some intricate algorithms, including Simpson's famous asynchronous four-slot buffer and Harris's novel three-slot algorithm, in a manner that is arguably simpler than earlier treatments, though we cannot claim that we have yet found proofs that are as simple as we would wish. Our example proofs show functional correctness but do not deal with questions of liveness.

show abstract

“…Thus, one part of the -snapshot‖ of the process will reflect the state of the process at one time, and another part will reflect the state of the process at a later time. This is analogous to traditional problems of concurrency and synchronization without mutual exclusion, especially the readers-writers problem [10] and in this context may be called inconsistent static auditing [11].…”

Section: B Application To Non-quiescent Vmsmentioning

confidence: 99%

Investigating the Implications of Virtual Machine Introspection for Digital Forensics

Nance

Bishop

Hay

2009

2009 International Conference on Availability, Reliability and Security

View full text Add to dashboard Cite

Abstract-Researchers and practitioners in computer forensics currently must base their analysis on information that is either incomplete or produced by tools that may themselves be compromised as a result of the intrusion. Complicating these issues are the techniques employed by the investigators themselves. If the system is quiescent when examined, most of the information in memory has been lost. If the system is active, the kernel and programs used by the forensic investigators are likely to influence the results and as such are themselves suspect. Using virtual machines and a technique called virtual machine introspection can help overcome these limits, but it introduces its own research challenges. Recent developments in virtual machine introspection have led to the identification of four initial priority research areas in virtual machine introspection including virtual machine introspection tool development, applications of virtual machine introspection to non-quiescent virtual machines, virtual machine introspection covert operations, and virtual machine introspection detection.

show abstract

Concurrent control with “readers” and “writers”

Cited by 455 publications

References 4 publications

Language representability of finite place/transition Petri nets

Language representability of finite place/transition Petri nets

Inter-process buffers in separation logic with rely-guarantee

Investigating the Implications of Virtual Machine Introspection for Digital Forensics

Contact Info

Product

Resources

About