J. Dingel. Towards a theory for shared-variable concurrent programming. Thesis proposal, Carnegie Mellon University, 1996.  Home/Search   Document Not in Database   Summary   Related Articles

.... S E[S 2 ] if S 1 v T S S 2 [ W i A i ; S i W j B j ; T j ] T S W i A i ; S i W j B j ; T j ] W j B j ; W i A i ; S i T j ] V 1 : P 1 ; Q 1 ] v T S V 2 : P 2 ; Q 2 ] iff P 1 [ x 0 = x] Q 1 V x2V1 x = x 0 ) P 2 [ x 0 = x] Q 2 V x2V2 x = x 0 See [Din96] for a more complete set of rules which also make use of the regular expression like shape of partial programs. 3.1 Context sensitive approximation on partial programs Trace set inclusion between two programs is a rather strong property since it expresses that the behaviour of one program in ....

.... S 1 S 2 I E S 0 1 S 0 2 if S 1 I E[ S 2 ] S 0 1 and S 2 I E[S1 [ S 0 2 S 1 I S;E S 2 iff S 1 I 0 E S 2 and I)wp(S; I 0 ) where S is sequential We currently work on extending this proposition to a proof system for contextsensitive approximation [Din96]. 3.2 Approximation on contexts We extend approximation to contexts. Consider the contexts x: 1;y: 2; and y: 2;x: 1; Both establish the same precondition for the program to be placed in the hole, and thus any program should behave the same in both of them. Consequently, we would like to ....

[Article contains additional citation context not shown here]

J. Dingel. Towards a theory for shared-variable concurrent programming. Thesis proposal, Carnegie Mellon University, 1996.

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