LCS Technical Memos (1974 - 2003): Recent submissions

Now showing items 289-291 of 486

    • New Lower Bound Techniques For VLSI 

      Leighton, Frank Thomson (1982-08)
      In this paper, we use crossing number and wire area arguments to find lower bounds on the layout area and maximum edge length of a variety of new and computationally useful networks. In particular, we describe 1) an N-node ...

    • Hoare's Logic Is Not Complete When It Could Be 

      Bergstra, J.; Chielinksa, A.; Tiuryn, J. (1982-08)
      It is known (cf.[2]) that is the Hoare rules are complete for a first-order structure A, then the set of partial correctness assertions true over A is recursive in the first-order theory of A. We show that the converse is ...

    • Foundations for Office Semantics 

      Barber, Gerald R.; Hewitt, Carl (1982-07)
      In this paper we develop the semantics of work in the office in terms of the concepts of application structure and organizational structure of the office. Application structure is concerned with the rules and constraints ...