Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID13th LICS 1998: Indianapolis, Indiana, USA
- Thirteenth Annual IEEE Symposium on Logic in Computer Science, Indianapolis, Indiana, USA, June 21-24, 1998. IEEE Computer Society 1998, ISBN 0-8186-8506-9
Invited Lecture
- Roger M. Needham:
Logic and Over-Simplification. 2-3
Finite Model Theory I
- Martin Grohe:
Fixed-Point Logics on Planar Graphs. 6-15 - Thomas Eiter, Georg Gottlob, Yuri Gurevich:
Existential Second-Order Logic over Strings. 16-27 - Anuj Dawar
, Lauri Hella, Anil Seth:
Ordering Finite Variable Types with Generalized Quantifiers. 28-43 - Manfred Jaeger:
Convergence Results for Relational Bayesian Networks. 44-55
Verification
- Witold Charatonik, David A. McAllester, Damian Niwinski, Andreas Podelski, Igor Walukiewicz:
The Horn Mu-calculus. 58-69 - E. Allen Emerson, Kedar S. Namjoshi:
On Model Checking for Non-Deterministic Infinite-State Systems. 70-80 - Orna Kupferman, Moshe Y. Vardi:
Freedom, Weakness, and Determinism: From Linear-Time to Branching-Time. 81-92 - George C. Necula, Peter Lee:
Efficient Representation and Validation of Proofs. 93-104 - Martín Abadi, Cédric Fournet, Georges Gonthier:
Secure Implementation of Channel Abstractions. 105-116
Logics
- Ofer Arieli, Arnon Avron:
The Logical Role of the Four-Valued Bilattice. 118-126 - Marcelo F. Frias, Roger D. Maddux:
Completeness of a Relational Calculus for Program Schemes. 127-134
Tutorial
- Wolfgang Thomas:
Monadic Logic and Automata: Recent Developments. 136-138
Concurrency I
- François Fages, Paul Ruet, Sylvain Soliman:
Phase Semantics and Verification of Concurrent Constraint Programs. 141-152 - Karen L. Bernstein:
A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages. 153-164 - Michele Boreale, Davide Sangiorgi:
Bisimulation in Name-Passing Calculi without Matching. 165-175 - Joachim Parrow, Björn Victor:
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes. 176-185
Category Theory
- Lars Birkedal, Aurelio Carboni, Giuseppe Rosolini, Dana S. Scott:
Type Theory via Exact Categories. 188-198 - Claudio Hermida, Michael Makkai, John Power:
Higher Dimensional Multigraphs. 199-206 - Peter T. Johnstone, John Power, Toru Tsujishita, Hiroshi Watanabe, James Worrell:
An Axiomatics for Categories of Transition Systems as Coalgebras. 207-213 - Gian Luca Cattani, Marcelo P. Fiore, Glynn Winskel:
A Theory of Recursive Domains with Applications to Concurrency. 214-225
Invited Lecture
- Dirk van Dalen:
L. E. J. Brouwer's Intuitionism: A Revolution in Two Installments. 228-241
Tutorial
- Johan van Benthem:
Process Operations in Extended Dynamic Logics. 244-250
Theorem Proving and Rewriting
- Andrei Voronkov:
Herbrand's Theorem, Automated Reasoning and Semantics Tableaux. 252-263 - Margus Veanes:
The Relation Between Second-Order Unification and Simultaneous Rigid E-Unification. 264-275 - Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michaël Rusinowitch:
Decision Problems in Ordered Rewriting. 276-286 - Paul-André Melliès:
A Stability Theorem in Rewriting Theory. 287-298 - Andrea Asperti:
Light Affine Logic. 300-308 - Ian Mackie:
Linear Logic With Boxes. 309-320 - Maribel Fernández, Ian Mackie:
Coinductive Techniques for Operational Equivalence of Interaction Nets. 321-332
Game Semantics
- Samson Abramsky, Kohei Honda, Guy McCusker:
A Fully Abstract Game Semantics for General References. 334-344 - Marcelo P. Fiore, Kohei Honda:
Recursive Types in Games: Axiomatics and Process Representation. 345-356
Type Theory
- Makoto Tatsuta:
Realizability for Constructive Theory of Functions and Classes and its Application to Program Synthesis. 358-367 - Hirofumi Yokouchi:
Completeness of Type Assignment Systems with Intersection, Union, and Type Quantifiers. 368-379 - Ramesh Viswanathan:
Full Abstraction for First-Order Objects with Recursive Types and Subtyping. 380-391
Invited Lecture
- Moshe Y. Vardi:
Linear vs. Branching Time: A Complexity-Theoretic Perspective. 394-405
Calculus and Lambda-Calculus
- Dusko Pavlovic, Martín Hötzel Escardó:
Calculus in Coinductive Form. 408-417 - Enno Folkerts:
Invertibility in lambda-eta. 418-429
Constraints and Complexity
- Martin Müller, Joachim Niehren, Ralf Treinen:
The First-Order Theory of Ordering Constraints over Feature Trees. 432-443 - Jan Johannsen, Chris Pollett:
On Proofs about Threshold Circuits and Counting Hierarchies. 444-452
Concurrency II
- Luca de Alfaro:
How to Specify and Verify the Long-Run Average Behavior of Probabilistic Systems. 454-465 - Eugene W. Stark, Scott A. Smolka:
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata. 466-477 - Josée Desharnais, Abbas Edalat, Prakash Panangaden:
A Logical Characterization of Bisimulation for Labeled Markov Processes. 478-487
Finite Model Theory II
- John T. Baldwin, Michael Benedikt:
Embedded Finite Models, Stability Theory and the Impact of Order. 490-500 - Leonid Libkin:
On Counting Logics and Local Properties. 501-512 - Phokion G. Kolaitis, Martin Otto:
On the Boundedness Problem for Two-Variable First-Order Logic. 513-524 - Jean-Marie Le Bars:
Fragments of Existential Second-Order Logic without 0-1 Laws. 525-536
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-19 19:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
