[Prev][Next][Index][Thread]

LICS '90 Preliminary Program

Date: Thu, 25 Jan 90 16:30:51 PST

           Preliminary program announcement 
       IEEE Symposium on Logic in Computer Science
              June 4-7, Philadelphia, PA

Banquet Speaker: R.O. Gandy, Oxford

Special session on automated decuction (to be announced).

Technical papers grouped into prospective sessions
(order not yet determined):

NEW FOUNDATIONS FOR FIXPOINT COMPUTATIONS 
	Roy L. Crole and Andrew M. Pitts 
POLYMORPHISM, SET THEORY, AND CALL-BY-VALUE 
	Edmund Robinson and Giuseppe Rosolini 
UNIVERSAL DOMAINS IN THE THEORY OF DENOTATIONAL 
SEMANTICS OF PROGRAMMING LANGUAGES 
	M. Droste and R. Gobel 
THE CLASSIFICATION OF CONTINUOUS DOMAINS 
	Achim Jung 

COMPLETENESS FOR TYPED LAZY EQUALITIES 
	Jon Riecke, Stavros Cosmadakis and Albert Meyer 
TYPE RECONSTRUCTION IN FINITE-RANK FRAGMENTS OF 
THE POLYMORPHIC $\lambda$-CALCULUS 
	A.J. Kfoury and J. Tiuryn 
CONDITIONAL LAMBDA-THEORIES AND THE VERIFICATION 
OF STATIC PROPERTIES OF PROGRAMS 
	Mitchell Wand 
SINGLE-THREADED POLYMORPHIC LAMBDA CALCULUS 
	Juan C. Guzman and Paul Hudak 

PROGRAMMING IN EQUATIONAL LOGIC: BEYOND STRONG SEQUENTIALITY 
	I.V. Ramakrishnan 
THE THEORY OF GROUND REWRITE SYSTEMS IS DECIDABLE 
	Max Dauchet and S. Tison 
WELL REWRITE ORDERINGS 
	Pierre Lescanne 
A CONSTRUCTIVE PROOF OF HIGMAN'S LEMMA 
	James R. Russell and Chet Murthy 

SYNTACTIC THEORIES AND UNIFICATION 
	Claude Kirchner and Francis Klay 
PROOF TRANSFORMATIONS FOR EQUATIONAL THEORIES 
	Tobias Nipkow 
A NEW AC UNIFICATION ALGORITHM WITH A NEW ALGORITHM FOR 
SOLVING DIOPHANTINE EQUATIONS 
	Alexandre Boudet, Evelyne Constejean and Herve Devie 
ON SUBSUMPTION AND SEMIUNIFICATION IN FEATURE ALGEBRAS 
	William Rounds 

SYMBOLIC MODEL CHECKING: $10^20$ STATES AND BEYOND 
	David Dill, J. Hwang, J.R. Burch, E.M. Clarke 
	and K.L. McMillan
WHEN IS "PARTIAL" ADEQUATE? A LOGIC-BASED PROOF TECHNIQUE 
USING PARTIAL SPECIFICATIONS 
	Bernhard Steffen and Rance Cleaveland
MODELLING SHARED STATE IN A SHARED ACTION MODEL 
	Kenneth J. Goldman and Nancy A. Lynch 
ON THE LIMITS OF EFFICIENT TEMPORAL DECIDABILITY 
	E. Allen Emerson, Mike Evangelist and Jai Srinivasan 

EQUATION SOLVING THROUGH AN OPERATIONAL SEMANTICS OF CONTEXT 
	Kim G. Larsen and Liu Xinxin 
THREE LOGICS FOR BRANCHING BISIMULATION 
	Rocco De Nicola and Frits Vaandrager
REACTIVE, GENERATIVE, AND STRATIFIED MODELS OF PROBABILISTIC PROCESSES 
	 R. van Glabbeek, Scott A. Smolka, B. Steffen and Chris Tofts 
THE NONEXISTENCE OF FINITE AXIOMATISATIONS FOR CCS CONGRUENCES 
	Faron Moller 

A LOGIC OF CONCRETE TIME INTERVALS 
	Harry R. Lewis 
REAL-TIME LOGICS: COMPLEXITY AND EXPRESSIVENESS 
	Rajeev S. Alur and Tom Henzinger 
EXPLICIT CLOCK TEMPORAL LOGIC 
	Amir Pnueli, Harel, Lichtenstein
MODEL-CHECKING FOR REAL-TIME SYSTEMS 
	Rajeev Alur, Costas Courcoubetis and David Dill 

A DECISION PROCEDURE FOR A CLASS OF SET CONSTRAINTS 
	Joxan Jaffar and Nevin Heintze 
A CONSTRAINT SEQUENT CALCULUS 
	Jean-Louis Lassez and Ken McAloon 
SOLVING INEQUATIONS IN TERM ALGEBRAS 
	H. Comon 

THE DYNAMIC LOGIC OF PERMISSION 
	R. van der Meyden 
A THEORY OF NON-MONOTONIC RULE SYSEMS 
	Wiktor Marek and Anil Nerode 
THE SEMANTICS OF REFLECTED PROOF 
	Robert L. Constable 
ON THE POWER OF BOUNDED CONCURRENCY: REASONING ABOUT PROGRAMS 
	David Harel, Roni Rosner and Moshe Vardi

NORMAL PROCESS REPRESENTATIVES 
	Vijay Gehlot and Carl Gunter 
A CATEGORIAL LINEAR FRAMEWORK FOR PETRI NETS
	Carolyn Brown and Doug Gurr 
A LINEAR SEMANTICS FOR ALLOWED LOGIC PROGRAMS 
	S. Cerrito 

0-1 LAWS FOR INFINITARY LOGICS 
	Phokion Kolaitis and Moshe Vardi
IMPLICIT DEFINABILITY ON FINITE STRUCTURES AND UNAMBIGUOUS COMPUTATIONS 
	Phokion Kolaitis 
ALOGTIME AND A CONJECTURE OF S.A. Cook 
	Peter Clote 
ON THE EXPRESSION OF MONADIC SECOND-ORDER GRAPH PROPERTIES 
WITHOUT QUANTIFICATIONS OVER SETS OF EDGES 
	Bruno Courcelle 

EXTENSIONAL PERS 
	Peter Freyd, P.Mulry, G.Rosolini, D.Scott 
RECURSIVE TYPES REDUCED TO INDUCTIVE TYPES 
	Peter Freyd 
A PER MODEL OF POLYMORPHISM AND RECURSIVE TYPES 
	M. Abadi and G. D. Plotkin 
EFFECTIVE DOMAINS AND INTRINSIC STRUCTURE 
	Wesley Phoa 


General chair: Albert R. Meyer
Conference chair: Jean Gallier
Program Chair: John C. Mitchell

Program committee: K. Apt, J. Barwise, E. Clarke, S. Cook, S. Hayashi, 
P. Kanellakis, J.-P. Jouannaud, D. Leivant, J. Mitchell, U. Montanari,
A. Pitts, E. Sandewall, A. Scedrov, M. Stickel, G. Winskel

For further conference information, send electronic mail
to lics@cs.cmu.edu.