Filters








24 Hits in 2.7 sec

Multiprogram Design in the theory of Owicki and Gries

Doug Goldson
2001 unpublished
doi:10.14236/ewic/iwfm2001.2 fatcat:ma2fz4gajjbvbdajdx7cq6s7gu

Extending the theory of Owicki and Gries with a logic of progress

Brijesh Dongol, Doug Goldson, David Gries
2006 Logical Methods in Computer Science  
The rules for progress in UNITY are then modified to suit this new system. This modification is however subtle enough to allow the theory of Owicki and Gries to be used without change.  ...  Integration of the two is achieved by using auxiliary variables in a systematic way that incorporates program counters into the program text.  ...  Whether greater expressivity of temporal logic can be achieved in the Owicki-Gries theory by combining auxiliary variables and leads-to is a topic of further research.  ... 
doi:10.2168/lmcs-2(1:6)2006 fatcat:r2ukts72abefff3idhjytjxmuq

Peterson's mutual exclusion algorithm revisited

F.W. van der Sommen, W.H.J. Feijen, A.J.M. van Gasteren
1997 Science of Computer Programming  
The only formalisms used in the derivation are the predicate calculus and the theory of Owicki and Gries. No use is made of temporal logic.  ...  In particular, the so complicating oscillating behaviour of an u~uit-condition is fully absorbed by the use of a variant function. @ 1997 Elsevier Science B.V.  ...  Acknowledgements We are indebted to the members of the ETAC (Eindhoven Tuesday Afternoon Club), in particular to Lex Bijlsma, for firing their comments at us.  ... 
doi:10.1016/s0167-6423(97)00003-8 fatcat:nadk7zwjqrcrrk6fqoktogmhoe

Page 8091 of Mathematical Reviews Vol. , Issue 98M [page]

1998 Mathematical Reviews  
Summary: “We exemplify a method for the formal derivation of multiprograms, using the simple theory of Owicki and Gries as our main tool for coping with concurrency.  ...  In our first and sim- plest example we derive a protocol for the problem of concurrent vector writing, and in our second and trickier example we design a distributed algorithm for the problem of liberal  ... 

Page 3637 of Mathematical Reviews Vol. , Issue 80I [page]

1980 Mathematical Reviews  
Hoare, Towards a theory of parallel programming (pp. 202-214); Per Brinch Hansen, Structured multiprogramming (pp. 215-223); C. A. R.  ...  Hoare, Proof of a program: Find (pp. 101-115); Ole-Johan Dahl, An approach to correctness proofs of semicoroutines (pp. 116-129); Susan Owicki and David Gries, An axiomatic proof technique for parallel  ... 

Derivation of Distributed Programs in the Theory of Owicki and Gries: An Example

Doug Goldson
2003 unpublished
The derivation is carried out in the theory of Owicki and Gries.  ...  A theory that is based on a shared variable model of communication is shown to manage the design of distributed multiprograms quite well.  ...  proof of its correctness in the theory of Owicki and Gries.  ... 
doi:10.14236/ewic/iwfm2003.7 fatcat:zgu3gxtnavbsfmmyaha3gfug6q

Extending the theory of Owicki and Gries with asynchronous message passing

D. Goldson
Tenth Asia-Pacific Software Engineering Conference, 2003.  
This paper describes an extension of the theory of Owicki and Gries to a programming language that supports asynchronous message passing based on unconditional send actions and conditional receive actions  ...  A number of experiments are reported, based on a running example problem, and with the aim of exploring design heuristics and of streamlining derivations and progress arguments.  ...  The theory of Owicki and Gries is based on the idea of a correct program annotation (in the style of Hoare logic).  ... 
doi:10.1109/apsec.2003.1254408 dblp:conf/apsec/Goldson03 fatcat:secyhk4esrfl7ifklaakp4wnei

A theory for nondeterminism, parallelism, communication, and concurrency

Manfred Broy
1986 Theoretical Computer Science  
So the language allows to treat the basic semantic notions of nondeterminism, parallelism, communication, and concurrency for multiprogramming in a completely formal, applicative framework.  ...  An applicative language is introduced for representing concurrent programs and communicating systems in the form of mutually recursive systems of nondeterministic equations for functions and streams.  ...  [27] ) the verification techniques of Gries and Owicki can be applied to prove partial correctness of the resulting programs (if not already guaranteed by the development) independently since the proofs  ... 
doi:10.1016/0304-3975(86)90040-x fatcat:deaevefkgrc2nkg4qbcahq2bca

