Research Catalog

Tenth Annual IEEE Symposium on Logic in Computer Science : proceedings, June 26-29, 1995, San Diego, California

Title
Tenth Annual IEEE Symposium on Logic in Computer Science : proceedings, June 26-29, 1995, San Diego, California / edited by Dexter Kozen ; sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing ; in cooperation with Special Interest Group on Automata and Computability Theory of the ACM [and others].
Author
Symposium on Logic in Computer Science (10th : 1995 : San Diego, Calif.)
Publication
Los Alamitos, Calif. : IEEE Computer Society Press, ©1995.

Items in the Library & Off-site

Filter by

1 Item

StatusFormatAccessCall NumberItem Location
TextUse in library QA75.5 .S9813 1995Off-site

Details

Additional Authors
  • Kozen, Dexter, 1951-
  • IEEE Computer Society. Technical Committee on Mathematical Foundations of Computing.
  • ACM Special Interest Group for Automata and Computability Theory.
Description
xiii, 518 pages : illustrations; 28 cm
Alternative Title
  • 1995 IEEE 10th Annual Symposium on Logic in Computer Science
  • Logic in Computer Science, 1995, LICS '95, proceedings, Tenth Annual IEEE Symposium on.
Subject
  • Computer science > Mathematics > Congresses
  • Logic, Symbolic and mathematical > Congresses
  • Computer science > Mathematics
  • Logic, Symbolic and mathematical
  • Informatik
  • Kongress
  • Mathematische Logik
  • Logique mathématique > Congrès
  • Informatique > Mathématiques > Congrès
Genre/Form
  • Conference papers and proceedings.
  • San Diego (Calif., 1995)
Note
  • "IEEE catalog number 95CH35768"--T.p. verso.
Bibliography (note)
  • Includes bibliographical references and index.
Contents
Kleene Award for Best Student Paper -- Complete Proof Systems for QPTL / Y. Kesten and A. Pnueli -- Completeness of Kozen's Axiomatisation of the Propositional [mu]-Calculus / I. Walukiewicz -- Once and For All / O. Kupferman and A. Pnueli -- Complete Proof Systems for First Order Interval Temporal Logic / B. Dutertre -- The Infinitary Logic of Sparse Random Graphs / J.F. Lynch and J. Tyszkiewicz -- Generalized Quantifiers and 0-1 Laws / A. Dawar and E. Gradel -- Relativized Logspace and Generalized Quantifiers over Finite Structures / G. Gottlob -- First-Order Queries on Finite Structures Over the Reals / J. Paredaens, J. Van den Bussche and D. Van Gucht -- Model-Checking of Causality Properties / R. Alur, D. Peled and W. Penczek -- On the Complexity of Modular Model Checking / M.Y. Vardi -- Timing Behavior Analysis for Real-Time Systems / F. Wang -- On the Verification Problem of Nonregular Properties for Nonregular Processes / A. Bouajjani, R. Echahed and P. Habermehl -- The Semantic Challenge of Verilog HDL / M. Gordon -- Uniform Proofs and Disjunctive Logic Programming / G. Nadathur and D.W. Loveland -- Structural Cut Elimination / F. Pfenning -- Paramodulation without Duplication / C. Lynch -- Complexity of Normal Default Logic and Related Modes of Nonmonotonic Reasoning / V.W. Marek, A. Nerode and J.B. Remmel -- Control Structures / A. Mifsud, R. Milner and J. Power -- Configuration Structures / R.J. van Glabbeek and G.D. Plotkin -- A Typed Calculus of Synchronous Processes / S. Gay and R. Nagarajan -- Modal [mu]-Types for Processes / M. Miculan and F. Gadducci -- Games and Full Abstraction for the Lazy [lambda]-Calculus / S. Abramsky and G. McCusker -- Domain Theory in Stochastic Processes / A. Edalat -- A Fully Abstract Semantics for a Concurrent Functional Language with Monadic Types / A. Jeffrey -- Experience Using Type Theory as a Foundation for Computer Science / R.L. Constable -- Equality Between Functionals in the Presence of Coproducts / D.J. Dougherty and R. Subrahmanyam -- A Logic of Subtyping / G. Longo, K. Milsted and S. Soloviev -- Normalization and Extensionality / A. Piperno -- New Notions of Reduction and Non-Semantic Proofs of Strong [beta]-Normalization in Typed [lambda]-Calculi / A.J. Kfoury and J.B. Wells -- Finitely Monotone Properties / A.P. Stolboushkin -- Tree Canonization and Transitive Closure / K. Etessami and N. Immerman -- PTime Canonization for Two Variables with Counting / M. Otto -- When Do Fixed Point Logics Capture Complexity Classes? / A. Seth -- Higher-Order Unification via Explicit Substitutions / G. Dowek, T. Hardin and C. Kirchner -- Sequentiality, Second Order Monadic Logic and Tree Automata / H. Comon -- Orderings, AC-Theories and Symbolic Constraint Solving / H. Comon, R. Nieuwenhuis and A. Rubio -- Efficient On-the-Fly Model Checking for CTL / G. Bhat, R. Cleaveland and O. Grumberg -- Partial Model Checking / H.R. Andersen -- Hardware Verification, Boolean Logic Programming, Boolean Functional Programming / E. Tronci -- Compositionality via Cut-Elimination: Hennessy-Milner Logic for an Arbitrary GSOS / A.K. Simpson -- Compositional Testing Preorders for Probablistic Processes / B. Jonsson and W. Yi -- The Stone Gamut: A Coordinatization of Mathematics / V.R. Pratt -- Logically Presented Domains / E. Palmgren and V. Stoltenberg-Hansen -- Games Semantics for Full Propositional Linear Logic / F. Lamarche -- Decision Problems for Second-Order Linear Logic / P. Lincoln, A. Scedrov and N. Shankar -- The Complexity of Neutrals in Linear Logic / M.I. Kanovich -- Decidability of Linear Affine Logic / A.P. Kopylov -- Origins and Metamorphoses of the Trinity: Logic, Nets, Automata / B. Trakhtenbrot.
ISBN
  • 078032563X
  • 9780780325630
  • 0818670509
  • 9780818670503
  • 0780329996
  • 9780780329997
OCLC
  • ocm33202549
  • 33202549
  • SCSB-2062398
Owning Institutions
Princeton University Library