Download:
|
by Jerry James, Ambuj Singh
Lecture Notes in Computer Science
http://www.cs.ucsb.edu/~ambuj/compose.ps
Add To MetaCart
Abstract:
We consider the language, programming, and proof-theoretic issues in the design of open systems built from concurrent objects. Our model supports constructs for communication and synchronization, and mechanisms for dioeerent kinds of method invocations. For full generality, it also supports an unbounded number of objects and threads of control. We express object properties using TLA, and use the rely-guarantee mechanism for specifying the interaction of an object with its environment. Our proof methodology supports proof reuse in subclasses. It also supports compositional reasoning techniques, so that properties of a system can be deduced from the properties of its component objects. We remark on the inheritance anomaly and issues that arise from the unboundedness of the system. 1
Citations
|
737
|
The temporal logic of actions
– Lamport
- 1994
|
|
477
|
Conjoining specifications
– Abadi, Lamport
- 1995
|
|
368
|
The Existence of Refinement Mappings
– Abadi, Lamport
- 1991
|
|
329
|
Hierarchical correctness proofs for distributed algorithms
– Lynch, Tuttle
- 1987
|
|
257
|
An Axiomatic Proof Technique for Parallel Programs I
– Owicki, Gries
- 1976
|
|
186
|
Common LISP: The Language
– Steele
- 1984
|
|
175
|
Chandy and Jayadev Misra. Parallel Program Design: A Foundation
– Mani
- 1988
|
|
132
|
The Java Virtual Machine Specification. The Java Series
– Lindholm, Yellin
- 1997
|
|
108
|
Distributed network protocols
– Segall
- 1983
|
|
70
|
Programming Distributed Systems
– Bal
- 1990
|
|
65
|
Now you may compose temporal logic specifications
– Barringer, Kuiper, et al.
- 1984
|
|
53
|
A Proof Technique for Rely/Guarantee Properties
– Stark
- 1985
|
|
46
|
Object-oriented specification of reactive systems
– J£rvinen, Kurki-Suonio, et al.
- 1990
|
|
25
|
Modular reasoning in the presence of subclassing
– Stata, Guttag
- 1995
|
|
9
|
A proof system for the parallel object-oriented language POOL
– Boer
- 1990
|
|
8
|
Mathematical logic and Hilbert's ffl-symbol
– Leisenring
- 1969
|
|
8
|
P-A logic|a compositional proof system for distributed programs
– Pandya, Joseph
- 1991
|
|
7
|
Verification of a distributed summation algorithm
– Vaandrager
- 1995
|
|
6
|
A foundation for modular reasoning about safety and progress properties of state-based concurrent programs
– Collette, Knapp
- 1997
|
|
6
|
Incremental specification with joint actions: The RPC-memory specification problem
– Kurki-Suonio
- 1996
|
|
4
|
A mechanical proof of Segall's PIF algorithm
– Hesselink
- 1997
|
|
3
|
Composing processes using modified relyguarantee specifications. Caltech technical report CS-TR-96-22
– Manohar, Sivilotti
- 1996
|