Under the spell of Leibniz's dream

Edsger W. Dijkstra
2001 Information Processing Letters  
I have in mind A.J.Martin in connection with chip design, and W.H.J.Feijen and A.J.M. van Gasteren, who forged the Gries-Owicki theory into a methodology for deriving multiprograms.  ...  most urgent one, and the development of some urgently needed theory was often the most practical thing to do.  ... 
doi:10.1016/s0020-0190(00)00204-0 fatcat:aneje6cxxvcqtebjk4zbd4lk3e

Partition Consistency: A Case Study in Modeling Systems with Weak Memory Consistency and Proving Correctness of their Implementations [article]

Steven Cheng, Lisa Higham, Jalal Kawash
2013 arXiv   pre-print
Multiprocess systems, including grid systems, multiprocessors and multicore computers, incorporate a variety of specialized hardware and software mechanisms, which speed computation, but result in complex  ...  Therefore, formal specification of the implementation or architecture is necessary, and proofs of correspondence between the abstract and the concrete models are required.  ...  Acknowledgments This research was supported by the Natural Sciences and Engineering Research Council of Canada through discovery grant number 41900-07.  ... 
arXiv:1306.0077v1 fatcat:b3fr4schpfc3vcxakpcjb65fqa

Page 868 of Mathematical Reviews Vol. 16, Issue Index [page]

Mathematical Reviews  
Centralized teleprocessing network design. (84i:94068) Kolyada, A. A. The normed kernel of a number in systems of residue classes and its calculation.  ...  (with Owicki, Susan) Construction of centered shortest-path trees in networks. (84i:90054) Wigderson, Avi See Dolev, Danny, (See 84j:94004) 68Bxx Software 68B0S General theory of programming (with Manes  ... 

An introduction to compositional methods for concurrency and their application to real-time [chapter]

J. J. M. Hooman, W. P. de Roever
1992 Formale Beschreibungstechniken für verteilte Systeme  
Compositionality enables verification during the process of (top-down) design -the derivation of correct programs -instead of the more familiar a-posteriori verification based on already completed program  ...  We stress the development towards compositional methods, i.e. methods in which the specification of a compound program can be inferred from specifications of its constituents without reference to the internal  ...  J J M Hooman and W P de Roever an early paper of Haase (1981) in which time is introduced by a special variable in the weakest pre-condition calculus.  ... 
doi:10.1007/978-3-642-77580-2_5 fatcat:2sqwxdmm4fgg7a2tf723nswy3u

An introduction to compositional methods for concurrency and their application to real-time

J J M Hooman, W P de Roever
1992 Sadhana (Bangalore)  
Compositionality enables verification during the process of (top-down) design -the derivation of correct programs -instead of the more familiar a-posteriori verification based on already completed program  ...  We stress the development towards compositional methods, i.e. methods in which the specification of a compound program can be inferred from specifications of its constituents without reference to the internal  ...  J J M Hooman and W P de Roever an early paper of Haase (1981) in which time is introduced by a special variable in the weakest pre-condition calculus.  ... 
doi:10.1007/bf02811338 fatcat:xw2ptfdyonfjjd4pucfqzkbjiu

The design of Edison

Brinch Hansen
1981 Software, Practice & Experience  
It also discusses the linguistic problems of writing a concise language report. P. Brinch Hansen, The Design of Edison.  ...  This paper describes the considerations behind the design of the programming language Edison including the reasons why a large number of well-known language features were excluded.  ...  As soon as processes begin to communicate, one needs the whole apparatus of the Gries-Owicki theory to reason about the effects of using semaphores, buffers, monitors, and so on (Owicki 1976) .  ... 
doi:10.1002/spe.4380110404 fatcat:ms2vd5gmrbfwnjjnvyzomzitiu

A discipline of multiprogramming

Jayadev Misra
1996 ACM Computing Surveys  
The theories and design principles that contribute to productivity in specification, abstraction and modularization are developed in this book.  ...  Most of the chapters have a small amount of theory and a large number of examples.  ...  Feijen and van Gasteren [69] have developed a beautiful approach, based on the classic work of Owicki and Gries [145] , for designs of multiprograms, and they illustrate the approach convincingly on  ... 
doi:10.1145/242224.242286 fatcat:j3mpx2j4qjcuddi34xz5fbdq4q
« Previous Showing results 1 — 15 out of 24 results