http://hdl.handle.net/1813/517 2013-06-19T09:18:38Z 2013-06-19T09:18:38Z Hopcroft, John E. Ullman, Jeffrey D. http://hdl.handle.net/1813/10810 2008-05-15T15:09:10Z 2008-05-14T13:42:16Z

Title: A Linear List Merging Algorithm Authors: Hopcroft, John E.; Ullman, Jeffrey D. Abstract: A linear list merging algorithm and its analysis is presented. Starting with n lists, each containing a single element, the algorithm will execute an arbitrary sequence of requests to merge lists and to find the name of the list currently containing a given element. If the length of the sequence of requests is bounded by a constant times n, then the execution time of the algorithm on a random access computer is bounded by a constant times n.

2008-05-14T13:42:16Z Meiling, Erik http://hdl.handle.net/1813/7516 2007-12-09T13:33:49Z 1979-12-01T00:00:00Z

Title: On the Modelling Power of Petri Nets Authors: Meiling, Erik Abstract: The behavior of a Petri net is expressed as a formal language. Certain families of Petri net languages are characterized by propositions similar to the classical pumping theorems. The results are used to give examples of behaviors that cannot be expressed by languages in these families.

1979-12-01T00:00:00Z Gries, David http://hdl.handle.net/1813/7515 2007-12-09T13:37:45Z 1979-11-01T00:00:00Z

Title: Cand and Cor Before and Then or Else in Ada Authors: Gries, David Abstract: NO ABSTRACT SUPPLIED

1979-11-01T00:00:00Z Levin, Gary Marc http://hdl.handle.net/1813/7514 2007-12-09T13:00:59Z 1979-11-01T00:00:00Z

Title: A Proof Technique for Communicating Sequential Processes(With an Example) Authors: Levin, Gary Marc Abstract: We present proof rules for an extension of the Communicating Sequential Processes proposed by Hoare. The send and receive statements are treated symmetrically, simplifying the rules and allowing send to appear in guards. An example is given to explain the use of the technique. This is an outline of a substantial part of a PhD thesis that is expected to be completed in June 1980.

1979-11-01T00:00:00Z Leivant, Daniel http://hdl.handle.net/1813/7513 2007-12-09T13:29:03Z 1979-11-01T00:00:00Z

Title: On Linear Natural Deduction Authors: Leivant, Daniel Abstract: NO ABSTRACT SUPPLIED

1979-11-01T00:00:00Z Archer, James E., Jr. Conway, Richard W. Shore, Andrew I. Silver, Leonard S. http://hdl.handle.net/1813/7512 2007-12-09T13:23:54Z 1979-10-01T00:00:00Z

Title: The System Architecture for CORE: A Tolerant Program Development Environment Authors: Archer, James E., Jr.; Conway, Richard W.; Shore, Andrew I.; Silver, Leonard S. Abstract: CORE is a program development environment intended primarily to explore a highly tolerant useer interface. In some respects the internal architecture is also novel. It permits a highly interactive and supportive user interface to be implemented with processing routines which are essentially oblivious to any user interaction.

1979-10-01T00:00:00Z Archer, James E., Jr. Shore, Andrew I. http://hdl.handle.net/1813/7511 2007-12-09T12:54:49Z 1979-10-01T00:00:00Z

Title: A Program Development System Execution Supervisor Authors: Archer, James E., Jr.; Shore, Andrew I. Abstract: The Cornell Program Development System is an experimental vehicle to explore the applicability of highly cooperative tactics to a contemporary development environment. The CPDS provides significant facilities for modifying and immediately executing programs. The execution supervisor and the internal user program representation it uses to implement these facilities are described.

1979-10-01T00:00:00Z Luk, Franklin T. Pagano, Marcello http://hdl.handle.net/1813/7510 2007-12-09T03:45:16Z 1979-10-01T00:00:00Z

Title: Quadratic Programming with M-Matrices Authors: Luk, Franklin T.; Pagano, Marcello Abstract: In this paper, we study the problem of quadratic programming with M-matrices. We describe (1) an effective algorithm for the case where the variables are subject to a lower bound constraint, and (2) an analogous algorithm for the case where the variables are subject to lower and upper bounds constraints. We demonstrate the special monotone behavior of the iterate and gradient vectors. The result on the gradient vector is new. It leads us to consider a simple updating procedure which preserves the monotonicity of both vectors. The procedure uses the fact that an M-matrix has a non-negative inverse. Two new algorithms are then constructed by incorporating this updating procedure into the two given algorithms. We give numerical examples which show that the new methods can be more efficient than the original ones.

1979-10-01T00:00:00Z Archer, James E., Jr. http://hdl.handle.net/1813/7509 2007-12-09T13:21:35Z 1979-10-01T00:00:00Z

Title: Ada/CS - An Instructional Subset of the Programming Language Ada Authors: Archer, James E., Jr. Abstract: NO ABSTRACT SUPPLIED

1979-10-01T00:00:00Z Majster, Mila E. http://hdl.handle.net/1813/7508 2007-12-09T13:06:45Z 1979-10-01T00:00:00Z

Title: A Unified View of Semantics Authors: Majster, Mila E. Abstract: NO ABSTRACT SUPPLIED

1979-10-01T00:00:00Z