Scheduled System Maintenance
On Saturday, October 21, single article sales and account management will be unavailable until 6 PM ET.
Notice: There is currently an issue with the citation download feature. Learn more.

Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)

5-5 July 1999

Filter Results

Displaying Results 1 - 25 of 48
  • Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)

    Publication Year: 1999
    Request permission for commercial reuse | PDF file iconPDF (311 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1999, Page(s):477 - 478
    Request permission for commercial reuse | PDF file iconPDF (10 KB)
    Freely Available from IEEE
  • Linear types and non-size-increasing polynomial time computation

    Publication Year: 1999, Page(s):464 - 473
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (188 KB)

    We propose a linear type system with recursion operators for inductive datatypes which ensures that all definable functions are polynomial time computable. The system improves upon previous such systems in that recursive definitions can be arbitrarily nested, in particular no predicativity or modality restrictions are made View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Abstract syntax and variable binding

    Publication Year: 1999, Page(s):193 - 202
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    We develop a theory of abstract syntax with variable binding. To every binding signature we associate a category of models consisting of variable sets endowed with compatible algebra and substitution structures. The syntax generated by the signature is the initial model. This gives a notion of initial algebra semantics encompassing the traditional one; besides compositionality, it automatically ve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logics with counting, auxiliary relations, and lower bounds for invariant queries

    Publication Year: 1999, Page(s):316 - 325
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB)

    We study the expressive power of counting logics in the presence of auxiliary relations such as orders and pre-orders. The simplest such logic, first-order with counting, captures the complexity class TC0 over ordered structures. We also consider first-order logic with arbitrary unary quantifiers, and infinitary extensions. The main result of the paper is that all the counting logics a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Plausibility measures and default reasoning: an overview

    Publication Year: 1999, Page(s):130 - 135
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (104 KB)

    We introduce a new approach to modeling uncertainty based on plausibility measures. This approach is easily seen to generalize other approaches to modeling uncertainty, such as probability measures, belief functions, and possibility measures. We then consider one application of plausibility measures: default reasoning. In recent years, a number of different semantics for defaults have been propose... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correctness of multiplicative proof nets is linear

    Publication Year: 1999, Page(s):454 - 463
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB)

    We reformulate Danos contractibility criterion in terms of a sort of unification. As for term unification, a direct implementation of the unification criterion leads to a quasi-linear algorithm. Linearity is obtained after observing that the disjoint-set union-find at the core of the unification criterion is a special case of union-find with a real linear time solution View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Elementary axioms for categories of classes

    Publication Year: 1999, Page(s):77 - 85
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB)

    We axiomatize a notion of “classic structure” on a regular category, isolating the essential properties of the category of classes together with its full subcategory of sets. Like the axioms for a topos, our axiomatization is very simple, but has powerful consequences. In particular, we show that our axiomatized categories provide a sound and complete class of models for intuitionistic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On bunched predicate logic

    Publication Year: 1999, Page(s):183 - 192
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB)

    We present the logic of bunched implications, BI, in which a multiplicative (or linear) and an additive (or intuitionistic) implication live side-by-side. The propositional version of BI arises from an analysis of the proof-theoretic relationship between conjunction and implication, and may be viewed as a merging of intuitionistic logic and multiplicative, intuitionistic linear logic. The predicat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Working with arms: Complexity results on atomic representations of Herbrand models

    Publication Year: 1999, Page(s):306 - 315
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB)

    An Atomic Representation of a Herbrand Model (ARM) is a finite set of (not necessarily ground) atoms over a given Herbrand universe. Each ARM represents a possibly infinite Herbrand interpretation. This concept has emerged independently in different branches of Computer Science as a natural and useful generalization of the concept of finite Herbrand interpretation. It was shown that several recurs... 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 CTL

    Publication Year: 1999, Page(s):360 - 368
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB)

    We show that the expressive power of the branching time logic CTL coincides with that of the class of bisimulation invariant properties expressible in so-called monadic path logic: monadic second order logic in which set quantification is restricted to paths. In order to prove this result, we first prove a new composition theorem for trees. This approach is adapted from the approach of Hafer and T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-variable descriptions of regularity

    Publication Year: 1999, Page(s):14 - 23
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB)

    We prove that the class of all languages that are definable in Σ11(FO2), that is, in (non-monadic) existential second-order logic with only two first-order variables, coincides with the regular languages. This provides an alternative logical description of regularity to both the traditional one in terms of monadic second-order logic, due to Buchi and Trakhten... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Hoare logic and Kleene algebra with tests

    Publication Year: 1999, Page(s):167 - 172
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (104 KB)

    We show that Kleene algebra with tests subsumes propositional Hoare logic. Thus the specialized syntax and deductive apparatus of Hoare logic are inessential and can be replaced by simple equational reasoning. We show using this reduction that propositional Hoare logic is PSPACE-complete View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non-deterministic games and program analysis: An application to security

    Publication Year: 1999, Page(s):443 - 452
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB)

    We present a unifying framework for using game semantics as a basis for program analysis. Also, we present a case study of the techniques. The unifying framework presents games-based program analysis as an abstract interpretation of an appropriate games category in the category of non-deterministic games. The case study concerns an application to security View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • First-order logic vs. fixed-point logic in finite set theory

    Publication Year: 1999, Page(s):275 - 284
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has been established that either way of settling this conjecture would resolve open problems in complexity theory. In fact, this holds true even for the particular instance of the ordered conjecture on the class of BIT-structu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parametric quantitative temporal reasoning

    Publication Year: 1999, Page(s):336 - 343
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    We define Parameterized Real-Time Computation Tree Logic (PRTCTL), which allows quantitative temporal specifications to be parameterized over the natural numbers. Parameterized quantitative specifications are quantitative specifications in which concrete timing information has been abstracted away. Such abstraction allows designers to specify quantitative restrictions on the temporal ordering of e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Full abstraction and universality via realisability

    Publication Year: 1999, Page(s):174 - 182
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB)

    We construct fully abstract realisability models of PCF. In particular, we prove a variant of the Longley-Phoa Conjecture by showing that the realisability model over an untyped λ-calculus with arithmetic is fully abstract for PCF. Further we consider the extension of our results to a general sequential functional programming language SFPL giving rise to universal realisability models for S... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A superposition decision procedure for the guarded fragment with equality

    Publication Year: 1999, Page(s):295 - 303
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB)

    We give a new decision procedure for the guarded fragment with equality. The procedure is based on resolution with superposition. We argue that this method will be more useful in practice than methods based on the enumeration of certain finite structures. It is surprising to see that one does not need any sophisticated simplification and redundancy elimination method to make superposition terminat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the verification of broadcast protocols

    Publication Year: 1999, Page(s):352 - 359
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    We analyze the model-checking problems for safety and liveness properties in parameterized broadcast protocols. We show that the procedure suggested previously for safety properties may not terminate, whereas termination is guaranteed for the procedure based on upward closed sets. We show that the model-checking problem for liveness properties is undecidable. In fact, even the problem of deciding ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fragment calculus-towards a model of separate compilation, linking and binary compatibility

    Publication Year: 1999, Page(s):147 - 156
    Cited by:  Papers (5)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (156 KB)

    We propose a calculus describing compilation and linking in terms of operations on fragments, i.e. compilation units, without reference to their specific contents. We believe this calculus faithfully reflects the situation within modern programming systems. Binary compatibility in Java prescribes conditions under which modification of fragments does not necessitate recompilation of importing fragm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parikh's theorem in commutative Kleene algebra

    Publication Year: 1999, Page(s):394 - 401
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    Parikh's theorem says that, the commutative image of every context free language is the commutative image of some regular set. Pilling has shown that this theorem is essentially a statement about least solutions of polynomial inequalities. We prove the following general theorem of commutative Kleene algebra, of which Parikh's and Pilling's theorems are special cases: Every finite system of polynom... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concurrent games and full completeness

    Publication Year: 1999, Page(s):431 - 442
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB)

    A new concurrent form of game semantics is introduced. This overcomes the problems which had arisen with previous, sequential forms of game semantics in modelling Linear Logic. It also admits an elegant and robust formalization. A Full Completeness Theorem for Multiplicative-Additive Linear Logic is proved for this semantics View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some computational properties of intersection types

    Publication Year: 1999, Page(s):109 - 118
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB)

    This paper presents a new method for comparing computation-properties of λ-terms typeable with intersection types with respect to terms typeable with Curry types. In particular, strong normalization and λ-definability are investigated. A translation is introduced from intersection typing derivations to Curry typeable terms; the main feature of the proposed technique is that the trans... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Weak bounded arithmetic, the Diffie-Hellman problem and Constable's Class K

    Publication Year: 1999, Page(s):268 - 274
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    The bounded arithmetic theory C20, which is closely related to the complexity class DLogTime-uniform TC0, is extended by a function symbol and axioms for integer division, which is not known to be in DLogTime-uniform TC0. About this extended theory C20[div], two main results are proved: (1). The Z1b-definable f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards a theory of bisimulation for local names

    Publication Year: 1999, Page(s):56 - 66
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB)

    A.M. Pitts and I.D.B. Stark (1998) have proposed the v-calculus as a language for investigating the interaction of unique name generation and higher-order functions. They developed a sound model based on logical relations, but left completeness as an open problem. In this paper, we develop a complete model based on bisimulation for a labelled transition system semantics. We show that bisimulation ... View full abstract»

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