default search action
Susan S. Owicki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1995
- [j10]Andrew Birrell, Greg Nelson, Susan S. Owicki, Edward Wobber:
Network Objects. Softw. Pract. Exp. 25(S4): S4 (1995) - [c22]Michael N. Nelson, Mark A. Linton, Susan S. Owicki:
A Highly Available, Scalable ITV System. SOSP 1995: 54-67 - 1994
- [j9]Anna R. Karlin, Mark S. Manasse, Lyle A. McGeoch, Susan S. Owicki:
Competitive Randomized Algorithms for Nonuniform Problems. Algorithmica 11(6): 542-571 (1994) - 1993
- [j8]Thomas E. Anderson, Susan S. Owicki, James B. Saxe, Charles P. Thacker:
High Speed Switch Scheduling for Local Area Networks. ACM Trans. Comput. Syst. 11(4): 319-352 (1993) - [c21]Susan S. Owicki:
A Perspective on AN2: Local Area Network as Distributed System. PODC 1993: 1-11 - [c20]Andrew Birrell, Greg Nelson, Susan S. Owicki, Edward Wobber:
Network Objects. SOSP 1993: 217-230 - [e2]Susan S. Owicki, Richard R. Muntz:
Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems, Santa Clara, California, USA, May 10-14, 1993. ACM 1993, ISBN 0-89791-580-1 [contents] - 1992
- [c19]Thomas E. Anderson, Susan S. Owicki, James B. Saxe, Charles P. Thacker:
High Speed Switch Scheduling for Local Area Networks. ASPLOS 1992: 98-110 - [c18]Susan S. Owicki, Anna R. Karlin:
Factors in the Performance of the AN1 Computer Network. SIGMETRICS 1992: 167-180 - 1991
- [c17]Anna R. Karlin, Kai Li, Mark S. Manasse, Susan S. Owicki:
Empirical Studies of Competitive Spinning for a Shared-Memory Multiprocessor. SOSP 1991: 41-55 - 1990
- [c16]Anna R. Karlin, Mark S. Manasse, Lyle A. McGeoch, Susan S. Owicki:
Competitive Randomized Algorithms for Non-Uniform Problems. SODA 1990: 301-309
1980 – 1989
- 1989
- [c15]Susan S. Owicki, Anant Agarwal:
Evaluating the Performance of Software Cache Coherence. ASPLOS 1989: 230-242 - 1986
- [j7]Van Nguyen, Alan J. Demers, David Gries
, Susan S. Owicki:
A Model and Temporal Proof System for Networks of Processes. Distributed Comput. 1(1): 7-25 (1986) - 1985
- [j6]Keith Marzullo, Susan S. Owicki:
Maintaining the Time in a Distributed System. ACM SIGOPS Oper. Syst. Rev. 19(3): 44-54 (1985) - [c14]Van Nguyen, Alan J. Demers, David Gries
Behavior: A Temporal Approach to Process Modelling. Logic of Programs 1985: 237-254 - [c13]Van Nguyen, David Gries, Susan S. Owicki:
A Model and Temporal Proof System for Networks of Processes. POPL 1985: 121-131 - 1983
- [j5]David W. Wall, Susan S. Owicki:
Construction of centered shortest-path trees in networks. Networks 13(2): 207-232 (1983) - [j4]Brent Hailpern, Susan S. Owicki:
Modular Verification of Computer Communication Protocols. IEEE Trans. Commun. 31(1): 56-68 (1983) - [c12]Amy L. Lansky, Susan S. Owicki:
GEM: A Tool for Concurrency Specification and Verification. PODC 1983: 198-212 - [c11]Keith Marzullo, Susan S. Owicki:
Maintaining the Time in a Distributed System. PODC 1983: 295-305 - 1982
- [j3]Susan S. Owicki, Leslie Lamport:
Proving Liveness Properties of Concurrent Programs. ACM Trans. Program. Lang. Syst. 4(3): 455-495 (1982) - [c10]Stefano Ceri, Susan S. Owicki:
On the Use of Optimistic Methods for Concurrency Control in Distributed Databases. Berkeley Workshop 1982: 117-129 - [c9]Les Belady, Susan S. Owicki, Robert Balzer, Bill Curtis:
Panel Discussion. COMPCON 1982: 235-236 - [c8]Brent Hailpern, Susan S. Owicki:
Modular Verification of Concurrent Programs. POPL 1982: 322-336 - 1981
- [c7]Leslie Lamport, Susan S. Owicki:
Program Logics and Program Verification (position paper). Logic of Programs 1981: 197-199 - [c6]Susan S. Owicki:
Making the World Safe for Garbage Collection. POPL 1981: 77-86
1970 – 1979
- 1978
- [c5]Susan S. Owicki:
Verifying parallel programs with resource allocation. Mathematical Studies of Information Processing 1978: 151-164 - [c4]Susan S. Owicki:
Specifications and Proofs for Abstract Data Types in Concurrent Programs. Program Construction 1978: 174-197 - [c3]Susan S. Owicki:
Specification and Verification of a Network Nail System. Program Construction 1978: 198-234 - [e1]Edward J. McCluskey, John F. Wakerly, E. David Crockett, Thomas H. Bredt, David J. Lu, William M. van Cleemput, Susan S. Owicki, Roy C. Ogus, Ravi Apte, M. Danielle Beaurdy, Jacques Losq:
Proceedings of the 5th Annual Symposium on Computer Architecture, Palo Alto, CA, USA, April 1978. ACM 1978, ISBN 978-1-4503-7400-2 - 1977
- [c2]Susan S. Owicki:
Verifying Concurrent Programs With Shared Data Classes. Formal Description of Programming Concepts 1977: 279-300 - 1976
- [j2]Susan S. Owicki, David Gries
An Axiomatic Proof Technique for Parallel Programs I. Acta Informatica 6: 319-340 (1976) - [j1]Susan S. Owicki, David Gries
Verifying Properties of Parallel Programs: An Axiomatic Approach. Commun. ACM 19(5): 279-285 (1976) - [c1]Susan S. Owicki:
A Consistent and Complete Deductive System for the Verification of Parallel Programs. STOC 1976: 73-86 - 1975
- [b2]Susan S. Owicki:
Axiomatic Proof Techniques for Parallel Programs. Outstanding Dissertations in the Computer Sciences, Garland Publishing, New York 1975, ISBN 0-8240-4413-4 - [b1]Susan S. Owicki:
Axiomatic Proof Techniques for Parallel Programs. Cornell University, USA, 1975
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: