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