Arthur J. Bernstein

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2006
47Completeness and realizability: conditions for automatic generation of workflows. Shiyong Lu, Arthur J. Bernstein, Philip M. Lewis. Int. J. Found. Comput. Sci. (17): 223-245 (2006). Web SearchBibTeXDownload
46Automatic workflow verification and generation. Shiyong Lu, Arthur J. Bernstein, Philip M. Lewis. Theor. Comput. Sci. (353): 71-92 (2006). Web SearchBibTeXDownload
2004
45A model for abstract process specification, verification and composition. Ziyang Duan, Arthur J. Bernstein, Philip M. Lewis, Shiyong Lu. ICSOC 2004, 232-241. Web SearchBibTeXDownload
44Semantics Based Verification and Synthesis of BPEL4WS Abstract Processes. Ziyang Duan, Arthur J. Bernstein, Philip M. Lewis, Shiyong Lu. ICWS 2004, 734-737. Web SearchBibTeXDownload
43Correct Execution of Transactions at Different Isolation Levels. Shiyong Lu, Arthur J. Bernstein, Philip M. Lewis. IEEE Trans. Knowl. Data Eng. (16): 1070-1081 (2004). Web SearchBibTeXDownload
2000
42Semantic Conditions for Correctness at Different Isolation Levels. Arthur J. Bernstein, Philip M. Lewis, Shiyong Lu. ICDE 2000, 57-66. Web SearchBibTeXDownload
1998
41Design and Performance of an Assertional Concurrency Control System. Arthur J. Bernstein, David Scott Gerstl, Wai-Hong Leung, Philip M. Lewis. ICDE 1998, 436-445. Web SearchBibTeXDownload
1996
40Transaction Decomposition Using Transaction Semantics. Arthur J. Bernstein, Philip M. Lewis. Distributed and Parallel Databases (4): 25-47 (1996). Web SearchBibTeXDownload
1995
39A Highly Asynchronous Minimum Spanning Tree Protocol. Gurdip Singh, Arthur J. Bernstein. Distributed Computing (8): 151-161 (1995). Web SearchBibTeXDownload
1994
38Bounded Ignorance: A Technique for Increasing Concurrency in a Replicated System. Narayanan Krishnakumar, Arthur J. Bernstein. ACM Trans. Database Syst. (19): 586-625 (1994). Web SearchBibTeXDownload
1992
37A Framework for Parallel Composition of Protocols. Gurdip Singh, Arthur J. Bernstein. PARLE 1992, 927-942. Web SearchBibTeXDownload
36High Throughput Escrow Algorithms for Replicated Databases. Narayanan Krishnakumar, Arthur J. Bernstein. VLDB 1992, 175-186. Web SearchBibTeX
1991
35A Nonblocking Quorum Consensus Protocol for Replicated Data. Divyakant Agrawal, Arthur J. Bernstein. IEEE Trans. Parallel Distrib. Syst. (2): 171-179 (1991). Cited by 23Web SearchBibTeXDownload
34Bounded Ignorance in Replicated Systems. Narayanan Krishnakumar, Arthur J. Bernstein. PODS 1991, 63-74. Web SearchBibTeX
1990
33On the Relative Execution Times of Distributed Protocols. Gurdip Singh, Arthur J. Bernstein. ICDCS 1990, 80-87. Web SearchBibTeX
1987
32Distributed Optimistic Concurrency Control with Reduced Rollback. Divyakant Agrawal, Arthur J. Bernstein, Pankaj Gupta, Soumitra Sengupta. Distributed Computing (2): 45-59 (1987). Cited by 42Web SearchBibTeXDownload
31Predicate Transfer and Timeout in Message Passing Systems. Arthur J. Bernstein. Inf. Process. Lett. (24): 43-52 (1987). Web SearchBibTeXDownload
1986
30Distributed Multi-Version Optimistic Concurrency Control for Relational Databases. Divyakant Agrawal, Arthur J. Bernstein, Pankaj Gupta, Soumitra Sengupta. COMPCON 1986, 416-421. Cited by 13Web SearchBibTeX
29Efficient Solutions to the Replicated Log and Dictionary Problems. Gene T. J. Wuu, Arthur J. Bernstein. Operating Systems Review (20): 57-66 (1986). Web SearchBibTeXDownload
1985
28Multicast Communication in UNIX 4.2BSD. Mustaque Ahamad, Arthur J. Bernstein. ICDCS 1985, 80-87. Web SearchBibTeX
27Maintaining Weakly-Consistent Replicated Data on Dynamic Groups of Computers. Ariel J. Frank, Larry D. Wittie, Arthur J. Bernstein. ICPP 1985, 155-162. Web SearchBibTeX
26False Deadlock Detection in Distributed Systems. Gene T. J. Wuu, Arthur J. Bernstein. IEEE Trans. Software Eng. (11): 820-821 (1985). Web SearchBibTeXDownload
25A Loosely Coupled Distributed System for Reliably Storing Data. Arthur J. Bernstein. IEEE Trans. Software Eng. (11): 446-454 (1985). Web SearchBibTeXDownload
24An Application of Name Based Addressing to Low Level Distributed Algorithms. Mustaque Ahamad, Arthur J. Bernstein. IEEE Trans. Software Eng. (11): 59-67 (1985). Web SearchBibTeXDownload
1984
23Group Communication on Netcomputers. Ariel J. Frank, Larry D. Wittie, Arthur J. Bernstein. ICDCS 1984, 326-335. Web SearchBibTeX
22Efficient Solutions to the Replicated Log and Dictionart Problems. Gene T. J. Wuu, Arthur J. Bernstein. PODC 1984, 233-242. Web SearchBibTeX
1982
21Concurrency Control Algorithms for Multiversion Database Systems. Philip A. Bernstein, Nathan Goodman. PODC 1982, 209-215. Web SearchBibTeX
20Distributed Communication via Global Buffer. David Gelernter, Arthur J. Bernstein. PODC 1982, 10-18. Web SearchBibTeX
1981
19A Modula Based Language Supporting Hierarchical Development and Verification. Arthur J. Bernstein, J. Robert Ensor. Softw., Pract. Exper. (11): 237-255 (1981). Web SearchBibTeX
18Proving Real-Time Properties of Programs with Temporal Logic. Arthur J. Bernstein, Paul K. Harter Jr.. SOSP 1981, 1-11. Web SearchBibTeXDownload
1980
17Output Guards and Nondeterminism in ``Communicating Sequential Processes''. Arthur J. Bernstein. ACM Trans. Program. Lang. Syst. (2): 234-238 (1980). Web SearchBibTeXDownload
1979
16Conditional Capabilities. Kattamuri Ekanadham, Arthur J. Bernstein. IEEE Trans. Software Eng. (5): 458-464 (1979). Web SearchBibTeXDownload
1978
15Conditions for the Equivalence of Synchronous and Asynchronous Systems. Eralp A. Akkoyunlu, Arthur J. Bernstein, Fred B. Schneider, Abraham Silberschatz. IEEE Trans. Software Eng. (4): 507-516 (1978). Web SearchBibTeXDownload
14On Language Restrictions to Ensure Deterministic Behavior in Concurrent Systems. Arthur J. Bernstein, Fred B. Schneider. Jerusalem Conference on Information Technology 1978, 537-541. Web SearchBibTeX
13Some New Transitions In Hierarchical Level Structures. Kattamuri Ekanadham, Arthur J. Bernstein. Operating Systems Review (12): 34-38 (1978). Web SearchBibTeXDownload
12Scheduling in Concurrent Pascal. Fred B. Schneider, Arthur J. Bernstein. Operating Systems Review (12): 15-20 (1978). Web SearchBibTeXDownload
1977
11Extending Concurrent Pascal to Allow Dynamic Resource Management. Abraham Silberschatz, Richard B. Kieburtz, Arthur J. Bernstein. IEEE Trans. Software Eng. (3): 210-217 (1977). Web SearchBibTeXDownload
1976
10Extending Concurrent Pascal to Allow Dynamic Resource Management (Abstract). Abraham Silberschatz, Richard B. Kieburtz, Arthur J. Bernstein. ICSE 1976, 236. Web SearchBibTeX
9Synthesizing a Response Function with a Feedback Scheduling Algorithm. Arthur J. Bernstein. SIAM J. Comput. (5): 309-317 (1976). Web SearchBibTeXDownload
1975
8A Computer Architecture for Level Structured Systems. Arthur J. Bernstein, Paul Siegel. IEEE Trans. Computers (24): 785-793 (1975). Web SearchBibTeXDownload
1974
7Analysis of a Feedback Scheduler. Y. S. Chua, Arthur J. Bernstein. SIAM J. Comput. (3): 159-176 (1974). Web SearchBibTeXDownload
1971
6A Policy-Driven Scheduler for a Time-Sharing System. Arthur J. Bernstein, J. C. Sharp. Commun. ACM (14): 74-78 (1971). Web SearchBibTeXDownload
5A Programmer Training Project. Arthur J. Bernstein. Commun. ACM (14): 449-452 (1971). Web SearchBibTeXDownload
1970
4Comment on the working set model for program behavior. Arthur J. Bernstein. Commun. ACM (13): 698-699 (1970). Web SearchBibTeXDownload
1969
3Synchronization in a parallel-accessed data base. Arie Shoshani, Arthur J. Bernstein. Commun. ACM (12): 604-607 (1969). Web SearchBibTeXDownload
1964
2On the minimum stage realization of switching functions using logic gates with limited fan-in. G. L. Hicks, Arthur J. Bernstein. SWCT (FOCS) 1964, 149-155. Web SearchBibTeXDownload
1Reducing variable dependency in combinational circuits. Arthur J. Bernstein. SWCT (FOCS) 1964, 156-164. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research