maude-help AT lists.siebelschool.illinois.edu
Subject: Maude-help mailing list
List archive
- From: Steven Eker <eker AT csl.sri.com>
- To: maude-help AT cs.uiuc.edu
- Subject: Re: [Maude-help] race conditions
- Date: Thu, 25 Apr 2013 11:44:16 -0700
- List-archive: <http://lists.cs.uiuc.edu/pipermail/maude-help/>
- List-id: <maude-help.cs.uiuc.edu>
On 4/25/13 6:48 AM, smiller wrote:
Is there a write up that deals with mutual exclusion, race conditions,Section 13.6.4 of the Maude book contains a model check of Dekker's algorithm. There are more complicated examples in the Maude literature if you Google, though some are behind pay walls.
process, and thread invariants in Maude like what the SPIN MODEL checker
excels at?
_______________________________________________
Maude-help mailing list
Maude-help AT cs.uiuc.edu
http://lists.cs.uiuc.edu/mailman/listinfo/maude-help
The basic idea when you deal with threads, is to write an interpreter (i.e. a deep embedding) for your imperative, threaded language in Maude. Depending on the semantics of your language, this can be quite compact. You then model check the run of the parallel algorithm you are interested in, on that interpreter.
Steven
- [Maude-help] race conditions, smiller, 04/25/2013
- Re: [Maude-help] race conditions, Steven Eker, 04/25/2013
Archive powered by MHonArc 2.6.16.