The Community for Technology Leaders
Logic in Computer Science, Symposium on (1996)
New Brunswick, NJ
July 27, 1996 to July 30, 1996
ISSN: 1043-6871
ISBN: 0-8186-7463-6
TABLE OF CONTENTS
Finite Model Theory I: Chair: K. Kunen

A generalization of Fagin's theorem (Abstract)

J.A. Medina , Dept. of Comput. Sci., Massachusetts Univ., Amherst, MA, USA
N. Immerman , Dept. of Comput. Sci., Massachusetts Univ., Amherst, MA, USA
pp. 2

DATALOG SIRUPs uniform boundedness is undecidable (Abstract)

J. Marcinkowski , Theor. of Comput. Sci. Group, Wroclaw Univ., Poland
pp. 13
Concurrency: Chair: U. Montanari

A Fully Abstract Domain Model for the p-Calculus (Abstract)

Ian Stark , University of Aarhus, Denmark
pp. 36

Higher Dimensional Transition Systems (Abstract)

Gian Luca Cattani , Aarhus University, Denmark
Vladimiro Sassone , Universita di Pisa, Italia
pp. 55

An Algebraic Theory of Process Efficiency (Abstract)

V. Natarajan , North Carolina State University
Rance Cleaveland , North Carolina State University
pp. 63
Types I: Chair: J. Mitchell

The Subtyping Problem for Second-Order Types is Undecidable (Abstract)

Pawel Urzyczyn , Warsaw University
Jerzy Tiuryn , Warsaw University
pp. 74

Subtyping Dependent Types (Abstract)

Adriana Compagnoni , University of Cambridge
David Aspinall , University of Edinburgh
pp. 86
Temporal Logic and Calculus: Chair: E.A. Emerson

An Until Hierarchy for Temporal Logic (Abstract)

Kousha Etessami , Rutgers University
Thomas Wilke , Rutgers University
pp. 108

Locally linear time temporal logic (Abstract)

R. Ramanujam , Institute of Mathematical Sciences C. I. T. Campus, India
pp. 118

A Modal Mu-Calculus for Durational Transition Systems (Abstract)

Helmut Seidl , Fachbereich IV / Abt. Informatik Universitat Trier, Germany
pp. 128
Reasoning about Programs: Chair: P. Lincoln

The essence of parallel Algol (Abstract)

S. Brookes , Dept. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
pp. 164

Games and Full Abstraction for FPC (Abstract)

Guy McCusker , Imperial College, London
pp. 174

A temporal-logic approach to binding-time analysis (Abstract)

R. Davies , Dept. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
pp. 184
Model Checking I: Chair: S. German

Symbolic Protocol Verification with Queue BDDs (Abstract)

David E. Long , Lucent Technologies
Patrice Godefroid , Lucent Technologies
pp. 198
Types II: Chair: D. Howe

A semantic view of classical proofs: type-theoretic, categorical, and denotational characterizations (Abstract)

C.-H. L. Ong , University of Oxford and National University of Singapore
pp. 230

On the Expressive Power of Simply Typed and Let-Polymorphic Lambda Calculi (Abstract)

Paris Kanellakis , Brown University
Gerd Hillebrand , Fakultaet fuer Informatik, Germany
pp. 253
Tutorial: Chair: J. Rushby

The theory of hybrid automata (Abstract)

T.A. Henzinger , Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA
pp. 278
Model Checking II: Chair: O. Grumberg

Efficient model checking via the equational /spl mu/-calculus (Abstract)

R. Cleaveland , Dept. of Comput. Sci., North Carolina State Univ., Raleigh, NC, USA
G. Bhat , Dept. of Comput. Sci., North Carolina State Univ., Raleigh, NC, USA
pp. 304

General decidability theorems for infinite-state systems (Abstract)

K. Cerans , Dept. of Comput. Syst., Uppsala Univ., Sweden
B. Jonsson , Dept. of Comput. Syst., Uppsala Univ., Sweden
Yih-Kuen Tsay , Dept. of Comput. Syst., Uppsala Univ., Sweden
P.A. Abdulla , Dept. of Comput. Syst., Uppsala Univ., Sweden
pp. 313

Relating word and tree automata (Abstract)

M.Y. Vardi , AT&T Bell Labs., Murray Hill, NJ, USA
O. Kupferman , AT&T Bell Labs., Murray Hill, NJ, USA
S. Safra , AT&T Bell Labs., Murray Hill, NJ, USA
pp. 322
Finite Model Theory II: Chair: G. Gottlob

More about recursive structures: descriptive complexity and zero-one laws (Abstract)

D. Harel , Weizmann Inst. of Sci., Rehovot, Israel
T. Hirst , Weizmann Inst. of Sci., Rehovot, Israel
pp. 334

On the expressive power of variable-confined logics (Abstract)

P.G. Kolaitis , Dept. of Comput. Sci., California Univ., Santa Cruz, CA, USA
M.Y. Vardi , Dept. of Comput. Sci., California Univ., Santa Cruz, CA, USA
pp. 348

Zero-one laws for Gilbert random graphs (Abstract)

G.L. McColm , Dept. of Math., Univ. of South Florida, Tampa, FL, USA
pp. 360
Semantics and Domains: Chair: G. Winskel

Game semantics and abstract machines (Abstract)

V. Danos , Paris VII Univ., France
H. Herbelin , Paris VII Univ., France
L. Regnier , Paris VII Univ., France
pp. 394

Semantics of Normal Logic Programs and Contested Information (Abstract)

Shekhar Pradhan , University of Maryland and Missouri State University
pp. 406
Lambda Calculus: Chair: F. Pfenning

Linear Logic, Monads and the Lambda Calculus (Abstract)

Nick Benton , University of Cambridge
Philip Wadler , University of Glasgow
pp. 420
Rewriting and Unification;: Chair: C. Kirchner

Complexity Analysis Based on Ordered Resolution (Abstract)

David Basin , Max-Planck-Institut fuer Informatik, Germany
Harald Ganzinger , Max-Planck-Institut fuer Informatik, Germany
pp. 456

Solving linear equations over polynomial semirings (Abstract)

P. Narendran , Dept. of Comput. Sci., State Univ. of New York, Albany, NY, USA
pp. 466

Basic Paramodulation and Decidable Theories (Abstract)

Robert Nieuwenhuis , Technical University of Catalonia, Spain
pp. 473
Complexity and Decidability: Chair: A. Stolboushkin

On the Complexity of Abduction (Abstract)

Victor W. Marek , University of Kentucky
Jeffrey B. Remmel , University of California at La Jolla
Anil Nerode , Cornell University
pp. 513

Decision Problems for Semi-Thue Systems with a Few Rules (Abstract)

Yuri Matiyasevich , Steklov Institute of Mathematics of Russian Academy of Sciences
Geraud Senizergues , Universite de Bordeaux, France
pp. 523
FLoC Plenary Session: Chair: M.Y. Vardi

Index of Authors (PDF)

pp. 535
105 ms
(Ver 3.3 (11022016))