2 options
Proceedings. 15th annual Symposium on Logic in Computer Science : June 26-28, 2000, Santa Barbara, California / sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing.
Connect to full text Available online
View online- Format:
- Book
- Conference/Event
- Conference Name:
- Symposium on Logic in Computer Science (15th : 2000 : Santa Barbara, Calif.)
- Language:
- English
- Subjects (All):
- Computer science--Mathematics--Congresses.
- Computer science.
- Computer science--Mathematics.
- Logic, Symbolic and mathematical--Congresses.
- Logic, Symbolic and mathematical.
- Genre:
- Conference papers and proceedings.
- Physical Description:
- xiii, 425 pages : illustrations
- Other Title:
- 2000 IEEE 15th annual Symposium on Logic in Computer Science
- 15th annual Symposium on Logic in Computer Science
- Logic in Computer Science, 2000, proceedings, 15th Annual IEEE Symposium on.
- Place of Publication:
- Los Alamitos, Calif. : IEEE Computer Society, [2000]
- System Details:
- Mode of access: World Wide Web.
- text file
- Contents:
- Logic, Complexity, and Games / R. Fagin 3
- A General Notion of Realizability / L. Birkedal 7
- A Model for Impredicative Type Systems, Universes, Intersection Types and Subtyping / A. Miquel 18
- Complete Axioms for Categorical Fixed-Point Operators / A. Simpson, G. Plotkin 30
- The Role of Decidability in First Order Separations over Classes of Finite Structures / S. Lindell, S. Weinstein 45
- Automatic Structures / A. Blumensath, E. Gradel 51
- Definability and Compression / F. Afrati, H. Leiss, M. de Rougemont 63
- Resource-Bounded Continuity and Sequentiality for Type-Two Functionals / S. Buss, B. Kapron 77
- A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation / K. Aehlig, H. Schwichtenberg 84
- Approximating Labeled Markov Processes / J. Desharnais, R. Jagadeesan, V. Gupta, P. Panangaden 95
- Precongruence Formats for Decorated Trace Preorders / B. Bloom, W. Fokkink, R. van Glabbeek 107
- Virtual Symmetry Reduction / E. Emerson, J. Havlicek, R. Trefler 121
- Better is Better than Well: On Efficient Verification of Infinite-State Systems / P. Abdulla, A. Nylen 132
- Concurrent Omega-Regular Games / L. de Alfaro, T. Henzinger 141
- Approximate Pattern Matching is Expressible in Transitive Closure Logic / K. Lemstrom, L. Hella 157
- Computational Complexity of Some Problems Involving Congruences on Algebras / C. Bergman, G. Slutzki 168
- From the Church-Turing Thesis to the First-Order Algorithm Theorem / S. Kripke 177
- Satisfiability Testing: Recent Developments and Challenge Problems / B. Selman 178
- Dominator Trees and Fast Verification of Proof Nets / A. Murawski, C.-H. Ong 181
- Game Semantics and Subtyping / J. Chroboczek 192
- Probabilistic Game Semantics / V. Danos, R. Harmer 204
- Back and Forth between Guarded and Modal Logics / E. Gradel, C. Hirsch, M. Otto 217
- More Past Glories / M. Reynolds 229
- A Complete Axiomatization of Interval Temporal Logic with Infinite Time / B. Moszkowski 241
- A Modality for Recurison / H. Nakano 255
- A Static Calculus of Dependencies for the [lambda]-Cube / F. Prost 267
- A Decision Procedure for Term Algebras with Queues / T. Rybina, A. Voronkov 279
- A Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix Ordering / K. Korovin, A. Voronkov 291
- Some Strategies for Proving Theorems with a Model Checker / K. McMillan 305
- The Curry-Howard Correspondence in Set Theory / J.-L. Krivine 307
- A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names / A. Jeffrey, J. Rathke 311
- Models for Name-Passing Processes: Interleaving and Causal / G. Cattani, P. Sewell 322
- Assigning Types to Processes / N. Yoshida, M. Hennessy 334
- On First-Order Topological Queries / M. Grohe, L. Segoufin 349
- View-Based Query Processing and Constraint Satisfaction / D. Calvanese, G. De Giacomo, M. Lenzerini, M. Vardi 361
- Imperative Programming with Dependent Types / H. Xi 375
- Efficient and Flexible Matching of Recursive Types / J. Palsberg, T. Zhao 388
- How to Optimize Proof-Search in Modal Logics: A New Way of Proving Redundancy Criteria for Sequent Calculi / A. Voronkov 401
- Paramodulation with Built-in Abelian Groups / G. Godoy, R. Nieuwenhuis 413.
- Notes:
- "IEEE Computer Society [order number] 00PR0725"--T.p. verso.
- [IEEE order plan catalog number] "00CB37133"--Spine.
- Includes bibliographical references and index.
- ISBN:
- 0769507255
- 9780769507255
- 0780365259
- 9780780365254
- 0780365267
- 9780780365261
- OCLC:
- 44815643
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.