Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science

26-29 June 1995

Filter Results

Displaying Results 1 - 25 of 50
  • Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science

    Publication Year: 1995
    Request permission for reuse | PDF file iconPDF (323 KB)
    Freely Available from IEEE
  • A complete proof systems for QPTL

    Publication Year: 1995, Page(s):2 - 12
    Cited by:  Papers (9)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (891 KB)

    The paper presents an axiomatic system for quantified propositional temporal logic (QPTL), which is propositional temporal logic equipped with quantification over propositions (boolean variables). The advantages of this extended temporal logic is that its expressive power is strictly higher than that of the unquantified version (PTL) and is equal to that of SIS, as well as that of /spl omega/-auto... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Completeness of Kozen's axiomatisation of the propositional /spl mu/-calculus

    Publication Year: 1995, Page(s):14 - 24
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1107 KB)

    We consider the propositional /spl mu/-calculus as introduced by D. Kozen (1983). In that paper a natural proof system was proposed and its completeness stated as an open problem. We show that the system is complete. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Once and for all [temporal logic]

    Publication Year: 1995, Page(s):25 - 35
    Cited by:  Papers (8)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1026 KB)

    It has long been known that past-time operators add no expressive power to linear temporal logics. In this paper, we consider the extension of branching temporal logics with past-time operators. Two possible views regarding the nature of past in a branching-time model induce two different such extensions. In the first view, past is branching and each moment in time may have several possible future... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complete proof systems for first order interval temporal logic

    Publication Year: 1995, Page(s):36 - 43
    Cited by:  Papers (22)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (718 KB)

    Different interval modal logics have been proposed for reasoning about the temporal behaviour of digital systems. Some of them are purely propositional and only enable the specification of qualitative time requirements. Others, such as ITL and the duration calculus, are first order logics which support the expression of quantitative, real-time requirements. These two logics have in common the pres... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The infinitary logic of sparse random graphs

    Publication Year: 1995, Page(s):46 - 53
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (804 KB)

    Let L/sub /spl infin//spl omega///sup /spl omega// be the infinitary language obtained from the first-order language of graphs by closure under conjunctions and disjunctions of arbitrary sets of formulas, provided only finitely many distinct variables occur among the formulas. Let p(n) be the edge probability of the random graph on n vertices. Previous articles have shown that when p(n) is constan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized quantifiers and 0-1 laws

    Publication Year: 1995, Page(s):54 - 64
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1078 KB)

    We study 0-1 laws for extensions of first-order logic by Lindstrom quantifiers. We state sufficient conditions on a quantifier Q expressing a graph property, for the logic FO[Q]-the extension of first-order logic by means of the quantifier Q-to have a 0-1 law. We use these conditions to show, in particular, that FO[Rig], where Rig is the quantifier expressing rigidity, has a 0-1 law. We also show ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relativized logspace and generalized quantifiers over finite structures

    Publication Year: 1995, Page(s):65 - 78
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1663 KB)

    The expressive power of first order logic with generalized quantifiers over finite ordered structures is studied. The following problem is addressed: Given a family Q of generalized quantifiers expressing a complexity class C, what is the expressive power of first order logic FO(Q) extended by the quantifiers in Q? From previously studied examples, one would expect that FO(Q) captures L/sup C/, i.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • First-order queries on finite structures over the reals

    Publication Year: 1995, Page(s):79 - 87
    Cited by:  Papers (14)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (807 KB)

    We investigate properties of finite relational structures over the reals expressed by first-order sentences whose predicates are the relations of the structure plus arbitrary polynomial inequalities, and whose quantifiers can range over the whole set of reals. In constraint programming terminology, this corresponds to Boolean real polynomial constraint queries on finite structures. The fact that q... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model-checking of causality properties

    Publication Year: 1995, Page(s):90 - 100
    Cited by:  Papers (25)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1123 KB)

    A temporal logic for causality (T/sub LC/) is introduced. The logic is interpreted over causal structures corresponding to partial order executions of programs. For causal structures describing the behavior of a finite fixed set of processes, a T/sub LC/-formula can, equivalently, be interpreted over their linearizations. The main result of the paper is a tableau construction that gives a singly-e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the complexity of modular model checking

    Publication Year: 1995, Page(s):101 - 111
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1246 KB)

    In modular verification the specification of a module consists of two parts. One part describes the guaranteed behavior of the module. The other part describes the assumed behavior of the environment with which the module is interacting. This is called the assume-guarantee paradigm. Even when one specifies the guaranteed behavior of the module in a branching temporal logic, the assumption in the a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Timing behavior analysis for real-time systems

    Publication Year: 1995, Page(s):112 - 122
    Cited by:  Papers (7)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (948 KB)

    We extend TCTL model-checking problem to timing behavior analysis problem for real-time systems and develop new techniques in solving it. The algorithm we present here accepts timed transition system descriptions and parametric TCTL formulas with timing parameter variables of unknown sizes and can give back general linear equations of timing parameter variables whose solutions make the systems wor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the verification problem of nonregular properties for nonregular processes

    Publication Year: 1995, Page(s):123 - 133
    Cited by:  Papers (16)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1165 KB)

    Investigate the verification problem of infinite-state processes w.r.t. nonregular properties, i.e. nondefinable by finite-state /spl omega/-automata. We consider processes in the algebra PA (Process Algebra) which provides sequential and parallel (merge) composition, nondeterministic choice and recursion. The algebra PA integrates and strictly subsumes the algebras BPA (Basic Process Algebra, i.e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The semantic challenge of Verilog HDL

    Publication Year: 1995, Page(s):136 - 145
    Cited by:  Papers (32)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (980 KB)

    The Verilog hardware description language (HDL) is widely used to model the structure and behaviour of digital systems ranging from simple hardware building blocks to complete systems. Its semantics is based an the scheduling of events and the propagation of changes. Different Verilog models of the same device are used during the design process and it is important that these be 'equivalent'; forma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Uniform proofs and disjunctive logic programming

    Publication Year: 1995, Page(s):148 - 155
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    One formulation of the concept of logic programming is the notion of an abstract logic programming language. Central to its definition is a uniform proof, which enforces the requirements of inference direction, including goal-directedness, and the duality of readings, both declarative and procedural. We use this technology to investigate disjunctive logic programming (DLP), an extension of traditi... View full abstract»

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

    Publication Year: 1995, Page(s):156 - 166
    Cited by:  Papers (16)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (860 KB)

    Presents new proofs of cut elimination for intuitionistic, classical and linear sequent calculi. In all cases, the proofs proceed by three nested structural inductions, avoiding the explicit use of multi-sets and termination measures on sequent derivations. This makes them amenable to elegant and concise implementations in Elf, a constraint logic programming language based on the LF logical framew... View full abstract»

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

    Publication Year: 1995, Page(s):167 - 177
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1151 KB)

    The resolution (and paramodulation) inference systems are theorem proving procedures for first-order logic (with equality), but they can run exponentially long for subclasses which have polynomial-time decision procedures, as in the case of SLD resolution and the Knuth-Bendix completion procedure, both in the ground case. Specialized methods run in polynomial time, but have not been extended to th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complexity of normal default logic and related modes of nonmonotonic reasoning

    Publication Year: 1995, Page(s):178 - 185
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (691 KB)

    Normal default logic, the fragment of default logic obtained by restricting defaults to rules to the form /spl alpha/:M/spl beta///spl beta/. is the most important and widely studied part of default logic. In Annals of Pure and Applied Logic, vol. 67, pp. 269-324 (1994), we proved a basis theorem for extensions of recursive propositional logic normal default theories and hence for finite predicate... View full abstract»

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

    Publication Year: 1995, Page(s):188 - 198
    Cited by:  Papers (8)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1050 KB)

    'Action calculi' are a class of action structures with added structure. Each action calculus AC(/spl Kscr/) is determined by a set /spl Kscr/ of controls, equipped with reaction rules; calculi such as Petri nets, the typed /spl lambda/-calculus and the /spl pi/-calculus are obtained by varying /spl Kscr/. This paper defines for each /spl Kscr/ a category CS(/spl Kscr/), characterized by equational... View full abstract»

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

    Publication Year: 1995, Page(s):199 - 209
    Cited by:  Papers (20)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1167 KB)

    Configuration structures provide a model of concurrency generalising the families of configurations of event structures. They can be considered logically, as classes of propositional models; then, sub-classes can be axiomatised by formulae of simple prescribed forms. Several equivalence relations for event structures are generalized to configuration structures, and also to general Petri nets. Ever... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A typed calculus of synchronous processes

    Publication Year: 1995, Page(s):210 - 220
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (921 KB)

    Proposes a typed calculus of synchronous processes based on the structure of interaction categories. Our aim has been to develop a calculus for concurrency that is canonical in the sense that the typed /spl lambda/-calculus is canonical for functional computation. We show strong connections between syntax, logic and semantics, analogous to the familiar correspondence between the typed /spl lambda/... 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 the lazy /spl lambda/-calculus

    Publication Year: 1995, Page(s):234 - 243
    Cited by:  Papers (9)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (904 KB)

    We define a category of games /spl Gscr/, and its extensional quotient /spl Escr/. A model of the lazy X-calculus, a type-free functional language based on evaluation to weak head normal form, is given in /spl Gscr/, yielding an extensional model in /spl Escr/. This model is shown to be fully abstract with respect to applicative simulation. This is, so fear as we known, the first purely semantic c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Domain theory in stochastic processes

    Publication Year: 1995, Page(s):244 - 254
    Cited by:  Papers (5)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (845 KB)

    We establish domain-theoretic models of finite-state discrete stochastic processes, Markov processes and vector recurrent iterated function systems. In each case, we show that the distribution of the stochastic process is canonically obtained as the least upper bound of an increasing chain of simple valuations in a probabilistic power domain associated to the process. This leads to various formula... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fully abstract semantics for a concurrent functional language with monadic types

    Publication Year: 1995, Page(s):255 - 264
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (760 KB)

    This paper presents a typed higher-order concurrent functional programming language, based on Moggi's monadic metalanguage and Reppy's Concurrent ML. We present an operational semantics for the language, and show that a higher-order variant of the traces model is fully abstract for may-testing. This proof uses a program logic based on Hennessy-Milner logic and Abramsky's domain theory in logical f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Experience using type theory as a foundation for computer science

    Publication Year: 1995, Page(s):266 - 279
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (964 KB)

    Type theory is an elegant organisation of the fundamental principles of a foundational theory of computing, with theory taken in the sense of a scientific theory as well as a deductive theory. This theory generates a research programme. I examine the elements of this programme and assess progress. A large number of people world wide have been pursuing the type theory aspects of this research progr... View full abstract»

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