8:00 -  9:00            REGISTRATION

 9:00 - 10:00    INVITED TALK: Dennis Volpano (Naval Postgraduate School)
                         Safety versus Secrecy

  10:00 - 10:25          COFFEE BREAK

 10:25 - 11:25  SAS SESSION: SYNCHRONIZATION IN JAVA PROGRAMS

A Formal Study of Slicing for Multi-threaded Programs with JVM Concurrency Primitives
John Hatcliff, James Corbett, Matthew Dwyer, Stefan Sokolowski, Hongjun Zheng
Static Analyses for Eliminating Unnecessary Synchronization from Java Programs.
Jonathan Aldrich, Craig Chambers, Emin Gun Sirer, and Susan Eggers

 A Framework for Assertion-based Debugging in Constraint Logic Programming
German Puebla, Francisco Bueno, Manuel Hermenegildo
 Annotation for Prolog - A Concept and Runtime Handling
Marija Kulas

 11:30 - 12:30  SAS SESSION: SYNCHRONOUS LANGUAGES

Dynamic Partitioning in Analyses of Numerical Properties
Bertrand Jeannet,  Nicolas Halbwachs, Pascal Raymond
Polyhedral Analysis for Synchronous Languages
Frèderic Besson, Thomas Jensen, Jean-Pierre Talpin

  Verification by testing for recursive program schemes
Daniel Le Métayer, V.-A. Nicolas, O. Ridoux
  Proofs by Program Transformations
Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan

 14:30 - 16:00    TUTORIAL: Mary Lou Soffa (University of Pittsburgh)

  Techniques to Improve the Scalability and Precision of Data Flow Analysis

 16.00 - 16.25        COFFEE BREAK

 16.25 - 17.25    SAS SESSION: STATIC SINGLE ASSIGNMENT

  Partial Dead Code Elimination Using Extended Value Graph

  Translating Out of Single Assignment Form

  On Dynamic Aspects of  OOD Frameworks in Component-based Software Development
in Computational Logic

  A Unified View of Programming Schemas and Proof Methods

 17.30 - 18:30    SAS SESSION: OPTIMIZATIONS

  Eliminating Dead Code on Recursive Data

  Detecting Equalities of Variables:  Combining Efficiency with Precision

  Specialising Finite Domain Programs Using Polyhedra

  A Compiler for Constraint Handling Rules based on Partial Evaluation

  Imperative Program Specialisation: An approach using CLP

 9:00 - 10:00     INVITED TALK: Daniel Weise (Microsoft Research)

          Static Analysis of Mega-Programs

 10:00 - 10:30           COFFEE  BREAK

 10:30 - 12.00    TUTORIAL: David Schmidt (Kansas State University)

  Model Checking

 12:00 - 13:00   COMPULOG AREA MEETING AND LOPSTR POSTER SESSION

 14:00 - 15:00   INVITED TALK: Don Sannella (University of Edinburgh)

 Algebraic Specification and Program Development by Stepwise Refinement

 15:05 - 16:35  TUTORIAL: Laurent Fribourg (Ecole Normale Sup. de Cachan & CNRS)

  Constraint Logic Programming Applied to Model Checking

 15:05 - 16:35  TUTORIAL: Craig Chambers (University of Washington)

Static Analysis and Profile-Guided Optimization of Object-Oriented Languages

 16:35 - 17:00         COFFEE  BREAK

 17:00 - 18.30    SAS SESSION: FOUNDATIONS

A New Class of Functions for Abstract Interpretation
JörgKöller and Markus Mohnen
Equational Semantic
Loïc Correnson, Etienne Duris, Didier Parigot, Gilles Roussel
Abstract animator for temporal specifications: Application to TLA
Dominique Cansell, Dominique Méry

 17:00 - 18.30    LOPSTR SESSION:  TRANSFORMATION

Making Mercury Programs tail recursive
Peter Ross, David Overton, Zoltan Somogyi
Context-Moving Transformations for Function Verification
Jürgen Giesl
The Replacement Operation for CCP Programs
Marco Bertolino, Sandro Etalle, Catuscia Palamidessi

19:00  EXCURSION AND SOCIAL DINNER
 

Friday,  24 September 1999

 9:00 - 10:00     INVITED TALK: David McAllester (AT&T Research)

         On the Complexity Analysis of Static Analyises

 10:00 - 10:25    COFFEE BREAK

 10:25 - 12:30    SAS SESSION: Abstract Domains

  Decomposing Non-Redundant Sharing by Complementation
Enea Zaffanella, Patricia M. Hill, Roberto Bagnara
  Freeness Analysis Through Linear Refinement
Patricia Hill, Fausto Spoto
  Binary Decision Graphs

  Binding-Time Analysis for Both Static and Dynamic Expressions

 10:25 - 12:30    LOPSTR SESSION: Analysis

  Infinite State Model Checking by Abstract Interpretation and Program Specialisation

  Termination Analysis for Abductive General Logic Programs

  Binding-Time Analysis for Mercury

  Mode Analysis Domains for Typed Logic Programs

 14:30 - 16:00    TUTORIAL: Mireille Ducasse' (IRISA/INSA)

         The B  formal method

 16:00 - 16:25    COFFEE BREAK

 16:25 - 18:00    SAS SESSION: Concurrency

  Abstract Interpretation of Mobile Ambients

Hanne Riis Nielson
  Abstracting Cryptographic Protocols with Tree Automata

  State Space Reduction based on Live Variables Analysis

  Transformation Rules for Logic Programs with Goals with Arguments

  Projections of programs revisited

  A Concurrent Extension of Functional Logic Programming Languages

  Transformation of Left Terminating Programs