By Topic

Foundations of Computer Science, 1976., 17th Annual Symposium on

Date 25-27 Oct. 1976

Filter Results

Displaying Results 1 - 25 of 35
  • [Front cover]

    Publication Year: 1976, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (122 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 1976, Page(s):iv - v
    Request permission for commercial reuse | PDF file iconPDF (123 KB)
    Freely Available from IEEE
  • Foreword

    Publication Year: 1976, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (83 KB)
    Freely Available from IEEE
  • The mutual exclusion problem for unreliable processes

    Publication Year: 1976, Page(s):1 - 8
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1127 KB)

    Consider n processes operating asynchronously in parallel, each of wich maintains a single "special" variable which can be read (but not written) by the other processes. All coordination between processes is to be accomplished by means of the execution of the primitive operations of a process (1) reading another process's special variable, and (2) setting its own special variable to some value. A ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characterization of the synchronization languages for PV systems

    Publication Year: 1976, Page(s):9 - 18
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1249 KB)

    A basic question in the area of asynchronous computation is: Given a synchronization problem, what synchronization primitives are needed for a solution? This paper is directed toward answering this question by characterizing the "behavior" of synchronization systems incorporating PV, PV multiple, PV chunk and PV general synchronization primitives. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concurrency control for database systems

    Publication Year: 1976, Page(s):19 - 32
    Cited by:  Papers (15)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2017 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Linear time algorithm for deciding security

    Publication Year: 1976, Page(s):33 - 41
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    The Folklore is replete with stories of "secure" protection systems being compromised in a matter of hours. This is quite astounding since one is not likely to claim that a system is secure without some sort of proof to support the claim. In practice, proof is not provided and one reason for this is clear: although the protection primitives are apparently quite simple, they may potentially interac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Graph grammars and global program data flow analysis

    Publication Year: 1976, Page(s):42 - 56
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1602 KB)

    Program structure is defined in terms of a simple graph grammar, the "semi-structured flow graph grammar," which admits many of the control structure extensions suggested for "structured programming." The grammar defines a set of graph reductions which are shown to have the "Finite Church-Rosser (FCR)" property; i.e., when applied in any order to a graph, the limit (when no further reductions are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Assignment commands and array structures

    Publication Year: 1976, Page(s):57 - 66
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1253 KB)

    Straight line programs in which array elements can be referenced and set are considered. Two programs are equivalent if they compute the same expression as a function of the inputs. Testing the equivalence of programs with arrays is shown to be NP-complete, while programs without arrays can be tested for equivalence in linear time. Equivalence testing takes polynomial time when programs have eithe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • K + 1 heads are better than K

    Publication Year: 1976, Page(s):67 - 70
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (433 KB)

    There are languages which can be recognized by a deterministic (k + 1)-headed oneway finite automaton but which cannot be recognized by a k-headed one-way (deterministic or non-deterministic) finite automaton. Furthermore, there is a language accepted by a 2-headed nondeterministic finite automaton which is accepted by no k-headed deterministic finite automaton. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A second step toward the polynomial hierarchy

    Publication Year: 1976, Page(s):71 - 75
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (510 KB)

    Some of the questions posed by Baker, Gill, and Solovay [1] are here answered. The principal result is that there exists a recursive oracle for which the relativized polynomial hierarchy exists through the second level; that is, there is a recursive set B such that Σ2P,B ≠ π2P,B. It follows that Σ2P,B ⊂≠ Σ3P,B. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the structure of complete sets: Almost everywhere complexity and infinitely often speedup

    Publication Year: 1976, Page(s):76 - 80
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (558 KB)

    In this paper we investigate the structure of sets which are complete for various classes. We show, for example, that sets complete for deterministic time classes contain infinite polynomial time recognizable subsets, thus showing that they are not complex almost everywhere. We show by a related technique that any set complete for NEXP_TIME contains an infinite subset in DEXP_TIME, thereby showing... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Diophantine complexity

    Publication Year: 1976, Page(s):81 - 88
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1018 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On parallelism in turing machines

    Publication Year: 1976, Page(s):89 - 97
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1029 KB)

    A model of parallel computation based on a generalization of nondeterminism in Turing machines is introduced. Complexity classes //T(n)-TIME, //L(n)-SPACE, //LOGSPACE, //PTIME, etc. are defined for these machines in a way analogous to T(n)-TIME, L(n)-SPACE, LOGSPACE, PTIME, etc. for deterministic machines. It is shown that, given appropriate honesty conditions, L(n)-SPACE ⊆ //L(n)2-TIME T(... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Alternation

    Publication Year: 1976, Page(s):98 - 108
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1781 KB)

    We define alternating Turing Machines which are like nondeterministic Turing Machines, except that existential and universal quantifiers alternate. Alternation links up time and space complexities rather well, in that alternating polynomial time equals deterministic polynomial space, and alternating linear space equals deterministic exponential time. Such considerations lead to a two-person game c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semantical consideration on floyo-hoare logic

    Publication Year: 1976, Page(s):109 - 121
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1975 KB)

    This paper deals with logics of programs. The objective is to formalize a notion of program description, and to give both plausible (semantic) and effective (syntactic) criteria for the notion of truth of a description. A novel feature of this treatment is the development of the mathematics underlying Floyd-Hoare axiom systems independently of such systems. Other directions that such research migh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Categories for fixpoint-semantics

    Publication Year: 1976, Page(s):122 - 126
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (627 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algebraic formulation of knuthian semantics

    Publication Year: 1976, Page(s):127 - 136
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1219 KB)

    This paper presents a formulation, within the framework of initial algebra semantics, of Knuthian semantic systems (K-systems) which contain both synthesized and inherited attributes. This formulation permits a precise definition of K-systems, and combines their intuitive appeal with the theoretical power of algebraic methods. The basic approach consists of algebraically specifying the semantic po... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algebraic families of interpretations

    Publication Year: 1976, Page(s):137 - 146
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    To each family C of interpretations corresponds an equivalence relation among program schemes, namely the equivalence of the program schemes for all interpretation of C. A family C is algebraic if any two programs are C-equivalent iff every partial finite computation of one of them is C-equivalent to some partial finite computation of the other. Our main theorem states that a family C is algebraic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rational algebraic theories and fixed-point solutions

    Publication Year: 1976, Page(s):147 - 158
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1821 KB)

    In a wide variety of situations, computer science has found it convenient to define complex object as (fixed-point) solutions of certain equations. This has been done in both algebraic and order-theoretic settings, and has often been contrasted with other approaches. This paper shows how to formulate such solutions in a setting which encompasses both algebraic and order-theoretic aspects, so that ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simple languages and free schemes

    Publication Year: 1976, Page(s):159 - 165
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (665 KB)

    A context-free language is said to be simple if it is accepted by a single-state deterministic push-down store acceptor that operates in real-time and accepts by empty store. While the problem remains open of deciding whether or not the language accepted by a deterministic pushdown store acceptor is simple, it is shown that this problem is equivalent to another problem in schemata theory. This que... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-organizing binary search trees

    Publication Year: 1976, Page(s):166 - 172
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (655 KB)

    We consider heuristics which attempt to maintain a binary search tree in a near optimal form, assuming that elements are requested with fixed, but unknown, independent probabilities. A "move to root" heuristic is shown to yield an expected search time within a constant factor of that of an optimal static binary search tree. On the other hand, a closely related "simple exchange" technique is shown ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The complexity of searching an ordered random table

    Publication Year: 1976, Page(s):173 - 177
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (535 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using computer trees to derive lower bounds for selection problems

    Publication Year: 1976, Page(s):178 - 182
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (530 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The analysis of hashing algorithms that exhibit k-ary clustering

    Publication Year: 1976, Page(s):183 - 196
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (951 KB)

    In this paper we investigate the performance of hashing algorithms that begin the search into the table with k independent random probes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.