Papers by Arthur Bernstein
Summary of Research, Grant AFOSR-81-0197, 15 June 1983 - 14 June 1984
Abstract : The research performed under this grant was concerned with distributed languages and a... more Abstract : The research performed under this grant was concerned with distributed languages and algorithms.
IEEE Transactions on Software Engineering, Nov 1, 1978
Synchronous and asynchronous operation of software cesses. Such a state may not have been anticip... more Synchronous and asynchronous operation of software cesses. Such a state may not have been anticipated by the syssystems are defined. It is argued that certifying the correct operation of a system in the synchronous mode is significantly simpler than in the asynchronous mode. A series of compile-time and run-time restrictions for systems constructed in Concuirent Pascal are presented which assure equivalent operation in the synchronous and asynchronous modes.
IEEE Transactions on Electronic Computers, Jun 1, 1965
The problem of assigning codes to the output states of are some input conditions upon which no co... more The problem of assigning codes to the output states of are some input conditions upon which no constraints a multiple-output combinational circuit is considered. It is assumed are placed, i.e., don't-care conditions, we say the netthat if the circuit has n inputs, then the 2n fundamental products, work is partially specified. i.e., input states, are to be partitioned into disjoint groups, such that all members of the same group produce the same output state. The The following example iS presented to llustrate the problem of coding the output states is studied here. Two algorithms kind of problem to be treated; it is solved later in Secfor making the assignments are considered. The first gives those en-tion I I. codings for which the sum of the costs of all the output functions is Example 1: The 16 input conditions for a 4-input, 3minimum; the second minimizes the variable dependency of the outoutput combinational circuit are divided into 8 disjoint put functions. In problems where reduced variable dependency is possible it has been found that the second algorithm yields minimum output states, as shown in Fig. 1. Encode the output or near-minimum cost networks. Since this algorithm is easily states so as to minimize the mechanization cost for applied it is useful for finding economical networks in situations some technology. where a large number of variables are involved since in such cases Note that the statement of the desired output groupthe first algorithm becomes lengthy. ings could have been presented more compactly in a Attention is also directed to the problem of determining the opti-ingcod havetben presen mr cmatyia mum number of output variables to use for an encoding. An upper standard function map, as shown in Fig. 2. bound is derived and an example is presented which requires this bound. xl x2 x3 x4 State O 1 1
Database Systems: An Application Oriented Approach, Complete Version (2nd Edition)
Addison-Wesley Longman Publishing Co., Inc. eBooks, Mar 1, 2005
... Languages: QBE and PC Databases The Relationship between Relational Algebra and the ... Semis... more ... Languages: QBE and PC Databases The Relationship between Relational Algebra and the ... Semistructured Data Overview of XML XML Schema XML Query Languages Bibliographic Notes ... Query Planning Strategies Bibliographic Notes Exercises Chapter 17 OLAP and Data ...
IEEE Transactions on Software Engineering, 1985
, he has been in the computer field since 1950. At SRI Intemational, he directed the ERMA project... more , he has been in the computer field since 1950. At SRI Intemational, he directed the ERMA project that developed the first computer system for the banking industry in the 1950's and served as Executive Director of the Information Science and Engineering division from 1961 to 1968. He then served eight years as Chairman of Computer Science at the University of Washington. While at SRI he was a lecturer at Stanford, and during 1976-1977 he was a Visiting Professor at the Vrije Universiteit in Amsterdam. Dr. Noe is a member of Eta Kappa Nu, Tau Beta Pi, Sigma Xi, and the Association for Computing Machinery.
Binary encoding of analog signals for noisy channels
Princeton University eBooks, 1965
IEEE Transactions on Electronic Computers, Aug 1, 1966
Transaction semantics and concurrency control
Semantics based analysis and synthesis of web services and workflows
Web service technologies provide a standard platform based on which heterogeneous software applic... more Web service technologies provide a standard platform based on which heterogeneous software applications can be integrated over the Internet. Web service protocols, such as WSDL, provide a standard way for software applications to communicate with each other. Web service orchestration languages, such as BPEL4WS, are proposed to specify business processes as workflows whose composite tasks are web services. In many cases, it is critical to verify the correctness of a business process before it is deployed, and it is also highly desirable that new business processes be automatically synthesized from available web services based on the business requirement. An abstract process model is introduced. The model restricts the data manipulation constructs in an abstract BPEL process. The restrictions permit a full description of a protocol while hiding computation details. A restricted abstract process can easily he converted into an abstract BPEL process or expanded into an executable process. A logic model is presented to formally specify the semantics of web services and workflows as abstract processes. A set of inference rules are established to deduce the strongest postcondition and weakest precondition of an abstract process. We demonstrate that the rules can be used for automatic inference due to the restriction on data manipulation capabilities in an abstract process. Based on this model, an algorithm is developed to automatically annotate the semantics and verify the correctness of workflows. An algorithm is developed to automatically synthesize a business process given its required semantics and a task library. The well-formedness of a task library is defined and the ranking assumption is introduced to simplify the synthesis procedure and guarantee its completeness. A prototype of the verification and synthesis system has been implemented and several business processes in the financial industry have been studied based on our approach. The model and algorithm is then extended to allow business rules to be specified and incorporated into the synthesis procedure.
Theory of computational error correcting codes for arithmetic units
Semantic concurrency control, recovery, and performance profiling for improving response time in database systems
Transaction semantics and concurrency control
Most workflow research focuses on the modeling aspects of workflows, ie, the specification of how... more Most workflow research focuses on the modeling aspects of workflows, ie, the specification of how the execution of thoses tasks in a workflow is to be ordered. Correctness of a workflow is not defined in terms of the outcome of the workflow, but in terms of the enforcement of the data and control dependency that are specified at design time. The semantics of each task is not modeled, thus the specification of these dependencies is based on the user's informal intuition and understanding of a particular workflow ...
1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design, 1964
In this paper a method is presented for reducing the number of stages of logic in the realization... more In this paper a method is presented for reducing the number of stages of logic in the realization of an arbitrary Boolean function when an upper bound exists on the fan-in at each gate. A procedure for obtaining the minimum stage realization of the function in sum of products form is first developed. The use this minimum is then described.
Databases and Transaction Procesing : An Application-Oriented Approach / P.M. Lewis, A. Bernstein, M. Kifer
Computer Group News
IEEE Transactions on Electronic Computers, 1966
Uploads
Papers by Arthur Bernstein