E.  Abraham-Mumm and F. de Boer. Proof-outlines for threads in Java. In Palamidessi [25].  Home/Search   Document Not in Database   Summary   Related Articles   Check

....programs using a 3 valued logic [SRW99, LAS00] to abstract the store. This technique can verify interesting properties of small programs. Pasareanu et al. PDH99] also describe a model checking tool for compositional checking of finite state message passing systems. Abraham Mumm and deBoer [AMdB00] sketch a logic for verifying multi threaded Java programs indirectly via a translation to communicating sequential programs. 2 A number of tools have been developed for identifying specific synchronization errors in multithreaded programs. These approaches are less general than thread modular ....

E. Abraham Mumm and F. S. de Boer. Proof-outlines for threads in java. In CONCUR 2000: Theories of Concurrency, Lecture Notes in Computer Science 1877. SpringerVerlag, 2000.

No context found.

E.  Abraham-Mumm and F. de Boer. Proof-outlines for threads in Java. In Palamidessi [25].

....Given a program prog , the proof outline prog satisfies the verification conditions of the proof system from Section 4. This paper presents the first sound and complete assertional proof method for a multithreaded sublanguage of Java including its monitor discipline. It extends earlier work ([3] and especially [4] by integrating Java s wait and notify constructs into the assertional proof system and by moving towards a more compositional identification mechanism for threads. Related work From its inception, Java attracted interest from the formal methods community: The widespread use ....

E. Abraham-Mumm and F. de Boer. Proof-outlines for threads in Java. In C. Palamidessi, editor, Proceedings of CONCUR 2000, volume 1877 of Lecture Notes in Computer Science. Springer-Verlag, Aug. 2000.

....of the proof. We want to specify in the postcondition of the insert operation the correct addition of the inserted node. We did so by introducing a logical variable z which denotes the initial list of linked nodes. The following assertion i=1 (z[i] next = z[i 1] z[i] nil) hd = z[1] (here and in the sequel we use the notation # i=e P and # i=e P as an abbreviation of the bounded quantification P ) and P ) states, among others, that two consecutive elements of z are linked by the instance variable next (by convention z[ z 1] nil) and that its ....

....of new verification conditions in terms of the substitution operators introduced in this paper. Currently, we are extending the system to the widely used programming language Java by, first of all, implementing message passing ( 4] and and the basics of the multi threaded control flow of Java ([1]) We are also incorporating the Java mechanism of inheritance. As already remarked above, the verification conditions corresponding to these Java programming constructs are defined in terms of the substitution operators introduced in this paper. A more long term goal consists of a further ....

E. Abraham-Mumm and F.S. de Boer. Proof-outlines for threads in Java. Proceedings of CONCUR 2000.

....of the paper: Theorem 2 (Completeness) Given a program prog , the proof outline prog satis es the veri cation conditions of the proof system from Section 4.2. Related work This paper presents the rst sound and complete assertional proof method for a multithreaded sublanguage of Java. In [2] the basic ideas have been introduced for proof outlines by means of a modular integration of the interference freedom and the cooperation test for a more restricted version of Java. The present paper o ers such an integration for a more concrete version of Java by incorporating Java s reentrant ....

E. Abraham-Mumm and F. de Boer. Proof-outlines for threads in Java. In C. Palamidessi, editor, Proceedings of CONCUR

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC