Proceedings 11th Annual IEEE Symposium on Logic in Computer Science

27-30 July 1996

Filter Results

Displaying Results 1 - 25 of 51
  • Proceedings 11th Annual IEEE Symposium on Logic in Computer Science

    Publication Year: 1996
    Request permission for reuse | PDF file iconPDF (192 KB)
    Freely Available from IEEE
  • A generalization of Fagin's theorem

    Publication Year: 1996, Page(s):2 - 12
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (977 KB)

    Fagin's theorem characterizes NP as the set of decision problems that are expressible as second-order existential sentences, i.e., in the form (/spl exist//spl Pi/)/spl phi/, where /spl Pi/ is a new predicate symbol, and /spl phi/ is first-order. In the presence of a successor relation, /spl phi/ may be assumed to be universal, i.e., /spl phi//spl equiv/(/spl forall/x~)/spl alpha/ where /spl alpha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DATALOG SIRUPs uniform boundedness is undecidable

    Publication Year: 1996, Page(s):13 - 24
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (935 KB)

    DATALOG is the paradigmatic database query language. If it is possible to eliminate recursion from a DATALOG program then it is uniformly bounded. Since uniformly bounded programs can be executed in parallel constant time, the possibility of automated boundedness detection is an important issue, and has been studied in many papers. In this paper we solve one of the most famous open problems in the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the structure of queries in constraint query languages

    Publication Year: 1996, Page(s):25 - 34
    Cited by:  Papers (11)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1045 KB)

    We study the structure of first-order and second-order queries over constraint databases. Constraint databases are formally modeled as finite relational structures embedded in some fixed infinite structure. We concentrate on problems of elimination of constraints, reducing quantification range to the active domain of the database and obtaining new complexity bounds. We show that for a large class ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fully abstract domain model for the /spl pi/-calculus

    Publication Year: 1996, Page(s):36 - 42
    Cited by:  Papers (28)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (596 KB)

    Abramsky's domain equation for bisimulation and the author's categorical models for names combine to give a domain-theoretic model for the /spl pi/-calculus. This is set in a functor category which provides a syntax-free interpretation of fresh names, privacy visibility and non-interference between processes. The model is fully abstract for strong late bisimilarity and equivalence (bisimilarity un... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fully-abstract model for the /spl pi/-calculus

    Publication Year: 1996, Page(s):43 - 54
    Cited by:  Papers (16)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1184 KB)

    This paper provides both a fully abstract (domain-theoretic) model for the /spl pi/-calculus and a universal (set-theoretic) model for the finite /spl pi/-calculus with respect to strong late bisimulation and congruence. This is done by: considering categorical models, defining a metalanguage for these models, and translating the /spl pi/-calculus into the metalanguage. A technical novelty of our ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Higher dimensional transition systems

    Publication Year: 1996, Page(s):55 - 62
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (753 KB)

    We introduce the notion of higher dimensional transition systems as a model of concurrency providing an elementary, set-theoretic formalisation of the idea of higher dimensional transition. We show an embedding of the category of higher dimensional transition systems into that of higher dimensional automata which cuts down to an equivalence when we restrict to non-degenerate automata. Moreover, we... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algebraic theory of process efficiency

    Publication Year: 1996, Page(s):63 - 72
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (909 KB)

    This paper presents a testing-based semantic theory for reasoning about the efficiency of concurrent systems as measured in terms of the amount of their internal activity. The semantic preorders are given an algebraic characterization, and their optimality is established by means of a full abstractness result. They are also shown to subsume existing bisimulation-based efficiency preorders. An exam... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The subtyping problem for second-order types is undecidable

    Publication Year: 1996, Page(s):74 - 85
    Cited by:  Papers (7)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1101 KB)

    We prove that the subtyping problem induced by Mitchell's containment relation (1988) for second-order polymorphic types is undecidable. It follows that type-checking is undecidable for the polymorphic lambda-calculus extended by an appropriate subsumption rule. View full abstract»

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

    Publication Year: 1996, Page(s):86 - 97
    Cited by:  Papers (14)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1106 KB)

    The need for subtyping in type-systems with dependent types has been realized for some years. But it is hard to prove that systems combining the two features have fundamental properties such as subject reduction. Here we investigate a subtyping extension of the system /spl lambda/P, which is an abstract version of the type system of the Edinburgh Logical Framework LF. By using an equivalent formul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reduction-free normalisation for a polymorphic system

    Publication Year: 1996, Page(s):98 - 106
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (762 KB)

    We give a semantical proof that every term of a combinator version of system F has a normal form. As the argument is entirely formalisable in an impredicative constructive type theory a reduction-free normalisation algorithm can be extracted from this. The proof is presented as the construction of a model of the calculus inside a category of presheaves. Its definition is given entirely in terms of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Until hierarchy for temporal logic

    Publication Year: 1996, Page(s):108 - 117
    Cited by:  Papers (11)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (983 KB)

    We prove there is a strict hierarchy of expressive power according to the Until depth of linear temporal logic (TL) formulas: for each k, there is a very natural property that is not expressible with k nestings of Until operators, regardless of the number of applications of other operators, but is expressible by a formula with Until depth k+1. Our proof uses a new Ehrenfeucht-Fraisse (EF) game des... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Locally linear time temporal logic

    Publication Year: 1996, Page(s):118 - 127
    Cited by:  Papers (14)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1035 KB)

    We study linear time temporal logics of multiple agents, where the temporal modalities are local. These modalities not only refer to local next-instants and local eventuality, but also global views of agents at any local instant, which are updated due to communication from other agents. Thus agents also reason about the future, present and past of other agents in the system. The models for these l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A modal /spl mu/-calculus for durational transition systems

    Publication Year: 1996, Page(s):128 - 137
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (886 KB)

    Durational transition systems are finite transition systems where every transition is additionally equipped with a duration. We consider the problem of interpreting /spl mu/-formulas over durational transition systems. In case the formula contains only operations minimum, maximum, addition, and sequencing, we show that the interpretation ist not only computable but (up to a linear factor) as effic... View full abstract»

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

    Publication Year: 1996, Page(s):138 - 147
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1088 KB)

    We investigate set constraints over set expressions with Tarskian functional and relational operations. Unlike the Herbrand constructor symbols used in recent set constraint formalisms, the meaning of a Tarskian function symbol is interpreted in an arbitrary first order structure. We show that satisfiability of Tarskian set constraints is decidable in nondeterministic doubly exponential time. We a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reasoning about local variables with operationally-based logical relations

    Publication Year: 1996, Page(s):152 - 163
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1089 KB)

    A parametric logical relation between the phrases of an Algol-like language is presented. Its definition involves the structural operational semantics of the language, but was inspired by recent denotationally-based work of O'Hearn and Reynolds on translating Algol into a predicatively polymorphic linear lambda calculus. The logical relation yields an applicative characterisation of contextual equ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The essence of parallel Algol

    Publication Year: 1996, Page(s):164 - 173
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (881 KB)

    We consider a parallel Algol-like language, combining the /spl lambda/-calculus with shared-variable parallelism. We provide a denotational semantics for this language, simultaneously adapting the possible worlds model of Reynolds and Oles (1981, 1982) to the parallel setting and generalizing the "transition traces" model to the procedural setting. This semantics supports reasoning about safety an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Games and full abstraction for FPC

    Publication Year: 1996, Page(s):174 - 183
    Cited by:  Papers (13)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (761 KB)

    We present a new category of games, /spl Gscr/, and build from it a cartesian closed category I and its extensional quotient /spl epsi/. /spl epsi/ represents an improvement over existing categories of games in that it has sums as well as products, function spaces and recursive types. A model of the language FPC, a sequential functional language with just this type structure, in /spl epsi/ is desc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A temporal-logic approach to binding-time analysis

    Publication Year: 1996, Page(s):184 - 195
    Cited by:  Papers (29)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (940 KB)

    The Curry-Howard isomorphism identifies proofs with typed /spl lambda/-calculus terms, and correspondingly identifies propositions with types. We show how this isomorphism can be extended to relate constructive temporal logic with binding-time analysis. In particular we show how to extend the Curry-Howard isomorphism to include the O ("next") operator from linear-time temporal logic. This yields t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Symbolic protocol verification with queue BDDs

    Publication Year: 1996, Page(s):198 - 206
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (819 KB)

    Symbolic verification based on Binary Decision Diagrams (BDDs) has proven to be a powerful technique for ensuring the correctness of digital hardware. In contrast, BDDs have not caught on as widely for software verification, partly because the data types used in software are more complicated than those used in hardware. In this work, we propose an extension of BDDs for dealing with dynamic data st... View full abstract»

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

    Publication Year: 1996, Page(s):207 - 218
    Cited by:  Papers (67)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1161 KB)

    We present a formal model for concurrent systems. The model represents synchronous and asynchronous components in a uniform framework that supports compositional (assume-guarantee) and hierarchical (stepwise refinement) reasoning. While synchronous models are based on a notion of atomic computation step, and asynchronous models remove that notion by introducing stuttering, our model is based on a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model-checking of correctness conditions for concurrent objects

    Publication Year: 1996, Page(s):219 - 228
    Cited by:  Papers (15)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (948 KB)

    The notions of serializability, linearizability and sequential consistency are used in the specification of concurrent systems. We show that the model checking problem for each of these properties can be cast in terms of the containment of one regular language in another regular language shuffled using a semi-commutative alphabet. The three model checking problems are shown to be, respectively, in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A semantic view of classical proofs: type-theoretic, categorical, and denotational characterizations

    Publication Year: 1996, Page(s):230 - 241
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1138 KB)

    Classical logic is one of the best examples of a mathematical theory that is truly useful to computer science. Hardware and software engineers apply the theory routinely. Yet from a foundational standpoint, there are aspects of classical logic that are problematic. Unlike intuitionistic logic, classical logic is often held to be non-constructive, and so, is said to admit no proof semantics. To dra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Syntactic considerations on recursive types

    Publication Year: 1996, Page(s):242 - 252
    Cited by:  Papers (11)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (881 KB)

    We study recursive types from a syntactic perspective. In particular, we compare the formulations of recursive types that are used in programming languages and formal systems. Our main tool is a new syntactic explanation of type expressions as functors. We also introduce a simple logic for programs with recursive types in which we carry out our proofs. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the expressive power of simply typed and let-polymorphic lambda calculi

    Publication Year: 1996, Page(s):253 - 263
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1136 KB)

    We present a functional framework for descriptive computational complexity, in which the Regular, First-order, Ptime, Pspace, k-Exptime, k-Expspace (k/spl ges/1), and Elementary sets have syntactic characterizations. In this framework, typed lambda terms represent inputs and outputs as well as programs. The lambda calculi describing the above computational complexity classes are simply or let-poly... View full abstract»

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