The meaning of concurrent programs
نویسنده
چکیده
The semantics of assignment and mutual exclusion in concurrent and multi-core/multi-processor systems is presented with attention to low level architectural features in an attempt to make the presentation realistic. Recursive functions on event sequences are used to define state dependent functions and variables in ordinary (non-formal-method) algebra.
منابع مشابه
Unfold/Fold Transformations of CCP Programs
We introduce a transformation system for concurrent constraint programming (CCP). We deene suitable applicability conditions for the transformations which guarantee that the input/output ccp semantics is preserved also when distinguishing deadlocked computations from successful ones. The systems allows to optimize CCP programs while preserving their intended meaning. Furthermore, since it prese...
متن کاملMeaning of “the Right Imam” based upon the Holy Quran’s Verses
The concept of “the Right Imam” is one of the most significant Quranic concepts and has attracted the attention of various jurisprudential, theological, mystical, interpretative, narrative and historical schools. However, it has not been dealt with by a semantic approach yet. Although the word “Imam” with the meaning of right leader has been used in 5 ranks in the Holy Quran, it could be said t...
متن کاملCompiling SHIM
Embedded systems demand concurrency for supporting simultaneous actions in their environment and parallel hardware. Although most concurrent programming formalisms are prone to races and nondeterminism, some, such as our shim (software/hardware integration medium) language, avoid them by design. In particular, the behavior of shim programs is scheduling-independent, meaning the I/O behavior of ...
متن کاملThe Stability Problem for Verification of Concurrent Object-Oriented Programs
Modular static verification of concurrent object-oriented programs remains a challenge. This paper discusses the impact of concurrency on the use and meaning of behavioural specifications, and in particular on method contracts and class invariants. Atomicity of methods is often advocated as a solution to the problem of verification of multithreaded programs. However, in a design-by-contract fra...
متن کاملConcurrent Kleene Algebra: Free Model and Completeness
Concurrent Kleene Algebra (CKA) was introduced by Hoare, Moeller, Struth and Wehrman in 2009 as a framework to reason about concurrent programs. We prove that the semantics proposed in the original paper is the free model of CKA with bounded parallel iteration, meaning the completeness of these axioms. This result settles a conjecture of Hoare and collaborators. Moreover, it allows us to establ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0810.1316 شماره
صفحات -
تاریخ انتشار 2008