Last update:
Sun Mar 12 07:56:33 MDT 2017
Anonymous Keynote Address . . . . . . . . . . . . 1
Peter J. Denning Designing a Discipline of Software
Design . . . . . . . . . . . . . . . . . 1
Anonymous Session 1: Undergraduate Software
Engineering Education . . . . . . . . . 3
David B. Boardman and
Aditya P. Mathur A Two-Semester Undergraduate Sequence in
Software Engineering: Architecture and
Experience . . . . . . . . . . . . . . . 5
Terry Shepard Software Engineering in an Undergraduate
Computer Engineering Program . . . . . . 23
Kenneth L. Modesitt When the Golden Arches Gang Aft Agley:
Incorporating Software Engineering into
Computer Science . . . . . . . . . . . . 35
Anonymous Session 2: Tools of the Trade . . . . . 63
Janusz Zalewski Cohesive Use of Commercial Tools in a
Classroom . . . . . . . . . . . . . . . 65
Yvon Kermarrec Ada Reusable Software Components for
Teaching Distributed Systems . . . . . . 77
Thomas B. Horton Using Commercial CASE Environments to
Teach Software Design . . . . . . . . . 97
Anonymous Session 3: Project-Oriented Courses . . 117
Donald Gotterbarn and
Robert Riser Real-World Software Engineering: A
Spiral Approach to a Project-Oriented
Course . . . . . . . . . . . . . . . . . 119
Melody Moore and
Colin Potts Learning by Doing: Goals and Experience
of Two Software Engineering Project
Courses . . . . . . . . . . . . . . . . 151
Edward C. Epp A ``Just in Time'' Course Framework:
Project-Oriented Courses . . . . . . . . 165
Rudolf Andersen and
Reidar Conradi and
John Krogstie and
Guttorm Sindre and
Arne Solvberg Project Courses at the NTH: 20 Years of
Experience . . . . . . . . . . . . . . . 177
Anonymous Session 4: Process Issues . . . . . . . 189
Laurie Honour Werth An Adventure in Software Process
Improvement . . . . . . . . . . . . . . 191
Pierre N. Robillard and
Jean Mayrand and
Jean-Normand Drouin Process Self-Assessment in an
Educational Context . . . . . . . . . . 211
Marcus Deininger and
Kurt Schneider Teaching Software Project Management by
Simulation-- Experiences with a
Comprehensive Model . . . . . . . . . . 227
Anonymous Session 5: Implications of Practitioners 243
Barbara J. Weinberger Awareness Week at Texas Instruments: An
Alternative Approach to Instructor-Led
Delivery . . . . . . . . . . . . . . . . 245
Jacques Guyard and
Jean-Pierre Jacquot and
Bernard Amar and
Yves Benoit Implication of Practitioners in a
Post-graduate Curriculum, a Successful
Collaboration . . . . . . . . . . . . . 251
Gunnar Hartvigsen Reducing the Gap Between Academic Theory
and Professional Practice in Software
Engineering Education . . . . . . . . . 263
Anonymous Session 6: Panel Discussion . . . . . . 275
J. Fernando Naveda and
John Beidler and
James E. Cardow and
Everald Mills and
Frances Van Scoy Bridging the Gaps . . . . . . . . . . . 277
Anonymous Session 7: Industry Influence in
Software Engineering Education . . . . . 283
James M. Purtilo and
Stan Siegel Experiences with CCB-Directed Projects
in the Classroom . . . . . . . . . . . . 285
Naji Habra and
Eric Dubois Putting into Practice Advanced Software
Engineering Techniques Through Students
Project . . . . . . . . . . . . . . . . 303
Cosimo Antonio Prete Cachesim: A Graphical Software
Environment to Support the Teaching of
Computer Systems with Cache Memories . . 317
Frank W. Calliss and
Debra Trantina Calliss Suggested Scenarios of Software
Maintenance Education . . . . . . . . . 329
Hassan Gomaa Software Design Methods for Concurrent
and Real-Time Systems . . . . . . . . . 341
Anonymous Session 9: Experiences in Academic
Education . . . . . . . . . . . . . . . 343
Lorraine Johnston and
Philip Dart Building on Experience: An Undergraduate
Course with Two Year-Long Projects . . . 345
Jane C. Prey and
James P. Cohoon and
Greg Fife Software Engineering Beginning in the
First Computer Science Course . . . . . 359
Alfs T. Berztiss Non-Functional Requirements in the
Design of Software . . . . . . . . . . . 375
Thomas C. Hartrum and
Paul D. Bailor Teaching Formal Extensions of
Informal-Based Object-Oriented Analysis
Methodologies . . . . . . . . . . . . . 389
Bernd Bruegge and
Robert F. Coyne Teaching Iterative and Collaborative
Design: Lessons and Directions . . . . . 411
Richard G. Epstein The Use of Computer Ethics Scenarios in
Software Engineering Education: The Case
of the Killer Robot . . . . . . . . . . 429
Kurt J. Maly and
Dennis E. Ray and
J. Christian Wild and
Irwin B. Levinstein and
Stephan Olariu and
C. Michael Overstreet and
Tijen Ireland and
George Kantsios and
Nageswara S. V. Rao Computer Productivity Initiative . . . . 441
Anonymous Session 11: Perspective on Software
Engineering Education . . . . . . . . . 461
Jody Paul Alternative Assessment for Software
Engineering Education . . . . . . . . . 463
Paul Ammann and
Hassan Gomaa and
Jeff Offutt and
David Rine and
Bo Sanden A Five Year Perspective on Software
Engineering Graduate Programs at George
Mason University . . . . . . . . . . . . 473
Darren Dalcher Falling Down is Part of Growing Up; the
Study of Failure and the Software
Engineering Community . . . . . . . . . 489
Anonymous Session 12: Software Reuse Education . . 497
Hsia Pei and
Richard H. S. Wang and
Dave Chenho Kung Guided Reuse for Programmers . . . . . . 499
James E. Cardow and
William D. Watson A Practical Approach to Teaching
Software Reuse . . . . . . . . . . . . . 517
Thomas Grechenig and
Stefan Biffl Introducing a Software Reuse Culture in
Practice . . . . . . . . . . . . . . . . 527
Anonymous Session 13: Software Engineering
Education Meeting Industry Needs . . . . 541
Frank P. Coyle and
Edward Forest and
Murat M. Tanik and
Dennis J. Frailey Meeting the Needs of Industry: SMU's
Master's Degree Program in Software
Engineering . . . . . . . . . . . . . . 543
William B. McCarty and
G. Thomas Plew How Mature is Your Software Process? . . 555
William A. Bralick and
John S. Robinson Using a Multi-User Dialogue System to
Support Software Engineering Distance
Education . . . . . . . . . . . . . . . 565
Mary Eward and
Steven Wartik Introducing Megaprogramming at the High
School and Undergraduate Levels . . . . 583
Mahesh H. Dodani Formal Methods for Software Engineering 597
David Gries and
Fred Schneider Saturday Tutorial Presentation Teaching
Logic as a Tool . . . . . . . . . . . . 599
Mark C. Paulk The Capability Maturity Model for
Software: A Tutorial . . . . . . . . . . 601
F. Pichler Systems Theory and Engineering . . . . . 2
T. I. Oren Computer-Aided Systems Technology: Its
Role in Advanced Computerization . . . . 11
H. J. Sommer and
H. Hahn Computer Aided Nonlinear System Design
Based on Algebraic System Representation
and on Nonlinear Bundle Graphs . . . . . 21
D. Monjau and
St. Kahlert and
K. Buchenrieder and
Ch. Veith A New Model-Based Approach to the
Co-Design of Heterogeneous Systems . . . 42
R. Creutzburg and
V. G. Labunets and
E. V. Labunets Towards an ``Erlangen Program'' for
General Linear Systems Theory . . . . . 52
Ch Rattray The Shape of Complex Systems . . . . . . 72
R. Ylinen Polynomial Systems Theory for $n$-D
Systems Applied to Vision-Based Control 83
J. Parets and
A. Anaya and
M. J. Rodriguez and
P. Paderewski A Representation of Software Systems
Evolution Based on the Theory of the
General System . . . . . . . . . . . . . 96
G. Fiol and
J. Miro-Nicolau Theoretical Considerations About Subset
Descriptions . . . . . . . . . . . . . . 111
P. Albertos Sampled Data Passive Systems . . . . . . 118
T. I. Oren and
D. G. King Computer-Aided Systems Technology for
CAD Environments: Complexity Issues and
a Repository-Based Approach . . . . . . 131
Ch. Schaffer and
H. Prahofer On Requirements for a CAST-Tool for
Complex, Reactive System Analysis,
Design and Evaluation . . . . . . . . . 137
H. Hyotyniemi Automating the Modeling of Dynamic
Systems . . . . . . . . . . . . . . . . 160
G. Musgrave and
S. Finn and
M. Francis and
R. Harris and
R. B. Hughes Formal Methods and Their Future . . . . 180
E. M. Thurner Formal Description of Bus Interfaces
Using Methods of System Theory . . . . . 190
W. Jacak and
J. Rozenblit CAST Tools for Intelligent Control in
Manufacturing Automation . . . . . . . . 203
I. Sierocki An Algebraic Transformation of the
Minimum Automaton Identification Problem 220
C. Joslyn On Possibilistic Automata . . . . . . . 231
S. Dormido and
I. Lopez and
F. Morilla and
M. A. Canto On Automatic Adjustment of the Sampling
Period . . . . . . . . . . . . . . . . . 243
Th. Mueller-Wipperfuerth and
J. Scharinger and
F. Pichler FSM Shift Register Realization for
Improved Testability . . . . . . . . . . 254
R. Ylinen Cluster-Based Modelling of Processes
with Unknown Qualitative Variables . . . 268
J. A. Munoz-Blanco and
J. C. Quevedo-Losada and
O. Bolivar-Toledo The Role of Partitions and Functionals
in Descriptor Computation for Data
Receptive Fields . . . . . . . . . . . . 282
V. Giorno and
A. G. Nobile and
L. M. Ricciardi On Some Algorithmic and Computational
Problems for Neuronal Diffusion Models 293
D. H. Kieronska and
S. Venkatesh Hierarchic Representation for Spatial
Knowledge . . . . . . . . . . . . . . . 314
W. Grossmann and
H. Werthner Probabilistic Models in Qualitative
Simulation . . . . . . . . . . . . . . . 331
R. P. Otero and
A. Barreiro and
H. Praehofer and
F. Pichler and
J. Mira STIMS-MEDTOOL: Integration of Expert
Systems with Systems Modelling and
Simulation . . . . . . . . . . . . . . . 347
J. A. Munoz-Blanco and
C. Garcia and
F. Alayon and
S. Candela Systems Concepts for Visual Texture
Change Detection Strategy . . . . . . . 357
A. Delgado and
R. Moreno-Diaz and
J. Mira Qualitative Computation with Neural
Nets: Differential Equations Like
Examples . . . . . . . . . . . . . . . . 366
M. Kilger and
T. Dietl Interpretation-Driven Low-Level
Parameter Adaptation in Scene Analysis 380
Z. Zdrahal General Systems Theory as a Framework
for Model-Based Diagnosis . . . . . . . 388
P. Kopacek Technical Applications of
Knowledge-Based Systems . . . . . . . . 399
M. Zauner CASE --- Computer-Aided Systems
Engineering, a New Approach for
Developing IM-Systems with Special
Consideration of CIM Systems . . . . . . 406
G. J. Marshall and
A. Behrooz and
F. M. Clayton Modelling and Analysis of Complex
Stochastic Systems: from a Specific
Example to a General Environment . . . . 418
K. Kitzmuller System Theoretic Approach to Migration
of Project Models . . . . . . . . . . . 427
K. Zenger Computer-Aided Analysis and Design of
Sequential Control in Industrial
Processes . . . . . . . . . . . . . . . 440
Gerd Wagner Vivid Logic. Knowledge-Based Reasoning
with Two Kinds of Negation . . . . . . . 1
Thomas Johansson and
Gregory Kabatianskii and
Bernard Smeets On the Relation between A-Codes and
Codes Correcting Independent Errors . . 1
R. Safavi-Naini and
L. Tombak Optimal Authentication Systems . . . . . 12
Brandon Dixon and
Arjen K. Lenstra Factoring Integers Using SIMD Sieves . . 28
N. Demytko A New Elliptic Curve Based Analogue of
RSA . . . . . . . . . . . . . . . . . . 40
Simon Blackburn and
Sean Murphy and
Jacques Stern Weaknesses of a Public-Key Cryptosystem
Based on Factorizations of Finite Groups 50
Kaisa Nyberg Differentially Uniform Mappings for
Cryptography . . . . . . . . . . . . . . 55
Thomas Beth and
Cunsheng Ding On Almost Perfect Nonlinear Permutations 65
Claude Carlet Two New Classes of Bent Functions . . . 77
Thomas W. Cusick Boolean Functions Satisfying a Higher
Order Strict Avalanche Criterion . . . . 102
Marco Carpentieri and
Alfredo De Santis and
Ugo Vaccaro Size of Shares and Probability of
Cheating in Threshold Schemes . . . . . 118
Kaoru Kurosawa and
Koji Okada and
Keiichi Sakano and
Wakaha Ogata and
Shigeo Tsujii Nonperfect Secret Sharing Schemes and
Matroids . . . . . . . . . . . . . . . . 126
Ernst S. Selmer From the Memoirs of a Norwegian
Cryptologist . . . . . . . . . . . . . . 142
Rainer Göttfert and
Harald Niederreiter On the Linear Complexity of Products of
Shift-Register Sequences . . . . . . . . 151
Joan Daemen and
René Govaerts and
Joos Vandewalle Resynchronization Weaknesses in
Synchronous Stream Ciphers . . . . . . . 159
Richard A. Games and
Joseph J. Rushanan Blind Synchronization of $m$-Sequences
with Even Span . . . . . . . . . . . . . 168
Jennifer Seberry and
Xian-Mo Zhang and
Yuliang Zheng On Constructions and Nonlinearity of
Correlation Immune Functions . . . . . . 181
Ivan Bjerre Damgård Practical and Provably Secure Release of
a Secret and Exchange of Signatures . . 200
I. B. Damgard Practical and provably secure release of
a secret and exchange of signatures . . 200
Gustavus J. Simmons Subliminal Communication Is Easy Using
the DSA . . . . . . . . . . . . . . . . 218
David Naccache Can O.S.S. be Repaired? --- Proposal for
a new practical signature scheme-- . . . 233
Colin Boyd and
Wenbo Mao On a Limitation of BAN Logic . . . . . . 240
Choonsik Park and
Kazutomu Itoh and
Kaoru Kurosawa Efficient Anonymous Channel and
All/Nothing Election Scheme . . . . . . 248
Josep Domingo-Ferrer Untransferable Rights in a
Client-Independent Server Environment 260
Rafail Ostrovsky and
Ramarathnam Venkatesan and
Moti Yung Interactive Hashing Simplifies
Zero-Knowledge Protocol Design . . . . . 267--273
Josh Cohen Benaloh and
Michael de Mare One-Way Accumulators: A Decentralized
Alternative to Digital Signatures . . . 274
Ivan Bjerre Damgård and
Lars R. Knudsen The Breaking of the AR Hash Function . . 286--292
Bert den Boer and
Antoon Bosselaers Collisions for the Compression Function
of MD-5 . . . . . . . . . . . . . . . . 293
Bert den Boer and
Antoon Bosselaers Collisions for the Compression Function
of MD-5 . . . . . . . . . . . . . . . . 293
Jacques Patarin How to Find and Avoid Collisions for the
Knapsack Hash Function . . . . . . . . . 305--317
Niels Ferguson Single Term Off-Line Coins . . . . . . . 318
Ronald J. F. Cramer and
Torben P. Pedersen Improved Privacy in Wallets with
Observers . . . . . . . . . . . . . . . 329
Stefan Brands and
David Chaum Distance Bounding Protocols . . . . . . 344
Luke O'Connor On the Distribution of Characteristics
in Bijective Mappings . . . . . . . . . 360
Willi Meier On the Security of the IDEA Block Cipher 371
Mitsuru Matsui Linear Cryptanalysis Method for DES
Cipher . . . . . . . . . . . . . . . . . 386--397
Eli Biham New Types of Cryptanalytic Attacks Using
Related Keys . . . . . . . . . . . . . . 398
Gilles Brassard and
Louis Salvail Secret Key Reconciliation by Public
Discussion . . . . . . . . . . . . . . . 410
Donald Beaver and
Nicol So Global, Unpredictable Bit Generation
without Broadcast . . . . . . . . . . . 424
Peter de Rooij On Schnorr's preprocessing for digital
signature schemes . . . . . . . . . . . 435
Peter de Rooij On Schnorr's Preprocessing for Digital
Signature Schemes . . . . . . . . . . . 435
Mike V. D. Burmester Cryptanalysis of the Chang-Wu-Chen Key
Distribution System . . . . . . . . . . 440
Paul C. van Oorschot An Alternate Explanation of Two
BAN-Logic ``Failures'' . . . . . . . . . 443
Paul C. van Oorschot An alternate explanation of two
BAN-logic ``failures'' . . . . . . . . . 443
Gustavus J. Simmons The Consequences of Trust in Shared
Secret Schemes . . . . . . . . . . . . . 448
G. Hornauer and
W. Stephan and
Ralph Wernsdorf Markov Ciphers and Alternating Groups 453
Choonsik Park and
Kaoru Kurosawa and
Tatsuaki Okamoto and
Shigeo Tsujii On Key Distribution and Authentication
in Mobile Radio Networks . . . . . . . . 461
Anonymous Author Index . . . . . . . . . . . . . . 467
Philip R. Van Loocke The Dynamics of Concepts. A
Connectionist Model . . . . . . . . . . 1
Martin Gogolla An Extended Entity-Relationship Model
Fundamentals and Pragmatics . . . . . . 1
Martin C. Carlisle and
Anne Rogers and
John H. Reppy and
Laurie J. Hendren Early Experiences with Olden . . . . . . 1
Jon A. Solworth and
Bryan B. Reagan Arbitrary Order Operations on Trees . . 21
John Plevyak and
Andrew A. Chien and
Vijay Karamcheti Analysis of Dynamic Structures for
Efficient Parallel Execution . . . . . . 37
Aart J. C. Bik and
Harry A. G. Wijshoff On Automatic Data Structure Selection
and Code Generation for Sparse
Computations . . . . . . . . . . . . . . 57
Sundeep Prakash and
Maneesh Dhagat and
Rajive Bagrodia Synchronization Issues in Data-Parallel
Languages . . . . . . . . . . . . . . . 76
Calvin Lin and
Lawrence Snyder ZPL: An Array Sublanguage . . . . . . . 96
Raju Browne and
James C. Pandey Event-Based Composition of Concurrent
Programs . . . . . . . . . . . . . . . . 115
Nicholas Carriero and
Eric Freeman and
David Gelernter Adaptive Parallelism on Multiprocessors:
Preliminary Experience with Piranha on
the CM-5 . . . . . . . . . . . . . . . . 139
Raja Das and
Joel Saltz and
Reinhard von Hanxleden Slicing Analysis and Indirect Accesses
to Distributed Arrays . . . . . . . . . 152
Yang Bwolen and
Jon Webb and
David R. Stichnoth and
James M. O'Hallaron and
Thomas Gross Do and Merge: Integrating Parallel Loops
and Reductions . . . . . . . . . . . . . 169
Barbara M. Chapman and
Thomas Fahringer and
Hans P. Zima Automatic Support for Data Distribution
on Distributed Memory Multiprocessor
Systems . . . . . . . . . . . . . . . . 184
Zeki Bozkus and
Alok Choudhary and
Geoffrey Fox and
Tomasz Haupt and
Sanjay Ranka A Compilation Approach for Fortran
90D/HPF Compilers . . . . . . . . . . . 200--215
Manish Gupta and
Edith Schonberg A Framework for Exploiting Data
Availability to Optimize Communication 216
Siddhartha Chatterjee and
Robert Schreiber and
John R. Gilbert The Alignment-Distribution Graph . . . . 234
Saman P. Amarasinghe and
Jennifer M. Anderson and
Monica S. Lam and
Amy W. Lim An Overview of a Compiler for Scalable
Parallel Machines . . . . . . . . . . . 253
Elana D. Granston Toward a Compile-Time Methodology for
Reducing False Sharing and Communication
Traffic in Shared Virtual Memory Systems 273
Bill Appelbe and
Charles Hardnett and
Sri Doddapaneni Program Transformation for Locality
Using Affinity Regions . . . . . . . . . 290
Ken Kennedy and
Kathryn S. McKinley Maximizing Loop Parallelism and
Improving Data Locality via Loop Fusion
and Distribution . . . . . . . . . . . . 301
Jordi Torres and
Eduard Ayguade and
Jesus Labarta and
Mateo Valero Align and Distribute-based Linear Loop
Transformations . . . . . . . . . . . . 321
Guang R. Gao and
Ning Qi and
Vincent Van Dongen Extending Software Pipelining Techniques
for Scheduling Nested Loops . . . . . . 340
S. D. Kaushik and
C.-H. Huang and
P. Sadayappan and
R. W. Johnson A Methodology for Generating Efficient
Disk-Based Algorithms from Tensor
Product Formulas . . . . . . . . . . . . 358
David C. Sehr and
Laxmikant V. Kale and
David A. Padua Loop Transformations for Prolog Programs 374
Rishiyur S. Nikhil A Multithreaded Implementation of Id
using P-RISC Graphs . . . . . . . . . . 390
Michael Schlansker and
Vinod Kathail Acceleration of First and Higher Order
Recurrences on Processors with
Instruction Level Parallelism . . . . . 406
Richard Neves and
Robert B. Schnabel Efficient Compile-Time/Run-Time
Contraction of Fine Grain Data Parallel
Codes . . . . . . . . . . . . . . . . . 430
Steven Novack and
Alexandru Nicolau VISTA: The Visual Interface for
Scheduling Transformations and Analysis 449
Ron K. Cytron and
Jeanne Ferrante Efficiently Computing $o$-Nodes
On-The-Fly . . . . . . . . . . . . . . . 461
Paul Havlak Construction of Thinned Gated
Single-Assignment Form . . . . . . . . . 477
Tu Peng and
David Padua Automatic Array Privatization . . . . . 500
Dirk Grunwald and
Harini Srinivasan Efficient Computation of Precedence
Information in Parallel Programs . . . . 502
Mary W. Hall and
John M. Mellor-Crummey and
Alan Carle and
Rene G. Rodriguez FIAT: A Framework for Interprocedural
Analysis and Transformations . . . . . . 522
William Pugh and
David Wonnacott An Exact Method for Analysis of
Value-based Array Data Dependences . . . 546
Mohammad R. Haghighat and
Constantine D. Polychronopoulos Symbolic Analysis: A Basis for
Parallelization, Optimization, and
Scheduling of Programs . . . . . . . . . 567
Rajiv Gupta and
Madalene Spezialetti Towards a Non-intrusive Approach for
Monitoring Distributed Computations
through Perturbation Analysis . . . . . 586
Robert H. B. Netzer Trace Size vs. Parallelism in
Trace-and-Replay Debugging of
Shared-Memory Programs . . . . . . . . . 617
Vivek Sarkar and
Barbara Simons Parallel Program Graphs and Their
Classification . . . . . . . . . . . . . 633
J. L. Nazareth The Newton-Cauchy Framework: A Unified
Approach to Unconstrained Nonlinear
Minimization . . . . . . . . . . . . . . 1
Peter Haddawy Representing Plans Under Uncertainty A
Logic of Time, Chance, and Action . . . 1
Gerald Tomas and
Christoph W. Ueberhuber Visualization of Scientific Parallel
Programs . . . . . . . . . . . . . . . . 1
J. Estublier Architecture Session . . . . . . . . . . 1
V. Ambriola and
G. A. Cignoni and
C. Montangero The Oikos Services for Object Management
in the Software Process . . . . . . . . 2
S. Bandinelli and
M. Braga and
A. Fuggetta and
L. Lavazza The Architecture of SPADE-1
Process-Centered SEE . . . . . . . . . . 15
M. Anderson and
P. Griffiths The Nature of the Software Process
Modelling Problem is Evolving . . . . . 31
M. Baldi and
S. Gai and
M. L. Jaccheri and
P. Lago Searching for PMIPS: Process Model
Instructions per Second . . . . . . . . 35
R. Conradi Meta-Process \slash Methodology Session 38
J. Sa and
B. C. Warboys Modelling Processes Using a Stepwise
Refinement Technique . . . . . . . . . . 40
T. Rodden and
V. King and
J. Hughes and
I. Sommerville Process Modelling and Development
Practice . . . . . . . . . . . . . . . . 59
K. Phalp and
M. Shepperd A Pragmatic Approach to Process
Modelling . . . . . . . . . . . . . . . 65
G. Junkermann and
W. Schafer A Design Methodology for
Process-Programming . . . . . . . . . . 69
J.-C. Derniame Process Modelling Concepts Session . . . 74
G. T. Heineman Process Modelling with Cooperative
Agents . . . . . . . . . . . . . . . . . 75
M. Dowson and
C. Fernstrom Towards Requirements for Enactment
Mechanisms . . . . . . . . . . . . . . . 90
D. E. Perry Enactment Control in
Interact/Intermediate . . . . . . . . . 107
I. Sommerville and
S. Monk Supporting Informality in the Software
Process . . . . . . . . . . . . . . . . 114
G. Chroust Navigation in Process Models . . . . . . 119
M. Verlage Multi-View Modelling of Software
Processes . . . . . . . . . . . . . . . 123
A. Fuggetta PML Concepts and Paradigms Session . . . 127
G. Engels and
L. Groenewegen Specification of Coordinated Behaviour
by SOCCA . . . . . . . . . . . . . . . . 128
N. Berrington and
D. De Roure and
R. Greenwood and
P. Henderson Distribution and Change: Investigating
Two Challenges for Process Enactment
Systems . . . . . . . . . . . . . . . . 152
G. Starke Why is Process Modelling so Difficult? 163
R. M. Greenwood Modelling Processes with Constraints . . 167
S. Arbaoui and
F. Oquendo Goal Oriented vs. Activity Oriented
Process Modelling and Enactment: Issues
and Perspectives . . . . . . . . . . . . 171
J. Tankoano and
J.-C. Derniame and
A. B. Kaba Software Process Design Based on
Products and the Object Oriented
Paradigm . . . . . . . . . . . . . . . . 177
I. Sommerville Experiences with Software Process
Technology Session . . . . . . . . . . . 186
I. Robertson An Implementation of the ISPW-6 Process
Example . . . . . . . . . . . . . . . . 187
V. Ambriola and
R. Di Meglio and
V. Gervasi and
B. Mercurio Applying a Metric Framework to the
Software Process: an Experiment . . . . 207
J.-M. Aumaitre and
M. Dowson and
D.-R. Harjani Lessons Learned from Formalizing and
Implementing a Large Process Model . . . 227
B. Kramer and
B. Dinler Applying Process Technology to Hardware
Design . . . . . . . . . . . . . . . . . 240
V. Ambriola Related Domains Session . . . . . . . . 249
V. Gruhn Software Process Management and Business
Process (Re-)Engineering . . . . . . . . 250
R. Conradi and
G. M. Hoydalsvik and
G. Sindre A Comparison of Modelling Frameworks for
Software Processes and Information
Systems . . . . . . . . . . . . . . . . 254
J. Lonchamp A Process-Centered Framework for
Asynchronous Collaborative Work . . . . 261
J. Estublier What Process Technology Needs from
Databases . . . . . . . . . . . . . . . 270
Adi Shamir Efficient Signature Schemes Based on
Birational Permutations . . . . . . . . 1
Jacques Stern A New Identification Scheme Based on
Syndrome Decoding . . . . . . . . . . . 13
Don Coppersmith and
Hugo Krawczyk and
Yishay Mansour The Shrinking Generator . . . . . . . . 22--39
Richard Taylor An Integrity Check Value Algorithm for
Stream Ciphers . . . . . . . . . . . . . 40
Jennifer Seberry and
Xian-Mo Zhang and
Yuliang Zheng Nonlinearly Balanced Boolean Functions
and Their Propagation Characteristics 49
Toshiya Itoh and
Masafumi Hoshi and
Shigeo Tsujii A Low Communication Competitive
Interactive Proof System for Promised
Quadratic Residuosity . . . . . . . . . 61
A. De Santis and
G. Di Crescenzo and
G. Persiano Secret sharing and perfect
zero-knowledge . . . . . . . . . . . . . 73
Alfredo De Santis and
Giovanni Di Crescenzo and
Giuseppe Persiano Secret Sharing and Perfect
Zero-Knowledge . . . . . . . . . . . . . 73
Yonatan Aumann and
Uriel Feige One Message Proof Systems with Known
Space Verifiers . . . . . . . . . . . . 85
Ivan B. Damgard Interactive hashing can simplify
zero-knowledge protocol design without
computational assumptions . . . . . . . 100--109
Ivan Bjerre Damgård Interactive Hashing Can Simplify
Zero-Knowledge Protocol Design without
Computational Assumptions . . . . . . . 100
Carlo Blundo and
Antonella Cresti and
Alfredo De Santis and
Ugo Vaccaro Fully Dynamic Secret Sharing Schemes . . 110
Wen-Ai Jackson and
Keith M. Martin and
Christine M. O'Keefe Multisecret Threshold Schemes . . . . . 126
Jackson Wen-Ai and
Keith M. Martin and
Christine M. O'Keefe Multisecret threshold schemes . . . . . 126
Hugo Krawczyk Secret Sharing Made Short . . . . . . . 136
Leonard M. Adleman and
Johnathan DeMarrais A Subexponential Algorithm for Discrete
Logarithms over All Finite Fields . . . 147
Johannes A. Buchmann and
J. Loho and
J. Zayer An Implementation of the General Number
Field Sieve . . . . . . . . . . . . . . 159
T. Denny and
Bruce Dodson and
Arjen K. Lenstra and
Mark S. Manasse On the Factorization of RSA-120 . . . . 166
Antoon Bosselaers and
René Govaerts and
Joos Vandewalle Comparison of Three Modular Reduction
Functions . . . . . . . . . . . . . . . 175
Ishai Ben-Aroya and
Eli Biham Differential Cryptanalysis of Lucifer 187
Kazuo Ohta and
Mitsuru Matsui Differential Attack on Message
Authentication Codes . . . . . . . . . . 200
Bart Preneel and
Marnix Nuttin and
Vincent Rijmen and
Johan Buelens Cryptanalysis of the CFB Mode of the DES
with a Reduced Number of Rounds . . . . 212
Joan Daemen and
René Govaerts and
Joos Vandewalle Weak Keys for IDEA . . . . . . . . . . . 224
Mihir Bellare and
Phillip Rogaway Entity Authentication and Key
Distribution . . . . . . . . . . . . . . 232
Ivan Bjerre Damgård and
Torben Pryds Pedersen and
Birgit Pfitzmann On the Existence of Statistically Hiding
Bit Commitment Schemes and Fail-Stop
Signatures . . . . . . . . . . . . . . . 250
Ivan B. Damgard and
Torben P. Pedersen and
Birgit Pfitzmann On the existence of statistically hiding
bit commitment schemes and fail-stop
signatures . . . . . . . . . . . . . . . 250
Matthew Franklin and
Stuart Haber Joint Encryption and Message-Efficient
Secure Computation . . . . . . . . . . . 266
Avrim Blum and
Merrick Furst and
Michael Kearns and
Richard J. Lipton Cryptographic Primitives Based on Hard
Learning Problems . . . . . . . . . . . 278
Niels Ferguson Extensions of Single-Term Coins . . . . 292
Stefan Brands Untraceable Off-Line Cash in Wallets
with Observers . . . . . . . . . . . . . 302
Claude Crépeau and
Joe Kilian Discreet Solitary Games . . . . . . . . 319
Jürgen Bierbrauer and
Thomas Johansson and
Gregory A. Kabatianskii and
Bernard J. M. Smeets On Families of Hash Functions via
Geometric Codes and Concatenation . . . 331--342
Thomas Johansson On the Construction of Perfect
Authentication Codes That Permit
Arbitration . . . . . . . . . . . . . . 343
Peter Gemmell and
Moni Naor Codes for Interactive Authentication . . 355
Bart Preneel and
René Govaerts and
Joos Vandewalle Hash Functions Based on Block Ciphers: A
Synthetic Approach . . . . . . . . . . . 368--378
Walter Hohl and
Xuejia Lai and
Thomas Meier and
Christian Waldvogel Security of Iterated Hash Functions
Based on Block Ciphers . . . . . . . . . 379--390
Jacques Patarin and
Pascal Chauvaud Improved Algorithms for the Permuted
Kernel Problem . . . . . . . . . . . . . 391
Luke O'Connor On the Distribution of Characteristics
in Composite Permutations . . . . . . . 403
Chuan-Ming Li and
Tzonelih Hwang and
Narn-Yih Lee Remark on the Threshold RSA Signature
Scheme . . . . . . . . . . . . . . . . . 413
Hoon Lim Chae and
Joong Lee Pil Another method for attaining security
against adaptively chosen ciphertext
attacks . . . . . . . . . . . . . . . . 420
Chae Hoon Lim and
Pil Joong Lee Another Method for Attaining Security
against Adaptively Chosen Ciphertext
Attacks . . . . . . . . . . . . . . . . 420
Don Coppersmith and
Jacques Stern and
Serge Vaudenay Attacks on the Birational Permutation
Signature Schemes . . . . . . . . . . . 435
Amos Beimel and
Benny Chor Interaction in Key Distribution Schemes 444
Tom Leighton and
Silvio Micali Secret-Key Agreement without Public-Key
Cryptography . . . . . . . . . . . . . . 456
Amos Fiat and
Moni Naor Broadcast Encryption . . . . . . . . . . 480
Anonymous Author Index . . . . . . . . . . . . . . 492
P. Laird Identifying and Using Patterns in
Sequential Data . . . . . . . . . . . . 1--18
Ram Chillarege Top Five Challenges Facing the Practice
of Fault Tolerance . . . . . . . . . . . 3
A. Yamamoto Generalized Unification as Background
Knowledge in Learning Logic Programs . . 11
Y. Levendel Fault Tolerance Cost Effectiveness . . . 13
S. Miyano Learning Theory Toward Genome
Informatics . . . . . . . . . . . . . . 19
C. Douglass Locke Fault Tolerant Applications Systems; A
Requirements Perspective . . . . . . . . 21
Michel Banatre and
Alain Gefflaut and
Christine Morin Scalable Shared Memory Multiprocessors:
Some Ideas to Make Them Reliable . . . . 29
S. Muggleton Optimal Layered Learning: A PAC Approach
to Incremental Sampling . . . . . . . . 37
J. Arima and
H. Sawamura Reformulation of Explanation by Linear
Logic --- Toward Logic for Explanation 45
W. Kent Fuchs and
Wen-mei Hwu and
Neal J. Alewine Application of Compiler-Assisted
Rollback Recovery to Speculative
Execution Repair . . . . . . . . . . . . 45
J. Barzdins and
G. Barzdins and
K. Apsitis and
U. Sarkans Towards Efficient Inductive Synthesis of
Expressions from Input/Output Examples 59
Barry J. Gleeson Fault Tolerance: Why Should I Pay for
It? . . . . . . . . . . . . . . . . . . 66
M. Hagiya A Typed lambda-Calculus for
Proving-by-Example and Bottom-up
Generalization Procedure . . . . . . . . 73
Jeremy Jones and
Brian Coghlan Stable Disk --- A Fault Tolerant Cached
RAID Subsystem . . . . . . . . . . . . . 78
K. P. Jantke and
S. Lange Case-Based Representation and Learning
of Pattern Languages . . . . . . . . . . 87
David Liddell Simple Design Makes Reliable Computers 91
Dhiraj K. Pradhan and
Debendra Das Sharma and
Nitin H. Vaidya Roll-Forward Checkpointing Schemes . . . 95
T. Sato and
S. Akiba Inductive Resolution . . . . . . . . . . 101
Jack J. Stiffler Fault Tolerant Architectures --- Past,
Present and (?) Future . . . . . . . . . 117
Y. Mukouchi and
S. Arikawa Inductive Inference Machines That Can
Refute Hypothesis Spaces . . . . . . . . 123
Ofir Amir and
Yair Amir and
Danny Dolev A Highly Available Application in the
Transis Environment . . . . . . . . . . 125
R. Freivalds and
C. H. Smith On the Duality Between Mechanistic
Learners and What it is They Learn . . . 137
Kenneth P. Birman Reliable Enterprise Computing Systems 140
S. Jain and
A. Sharma On Aggregating Teams of Learning
Machines . . . . . . . . . . . . . . . . 150
Elmootazbellah N. Elnozahy Fault Tolerance for Clusters of
Workstations . . . . . . . . . . . . . . 151
Yennun Huang and
Chandra Kintala and
Pankaj Jalote Two Techniques for Transient Software
Error Recovery . . . . . . . . . . . . . 159
J. Viksna Learning with Growing Quality . . . . . 164
Peter A. Lee Software-Faults: The Remaining Problem
in Fault Tolerant Systems? . . . . . . . 171
R. Daley and
B. Kalyanasundaram Use of Reduction Arguments in
Determining Popperian FIN-Type Learning
Capabilities . . . . . . . . . . . . . . 173
Jim Lipkis and
Marc Rozier Fault Tolerance Enablers in the CHORUS
Microkernel . . . . . . . . . . . . . . 182
T. Moriyama and
M. Sato Properties of Language Classes with
Finite Elasticity . . . . . . . . . . . 187
Gilles Muller A Reliable Client-Server Model on Top of
a Micro-Kernel . . . . . . . . . . . . . 191
S. Kapur Uniform Characterizations of Various
Kinds of Language Learning . . . . . . . 197
David Powell Distributed Fault Tolerance --- Lessons
Learnt from Delta-4 . . . . . . . . . . 199
T. Knuutila How to Invent Characterizable Inference
Methods for Regular Languages . . . . . 209
Santosh K. Shrivastava Arjuna and Voltan: Case Studies in
Building Fault Tolerant Distributed
Systems Using Standard Components . . . 218
J. R. Cuellar and
H. U. Simon Neural Discriminant Analysis . . . . . . 223
Rod Bark Fault Tolerant Platforms for Emerging
Telecommunications Markets . . . . . . . 229
M. Iwayama and
N. Indurkhya and
H. Motoda A New Algorithm for Automatic
Configuration of Hidden Markov Models 237
Farman Jahanian Fault Tolerance in Embedded Real-Time
Systems . . . . . . . . . . . . . . . . 237
Hermann Kopetz The Systematic Design of Large Real-Time
Systems or Interface Simplicity . . . . 250
A. Sakurai On the VC-Dimension of Depth Four
Threshold Circuits and the Complexity of
Boolean-valued Functions . . . . . . . . 251
Jaynarayan H. Lala and
Richard E. Harper Fault Tolerance in Embedded Real-Time
Systems: Importance and Treatment of
Common Mode Failures . . . . . . . . . . 263
E. Takimoto and
A. Maruoka On the Sample Complexity of Consistent
Learning with One-Sided Error . . . . . 265
A. Shinohara Complexity of Computing
Vapnik--Chervonenkis Dimension . . . . . 279
Andrea Borr and
Carol Wilhelmy Highly-Available Data Services for UNIX
Client-Server Networks: Why Fault
Tolerant Hardware Isn't the Answer . . . 285
S. Hasegawa and
H. Imai and
M. Ishiguro in-Approximations of $k$-Label Spaces 288
A. Nakamura and
N. Abe Exact Learning of Linear Combinations of
Monotone Terms from Function Value
Queries . . . . . . . . . . . . . . . . 300
Jean-François Paris The Management of Replicated Data . . . 305
R. Siromoney and
D. G. Thomas and
K. G. Subramanian and
V. R. Dare Thue Systems and DNA --- A Learning
Algorithm for a Subclass . . . . . . . . 314
Y. Ishigami and
S. Tani The VC-Dimensions of Finite Automata
with n States . . . . . . . . . . . . . 328
K. Yoshida and
H. Motoda and
N. Indurkhya Unifying Learning Methods by Colored
Digraphs . . . . . . . . . . . . . . . . 342
M. Suwa and
H. Motoda A Perceptual Criterion for Visually
Controlling Learning . . . . . . . . . . 356
S. Kobayashi Learning Strategies Using Decision Lists 370
N. Zhong and
S. Ohsuga A Decomposition Based Induction Model
for Discovering Concept Clusters from
Databases . . . . . . . . . . . . . . . 384
J.-G. Ganascia Algebraic Structure of Some Learning
Systems . . . . . . . . . . . . . . . . 398
S. Tsumoto and
H. Tanaka Induction of Probabilistic Rules Based
on Rough Set Theory . . . . . . . . . . 410
Raimund Seidel The Nature and Meaning of Perturbations
in Geometric Computing . . . . . . . . . 3
Ph. Devienne and
P. Lebegue and
J-Ch. Routier and
J. Wurtz One Binary Horn Clause Is Enough . . . . 21
N. Bensaou and
I. Guessarian Transforming Constraint Logic Programs 33
F. Laroussinie and
Ph. Schnoebelen A Hierarchy of Temporal Logics with Past 47
J. Goubault The Complexity of Resource-Bounded
First-Order Classical Logic . . . . . . 59
B. Benhamou and
L. Sais and
P. Siegel Two Proof Procedures for a Cardinality
Based Language in Propositional Calculus 71
B. von Braunmuhl and
R. Gengler and
R. Rettinger The Alternation Hierarchy for Machines
with Sublogarithmic Space Is Infinite 85
A. V. Naik and
K. W. Regan and
D. Sivakumar Quasilinear Time Complexity Theory . . . 97
I. I. Macarie Space-Efficient Deterministic Simulation
of Probabilistic Automata . . . . . . . 109
K. Immerman and
N. Etessami Reachability and the Power of Local
Ordering . . . . . . . . . . . . . . . . 123
L. Mak Are Parallel Machines Always Faster than
Sequential Machines? . . . . . . . . . . 137
H. Comon and
F. Jacquemard Ground Reducibility and Automata with
Disequality Constraints . . . . . . . . 151
Z. Khasidashvili Perpetuality and Strong Normalization in
Orthogonal Term Rewriting Systems . . . 163
A. Sattler-Klein About Changing the Ordering During
Knuth--Bendix Completion . . . . . . . . 175
C. Ringeissen Combination of Matching Algorithms . . . 187
M. Kik and
M. Kutylowski and
G. Stachowiak Periodic Constant Depth Sorting Networks 201
B. S. Chlebus and
L. Gasieniec Optimal Pattern Matching on Meshes . . . 213
M. Kunde and
R. Niedermeier and
P. Rossmanith Faster Sorting and Routing on Grids with
Diagonals . . . . . . . . . . . . . . . 225
J. F. Sibeyn and
M. Kaufmann Deterministic 1-k Routing on Meshes . . 237
M. Hofmann and
B. Pierce A Unifying Type-Theoretic Framework for
Objects . . . . . . . . . . . . . . . . 251
J. Avenhaus and
K. Becker Operational Specifications with
Built-Ins . . . . . . . . . . . . . . . 263
E. P. Gribomont and
J. Hagelstein Reactive Variables for System
Specification and Design . . . . . . . . 275
K. W. Regan A New Parallel Vector Model, with Exact
Characterizations of NC$^k$ . . . . . . 289
C. Alvarez and
B. Jenner On Adaptive Dlogtime and Polylogtime
Reductions . . . . . . . . . . . . . . . 301
M. Ogiwara $ \mbox {NC}^k(\mbox {NP}) = \mbox
{AC}^{k - 1}(\mbox {NP}) $ . . . . . . . 313
Andre Arnold Hypertransition Systems . . . . . . . . 327
Y. Metivier and
G. Richomme On the Star Operation and the Finite
Power Property in Free Partially
Commutative Monoids . . . . . . . . . . 341
V. Bruyere and
C. De Felice and
G. Guaiana Coding with Traces . . . . . . . . . . . 353
D. Giammarresi and
A. Restivo and
S. Seibert and
W. Thomas Monadic Second-Order Logic over Pictures
and Recognizability by Tiling Systems 365
M. Delest and
J- Ph. Dubernard $q$-Grammars: Results, Implementation 377
G. Karner A Topology for Complete Semirings . . . 389
R. V. Book and
J. H. Lutz and
D. M. Martin The Global Power of Additional Queries
to Random Oracles . . . . . . . . . . . 403
J. H. Lutz and
E. Mayordomo Cook Versus Karp-Levin: Separating
Completeness Notions if NP is Not Small 415
Th. Thierauf and
S. Toda and
O. Watanabe On Sets Bounded Truth-Table Reducible to
P-Selective Sets . . . . . . . . . . . . 427
V. L. Selivanov Two Refinements of the Polynomial
Hierarchy . . . . . . . . . . . . . . . 439
H. Vollmer On Different Reducibility Notions for
Function Classes . . . . . . . . . . . . 449
M. Luby and
W. Ertel Optimal Parallelization of Las Vegas
Algorithms . . . . . . . . . . . . . . . 463
A. Datta Efficient Parallel Algorithms for
Geometric $k$-Clustering Problems . . . 475
A. Maheshwari and
A. Lingas A Simple Optimal Parallel Algorithm for
Reporting Paths in a Tree . . . . . . . 487
A. Apostolico and
D. Breslauer and
Z. Galil Parallel Detection of All Palindromes in
a String . . . . . . . . . . . . . . . . 497
L. Cai and
J. Chen and
R. Downey and
M. Fellows On the Structure of Parameterized
Problems in NP . . . . . . . . . . . . . 509
E. Amaldi and
V. Kann On the Approximability of Finding
Maximum Feasible Subsystems of Linear
Systems . . . . . . . . . . . . . . . . 521
B. Borchert On the Acceptance Power of Regular
Languages . . . . . . . . . . . . . . . 533
U. Hertrampf Complexity Classes with Finite
Acceptance Types . . . . . . . . . . . . 543
J. Parrow and
P. Sjodin The Complete Axiomatization of
Cs-Congruence . . . . . . . . . . . . . 557
V. van Oostrom and
E. P. de Vink Transition System Specifications in
Stalk Format with Bisimulation as a
Congruence . . . . . . . . . . . . . . . 569
P. Jancar Decidability Questions for Bisimilarity
of Petri Nets and Some Related Problems 581
G. Buntrock and
K. Lorys The Variable Membership Problem:
Succinctness Versus Complexity . . . . . 595
A. Klemm and
R. Weber Economy of Description for Single-Valued
Transducers . . . . . . . . . . . . . . 607
J. Shallit and
Y. Breitbart Automaticity: Properties of a Measure of
Descriptional Complexity . . . . . . . . 619
David Harel Towards a Theory of Recursive Structures 633
H. Arimura and
T. Shinohara and
S. Otsuki Finding Minimal Generalizations for
Unions of Pattern Languages and Its
Application to Inductive Inference from
Positive Data . . . . . . . . . . . . . 649
A. Mateescu and
A. Salomaa Nondeterminism in Patterns . . . . . . . 661
V. Paterson and
M. Dancik Upper Bounds for the Expected Length of
a Longest Common Subsequence of Two
Binary Sequences . . . . . . . . . . . . 669
H. Petersen The Ambiguity of Primitive Words . . . . 679
N. H. Lam On Codes Having No Finite Completion . . 691
R. J. Lipton A New Approach to Information Theory . . 699
N.-M. Le On Voronoi Diagrams in the $ {L}_p
$-Metric in Higher Dimensions . . . . . 711
M.-Y. Kao Total Protection of Analytic Invariant
Information in Cross Tabulated Tables 723
F. F. Dragan and
A. Brandstadt Dominating Cliques in Graphs with
Hypertree Structure . . . . . . . . . . 735
J. S. Deogun and
T. Kloks and
D. Kratsch and
H. Muller On Vertex Ranking for Permutation and
Other Graphs . . . . . . . . . . . . . . 747
T. Kloks and
D. Kratsch Finding All Minimal Separators of a
Graph . . . . . . . . . . . . . . . . . 759
H. L. Bodlaender and
K. Jansen On the Complexity of the Maximum Cut
Problem . . . . . . . . . . . . . . . . 769
K. Aizawa and
A. Nakamura Path-Controlled Graph Grammars for
Multiresolution Image Processing and
Analysis . . . . . . . . . . . . . . . . 1
M. Andries and
G. Engels Syntax and Semantics of Hybrid Database
Languages . . . . . . . . . . . . . . . 19
S. Arnborg Decomposability Helps for Deciding
Logics of Knowledge and Belief . . . . . 37
E. Barendsen and
S. Smetsers Extending Graph Rewriting with Copying 51
K. Barthelmann and
G. Schied Graph-Grammar Semantics of a
Higher-Order Programming Language for
Distributed Systems . . . . . . . . . . 71
A. Corradini and
H. Ehrig and
M. Lowe and
U. Montanari and
F. Rossi Abstract Graph Derivations in the Double
Pushout Approach . . . . . . . . . . . . 86
A. Corradini and
H. Ehrig and
M. Lowe and
U. Montanari and
F. Rossi Note on Standard Representation of
Graphs and Graph Derivations . . . . . . 104
A. Corradini and
D. Wolz Jungle Rewriting: an Abstract
Description of a Lazy Narrowing Machine 119
B. Courcelle and
J. Lagergren Recognizable Sets of Graphs of Bounded
Tree-Width . . . . . . . . . . . . . . . 138
H. Ehrig and
H.-J. Kreowski and
G. Taentzer Canonical Derivations for High-Level
Replacement Systems . . . . . . . . . . 153
M. Gemis and
J. Paredaens and
P. Peelman and
J. Van den Bussche A Computational Model for Generic Graph
Functions . . . . . . . . . . . . . . . 170
E. Grabska Graphs and Designing . . . . . . . . . . 188
D. Janssens ESM Systems and the Composition of Their
Computations . . . . . . . . . . . . . . 203
Y. Kawahara and
Y. Mizoguchi Relational Structures and Their Partial
Morphisms in View of Single Pushout
Rewriting . . . . . . . . . . . . . . . 218
M. Korff Single Pushout Transformations of
Equationally Defined Graph Structures
with Applications to Actor Systems . . . 234
M. Lowe and
J. Dingel Parallelism in Single-Pushout Graph
Rewriting . . . . . . . . . . . . . . . 248
A. Maggiolo-Schettini and
A. Peron Semantics of Full Statecharts Based on
Graph Rewriting . . . . . . . . . . . . 265
U. Montanari and
F. Rossi Contextual Occurrence Nets and
Concurrent Constraint Programming . . . 280
M. Nagl Uniform-Modelling in Graph Grammar
Specifications . . . . . . . . . . . . . 296
J.- C. Raoult and
F. Voisin Set-Theoretic Graph Rewriting . . . . . 312
G. Schied On Relating Rewriting Systems and Graph
Grammars to Event Structures . . . . . . 326
A. Schurr Logic Based Structure Rewriting Systems 341
S. Smetsers and
E. Barendsen and
M. v. Eekelen and
R. Plasmeijer Guaranteeing Safe Destructive Updates
Through a Type System with Uniqueness
Information for Graphs . . . . . . . . . 358
G. Taentzer and
M. Beyer Amalgamated Graph Transformations and
Their Use for Specifying AGG --- an
Algebraic Graph Grammar System . . . . . 380
B. Walter and
S. Benzschawel Complex Structures in (Deductive)
Database Systems: Variables and Open
Property Sets . . . . . . . . . . . . . 1
U. W. Lipeck and
S. Brass Object-Oriented System Specification
Using Defaults . . . . . . . . . . . . . 22
H.-J Burckert Terminologies and Rules . . . . . . . . 44
M. H. Scholl and
M. Tresch Evolution Towards, in, and Beyond Object
Databases . . . . . . . . . . . . . . . 64
T. Eiter and
G. Gottlob and
H. Mannila Expressive Power and Complexity of
Disjunctive Datalog under the Stable
Model Semantics . . . . . . . . . . . . 83
B. Nebel and
H.-J. Burckert Managing Qualitative Temporal
Information: Expressiveness vs.
Complexity . . . . . . . . . . . . . . . 104
W. Kiebling and
U. Guntzer Database Reasoning --- A Deductive
Framework for Solving Large and Complex
Problems by Means of Subsumption . . . . 118
U. Furbach Theory Reasoning in First Order Calculi 139
G. Saake and
T. Hartmann Modelling Information Systems as Object
Societies . . . . . . . . . . . . . . . 157
B. J. Wielinga and
A. T. Schreiber Conceptual Modelling of Large Reusable
Knowledge Bases . . . . . . . . . . . . 181
M. Jarke and
H. W. Nissen and
K. Pohl Tool Integration in Evolving Information
Systems Environments . . . . . . . . . . 201
J. Hartmanis and
S. Chari On the Intellectual Terrain Around NP 1
A. Garg and
R. Tamassia Advances in Graph Drawing . . . . . . . 12
S. C. Sahinalp and
U. Vishkin On a Parallel-Algorithms Method for
String Matching Problems . . . . . . . . 22
M. Yannakakis Some Open Problems in Approximation . . 33
P. Alimonti New Local Search Approximation
Techniques for Maximum Generalized
Satisfiability Problems . . . . . . . . 40
F. Bergadano and
S. Varricchio Learning Behaviors of Automata from
Multiplicity and Equivalence Queries . . 54
A. Bernasconi and
B. Codenotti Measures of Boolean Function Complexity
Based on Harmonic Analysis . . . . . . . 63
A. Clementi and
R. Impagliazzo Graph Theory and Interactive Protocols
for Reachability Problems on Finite
Cellular Automata . . . . . . . . . . . 73
E. Dekel and
J. Hu Parallel Pruning Decomposition (PDS) and
Biconnected Components of Graphs . . . . 91
G. Di Crescenzo A Non-Interactive Electronic Cash System 109
S. Even and
A. Litman A Unified Scheme for Routing in Expander
Based Networks . . . . . . . . . . . . . 125
D. Frigioni and
A. Marchetti-Spaccamela and
U. Nanni Dynamization of Backtrack-Free Search
for the Constraint Satisfaction Problem 136
M. Hofri and
H. Shachnai Efficient Reorganization of Binary
Search Trees . . . . . . . . . . . . . . 152
A. Israeli and
E. Kranakis and
D. Krizanc and
N. Santoro Time-Message Trade-Offs for the Weak
Unison Problem . . . . . . . . . . . . . 167
T. W. Lam and
K. H. Lee On Set Equality-Testing . . . . . . . . 179
A. Monti and
A. Roncato On the Complexity of Some Reachability
Problems . . . . . . . . . . . . . . . . 192
M. Mundhenk On Self-Reducible Sets of Low
Information Content . . . . . . . . . . 203
C. Rub Lower Bounds for Merging on the
Hypercube . . . . . . . . . . . . . . . 213
C. M. Stone The Object Management Group:
Standardization of Object Technology . . 1--1
A. Herbert Databases in Distributed Systems: The
New Frontier . . . . . . . . . . . . . . 2--6
R. Agrawal and
L. G. Demichiel Type Derivation Using the Projection
Operation . . . . . . . . . . . . . . . 7
M. Buchheit and
M. A. Jeusfeld and
W. Nutt and
M. Staudt Subsumption between Queries to
Object-Oriented Databases . . . . . . . 15--22
H. Pirahesh and
B. Mitschang and
N. Südkamp and
B. Lindsay Composite-Object Views in Relational
DBMS: An Implementation Perspective . . 23--30
R. Cicchetti and
L. Lakhal Matrix Relation for Statistical Database
Management . . . . . . . . . . . . . . . 31--44
M. P. Consens and
A. O. Mendelzon and
D. Vista Deductive Database Support for Data
Visualization . . . . . . . . . . . . . 45--58
Z. Somogyi and
D. Kemp and
J. Harland and
K. Ramamohanarao Subsumption-Free Bottom-up Evaluation of
Logic Programs with Partially
Instantiated Data Structures . . . . . . 59--72
R. J. Miller and
Y. E. Ioannidis and
R. Ramakrishnan Schema Equivalence in Heterogeneous
Systems: Bridging Theory and Practice 73--80
C. S. Dos Santos and
S. Abiteboul and
C. Delobel Virtual Schemas and Bases . . . . . . . 81--94
P. Scheuermann and
E. I. Chong Role-Based Query Processing in
Multidatabase Systems . . . . . . . . . 95--108
M. A. Sheldon and
A. Duda and
R. Weiss and
J. W. O'Toole and
D. K. Gifford Content Routing for Distributed
Information Servers . . . . . . . . . . 109--122
G. Alonso and
R. Vingralek and
D. Agrawal and
Y. Breitbart and
A. El Abbadi and
H. Schek and
G. Weikum A Unified Approach to Concurrency
Control and Transaction Recovery . . . . 123--130
C. Mohan and
D. Haderle Algorithms for Flexible Space Management
in Transaction Systems Supporting
Fine-Granularity Locking . . . . . . . . 131--144
P. M. Bober and
M. J. Carey Indexing Alternatives for Multiversion
Locking . . . . . . . . . . . . . . . . 145--158
I. Petrounias and
P. Loucopoulos A Rule-Based Approach for the Design and
Implementation of Information Systems 159--172
M. M. A. Morsi and
S. B. Navathe and
J. Shilling On Behavioral Schema Evolution in
Object-Oriented Databases . . . . . . . 173--186
B. A. Nixon Representing and Using Performance
Requirements During the Development of
Information Systems . . . . . . . . . . 187--200
X. Qian A Model-Theoretic Semantics of the
Multilevel Relational Model . . . . . . 201--214
J. Clifford and
T. Isakowitz On the Semantics of (Bi)Temporal
Variable Databases . . . . . . . . . . . 215--230
A. Formica and
M. Missikoff Correctness of ISA Hierarchies in
Object-Oriented Database Schemas . . . . 231--244
T. Imielinski and
S. Viswanathan and
B. R. Badrinath Power Efficient Filtering of Data on Air 245--258
R. Hjelsvold Video Information Contents and
Architecture . . . . . . . . . . . . . . 259--272
L. T. Chen and
D. Rotem Optimizing Storage of Objects on Mass
Storage Systems with Robotic Devices . . 273--286
A. Swami and
K. B. Schiefer On the Estimation of Join Result Sizes 287--300
X. Zhao and
R. G. Johnson and
N. J. Martin DBJ --- A Dynamic Balancing Hash Join
Algorithm in Multiprocessor Database
Systems . . . . . . . . . . . . . . . . 301--308
T. Morzy and
M. Matysiak and
S. Salza Tabu Search Optimization of Large Join
Queries . . . . . . . . . . . . . . . . 309--322
C. M. Chen and
N. Roussopoulos The Implementation and Performance
Evaluation of the ADMS Query Optimizer:
Integrating Query Result Caching and
Matching . . . . . . . . . . . . . . . . 323--336
H. J. Steenhagen and
P. M. G. Apers and
H. M. Blanken Optimization of Nested Queries in a
Complex Object Model . . . . . . . . . . 337--350
C. A. Gerlhof and
A. Kemper A Multi-Threaded Architecture for
Prefetching in Object Bases . . . . . . 351--364
E. W. Brown and
J. P. Callan and
W. B. Croft and
J. E. B. Moss Supporting Full-Text Information
Retrieval with a Persistent Object Store 365--378
G. Panagopoulos and
C. Faloutsos Bit-Sliced Signature Files for Very
Large Text Databases on a Parallel
Machine Architecture . . . . . . . . . . 379--392
C. Goble and
P. Crowther Schemas for Telling Stories in Medical
Records . . . . . . . . . . . . . . . . 393--406
F. Andersen and
K. D. Petersen and
J. S. Pettersson Program Verification using HOL-UNITY . . 1--15
K. D. Petersen Graph model of LAMBDA in Higher Order
Logic . . . . . . . . . . . . . . . . . 16--28
C. Zhang and
R. Shaw and
R. Olsson and
K. Levitt Mechanizing a Programming Logic for the
Concurrent Programming Language microSR
in HOL . . . . . . . . . . . . . . . . . 29--42
D. Syme Reasoning with the Formal Definition of
Standard ML in HOL . . . . . . . . . . . 43--58
M. VanInwegen and
E. Gunter HOL-ML . . . . . . . . . . . . . . . . . 59--72
K. Goossens Structure and Behaviour in Hardware
Verification . . . . . . . . . . . . . . 73--86
C. M. Angelo and
L. Claesen and
H. De Man Degrees of Formality in Shallow
Embedding Hardware Description Languages
in HOL . . . . . . . . . . . . . . . . . 87--98
D. Eisenbiegler and
K. Schneider and
R. Kumar A Functional Approach for Formalizing
Regular Hardware Structures . . . . . . 99--112
L. Thery A Proof Development System for HOL . . . 113--126
R. Roxas A HOL Package for Reasoning about
Relations Defined by Mutual Induction 127--139
E. Gunter A Broader Class of Trees for Recursive
Type Definitions for HOL . . . . . . . . 140--153
D. Parnas Some Theorems We Should Prove . . . . . 154--161
J. Rushby and
M. Srivas Using PVS to Prove Some Theorems Of
David Parnas . . . . . . . . . . . . . . 162--173
J. Harrison and
L. Thery Extending the HOL Theorem Prover with a
Computer Algebra System to Reason about
the Reals . . . . . . . . . . . . . . . 174--184
J. Joyce and
C. Seger The HOL-Voss System: Model-Checking
inside a General-Purpose Theorem-Prover 185--198
J. Lu and
S. Chin Linking HOL to a VLSI CAD System . . . . 199--212
K. Schneider and
R. Kumar and
T. Kropf Alternative Proof Procedures for
Finite-State Machines in Higher-Order
Logic . . . . . . . . . . . . . . . . . 213--226
A. McIsaac A Formalization of Abstraction in LAMBDA 227--238
T. Arora and
T. Leung and
K. Levitt and
T. Schubert Report on the UCD Microcoded Viper
Verification Project . . . . . . . . . . 239--252
Z. Zhu and
J. Joyce and
C. Seger Verification of the Tamarack-3
Microprocessor in a Hybrid Verification
Environment . . . . . . . . . . . . . . 253--266
D. A. Fura and
P. J. Windley and
A. K. Somani Abstraction Techniques for Modeling
Real-World Interface Chips . . . . . . . 267--280
S. Tahar and
R. Kumar Implementing a Methodology for Formally
Verifying RISC Processors in HOL . . . . 281--294
S. Agerholm Domain Theory in HOL . . . . . . . . . . 295--309
C.-T. Chou Predicates, Temporal Logic, and
Simulations . . . . . . . . . . . . . . 310--323
W. Prasetya Formalization of Variables Access
Constraints to Support Compositionality
of Liveness Properties . . . . . . . . . 324--337
N. Day and
J. Joyce The Semantics of Statecharts in HOL . . 338--351
M. Nesi Value-Passing CCS in HOL . . . . . . . . 352--365
P. Andrews and
M. Bishop and
S. Issar and
D. Nesmith TPS: An Interactive and Automatic Tool
for Proving Theorems of Type Theory . . 366--371
W. Wong Modelling Bit Vectors in HOL: the word
Library . . . . . . . . . . . . . . . . 372--385
K. Schneider and
R. Kumar and
T. Kropf Eliminating Higher-Order Quantifiers to
Obtain Decision Procedures for Hardware
Verification . . . . . . . . . . . . . . 386--399
M. Aagaard and
M. Leeser and
P. Windley Toward a Super Duper Hardware Tactic . . 400--413
A. Gordon A Mechanisation of Name-Carrying Syntax
up to Alpha-Conversion . . . . . . . . . 414--426
J. Harrison A HOL Decision Procedure for Elementary
Real Algebra . . . . . . . . . . . . . . 427--437
K. Slind AC Unification in HOL90 . . . . . . . . 438--450
S. Brackin and
S.-K. Chin Server-Process Restrictiveness in HOL 451--464
M. J. Morley Safety in Railway Signalling Data: A
Behavioural Analysis . . . . . . . . . . 465--475
W. Prasetya On the Style of Mechanical Proving . . . 476--489
S. Rajan and
J. Joyce and
C. Seger From Abstract Data Types to Shift
Registers: A Case Study in Formal
Specification and Verification at
Differing Levels of Abstraction using
Theorem Proving and Symbolic Simulation 490--501
V. Carreno Verification in Higher Order Logic of
Mutual Exclusion Algorithm . . . . . . . 502--515
S. Kalvala Using Isabelle to Prove Simple Theorems 516--517
Butler W. Lampson Interconnecting Computers: Architecture,
Technology, and Economics . . . . . . . 1
Susan Graham Languages and Interactive Software
Development . . . . . . . . . . . . . . 21
Jan L. A. van de Snepscheut Mechanized Support for Stepwise
Refinement . . . . . . . . . . . . . . . 35
C. A. R. Hoare and
Innes Page Hardware and Software: The Closing Gap 49
Jean E. Vuillemin On Computing Power . . . . . . . . . . . 69
Sally A. Moyer and
Steven A. McKee and
William A. Wulf and
Charles Hitchcock Increasing Memory Bandwidth for Vector
Computations . . . . . . . . . . . . . . 87
Manuel E. Benitez and
Jack W. Davidson The Advantages of Machine-Dependent
Global Optimization . . . . . . . . . . 105
Wolfgang Ambrosch and
M. Anton Ertl and
Felix Beer and
Andreas Krall Dependence-Conscious Global Register
Allocation . . . . . . . . . . . . . . . 129
Diane Corney and
John Gough Type Test Elimination Using Typeflow
Analysis . . . . . . . . . . . . . . . . 137
Stanislaw Chrobot Where Concurrent Processes Originate . . 151
Suresh Jagannathan and
James Philbin High-Level Abstractions for Efficient
Concurrent Systems . . . . . . . . . . . 171
Diomidis Spinellis and
Sophia Drossopoulou and
Susan Eisenbach Language and Architecture Paradigms as
Object Classes: A Unified Approach
Towards Multiparadigm Programming . . . 191--207
Clemens A. Szyperski and
Stephen Omohundro and
Stephan Murer Engineering a Programming Language: The
Type and Class System of Sather . . . . 208
Klaus Didrich and
Andreas Fett and
Carola Gerke and
Wolfgang Grieskamp and
Peter Pepper OPAL: Design and Implementation of an
Algebraic Programming Language . . . . . 228
Alan G. Cohn and
David L. Yoder Architectural Issues in Spreadsheet
Languages . . . . . . . . . . . . . . . 245
Michael Franz Technological Steps toward a Software
Component Industry . . . . . . . . . . . 259
Christian S. Collberg Distributed High-Level Module Binding
for Flexible Encapsulation and Fast
Inter-Modular Optimization . . . . . . . 282
Atanas Radenski Is Oberon as Simple as Possible? A
Smaller Object-Oriented Language Based
on the Concept of Module Type . . . . . 298
David A. Naumann On the Essence of Oberon . . . . . . . . 313
Spiros Lalis and
Beverly A. Sanders Adding Concurrency to the Oberon System 328
D. J. Goodman Personal Communications . . . . . . . . 1
M. Mouly and
M.-B. Pautet The Evolution of GSM . . . . . . . . . . 13
L. F. Merakos and
F. Li Integrating Data Traffic in
Enhanced-TDMA Digital Cellular Systems 21
A. Baiocchi and
F. Delli Priscoli and
F. Grilli and
F. Sestini The Geometric Dynamic Channel Allocation
Strategy for High Traffic FDM/TDMA
Mobile Communications Networks . . . . . 33
H. Hussmann Performance Evaluation of the DECT Radio
Resource Management . . . . . . . . . . 45
R. Padovani The Capacity of CDMA Cellular: Reverse
Link Field Test Results . . . . . . . . 56
Z. Siveski and
Y. Bar-Ness and
D. W. Chen Adaptive Multiuser Detector for
Synchronous Code Division Multiple
Access Applications . . . . . . . . . . 67
R. D. Cideciyan and
E. Eleftheriou Concatenated Coding Scheme for Reliable
Data Transmission in CDMA Cellular
Systems . . . . . . . . . . . . . . . . 76
A. F. Naguib and
A. Paulraj Performance of CDMA Cellular Networks
with Base-Station Antenna Arrays . . . . 87
I. Ghareeb and
A. Yongacoglu Joint Frequency-Phase Modulation over
Rayleigh Fading Channels . . . . . . . . 101
A. Lapidoth Convolutional Codes and Finite
Interleavers for the Block Erasure
Channel . . . . . . . . . . . . . . . . 113
B. Mayr and
H. Weinrichter Fractional-Rate Hybrid PSK-TCM Codes for
the Rayleigh Fading Channel . . . . . . 121
S. Cacopardi and
F. Frescura and
G. Reali Increased Capacity of DS-CDMA Mobile
Systems on Frequency-Selective Slow
Fading Channels . . . . . . . . . . . . 131
S. L. Drakul and
E. Biglieri Design and Performance of an
$8$-Dimensional Modulation Scheme . . . 141
P. R. Patel and
J. M. Holtzman Analysis of Successive Interference
Cancellation in M-ary Orthogonal DS-CDMA
System with Single Path Rayleigh Fading 150
L. Levi and
F. Muratore and
G. Romano Simulation Results for a CDMA
Interference Cancellation Technique in a
Rayleigh Fading Channel . . . . . . . . 162
R. Wichman and
J. Lilleberg and
Y. Neuvo Matched Median Detectors for Synchronous
Direct-Sequence Multiple-Access
Communications . . . . . . . . . . . . . 172
J. Blanz and
A. Klein and
M. Nabhan and
A. Steil Cellular Spectrum Efficiency of a Joint
Detection C/TDMA Mobile Radio System . . 184
T. Suzuki and
T. Mizuno Multiple-Symbol Differential Detection
Scheme for Differential Amplitude
Modulation . . . . . . . . . . . . . . . 196
A. Wautier and
J.-C. Dany and
C. Mourot Phase-Correcting Filter for Sub-optimal
Equalizers . . . . . . . . . . . . . . . 208
A. Valdovinos and
F. J. Casadevall Performance of Adaptive Equalization in
Typical Indoor Environments Including
Non-Linear Power Amplifiers . . . . . . 219
H. Nogami and
G. L. Stuber New Error Probability Upper Bound on
Maximum Likelihood Sequence Estimation
for Intersymbol Interference Channels 230
P. Schramm Bit Error Probability of a
Rapidly-Adapting Rake Receiver as a
Function of Dwell Time . . . . . . . . . 242
E. G. Strom and
S. Parkvall and
B. E. Ottersten Near-Far Resistant Propagation Delay
Estimators for Asynchronous
Direct-Sequence Code Division Multiple
Access Systems . . . . . . . . . . . . . 251
F. R. Gfeller and
P. Bernasconi and
W. Hirt and
C. Elisii and
B. Weiss Dynamic Cell Planning for Wireless
Infrared In-House Data Transmission . . 261
H. Hashemi and
G. Yun and
M. Kavehrad and
F. Behbahani and
P. Galko Frequency Response Measurements of the
Wireless Indoor Channel at Infrared
Optics . . . . . . . . . . . . . . . . . 273
C. R. A. T. Lomba and
R. T. Valadas and
A. M. de Oliveira Duarte Propagation Losses and Impulse Response
of the Indoor Optical Channel: A
Simulation Package . . . . . . . . . . . 285
M. J. McCullagh and
D. R. Wisely and
P. L. Eardley and
P. P. Smyth A 50 Mbit/s Optical Wireless LAN Link
Using Novel Optical and Electronic
Enabling Technologies . . . . . . . . . 298
D. Sorbara and
M. Visintin Performance Comparison of GMSK and $ p i
/ 4 $-DQPSK Modulations in a Mobile
Radio Environment . . . . . . . . . . . 310
D. W. Bennett and
P. B. Kenington and
R. J. Wilkinson The Effect of Modulation on the Power
Rating of Multi-Channel Linear
Amplifiers . . . . . . . . . . . . . . . 322
G. Blanke Simulation of GSM Data Channels in a
Safety Critical Railway Environment . . 334
G. J. M. Janssen and
P. A. Stigter and
R. Prasad A Model for BER Evaluation of Indoor
Frequency Selective Channels Using
Multipath Measurement Results at 2.4,
4.75 and 11.5 GHz . . . . . . . . . . . 344
R. Kattenbach and
H. Fruchting Measuring Bit Errors, Clock Errors and
Their Burst Characteristics in Mobile
Communication Systems . . . . . . . . . 356
S. Ariyavisitakul Performance of Dynamic Feedback Power
Control in a TDMA Radio System . . . . . 365
R. Saunders and
L. Lopes Performance of Cellular Radio Systems
with Power Control in Varying Shadow
Fading Environments . . . . . . . . . . 376
M. Zorzi and
L. B. Milstein Power Control on the Forward Link in
Cellular CDMA . . . . . . . . . . . . . 391
R. De Gaudenzi and
F. Giannetti Performance Analysis of a CDMA-Based
Satellite-Mobile Audio Broadcasting
System . . . . . . . . . . . . . . . . . 400
E. Berruto and
T. Brannlund and
J. Gustafsson and
D. Maiwald and
W. Schott and
P. Whitworth Radio Protocol Architecture of the CODIT
UMTS System . . . . . . . . . . . . . . 417
D. Cygan and
F. David and
H. J. Eul and
J. Hofmann and
N. Metzner and
W. Mohr RACE-II Advanced TDMA Mobile Access
Project --- An Approach for UMTS . . . . 428
L. Vandendorpe Multitone Spread Spectrum Communication
Systems in a Multipath Rician Fading
Channel . . . . . . . . . . . . . . . . 440
M. Zorzi and
R. R. Rao Slotted ALOHA with Capture in a Mobile
Radio Environment . . . . . . . . . . . 452
N. D. Vvedenskaya and
J. C. Arnbak and
B. S. Tsybakov Improved Performance of Mobile Data
Networks Using Stack Algorithms and
Receiver Capture . . . . . . . . . . . . 464
F. Babich Contention Resolution Multiple Access
Techniques for Handling Speech and Data
Traffic on Wireless Networks . . . . . . 476
T. Ketseoglou Certain Generalizations on the Slotted
Collision Channel Without Feedback . . . 488
W. Baumberger and
H. Kaufmann Monolithic Integration of a
Spread-Spectrum Transmitter and Receiver
Front End for Wireless LAN Applications 501
P. Nilsson and
M. Torkelson and
K. Palmkvist and
M. Vesterbacka and
L. Wanhammar A Bit-Serial CMOS Digital IF-Filter for
Mobile Radio Using an On-Chip Clock . . 510
S. D. Lingwood A 65-MHz Digital Chip-Matched-Filter for
DS-Spread Spectrum Applications . . . . 522
H.-D. Lin Area-Efficient Viterbi Decoders for
Complex Rate-$ k / n $ Convolutional and
Trellis Codes . . . . . . . . . . . . . 529
A. J. Viterbi and
A. M. Viterbi and
K. S. Gilhousen and
E. Zehavi Soft Handoff Extends CDMA Cell Coverage
and Increases Reverse Link Capacity . . 541
A. S. Acampora and
M. Naghshineh An Architecture and Methodology for
Mobile-Executed Cell Hand-off in
Wireless ATM Networks . . . . . . . . . 552
Y. Kodratoff Industrial Applications of ML:
Illustrations for the KAML Dilemma and
the CBR Dream . . . . . . . . . . . . . 3
F. Neri and
L. Saitta Knowledge Representation in Machine
Learning . . . . . . . . . . . . . . . . 20
D. W. Aha and
S. Lapointe and
C. X. Ling and
S. Matwin Inverting Implication with Small
Training Sets . . . . . . . . . . . . . 31
Y. Biberman A Context Similarity Measure . . . . . . 49
D. Borrajo and
M. Veloso Incremental Learning of Control
Knowledge for Nonlinear Problem Solving 64
P. Brazdil and
J. Gama and
B. Henery Characterizing the Applicability of
Classification Algorithms Using
Meta-Level Learning . . . . . . . . . . 83
W. Emde Inductive Learning of Characteristic
Concept Descriptions from Small Sets of
Classified Examples . . . . . . . . . . 103
J. Furnkranz FOSSIL: A Robust Relational Learner . . 122
J. Herrmann and
R. Ackermann and
J. Peters and
D. Reipa A Multistrategy Learning System and Its
Integration into an Interactive
Floorplanning Tool . . . . . . . . . . . 138
R. Kohavi Bottom-Up Induction of Oblivious
Read-Once Decision Graphs . . . . . . . 154
I. Kononenko Estimating Attributes: Analysis and
Extensions of RELIEF . . . . . . . . . . 171
G. Le Blanc Generalization and Formalization of an
Algorithm for Detecting Recursive
Relations in Term Sequences . . . . . . 183
D. Malerba and
G. Semeraro and
F. Esposito An Analytic and Empirical Comparison of
Two Methods for Discovering
Probabilistic Causal Relationships . . . 198
S. H. Nienhuys-Cheng and
M. Polman Sample PAC-Learnability in Model
Inference . . . . . . . . . . . . . . . 217
J. J. Oliver and
D. Hand Averaging Over Decision Stumps . . . . . 231
B. Pfahringer Controlling Constructive Induction in
CIPF: An MDL Approach . . . . . . . . . 242
M. Sebag Using Constraints to Building Version
Spaces . . . . . . . . . . . . . . . . . 257
I. Stahl On the Utility of Predicate Invention in
Inductive Logic Programming . . . . . . 272
E. Stroulia and
A. K. Goel Learning Problem-Solving Concepts by
Reflecting on Problem Solving . . . . . 287
P. R. J. van der Laag and
S. H. Nienhuys-Cheng Existence and Nonexistence of Complete
Refinement Operators . . . . . . . . . . 307
D. Wettschereck A Hybrid Nearest-Neighbor and
Nearest-Hyperrectangle Algorithm . . . . 323
P. Berka and
J. Ivanek Automated Knowledge Acquisition for
PROSPECTOR-like Expert Systems . . . . . 339
W. Brockmann On the Role of Machine Learning in
Knowledge-Based Control . . . . . . . . 343
S. Dzeroski and
I. Petrovksi Discovering Dynamics with Genetic
Programming . . . . . . . . . . . . . . 347
T. Elomaa and
E. Ukkonen A Geometric Approach to Feature
Selection . . . . . . . . . . . . . . . 351
C. Ferretti and
G. Mauri Identifying Unrecognizable Regular
Languages by Queries . . . . . . . . . . 355
D. Gunetti and
U. Trinchero Intensional Learning of Logic Programs 359
E. Hirowatari and
S. Arikawa Partially Isomorphic Generalization and
Analogical Reasoning . . . . . . . . . . 363
P. Jappy and
M. C. Daniel-Vatonne and
O. Gascuel and
C. de la Higuera Learning from Recursive, Tree Structured
Examples . . . . . . . . . . . . . . . . 367
A. Ketterlin and
J. J. Korczak Concept Formation in Complex Domains . . 371
J. Kivinen and
H. Mannila and
E. Ukkonen and
J. Vilo An Algorithm for Learning Hierarchical
Classifiers . . . . . . . . . . . . . . 375
M. A. Klopotek Learning Belief Network Structure from
Data Under Causal Insufficiency . . . . 379
U. Knoll and
G. Nakhaeizadeh and
B. Tausend Cost-Sensitive Pruning of Decision Trees 383
C. Lee An Instance-Based Learning Method for
Databases: An Information Theoretic
Approach . . . . . . . . . . . . . . . . 387
W. Z. Liu and
A. P. White and
M. T. Hallissey Early Screening for Gastric Cancer Using
Machine Learning Techniques . . . . . . 391
J. D. Martin DP1: Supervised and Unsupervised
Clustering . . . . . . . . . . . . . . . 395
D. Mladenic and
I. Bratko and
R. J. Paul and
M. Grobelnik Using Machine Learning Techniques to
Interpret Results from Discrete Event
Simulation . . . . . . . . . . . . . . . 399
E. Plaza and
J. L. Arcos Flexible Integration of Multiple
Learning Methods into a Problem Solving
Architecture . . . . . . . . . . . . . . 403
J. Sarbo and
J. Farkas Concept Sublattices . . . . . . . . . . 407
B. Schulmeister and
F. Wysotzki The Piecewise Linear Classifier DIPOL92 411
A. Shinohara Complexity of Computing Generalized
VC-Dimensions . . . . . . . . . . . . . 415
E. Sommer Learning Relations Without Closing the
World . . . . . . . . . . . . . . . . . 419
I. Stahl Properties of Inductive Logic
Programming in Function-Free Horn Logic 423
B. Tausend Representing Biases for Inductive Logic
Programming . . . . . . . . . . . . . . 427
B. Tausend Biases and Their Effects in Inductive
Logic Programming . . . . . . . . . . . 431
C. Vrain and
L. Martin Inductive Learning of Normal Clauses . . 435
J. A. Goguen and
R. Diaconescu Towards an algebraic semantics for the
object paradigm . . . . . . . . . . . . 1--29
J.-P. Jouannaud Rewriting techniques for software
engineering . . . . . . . . . . . . . . 30--52
A. Poigne Identity and existence, and types in
algebra --- A survey of sorts . . . . . 53--78
E. G. Wagner Overloading and inheritance . . . . . . 79--97
M. Bettaz and
G. Reggio A SMoLCS based kit for defining
high-level algebraic Petri nets . . . . 98--112
M. Cerioli and
G. Reggio Institutions for very abstract
specifications . . . . . . . . . . . . . 113--127
C. Choppy About the ``correctness'' and
``adequacy'' of PLUSS specifications . . 128--143
S. Clerici and
R. Jimenez and
F. Orejas Semantic constructions in the
specification language Glider . . . . . 144--157
S. Conrad On certification of specifications for
TROLL light objects . . . . . . . . . . 158--172
G. Denker and
M. Gogolla Translating TROLL light concepts to
MAUDE . . . . . . . . . . . . . . . . . 173--187
H. Ehrig and
J. Padberg and
L. Ribeiro Algebraic high level nets: Petri nets
revisited . . . . . . . . . . . . . . . 188--206
M. Grosse-Rhode and
U. Wolter $2$-categorical specification of partial
algebras . . . . . . . . . . . . . . . . 207--219
R. Hennicker and
F. Nickl A behavioural algebraic framework for
modular system design with reuse . . . . 220--234
C. Hermida On fibred adjunctions and completeness
for fibred categories . . . . . . . . . 235--251
J. Levy and
J. Agusti Implementing inequality and
nondeterministic specifications with
bi-rewriting systems . . . . . . . . . . 252--267
J. Liu A semantic basis of logic-independent
transformation . . . . . . . . . . . . . 268--279
P. D. Mosses Unified algebras and abstract syntax . . 280--294
F. Parisi Presicce and
A. Pierantonio Structured inheritance for algebraic
class specifications . . . . . . . . . . 295--309
C. Rieckhoff Towards a theory for the animation of
algebraic specification . . . . . . . . 310--320
P.-Y. Schobbens Second-order proof systems for algebraic
specification languages . . . . . . . . 321--336
A. Sernadas and
J. F. Costa and
C. Sernadas An institution of object behaviour . . . 337--350
Peter Orbaek OASIS: An Optimizing Action-Based
Compiler Generator . . . . . . . . . . . 1
Hermano Moura and
David A. Watt Action Transformations in the ACTRESS
Compiler Generator . . . . . . . . . . . 16
Gorel Hedin An Overview of Door Attribute Grammars 31
Gilles Roussel and
Didier Parigot and
Martin Jourdan Coupling Evaluators for Attribute
Coupled Grammars . . . . . . . . . . . . 52
Michael Hanus Towards the Global Optimization of
Functional Logic Programs . . . . . . . 68
Lal George and
Florent Guillame and
John H. Reppy A Portable and Optimizing Back End for
the SML/NJ Compiler . . . . . . . . . . 83
Guido Hogen and
Rita Loogen Efficient Organization of Control
Structures in Distributed
Implementations . . . . . . . . . . . . 98
Yosi Ben-Asher and
Gudula Runger and
Reinhard Wilhelm and
Assaf Schuster Implementing 2DT on a Multiprocessor . . 113
Andreas Fauth and
Gunter Hommel and
Carsten Muller and
Alois Knoll Global Code Selection for Directed
Acyclic Graphs . . . . . . . . . . . . . 128
Adrian Slowik and
Georg Piepenbrock and
Peter Pfahler Compiling Nested Loops for Limited
Connectivity VLIWs . . . . . . . . . . . 143
M. Anton Ertl and
Andreas Krall Delayed Exceptions --- Speculative
Execution of Trapping Instructions . . . 158
Gerda Janssens and
Wim Simoens On the Implementation of Abstract
Interpretation Systems for (Constraint)
Logic Programs . . . . . . . . . . . . . 172
Thomas Cheatham and
Haiming Gao and
Dan Stefanescu A Suite of Analysis Tools Based on a
General Purpose Abstract Interpreter . . 188
James S. Uhl and
R. Nigel Horspool Flow Grammars --- A Flow Analysis
Methodology . . . . . . . . . . . . . . 203
Ralf Lammel and
Gunter Riedewald Provable Correctness of Prototype
Interpreters in LDL . . . . . . . . . . 218
Arnd Poetzsch-Heffter Developing Efficient Interpreters Based
on Formal Language Specifications . . . 233
Johan Ringstrom and
Peter Fritzson and
Mikael Pettersson Generating an Efficient Compiler for a
Data Parallel Language from a
Denotational Specification . . . . . . . 248
Terence J. Parr and
Russel W. Quong Adding Semantic and Syntactic Predicates
to LL(k): pred-LL(k) . . . . . . . . . . 263
Martin Alt and
Uwe Abmann and
Hans van Someren Cosy Compiler Phase Embedding with the
CoSy Compiler Model . . . . . . . . . . 278
Martin Franzle and
Markus Muller-Olm Towards Provably Correct Code Generation
for a Hard Real-Time Programming
Language . . . . . . . . . . . . . . . . 294
Justiani and
Laurie J. Hendren Supporting Array Dependence Testing for
an Optimizing/Parallelizing C Compiler 309--323
Siegfried Benkner and
Peter Brezany and
Hans Zima Processing Array Statements and
Procedure Interfaces in the PREPARE High
Performance Fortran Compiler . . . . . . 324--338
Patricia Pineo and
Mary Lou Soffa A Practical Approach to the Symbolic
Debugging of Parallelized Code . . . . . 339
Evelyn Duesterwald and
Rajiv Gupta and
Mary Lou Soffa Reducing the Cost of Data-Flow Analysis
by Congruence Partitioning . . . . . . . 357
David Binkley Interprocedural Constant Propagation
Using Dependence Graphs and a Data-Flow
Model . . . . . . . . . . . . . . . . . 374
Thomas Reps Solving Demand Versions of
Interprocedural Analysis Problems . . . 389
Abraham Mendlson and
Ruth Shtokhamer and
Shlomit S. Pinter Compile Time Instruction Cache
Optimisations . . . . . . . . . . . . . 404
Uma Mahadevan and
Sridhar Ramakrishnan Instruction Scheduling Over Regions: A
Framework for Scheduling Across Basic
Blocks . . . . . . . . . . . . . . . . . 419
Jan Hoogerbrugge and
Henk Corporaal Transport-Triggering vs.
Operation-Triggering . . . . . . . . . . 435
H. Comon and
R. Treinen Ordering Constraints on Trees . . . . . 1
J. Engelfriet Graph Grammars and Tree Transducers . . 15
F. Alessi Type Preorders . . . . . . . . . . . . . 37
P. Bruscoli and
F. Levi and
G. Levi and
M. C. Meo Compilative Constructive Negation in
Constraint Logic Programs . . . . . . . 52
A. Cournier and
M. Habib A New Linear Algorithm for Modular
Decomposition . . . . . . . . . . . . . 68
P. de Groote A CPS-Translation of the
lambda-mu-Calculus . . . . . . . . . . . 85
F. Drewes A Lower Bound on the Growth of Functions
Computed by Tree Transductions . . . . . 100
J. Esparza On the Decidability of Model Checking
for Several mu-Calculi and Petri Nets 115
R. Giancarlo and
F. Mignosi Generalizations of the Periodicity
Theorem of Fine and Wilf . . . . . . . . 130
R. Heckmann Probabilistic Domains . . . . . . . . . 142
D. Hofbauer and
M. Huber and
G. Kucherov Some Results on Top-Context-Free Tree
Languages . . . . . . . . . . . . . . . 157
Z. Khasidashvili On Higher Order Recursive Program
Schemes . . . . . . . . . . . . . . . . 172
N. Klarlund and
M. I. Schwartzbach Graphs and Decidable Transductions Based
on Edge Constraints . . . . . . . . . . 187
D. Kuske Nondeterministic Automata with
Concurrency Relations and Domains . . . 202
D. Merlini and
R. Sprugnoli and
M. C. Verri Algebraic and Combinatorial Properties
of Simple, Coloured Walks . . . . . . . 218
Y. Metivier and
N. Saheb Probabilistic Analysis of an Election
Algorithm in a Tree . . . . . . . . . . 234
T. Noll On the First-Order Equivalence of
Call-by-Name and Call-by-Value . . . . . 246
E. Ohlebush On the Modularity of Confluence of
Constructor-Sharing Term Rewriting
Systems . . . . . . . . . . . . . . . . 261
J. Palsberg Global Program Analysis in Constraint
Form . . . . . . . . . . . . . . . . . . 276
D. Peled On Projective and Separable Properties 291
O. Rambow and
G. Satta A Rank Hierarchy for Deterministic
Tree-Walking Transducers . . . . . . . . 308
B. Ratoandromanana and
D. Robilliard Superposition in Picture Languages . . . 322
M. H. Sorensen A Grammar-Based Data-Flow Analysis to
Stop Deforestation . . . . . . . . . . . 335
M. Abadi and
L. Cardelli A theory of primitive objects:
second-order systems . . . . . . . . . . 1
R. Milner Pi-nets: a graphical form of pi-calculus 26
T. Amtoft Local type reconstruction by means of
symbolic fixed point iteration . . . . . 43
H. R. Andersen and
M. Mendler An asynchronous process algebra with
multiple clocks . . . . . . . . . . . . 58
J. H. Andrews Foundational issues in implementing
constraint logic programming systems . . 74
B. Berthomieu and
T. Le Sergent Programming with behaviors in an ML
framework: the syntax and semantics of
LCS . . . . . . . . . . . . . . . . . . 89
M. Bidoit and
R. Hennicker and
M. Wirsing Characterizing behavioural semantics and
abstractor semantics . . . . . . . . . . 105
L. Boerio Extending pruning techniques to
polymorphic second order lambda-calculus 120
C. Bohm and
A. Piperno and
S. Guerrini lambda-definition of function(al)s by
normal forms . . . . . . . . . . . . . . 135
K.-H. Buth Simulation of SOS definitions with term
rewriting systems . . . . . . . . . . . 150
S. Cicerone and
F. Parisi Presicce Strategies in modular system design by
interface rewriting . . . . . . . . . . 165
M.-M. Corsini and
A. Rauzy Symbolic model checking and constraint
logic programming: a cross-fertilization 180
A. Di Pierro and
C. Palamidessi A logical denotational semantics for
constraint logic programming . . . . . . 195
P. Fradet Compilation of head and strong reduction 211
R. Giegerich and
S. Kurtz Suffix trees in the functional
programming paradigm . . . . . . . . . . 225
C. Hall and
K. Hammond and
S. Peyton Jones and
P. Wadler Type classes in Haskell . . . . . . . . 241
C. Hankin and
D. Le Metayer Lazy type inference for the strictness
analysis of lists . . . . . . . . . . . 257
M. Hanus Lazy unification with simplification . . 272
F. Henglein and
C. Mossin Polymorphic binding-time analysis . . . 287
C. B. Jay and
J. R. B. Cockett Shapely types and shape polymorphism . . 302
J. Jeuring and
D. Swierstra Bottom-up grammar analysis: a functional
formulation . . . . . . . . . . . . . . 317
S. Kahrs First-class polymorphism for ML . . . . 333
A. Kennedy Dimension types . . . . . . . . . . . . 348
A. King A synergistic analysis for sharing and
groundness which traces linearity . . . 363
B. Z. Li A pi-calculus specification of Prolog 379
W. Li A logical framework for evolution of
specifications . . . . . . . . . . . . . 394
D. B. MacQueen and
M. Tofte A semantics for higher-order functors 409
L. Moreau The PCKS-machine: an abstract machine
for sound evaluation of parallel
functional programs with first-class
continuations . . . . . . . . . . . . . 424
A. Muck and
T. Streicher and
H. C. R. Lock A tiny constraint functional logic
language and its continuation semantics 439
P. W. O'Hearn and
J. G. Riecke Fully abstract translations and
parametric polymorphism . . . . . . . . 454
K. V. S. Prasad Broadcasting with priority . . . . . . . 469
M. H. Sorensen and
R. Gluck and
N. D. Jones Towards unifying partial evaluation,
deforestation, supercompilation, and GPC 485
D. Walker Algebraic proofs of properties of
objects . . . . . . . . . . . . . . . . 501
Samson Abramsky and
Pasquale Malacaria and
Radha Jagadeesan Full Abstraction for PCF . . . . . . . . 1
Mariangiola Dezani-Ciancaglini and
Ugo de'Liguoro and
Adolfo Piperno Fully Abstract Semantics for Concurrent
lambda-calculus . . . . . . . . . . . . 16
Douglas J. Howe and
Scott D. Stoller An Operational Approach to Combining
Classical Set Theory and Functional
Programming Languages . . . . . . . . . 36
Mark P. Jones ML Typing, Explicit Polymorphism and
Qualified Types . . . . . . . . . . . . 56
Jon G. Riecke and
Ramesh Subrahmanyam Extensions to Type Systems Can Preserve
Operational Equivalences . . . . . . . . 76
Paris C. Kanellakis and
Dina Q. Goldin Constraint Programming and Database
Query Languages . . . . . . . . . . . . 96
Alain Hui Bon Hoa Intuitionistic Resolution for a Logic
Programming Language with Scoping
Constructs . . . . . . . . . . . . . . . 121
Yves Bertot and
Gilles Kahn and
Laurent Thery Proof by Pointing . . . . . . . . . . . 141
Henri Korver and
Jan Springintveld A Computer-Checked Verification of
Milner's Scheduler . . . . . . . . . . . 161
Masahiko Sato A Purely Functional Language with
Encapsulated Assignment . . . . . . . . 179
M. R. K. Krishna Rao Simple Termination of Hierarchical
Combinations of Term Rewriting Systems 203
Mei Tang Yan and
Pierre Jouvelot Separate Abstract Interpretation for
Control-Flow Analysis . . . . . . . . . 224
Robert Cartwright and
Matthias Felleisen Extensible Denotational Language
Specifications . . . . . . . . . . . . . 244
Hideki Tsuiki A Normalizing Calculus with Overloading
and Subtyping . . . . . . . . . . . . . 273
Martin Abadi and
Luca Cardelli A Theory of Primitive Objects ---
Untyped and First-Order Systems . . . . 296
Didier Remy Programming Objects with ML-ART, an
Extension to ML with Abstract and Record 321
Chen Kung and
Martin Odersky A Type System for a Lambda Calculus with
Assignments . . . . . . . . . . . . . . 347
Akinori Yonezawa Theory and Practice of Concurrent
Object-Oriented Computing . . . . . . . 365
Andrea Asperti and
Cosimo Laneve The Family Relation in Interaction
Systems . . . . . . . . . . . . . . . . 366
Ursula Goltz and
Roberto Gorrieri and
Arend Rensink On Syntactic and Semantic Action
Refinement . . . . . . . . . . . . . . . 385
Davide Sangiorgi Locality and True-concurrency in Calculi
for Mobile Processes . . . . . . . . . . 405
D. J. B. Bosscher Term Rewriting Properties of SOS
Axiomatisations . . . . . . . . . . . . 425
Willem Jan Fokkink The Tyft/Tyxt Format Reduces to Tree
Rules . . . . . . . . . . . . . . . . . 440
Hans Huttel Undecidable Equivalences for Basic
Parallel Processes . . . . . . . . . . . 454
Masako Takahashi and
Y. Akama and
S. Hirokawa Normal Proofs and their Grammar . . . . 465
Franco Barbanera and
Stefano Berardi A Symmetric Lambda Calculus for
``Classical'' Program Extraction . . . . 495
Niels Jakob Rehof and
Morten Heine Sorensen The $ \lambda_\Delta $-Calculus . . . . 516
Zena Ariola and
Richard Kennaway and
Jan Willem Klop and
Ronan Sleep and
Fer-Jan de Vries Syntactic Definitions of Undefined: On
Defining the Undefined . . . . . . . . . 543
Philippa Gardner Discovering Needed Reductions Using Type
Theory . . . . . . . . . . . . . . . . . 555
Moshe Y. Vardi Nontraditional Applications of Automata
Theory . . . . . . . . . . . . . . . . . 575
Kim Ritter Wagner Abstract Pre-Orders . . . . . . . . . . 598
Amitavo Islam and
Wesley Phoa Categorical Models of Relational
Databases I: Fibrational Formulation,
Schema Integration . . . . . . . . . . . 618
Max I. Kanovich Petri Nets, Horn Programs, Linear Logic,
and Vector Games . . . . . . . . . . . . 642
Tatsurou Sekiguchi and
Akinori Yonezawa A Complete Type Inference System for
Subtyped Recursive Types . . . . . . . . 667
Flemming M. Damm Subtyping with Union Types, Intersection
Types and Recursive Types . . . . . . . 687
Ferruccio Damiani and
Paola Giannini A Decidable Intersection Type System
based on Relevance . . . . . . . . . . . 707
Zohar Manna and
Amir Pnueli Temporal Verification Diagrams . . . . . 726
Dominique Bolignano and
Mourad Debabi A Semantic Theory for Concurrent ML . . 766
Kohei Honda and
Nobuko Yoshida Replication in Concurrent Combinators 786
Adriano Peron and
Andrea Maggiolo-Schettini Transitions as Interrupts: A New
Semantics for Timed Statecharts . . . . 806
Marcello M. Bonsangue and
Joost N. Kok Relating Multifunctions and Predicate
Transformers through Closure Operators 822
K. Fisher and
J. C. Mitchell Notes on Typed Object-Oriented
Programming . . . . . . . . . . . . . . 844--885
Albert R. Meyer Observing Truly Concurrent Processes . . 886
P. Wegner Models and Paradigms of Interaction . . 1
R. J. Fowler Architectural Convergence and the
Granularity of Objects in Distributed
Systems . . . . . . . . . . . . . . . . 33
E. Jul Separation of Distribution and Objects 47
C. Zeidler and
B. Fank Integrating Structural and Operational
Programming to Manage Distributed
Systems . . . . . . . . . . . . . . . . 55
M. Bourgois and
J.-M. Andreoli and
R. Pareschi Concurrency and Communication: Choices
in Implementing the Coordination
Language LO . . . . . . . . . . . . . . 73
M. Tokoro and
K. Takashio Toward Languages and Formal Systems for
Distributed Computing . . . . . . . . . 93
J. M. Wing Decomposing and Recomposing
Transactional Concepts . . . . . . . . . 111
A. Rakotonirainy DPL to Express a Concurrency Control
Using Transaction and Object Semantics 122
S. Bijnens and
W. Joosen and
P. Verbaeten A Reflective Invocation Scheme to
Realise Advanced Object Management . . . 139
M. Aksit and
K. Wakita and
J. Bosch and
L. Bergmans Abstracting Object Interactions Using
Composition Filters . . . . . . . . . . 152
S. Brandt and
O. L. Madsen Object-Oriented Distributed Programming
in BETA . . . . . . . . . . . . . . . . 185
S. Maffeis A Flexible System Design to Support
Object-Groups and Object-Oriented
Distributed Programming . . . . . . . . 213
B. Garbinato and
R. Guerraoui and
K. R. Mazouni Distributed Programming in GARF . . . . 225
M. Fazzolare and
B. G. Humm and
R. D. Ranson Object-Oriented Extendibility in
Hermes/ST, a Transactional Distributed
Programming Environment . . . . . . . . 240
Susumu Hayashi and
Yukihide Takayama Lifschitz' Logic of Calculable Numbers
and Optimizations in Program Extraction 1
Masami Hagiya and
Yozo Toda On Implicit Arguments . . . . . . . . . 10
Mariko Yasugi and
Susumu Hayashi A Functional System with Transfinitely
Defined Types . . . . . . . . . . . . . 31
Hiroshi Nakano The Non-deterministic Catch and Throw
Mechanism and Its Subject Reduction
Property . . . . . . . . . . . . . . . . 61
Masahiko Sato and
Yukiyoshi Kameyama Conservativeness of Lambda over
lambdasigma-Calculus . . . . . . . . . . 73
Shin-ya Nishizaki ML with First-Class Environments and its
Type Inference Algorithm . . . . . . . . 95
Masako Takahashi A Simple Proof of the Genericity Lemma 117
Richard W. Weyhrauch and
Carolyn Talcott The Logic of FOL Systems: Formulated in
Set Theory . . . . . . . . . . . . . . . 119
Ryu Hasegawa Well-Ordering of Algebras and Kruskal's
Theorem . . . . . . . . . . . . . . . . 133
Shigeru Igarashi and
Tetsuya Mizutani and
Takashi Tsuji and
Chiharu Hosono On Locomorphism in Analytical
Equivalence Theory . . . . . . . . . . . 173
Kohji Tomita and
Takashi Tsuji and
Shigeru Igarashi Analysis of a Software/Hardware System
by Tense Arithmetic . . . . . . . . . . 188
Neil D. Jones The Essence of Program Transformation by
Partial Evaluation and Driving . . . . . 206
Ian A. Mason and
Carolyn Talcott Program Transformation via Contextual
Assertions . . . . . . . . . . . . . . . 225
Kojiro Kobayashi On Coding Theorems with Modified Length
Functions . . . . . . . . . . . . . . . 255
Takumi Kasai and
Shusaku Sawato and
Shigeki Iwata Thirty four Comparisons are Required to
Sort 13 Items . . . . . . . . . . . . . 260
I. F. Blake and
S. Gao and
R. Lambert Constructive problems for irreducible
polynomials over finite fields . . . . . 1--23
D. Polemi and
T. Sakkalis Singular algebraic curves over finite
fields . . . . . . . . . . . . . . . . . 24--37
C. J. Zarowski A divisionless form of the Schur
Berlekamp--Massey algorithm . . . . . . 38--44
M. Sablatash Error-control coding, modulation and
equalization for all-digital advanced
television: state of the art and future
possibilities . . . . . . . . . . . . . 45--66
G. Drolet A finite field arithmetic unit VLSI chip 67--77
F. Hendessi and
M. R. Aref A successful attack against the DES . . 78--90
S. Lin and
S. Rajpal and
D. J. Rhee Low-complexity and high-performance
multilevel coded modulation for the AWGN
and Rayleigh fading channels . . . . . . 91--108
V. S. Lin and
G. J. Pottie Channel coding for a frequency-hopped
wireless transceiver . . . . . . . . . . 109--124
D. Boudreau A unified view of noncoherent detection
and differential detection of phase
modulated signals . . . . . . . . . . . 125--135
M. Fattouche and
H. Zaghloul Error reduction of coded DPSK over a
fading channel . . . . . . . . . . . . . 136--152
G. Ferland and
J.-Y. Chouinard Performance of BCH codes with DES
encryption in a digital mobile channel 153--172
A. Wautier and
J.-C. Dany and
C. Mourot Reduced-complexity channels estimation
and equalization for TDMA mobile radio
systems . . . . . . . . . . . . . . . . 173--190
C. Trabelsi and
A. Yongacoglu Probability of packet success for
asynchronous DS/CDMA with block and
convolutional codes . . . . . . . . . . 191--202
I. Markman and
J. B. Anderson Sequential decoding on intersymbol
interference channels under the
Pe-criterion . . . . . . . . . . . . . . 203--222
J. Lodge and
R. Young and
P. Guinand Separable concatenated codes with
iterative map filtering . . . . . . . . 223--240
S. Roy and
P. Fortier Adapting the strongly-connected trellis
concept for use with trellis-coded
modulation . . . . . . . . . . . . . . . 241--252
F. Chan and
D. Haccoun Variable-rate punctured trellis-coded
modulation and applications . . . . . . 253--269
V. Sorokine and
F. R. Kschischang and
V. Durand Trellis-based decoding of binary linear
block codes . . . . . . . . . . . . . . 270--286
T. Le-Ngoc and
M. Jia and
A. Benyamin-Seeyar Permutation decoding using primitive
elements as multipliers . . . . . . . . 287--295
F. Ghazi-Moghaddam and
I. Lambadaris and
J. F. Hayes Overflow constraint in hybrid nodes with
movable boundary scheme . . . . . . . . 296--309
M. Zeytinoglu and
Y. C. Hsu Statistical analysis of wavelet
transform coded multi-channel signals
for transmission over ATM packet
networks . . . . . . . . . . . . . . . . 310--324
F. Kamoun and
M. M. Ali Statistical analysis of the traffic
generated by the superposition of $N$
independent interrupted Poisson
processes . . . . . . . . . . . . . . . 325--342
J. A. F. Ross and
D. P. Taylor Throughput increase of ALOHA-based
systems with multiuser sequence
detection . . . . . . . . . . . . . . . 343--358
X. Huang and
H. Leung Auto-regressive transfer function
identification using chaos . . . . . . . 359--367
R. J. Inkol and
R. H. Saper A new algorithm for signal
classification using phase information 368--384
A. K. Khandani and
P. Kabal and
E. Dubois Efficient algorithms for fixed-rate
entropy-coded vector quantization . . . 385--394
K. S. Trivedi and
B. R. Haverkort and
A. Rindos and
V. Mainkar Techniques and Tools for Reliability and
Performance Evaluation: Problems and
Perspectives . . . . . . . . . . . . . . 1--24
D. A. Reed Experimental Analysis of Parallel
Systems: Techniques and Open Problems 25--51
A. Carmona and
L. Domingo and
R. Macau and
R. Puigjaner Performance Experiences of the Barcelona
Olympic Games Computer System . . . . . 52--75
T. Bemmerl and
B. Ries Performance Tools on Intel Scalable High
Performance Computing Systems . . . . . 76--88
L. J. N. Franken and
R. H. Pijpers and
B. R. M. Haverkort Modelling Aspects of Model-Based Dynamic
QoS Management by the Performability
Manager . . . . . . . . . . . . . . . . 89--110
J. Braband Waiting Time Distributions for Processor
Sharing Queues with State-Dependent
Arrival and Service Rates . . . . . . . 111--122
H. Jonkers Queueing Models of Parallel
Applications: The Glamis Methodology . . 123--138
A. D. Malony and
V. Mertsiotakis and
A. Quick Automatic Scalability Analysis of
Parallel Programs Based on Modelling
Techniques . . . . . . . . . . . . . . . 139--158
M. Ajmone Marsan and
R. Lo Cigno and
M. Munafo and
A. Tonietti Simulation of ATM Computer Networks with
CLASS . . . . . . . . . . . . . . . . . 159--179
V. Gupta and
E. Schenfeld NetSim --- A Tool for Modeling the
Performance of Circuit Switched
Multicomputer Networks . . . . . . . . . 180--192
J. Garcia-Haro and
R. Marin-Sillue and
J. L. Melus-Moreno ATMSWSIM: An Efficient, Portable and
Expandable ATM SWitch SIMulator Tool . . 193--212
M. J. Serrano and
W. Yamamoto and
R. C. Wood and
M. Nemirovsky A Model for Performance Estimation in a
Multistreamed Superscalar Processor . . 213--230
A. Ferscha and
G. Chiola Accelerating the Evaluation of Parallel
Program Performance Models Using
Distributed Simulation . . . . . . . . . 231--252
T. D. Wagner and
B. M. Carlson An Algorithm for Off-Line Detection of
Phases in Execution Profiles . . . . . . 253--265
S. Caselli and
G. Conte and
F. Bonardi and
M. Fontanesi Experiences on SIMD Massively Parallel
GSPN Analysis . . . . . . . . . . . . . 266--283
H. Wabnig and
G. Haring PAPS --- The Parallel Program
Performance Prediction Toolset . . . . . 284--304
N. J. Gunther qcomp: A Tool for Assessing Online
Transaction Processing Scalability . . . 305--320
F. Bause and
P. Kemper QPN-Tool for Qualitative and
Quantitative Analysis of Queueing Petri
Nets . . . . . . . . . . . . . . . . . . 321--334
S. Donatelli and
G. Franceschinis and
N. Mazzocca and
S. Russo Software Architecture of the EPOCA
Integrated Environment . . . . . . . . . 335--352
S. Gilmore and
J. Hillston The PEPA Workbench: A Tool to Support a
Process Algebra-Based Approach to
Performance Modelling . . . . . . . . . 353--368
K. Grimsrud and
J. Archibald and
R. Frost and
B. Nelson On the Accuracy of Memory Reference
Models . . . . . . . . . . . . . . . . . 369--388
T. Fahringer Automatically Estimating Network
Contention of Parallel Programs . . . . 389--405
C. Tron and
B. Plateau Modelling of Communication Contention in
Multiprocessors . . . . . . . . . . . . 406--424
W. M. P. Van der Aalst Using Interval Timed Coloured Petri Nets
to Calculate Performance Bounds . . . . 425--444
A. P. Merlo and
P. H. Worley Analyzing PICL Trace Data with MEDEA . . 445--463
G. C. Fox and
K. Mills Information Processing and Opportunities
for HPCN Use in Industry . . . . . . . . 1
D. O. Williams Information Superhighways --- Does
Europe Need Them, Can Europe Build Them? 15
M. Hillmann and
J. Weiher Simulation of Metal Forming Processes
with Respect to MPP-Systems . . . . . . 21
R. Herken High Image Quality Rendering on Scalable
Parallel Systems . . . . . . . . . . . . 31
S. H. Duncan and
P. L. Gordon and
E. J. Zaluska and
S. I. Edwards Parallel Processing in High Integrity
Aircraft Engine Control . . . . . . . . 32
G. D. Garcia and
F. Suarez and
M. Garcia and
E. Lasso and
R. Guzman and
T. Carden and
D. Watson and
C. McGregor and
F. Obeso and
M. Tarrio An Embedded Solution Using
High-Performance Computing for Cost
Effective On-Line Real-Time Monitoring
of Industrial Processes . . . . . . . . 40
A. Colbrook and
M. Lemke and
H. Mierendorff and
K. Stuben and
C.-A. Thole and
O. Thomas EUROPORT --- Esprit European Porting
Projects . . . . . . . . . . . . . . . . 46
G. Lonsdale and
J. Clinckemaillie and
S. Vlachoutsis and
J. Dubois Communication Requirements in Parallel
Crashworthiness Simulation . . . . . . . 55
I. Boston and
M. Surridge and
C. Upstill PAFEC-FE --- A Commercial Parallel
Finite Element Package . . . . . . . . . 62
M. Bennani and
T. Braconnier and
J. C. Dunyach Solving Large-Scale Nonnormal
Eigenproblems in the Aeronautical
Industry Using Parallel BLAS . . . . . . 72
M. Krafczyk and
E. Rank Supercomputing on a Workstation Cluster:
A Parallelized Lattice-Gas Solver for
Transient Navier--Stokes-Flow . . . . . 78
L. Grandinetti and
F. Guerriero and
R. Musmanno Parallel Techniques for Large-Scale
Nonlinear Network Optimization . . . . . 84
A. Watermann and
J. Altes Experiences Concerning the
Parallelization of the Finite Element
Code SMART . . . . . . . . . . . . . . . 92
W. Daehn Electrosmog and Electromagnetic CAD . . 94
W. Klix and
R. Dittmann and
R. Stenzel Three-Dimensional Simulation of
Semiconductor Devices . . . . . . . . . 99
P. A. Krauss A Distributed Automatic Test Pattern
Generation System . . . . . . . . . . . 105
P. Luksch Distributed Logic Simulation --- A Test
Environment for the Evaluation of
Different Approaches . . . . . . . . . . 111
A. Hunger and
F. Muller Modelling Hierarchy as Guideline for
Parallel Simulation . . . . . . . . . . 117
H. Daniels and
A. Peters and
O. Bergen and
C. Forkel Large Implicit Finite Element
Simulations of Time-Dependent
Incompressible Flows on Scalable
Parallel Systems . . . . . . . . . . . . 119
D. Thevenin and
F. Behrendt and
U. Maas and
J. Warnatz Parallel Simulation of Reacting Flows
Using Detailed Chemistry . . . . . . . . 125
S. Haberhauer Unstructured Computational Fluid
Dynamics on Massively-Parallel
SIMD-Systems . . . . . . . . . . . . . . 131
C. de Nicola and
G. De Pietro and
M. Giuliani An Advanced Parallel Multiblock Code for
the Solution of $2$D Flow-Fields . . . . 139
C. W. Oosterlee and
H. Ritzdorf and
A. Schuller and
B. Steckel Parallel Multigrid Results for Euler
Equations and Grid Partitioning into a
Large Number of Blocks . . . . . . . . . 145
L. Giraud and
G. M. Manzini Parallel Distributed Implementations of
$2$D Explicit Euler Solvers . . . . . . 151
E. Issman and
G. Degrez and
J. de Keyser A Parallel Multiblock
Euler/Navier--Stokes Solver on a Cluster
of Workstations Using PVM . . . . . . . 157--162
G. van Beek and
J. P. Geschiere and
A. R. Sukul Parallelization of a $3$D Multi-Block
Navier--Stokes Flow Solver on a
Distributed Memory MIMD Machine . . . . 163
I. d'Ast Porting of a Three-Dimensional
Navier--Stokes Solver to a Range of
Parallel Computers and a Network of
Workstations . . . . . . . . . . . . . . 171
K. Boryczko and
M. Bubak and
J. Kitowski and
J. Moscinski and
R. Slota Lattice Gas Automata and Molecular
Dynamics on a Network of Computers . . . 177
S. Dietrich and
I. Boyd Parallel Scalar Optimized Direct
Simulation Monte Carlo Method for
Rarefied Flows on the SP-1 . . . . . . . 181
J. M. Andre and
B. Champagne and
J. Delhalle and
J. G. Fripiat and
D. H. Mosley Modern Quantum Mechanical Techniques and
Computations on the Electronic Structure
of Polymers . . . . . . . . . . . . . . 183
R. Bywater and
W. Joosen and
S. Bijnens and
P. Verbaeten and
T. Larsen and
J. Perram Object-Oriented Simulation Software for
Drug Design . . . . . . . . . . . . . . 189
O. Trelles-Salazar and
E. L. Zapata and
J.- M. Carazo Mapping Strategies of Sequential
Sequence Comparison Algorithms on
LAN-Based Message Passing Architectures 197
H. Lischka and
H. Dachsel and
R. Shepard and
R. J. Harrison Parallel Computing in Quantum Chemistry
--- Message Passing and Beyond for a
General Ab Initio Program System . . . . 203
P. Bleckmann and
F. H. Walter Solving Dynamic and Quantum Chemical
Problems with the Help of Concurrent
Processors . . . . . . . . . . . . . . . 210
G. H. F. Diercksen Intelligent Software: The OpenMol
Program . . . . . . . . . . . . . . . . 219
E. O'Toole and
M. Surridge and
C. Upstill Parallel Molecular Dynamics Simulation
of Commercial Surfactants . . . . . . . 223
J. Schulte and
G. Seifert Computer Simulations of Molecular
Collision Processes . . . . . . . . . . 226
H. Braun and
M. Assfalg and
K. Weymann and
T. Harvey Parallel Processing for Generating Large
Molecular Databases . . . . . . . . . . 232
D. A. Clark and
Ch. Rawlings and
J. Shirazi Applications of Parallel Constraint
Logic Programming to Molecular Biology
and Genetics . . . . . . . . . . . . . . 236
U. Tangen and
H. Weberpals Simulating Biological Evolution on a
Parallel Computer . . . . . . . . . . . 238
K. Kremer Supercomputing in Polymere Research . . 244
R. Keunings and
R. Aggarwal and
P. Henriksen and
D. Vanderstraeten and
O. Zone Parallel Finite Element Algorithms
Applied to Polymer Flow . . . . . . . . 254
O. H. Nielsen Performance of a Molecular-Dynamics
Algorithm on Connection Machines CM-200
and CM-5 . . . . . . . . . . . . . . . . 261
U. K. Robler and
H. Teichler Parallel Molecular Dynamics Simulations
of Liquid and Amorphous Metals . . . . . 267
D. Hohl Computational Materials Science from
First Principles . . . . . . . . . . . . 274
M. Gerndt Automatic Parallelization of a Crystal
Growth Simulation Program for
Distributed-Memory Systems . . . . . . . 281
M. J. P. Nijmeijer A Parallel Molecular-Dynamics Simulation
of Crystal Growth at a Cluster of
Workstations . . . . . . . . . . . . . . 287
J. M. Voogd and
P. M. A. Sloot and
R. v. Dantzig Simulated Annealing for $N$-body Systems 293
S. R. M. Barros and
D. Dent and
L. Isaksen and
G. Robinson and
F. G. Wollenweber The Message Passing Version of ECMWF's
Weather Forecast Model . . . . . . . . . 299
U. Gartel and
W. Joppich and
A. Schuller Parallel Computing for Weather
Prediction . . . . . . . . . . . . . . . 305
J. Gerlach and
B. Kahler Parallelization of a Mesoscale Model of
Atmospheric Circulation --- An
Object-Oriented Approach . . . . . . . . 311
Y. Tremolet and
F. X. Le Dimet and
D. Trystram Parallelization of Scientific
Applications: Data Assimilation in
Meteorology . . . . . . . . . . . . . . 317
H.-P. Kersken and
B. Fritzsch and
O. Schenk and
W. Hiller and
J. Behrens and
E. Kraube Parallelization of Large Scale Ocean
Models by Data Decomposition . . . . . . 323
Z. W. Song and
K. P. P. Pathirana and
D. Roose and
J. Berlamont Simulation of Tidal Flows for Southern
North Sea and Sediment Transports for
Western Scheldt Estuary on Parallel
Computers . . . . . . . . . . . . . . . 329
Ch. Kervevan and
R. Fabriol and
A. Guillen and
J.- P. Sauty A Sequential-Parallel Approach for
Coupling Chemistry and Transport in
Groundwater Quality Modelling . . . . . 335
C. Addison and
T. Christensen and
J. Larsen and
T. Oliver and
A. Sunderland Supporting an Oil Reservoir Simulator in
a Distributed Memory Environment . . . . 340
H. W. Yau and
K. A. Cliffe and
J. E. Sinclair and
P. J. Sumner The Parallelization of the AEA
Probabilistic Safety Assessment Program,
MASCOT . . . . . . . . . . . . . . . . . 346
P. Altevogt and
F. Gutbrod Monte Carlo Simulations of Lattice Gauge
Theories on Multiprocessor Systems . . . 352
M. Steinmetz The Formation of Galaxies: A Challenge
for Supercomputers --- A Simple Task for
GRAPE? . . . . . . . . . . . . . . . . . 358
S. Poedts and
P. M. Meijer and
J. P. Goedbloed and
H. A. van der Vorst and
A. Jakoby Parallel Magnetohydrodynamics on the
CM-5 . . . . . . . . . . . . . . . . . . 365
J. Apostolakis and
C. E. Bruschini and
P. Calafiura and
F. Gagliardi and
M. Metcalf and
A. Norton and
B. Panzer-Steindel and
L. M. Bertolotto and
K. J. Peach First Results from the Parallelization
of CERN's NA48 Simulation Program . . . 371
G. E. Cirlin and
G. M. Guryanov and
N. P. Korneeva and
Yu. B. Samsonenko Software Package for Reflection High
Energy Electron Diffraction Beam
Intensity Measurement and Analysis
System . . . . . . . . . . . . . . . . . 377
N. Petkov Conceiving Computationally Intensive
Approaches to Vision . . . . . . . . . . 380
S. Hagmann and
H. Kihl and
D. Kuhn and
J.-P. Urban A Transputer-Based Visually-Guided Robot
System Using Neuro-Control . . . . . . . 390
L. Vuurpijl and
T. Schouten and
J. Vytopil A Scalable Performance Prediction Method
for Parallel Neural Network Simulations 396
L. Vuurpijl and
T. Schouten and
J. Vytopil PREENS, a Parallel Research Execution
Environment for Neural Systems . . . . . 402
D. A. Castelow and
N. D. Gent Parallel Implementation of Control Tasks
for an Automated Stereo Camera Mount . . 408
Z. Hanzalek Simulating Neural Networks on Telmat
T-node . . . . . . . . . . . . . . . . . 416
M. M. Lankhorst A Genetic Algorithm for Grammatical
Inference . . . . . . . . . . . . . . . 418
P. Lukowicz and
J. Schiffers and
R. Cober A Massively Parallel Implementation of
the Full Search Vector Quantization
Algorithm . . . . . . . . . . . . . . . 420
I. Cramb and
C. Upstill Commercial Database Applications on
Parallel Systems . . . . . . . . . . . . 422
J. Kerridge and
I. Jelly and
Ch. Bates Evaluation of High-Performance Parallel
Database Machines . . . . . . . . . . . 424
F. R. Kroll A Free-Text Retrieval Index-Server on a
Massively Parallel Machine . . . . . . . 430
D. Walter and
J. Kerridge Large Scale Data Management and
Massively Parallel Architectures in
Automatic Fingerprint Recognition . . . 435
M. Fruscione and
L. Marenzi and
S. Punzi and
P. Stoffella PARCS: Parallel Picture Archiving and
Communication System . . . . . . . . . . 441
Q. Yang and
C. Yu and
C. Liu The Performance of a Parallel Scheme
Using the Divide-and-Conquer Method . . 446
G.-R. Hoffmann High-Performance Computing and
Networking for Numerical Weather
Prediction . . . . . . . . . . . . . . . 1
F. Schmidt High-Performance Computing and
Networking as Base Element of the
Environmental Information System UIS of
Baden-Wurttemberg . . . . . . . . . . . 5
K. Ullmann High Speed Networking for the Research
Community in Europe . . . . . . . . . . 13
M. McKeown The National Information Infrastructure
Testbed (NIIT) . . . . . . . . . . . . . 18
P. M. Borst and
H.-T. Goetz and
P. S. Sapaty and
W. Zorn Parallel Knowledge Processing in Open
Networks . . . . . . . . . . . . . . . . 24
A. Klauser and
R. Posch Distributed File Caching in Parallel
Architectures Utilizing High Speed
Networks . . . . . . . . . . . . . . . . 30
H. Westphal and
D. Popovic Application Fundamentals of Distributed,
High-Performance Computing and
Networking Systems . . . . . . . . . . . 36
C. H. Cap Massive Parallelism with Workstation
Clusters --- Challange or Nonsense? . . 42
J. P. Peltier and
P. Christ Networking Perspectives for
Collaborative Supercomputing in European
Aerospace Research and Industry . . . . 53
S. Rill and
R. Grosso Future Aerospace Working Scenarios Using
High Speed Networks and Supercomputers
Applied to Flow Simulation for Complete
Aircraft . . . . . . . . . . . . . . . . 60
U. Lang A Software Environment for Cooperative
Simulation and Visualization in the
Aerospace Field . . . . . . . . . . . . 70
S. Causse and
F. Juaneda and
M. Grave Implementation of Visualization Tools in
a Distributed Environment . . . . . . . 77
P. Haas and
P. Christ Networking Issues in PAGEIN: The ``N''
of ``HPCN'' . . . . . . . . . . . . . . 86
F. X. Roux and
J. Ryan and
B. Troff and
T. H. Le and
K. Dang-Tran Wavelet Interactive In-Line Analysis
with Pegase . . . . . . . . . . . . . . 94
A. Scheidegger European HPC Competitiveness Centers for
Industry . . . . . . . . . . . . . . . . 103
R. Iffert and
U. Harms An Open High-Performance Computing
Infrastructure in Industry . . . . . . . 109
T. Bonniger and
R. Esser and
D. Krekel A Catalog of Classifying Characteristics
for Massively Parallel Computers . . . . 114
K. Koski Building a Parallel Computing
Environment from Heterogeneous Resources 120
F. Ramme and
T. Romke and
K. Kremer A Distributed Computing Center Software
for the Efficient Use of Parallel
Computer Systems . . . . . . . . . . . . 129
G. C. Fox and
E. Bogucz and
D. A. Jones and
K. Mills and
M. Podgorny and
K. A. Hawick InfoMall: A Scalable Organisation for
the Development of High-Performance
Computing and Communications ---
Software and Systems . . . . . . . . . . 137
A. Uszok and
A. Krol and
K. Zielinski Cluster Management Software for Open
Object-Oriented Systems . . . . . . . . 140
K. Boryczko and
M. Bubak and
M. Gajecki and
J. Kitowski and
J. Moscinski and
M. Pogoda Transmission Rates and Performance of a
Network of Computers . . . . . . . . . . 142
R. W. Numrich and
P. L. Springer and
J. C. Peterson Measurement of Communication Rates on
the Cray T3D Interprocessor Network . . 150
M. Baker and
R. Cloke A Evaluation of the Meiko CS-2 Using the
GENESIS Benchmark Suite . . . . . . . . 158
R. C. Agarwal and
F. G. Gustavson and
M. Zubair A Very High-Performance Algorithm for
NAS EP Benchmark . . . . . . . . . . . . 164
C. Lazou and
G. R. Nudd Evaluation of Parallel Operating Systems 170
S. Hotovy and
T. Sterling JNNIE: Evaluation of Scalable Parallel
Processing Architectures . . . . . . . . 172
H. A. van der Vorst Recent Developments in Hybrid CG Methods 174
L. G. C. Crone The Preconditioned Conjugate Gradient
Method on Distributed Memory Systems . . 184
E. de Sturler and
H. A. van der Vorst Communication Cost Reduction for Krylov
Methods on Parallel Computers . . . . . 190
J. G. L. Booten and
P. M. Meijer and
H. J. J. te Riele and
H. A. van der Vorst Parallel Arnoldi Method for the
Construction of a Krylov Subspace Basis:
an Application in Magnetohydrodynamics 196
G. Cheng and
G. C. Fox and
K. A. Hawick A Scalable Paradigm for
Effectively-Dense Matrix Formulated
Applications . . . . . . . . . . . . . . 202
L. De Luca and
P. Fiorino Automatic Differentiation on Distributed
Memory MIMD Systems . . . . . . . . . . 211
A. Czezowski and
P. Strazdins Optimisations for the Memory Hierarchy
of a Singular Value Decomposition
Algorithm Implemented on the MIMD
Architecture . . . . . . . . . . . . . . 215
Ulrich Schwardmann Parallelization and Data Locality of a
Multigrid Solver on the KSR1 . . . . . . 217
A. Kiper On the Parallel Evaluations of
Recurrences . . . . . . . . . . . . . . 219
U. Geuder and
M. Hardtner and
B. Worner and
R. Zink Implementation of a Parallel Euler
Solver with GRIDS . . . . . . . . . . . 221
J. de Keyser and
D. Roose Distributed Mapping of SPMD Programs
with a Generalized Kernighan-Lin
Heuristic . . . . . . . . . . . . . . . 227
Z. Johan and
K. K. Mathur and
S. L. Johnsson and
T. J. R. Hughes Mesh Decomposition and Communication
Procedures for Finite Element
Applications on the Connection Machine
CM-5 System . . . . . . . . . . . . . . 233
M. Cross and
C. S. Ierotheou and
S. P. Johnson and
P. F. Leggett CAPTools --- Semiautomatic
Parallelization of Mesh-Based
Computational Mechanics Codes . . . . . 241
R. Hempel The MPI Standard for Message Passing . . 247--252
P. M. A. Sloot and
A. G. Hoekstra and
L. O. Hertzberger A Comparison of the Iserver-Occam,
Parix, Express, and PVM Programming
Environments on a Parsytec GCel . . . . 253--259
M. Resch and
A. Geiger and
J. Zikeli Message-Passing-Systems on Workstation
Clusters and Parallel Computers --- The
Impact of Software- and
Network-Architectures on Applications 260
S. Saarinen EASYPVM --- An EnhAnced Subroutine
LibrarY for PVM . . . . . . . . . . . . 267--272
L. Dikken and
F. van der Linden and
J. Vesseur and
P. M. A. Sloot DynamicPVM --- Dynamic Load Balancing on
Parallel Systems . . . . . . . . . . . . 273
V. Strumpen A Large-Scale Metacomputer Approach for
Distributed Parallel Computing . . . . . 278
G. Stellner and
A. Bode and
S. Lamberts and
Th. Ludwig Developing Applications for
Multicomputer Systems on Workstation
Clusters . . . . . . . . . . . . . . . . 286
S. Maffeis System Support for Distributed Computing 293
V. E. Malyshkin Assembly Environment for Development of
Application Parallel Program . . . . . . 302
R. G. Hackenberg MaX --- Investigating Shared Virtual
Memory . . . . . . . . . . . . . . . . . 308
J.-Th. Pfenning Experiences with the Mether-NFS Virtual
Shared Memory System . . . . . . . . . . 316
V. Blanco and
F. F. Rivera and
O. Plata Adapting PICL and ParaGraph Tools to
Transputer-Based Multicomputers . . . . 324
P. Arbenz and
H. P. Luthi and
Ch. Sprenger and
S. Vogel SCIDDLE: A Tool for Large Scale
Cooperative Computing . . . . . . . . . 326
L. Schafers and
C. Scheidler and
O. Kramer-Fuhrmann TRAPPER: A Graphical Programming
Environment for Parallel Systems . . . . 328
S. Tritscher and
R. Zajcew and
M. Barnett Load Leveling on the Paragon
Multicomputer . . . . . . . . . . . . . 330
C. Fonlupt and
P. Marquet and
J.-L. Dekeyser A Data-Parallel View of the Load
Balancing --- Experimental Results on
MasPar MP-1 . . . . . . . . . . . . . . 338
L. Philippe and
G.-R. Perrin Distributed Scheduling for
Multicomputers . . . . . . . . . . . . . 344
O. Hansen A Tool for Optimizing Programs on
Massively Parallel Computer
Architectures . . . . . . . . . . . . . 350
J. Schwarz and
F. A. Rabhi A Case Study in the Parallel
Implementation of Functional Languages
Using Skeletons . . . . . . . . . . . . 357
T. Feng and
Y. Kim A Dynamic Task Allocation Scheme in
Benes-Type Nonblocking Networks . . . . 363
A. Pinti and
J.-C. Grossetie A Methodology for Dimensioning SPMD
Distributed Systems Applied to
Industrial Applications . . . . . . . . 365
O. Naim and
A. J. G. Hey Do-Loop-Surface: An Abstract Performance
Data Visualization . . . . . . . . . . . 367
G. De Pietro and
A. Esposito and
G. Reitano A Graphic Distributed Monitoring System
for Unix-Based Architectures . . . . . . 373
P. Pouzet and
J. Paris and
V. Jorrand Parallel Application Design: The
Simulation Approach with HASTE . . . . . 379
T. Bemmerl and
R. Wismuller On-line Distributed Debugging on
Scaleable Multicomputer Architectures 394
J. Vounckx and
G. Deconinck and
R. Lauwereins and
G. Viehover and
R. Wagner and
H. Madeira and
J. G. Silva and
F. Balbach and
J. Altmann and
B. Bieker The FTMPS-Project: Design and
Implementation of Fault-Tolerance
Techniques for Massively Parallel
Systems . . . . . . . . . . . . . . . . 401
B. Chapman and
H. Zima and
P. Mehrotra High-Performance Fortran Languages:
Advanced Applications and Their
Implementation . . . . . . . . . . . . . 407--416
T. Brandes Evaluation of High-Performance Fortran
on Some Real Applications . . . . . . . 417--422
F. Coelho Experiments with HPF Compilation for a
Network of Workstations . . . . . . . . 423
G. M. van Waveren High-Performance Fortran . . . . . . . . 429--433
R. v. Hanxleden and
K. Kennedy and
J. Saltz Value-Based Distributions in Fortran D 434--440
R. Hanson and
T. Leite Basic Linear Operators in Fortran 90 . . 441--444
A. Sodan and
H. Bi parLisp --- Parallel Symbolic Processing
with Lisp on the Distributed Memory
Machine MANNA . . . . . . . . . . . . . 445
M. Dion and
Y. Robert and
J.-L. Philippe Parallelizing Compilers: What Can Be
Achieved? . . . . . . . . . . . . . . . 447
M. Clint and
S. Fitzpatrick and
T. J. Harmer and
P. L. Kilpatrick and
J. M. Boyle A Family of Data-Parallel Derivations 457
P. Crooks and
R. H. Perrott Automatic Data Distribution . . . . . . 463
G.-R. Perrin Some Synthesis Aspects for Data Parallel
Programming . . . . . . . . . . . . . . 469
U. Kuster and
M. Zurn Influence of Fortran 90 Features on
Performance on Cray Vector Computer
Systems . . . . . . . . . . . . . . . . 475--483
W. Dzwinel Mapping of Patterns --- The Way of
Insight into Multi-Dimensional Data
Structures . . . . . . . . . . . . . . . 484
M. Schimmler and
H.-W. Lang and
R. Maab The Instruction Systolic Array ---
Implementation of a Low-Cost Parallel
Architecture as Add-On Board for
Personal Computers . . . . . . . . . . . 487
J. S. Alherbish The BBN Butterfly Family: An Overview 489
Y. A. Mamatov and
V. P. Yemelin Architectural Principles of the RPM . . 491
S. Saini and
H. D. Simon Applications Performance on Intel
Paragon XP/S-15 . . . . . . . . . . . . 493
C. Casari and
C. Catelli and
M. Guanziroli and
M. Mazzeo and
G. Meola and
S. Punzi and
A. L. Scheinine and
P. Stofella Status Report on ESPRIT Project P7519
Palace: Parallelization of GEANT . . . . 499
M. Amato and
A. Matrone and
P. Schiano A Practical Experience in Parallelizing
a Large CFD Code: The ENSOLV Flow Solver 508
S. Abreu and
L. M. Pereira Design for AKL with Intelligent Pruning 3--10
J. J. Alferes and
L. M. Pereira Contradiction: When Avoidance Equals
Removal, Part I . . . . . . . . . . . . 11--23
B. Amrhein Birkhoff's HSP-Theorem for Cumulative
Logic Programs . . . . . . . . . . . . . 24--36
H. Boley Finite Domains and Exclusions as
First-Class Citizens . . . . . . . . . . 37--61
A. Ciampolini and
E. Lamma and
P. Mello and
C. Stefanelli Some Experimental Results in
Implementing a Logic Language with
Multi-Head Clauses on a Transputer
Architecture . . . . . . . . . . . . . . 62--76
A. Dovier A Language with Finite Sets Embedded in
the CLP-Scheme . . . . . . . . . . . . . 77--93
L.-H. Eriksson Finitary Partial Inductive Definitions
as a General Logic . . . . . . . . . . . 94--119
G. Falkman and
O. Torgersson Programming Methodologies in GCLA . . . 120--151
K. Hinkelmann and
H. Hintze Computing Cost Estimates for Proof
Strategies . . . . . . . . . . . . . . . 152--170
J. S. Hodas Logic Programming with Multiple Context
Management Schemes . . . . . . . . . . . 171--182
S. Keronen Non-Procedural Logic Programming . . . . 183--195
P. Kreuger Axioms in Definitional Calculi . . . . . 196--205
D. Miller A Proposal for Modules in Lambda-Prolog 206--221
A. Momigliano and
M. Ornaghi Regular Search Spaces as a Foundation of
Logic Programming . . . . . . . . . . . 222--254
D. Pearce Answer Sets and Nonmonotonic S4 . . . . 255--267
L. M. Pereira and
J. J. Alferes Contradiction: When Avoidance Equals
Removal, Part II . . . . . . . . . . . . 268--281
L. Pinto Cut Formulae and Logic Programming . . . 282--300
U. S. Reddy Higher-Order Aspects of Logic
Programming . . . . . . . . . . . . . . 301--321
C. Ribeiro and
A. Porto Representation and Inference with
Consistent Temporal Propositions . . . . 322--332
P. Schroeder-Heister Definitional Reflection and the
Completion . . . . . . . . . . . . . . . 333--347
J. Zlatuska Linear Logic Semantics for Concurrent
Prolog . . . . . . . . . . . . . . . . . 348--360
M. P. Singh Multiagent Systems: A Theoretical
Framework for Intentions, Know-How, and
Communications . . . . . . . . . . . . . xxiii + 168
R. Malladi and
J. A. Sethian and
B. C. Vemuri Evolutionary fronts for
topology-independent shape modeling and
recovery . . . . . . . . . . . . . . . . 3--13
S. J. Dickinson and
H. I. Christensen and
J. K. Tsotsos and
J. G. Olofsson Active object recognition integrating
attention and viewpoint control . . . . 3--14
P. J. Giblin and
R. S. Weiss Epipolar fields on surfaces . . . . . . 14--23
S. Vinther and
R. Cipolla Active $3$D object recognition using
$3$D affine invariants . . . . . . . . . 15--24
D. Weinshall and
M. Werman and
N. Tishby Stability and likelihood of views of
three dimensional objects . . . . . . . 24--35
M. J. Taylor and
A. Blake Grasping the apparent contour . . . . . 25--34
J. M. Rehg and
T. Kanade Visual tracking of high DOF articulated
structures: An application to human hand
tracking . . . . . . . . . . . . . . . . 35--46
L. R. Williams Topological reconstruction of a smooth
manifold-solid from its occluding
contour . . . . . . . . . . . . . . . . 36--50
J. L. Crowley and
J. M. Bedrune and
M. Bekker and
M. Schneider Integration and control of reactive
visual processes . . . . . . . . . . . . 47--60
M. Otte and
H.-H. Nagel Optical flow estimation: advances and
comparisons . . . . . . . . . . . . . . 51--60
M. Tistarelli Multiple constraints for optical flow 61--70
S. Soatto and
R. Frezza and
P. Perona Motion estimation on the essential
manifold . . . . . . . . . . . . . . . . 61--72
T. Papadopoulo and
O. Faugeras Motion field of curves: applications . . 71--82
L. S. Shapiro and
A. Zisserman and
M. Brady Motion from point matches using affine
epipolar geometry . . . . . . . . . . . 73--84
S. Carlsson Sufficient image structure for $3$-D
motion and shape estimation . . . . . . 83--94
P. A. Beardsley and
A. Zisserman and
D. W. Murray Navigation using affine structure from
motion . . . . . . . . . . . . . . . . . 85--96
C. Xu and
S. A. Velastin A comparison between the standard Hough
transform and the Mahalanobis distance
Hough transform . . . . . . . . . . . . 95--100
C. J. Poelman and
T. Kanade A paraperspective factorization method
for shape and motion recovery . . . . . 97--110
M. Michaelis and
G. Sommer Junction classification by multiple
orientation detection . . . . . . . . . 101--108
B. Vasselle and
G. Giraudon and
M. Berthod Following corners on curves and surfaces
in the scale space . . . . . . . . . . . 109--114
V. Sundareswaran and
P. Bouthemy and
F. Chaumette Active camera self-orientation using
dynamic image parameters . . . . . . . . 111--116
P. Kube and
P. Perona Scale-space properties of quadratic edge
detectors . . . . . . . . . . . . . . . 115--124
J. Maver and
A. Leonardis and
F. Solina Planning the optimal set of views using
the max-min principle . . . . . . . . . 117--122
E. Grosso On perceptual advantages of eye-head
active control . . . . . . . . . . . . . 123--130
A. A. Amini A scalar function formulation for
optical flow . . . . . . . . . . . . . . 125--131
G. Malandain and
S. Fernandez-Vidal and
J. M. Rocchisani Improving registration of $3$-D medical
images using a mechanical based method 131--136
H. Tunley and
D. Young First order optic flow from log-polar
sampled images . . . . . . . . . . . . . 132--137
B. Christmas and
J. Kittler and
M. Petrou Non-iterative contextual correspondence
matching . . . . . . . . . . . . . . . . 137--142
M. J. Black Recursive non-linear estimation of
discontinuous flow fields . . . . . . . 138--145
Y. Kita A registration method for rigid objects
without point matching . . . . . . . . . 143--150
A. Giachetti and
M. Campani and
V. Torre The use of optical flow for the
autonomous navigation . . . . . . . . . 146--151
R. Zabih and
J. Woodfill Non-parametric local transforms for
computing visual correspondence . . . . 151--158
F. Germain and
T. Skordas An image motion estimation technique
based on a combined statistical test and
spatiotemporal generalised likelihood
ratio approach . . . . . . . . . . . . . 152--160
R. Manmatha Measuring the affine transform using
Gaussian filters . . . . . . . . . . . . 159--164
D. Sinclair and
B. Boufama Independent motion segmentation and
collision prediction for road vehicles 161--166
J. Sato and
R. Cipolla Extracting the affine transformation
from texture moments . . . . . . . . . . 165--172
F. Luthon and
G. V. Popescu and
A. Caplier An MRF based motion detection algorithm
implemented on analog resistive network 167--174
A. W. Fitzgibbon and
R. B. Fisher Lack-of-fit detection using the
run-distribution test . . . . . . . . . 173--178
D. Geiger and
K. J. Diamantaras Occlusion ambiguities in motion . . . . 175--180
S. S. Intille and
A. F. Bobick Disparity-space images and large
occlusion stereo . . . . . . . . . . . . 179--186
A. Borri and
G. Bucci and
P. Nesi A robust tracking of $3$D motion . . . . 181--188
A. Gourdon and
N. Ayache Registration of a curve on a surface
using differential properties . . . . . 187--192
D. Koller and
J. Weber and
J. Malik Robust multiple car tracking with
occlusion reasoning . . . . . . . . . . 189--198
R. Vaillant and
L. Gueguen Genetic algorithms applied to binocular
stereovision . . . . . . . . . . . . . . 193--200
B. Boufama and
D. Weinshall and
M. Werman Shape from motion algorithms: a
comparative analysis of scaled
orthography and perspective . . . . . . 199--204
I. L. Herlin and
D. Bereziat and
G. Giraudon and
C. Nguyen Segmentation of echocardiographic images
with Markov random fields . . . . . . . 201--206
J. M. Lawn and
R. Cipolla Robust egomotion estimation from affine
motion parallax . . . . . . . . . . . . 205--210
M. Derras and
C. Debain and
M. Berducat and
P. Bonton Unsupervised regions segmentation: Real
time control of an upkeep machine of
natural spaces . . . . . . . . . . . . . 207--212
S. Sull and
N. Ahuja Integrated $3$D analysis of flight image
sequences . . . . . . . . . . . . . . . 211--216
L. Younes Synchronous image restoration . . . . . 213--217
P. F. McLauchlan and
I. D. Reid and
D. W. Murray Recursive affine structure and motion
from image sequences . . . . . . . . . . 217--224
U. Weidner Parameterfree information-preserving
surface restoration . . . . . . . . . . 218--226
X. Shen and
D. Hogg Shape models from image sequences . . . 225--230
M. S. Langer and
S. W. Zucker Spatially varying illumination: A
computational model of converging and
diverging sources . . . . . . . . . . . 227--234
C. Nastar Vibration modes for nonrigid motion
analysis in $3$D images . . . . . . . . 231--238
Y. Ohta and
Y. Hayashi Recovery of illuminant and surface
colors from images based on the CIE
daylight . . . . . . . . . . . . . . . . 235--246
M. Lindenbaum and
S. Ben-David Applying VC-dimension analysis to object
recognition . . . . . . . . . . . . . . 239--250
L. B. Wolff and
E. Angelopoulou $3$-D stereo using photometric ratios 247--258
P. Havaldar and
G. Medioni and
F. Stein Extraction of groups for recognition . . 251--261
P. Dupuis and
J. Oliensis Shape from shading: provably convergent
algorithms and uniqueness results . . . 259--268
Y. Hel-Or and
M. Werman Model based pose estimation of
articulated and constrained objects . . 262--273
M. Oren and
S. K. Nayar Seeing beyond Lambert's law . . . . . . 269--280
D. H. Ballard and
R. P. N. Rao Seeing behind occlusions . . . . . . . . 274--285
P. Fua and
Y. G. Leclerc Using $3$-dimensional meshes to combine
image-based and geometry-based
constraints . . . . . . . . . . . . . . 281--294
Y. Moses and
Y. Adini and
S. Ullman Face recognition: the problem of
compensating for changes in illumination
direction . . . . . . . . . . . . . . . 286--298
M. Proesmans and
L. J. VanGool and
E. Pauwels and
A. Oosterlinck Determination of optical flow and its
discontinuities using non-linear
diffusion . . . . . . . . . . . . . . . 295--304
A. Baumberg and
D. Hogg Learning flexible models from image
sequences . . . . . . . . . . . . . . . 299--308
H.-H. Nagel and
G. Socher and
H. Kollnig and
M. Otte Motion boundary detection in image
sequences by local stochastic tests . . 305--315
A. Leonardis and
F. Solina and
A. Macerl A direct recovery of superquadric models
in range images using recover-and-select
paradigm . . . . . . . . . . . . . . . . 309--318
S. Ayer and
P. Schroeter and
J. Biguen Segmentation of moving objects by robust
motion parameter estimation over
multiple frames . . . . . . . . . . . . 316--327
M. Zerroug and
R. Nevatia Segmentation and recovery of SHGCs from
a real intensity image . . . . . . . . . 319--330
P. H. S. Torr and
D. W. Murray Stochastic motion clustering . . . . . . 328--337
J. Davis and
M. Shah Recognizing hand gestures . . . . . . . 331--340
H. Kollnig and
H.-H. Nagel and
M. Otte Association of motion verbs with vehicle
movements extracted from dense optical
flow fields . . . . . . . . . . . . . . 338--350
A. D. Worrall and
G. D. Sullivan and
K. D. Baker Pose refinement of active models using
forces in $3$D . . . . . . . . . . . . . 341--352
H. Kaelviaeinen and
P. Hirvonen and
L. Xu and
E. Oja Comparisons of probabilistic and
non-probabilistic Hough transforms . . . 351--360
J. Malik and
R. Rosenholtz Recovering surface curvature and
orientation from texture distortion: a
least squares algorithm and sensitivity
analysis . . . . . . . . . . . . . . . . 353--364
S. Z. Li Markov random field models in computer
vision . . . . . . . . . . . . . . . . . 361--370
J. Gaarding and
T. Lindeberg Direct estimation of local surface shape
in a fixating binocular vision system 365--376
O. Henricsson and
F. Heitger The role of key-points in finding
contours . . . . . . . . . . . . . . . . 371--382
L. Robert and
M. Hebert Deriving orientation cues from stereo
images . . . . . . . . . . . . . . . . . 377--388
W. Foerstner A framework for low level feature
extraction . . . . . . . . . . . . . . . 383--396
T. Lindeberg and
J. Gaarding Shape-adapted smoothing in estimation of
$3$-D depth cues from affine distortions
of local $2$-D brightness structure . . 389--402
J. Feldmar and
N. Ayache Rigid and affine registration of smooth
surfaces using differential properties 397--406
H. Zabrodsky and
D. Weinshall Utilizing symmetry in the reconstruction
of three-dimensional shape from noisy
images . . . . . . . . . . . . . . . . . 403--410
A. Shashua and
S. Toelg The quadric reference surface:
Applications in registering views of
complex $3$D objects . . . . . . . . . . 407--416
A. Heyden Consistency and correction of
line-drawing, obtained by projections of
piecewise planar objects . . . . . . . . 411--420
C. S. Zhao and
R. Mohr Relative $3$D regularized B-spline
surface reconstruction through image
sequences . . . . . . . . . . . . . . . 417--426
S. Petitjean On the enumerative geometry of aspect
graphs . . . . . . . . . . . . . . . . . 421--426
P. Fiddelaers and
E. J. Pauwels and
L. J. Van Gool Geometry-driven curve evolution . . . . 427--432
H. Delingette Intrinsic stabilizers of planar curves 427--438
R. J. Hartley and
A. Noble and
J. Grande and
J. Liu Quantitative measurement of manufactured
diamond shape . . . . . . . . . . . . . 433--440
K. Aastroem Affine and projective normalization of
planar curves and regions . . . . . . . 439--448
E. Koh and
D. Metaxas and
N. Badler Hierarchical shape representation using
locally adaptive finite elements . . . . 441--448
N. Daucher and
M. Dhome and
J. T. Lapreste Camera calibration from spheres images 449--454
G. Sapiro and
A. Tannenbaum Area and length preserving geometric
invariant scale-spaces . . . . . . . . . 449--458
R. Horaud and
F. Dornaika and
B. Boufama and
R. Mohr Self calibration of a stereo head
mounted onto a robot arm . . . . . . . . 455--462
L. Quan Invariants of 6 points from 3
uncalibrated images . . . . . . . . . . 459--470
J. Ponce and
D. H. Marimont and
T. A. Cass Analytical methods for uncalibrated
stereo and motion reconstruction . . . . 463--470
R. J. Hartley Self-calibration from multiple views
with a rotating camera . . . . . . . . . 471--478
G. Sparr A common framework for kinetic depth,
reconstruction and motion for deformable
objects . . . . . . . . . . . . . . . . 471--481
A. Shashua Trilinearity in visual recognition by
alignment . . . . . . . . . . . . . . . 479--484
O. Faugeras and
L. Robert What can two images tell us about a
third one? . . . . . . . . . . . . . . . 485--494
G. Piccioli and
E. De Micheli and
M. Campani A robust method for road sign detection
and recognition . . . . . . . . . . . . 495--500
T. N. Tan and
G. D. Sullivan and
K. D. Baker Pose determination and recognition of
vehicles in traffic scenes . . . . . . . 501--506
R. B. Fisher Performance comparison of ten variations
on the interpretation-tree matching
algorithm . . . . . . . . . . . . . . . 507--512
K. Matsuno and
C. W. Lee and
S. Tsuji Recognition of human facial expressions
without feature extraction . . . . . . . 513--520
D. Derou and
L. Herault Pulsed neural networks and perceptive
grouping . . . . . . . . . . . . . . . . 521--526
M. Van Diest and
L. J. Van Gool and
T. Moons and
E. J. Pauwels Projective invariants for planar contour
recognition . . . . . . . . . . . . . . 527--534
P. R. Cooper and
L. A. Birnbaum and
D. Halabe and
M. Brand Divided we fall: Resolving occlusions
using causal reasoning . . . . . . . . . 535--542
M. Li Camera calibration of a head-eye system
for active vision . . . . . . . . . . . 543--554
R. J. Hartley and
R. Gupta Linear pushbroom cameras . . . . . . . . 555--566
R. Deriche and
Z. Zhang and
Q.-T. Luong and
O. Faugeras Robust recovery of the epipolar geometry
for an uncalibrated stereo rig . . . . . 567--576
Q.-T. Luong and
O. Faugeras A stability analysis of the fundamental
matrix . . . . . . . . . . . . . . . . . 577--588
Q.-T. Luong and
T. Vieville Canonic representations for the
geometries of multiple projective views 589--599
P. Aczel Final Universes of Processes . . . . . . 1--28
P.-L. Curien On the Symmetry of Sequentiality . . . . 29--71
A. M. Pitts Computational Adequacy via ``Mixed''
Inductive Definitions . . . . . . . . . 72--82
J. Rutten A Structural Co-Induction Theorem . . . 83--102
F. Van Breugel Three Metric Domains of Processes for
Bisimulation . . . . . . . . . . . . . . 103--121
J. W. De Bakker and
F. Van Breugel Topological Models for Higher Order
Control Flow . . . . . . . . . . . . . . 122--142
D. Sangiorgi An Investigation into Functions as
Processes . . . . . . . . . . . . . . . 143--159
K. G. Larsen and
W. Yi Time Abstracted Bisimulation: Implicit
Specifications and Decidability . . . . 160--176
S. Schneider Timewise Refinement for Communicating
Processes . . . . . . . . . . . . . . . 177--214
L. Chen Axiomatising Real-Time Processes . . . . 215--229
D. Scholefield and
H. Zedan and
H. Jifeng A Predicative Semantics for the
Refinement of Real-Time Systems . . . . 230--249
E. Best and
H.-G. Linde-Goeers Compositional Process Semantics of Petri
Boxes . . . . . . . . . . . . . . . . . 250--270
G. M. Pinna and
A. Poigne On the Specification of Elementary
Reactive Behaviour . . . . . . . . . . . 271--292
A. Jeffrey A Chemical Abstract Machine for Graph
Reduction . . . . . . . . . . . . . . . 293--303
P. S. Mulry Lifting Theorems for Kleisli Categories 304--319
S. Brookes and
S. Geva Sequential Functions on Indexed Domains
and Full Abstraction for a Sub-Language
of PCF . . . . . . . . . . . . . . . . . 320--332
A. Bucciarelli Another Approach to Sequentiality:
Kleene's Unimonotone Functions . . . . . 333--358
A. Stoughton Mechanizing Logical Relations . . . . . 359--377
S. L. Bloom and
Z. Esik Some Quasi-Varieties of Iteration
Theories . . . . . . . . . . . . . . . . 378--409
R. Heckmann Probabilistic Power Domains, Information
Systems, and Locales . . . . . . . . . . 410--437
M. Huth Linear Domains and Linear Maps . . . . . 438--453
G.-Q. Zhang Universal Quasi-Prime Algebraic Domains 454--473
R. F. Blute and
P. Panangaden and
R. A. G. Seely Holomorphic Models of Exponential Types
in Linear Logic . . . . . . . . . . . . 474--512
P. Wadler A Syntax for Linear Logic . . . . . . . 513--529
A. Rabinovich A Complete Axiomatisation for Trace
Congruence of Finite State Behaviors . . 530--543
R. D. Kopperman and
R. C. Flagg The Asymmetric Topology of Computer
Science . . . . . . . . . . . . . . . . 544--553
H. Calbrix and
M. Nivat and
A. Podelski Ultimately Periodic Words of Rational
$w$-Languages . . . . . . . . . . . . . 554--566
A. Fiech Category of delta-Functors . . . . . . . 567--586
A. Banerjee and
D. A. Schmidt A Categorical Interpretation of Landin's
Correspondence Principle . . . . . . . . 587--602
K. B. Bruce and
J. Crabtree and
G. Kanapathy An Operational Semantics for TOOPLE: A
Statically-Typed Object-Oriented
Programming Language . . . . . . . . . . 603--626
O. Danvy and
J. Hatcliff On the Transformation Between Direct and
Continuation Semantics . . . . . . . . . 627--648
A. Benveniste and
P. Caspi and
P. Le Guernic and
N. Halbwachs Data-Flow Synchronous Languages . . . . 1
J. A. Bergstra and
A. Ponse and
J. J. Van Wamel Process Algebra with Backtracking . . . 46
G. Boudol Some Chemical Abstract Machines . . . . 92
E. Clarke and
O. Grumberg and
D. Long Verification Tools for Finite-State
Concurrent Systems . . . . . . . . . . . 124
U. Engberg and
G. Winskel Linear Logic on Petri Nets . . . . . . . 176
K. Jensen An Introduction to the Theoretical
Aspects of Coloured Petri Nets . . . . . 230
Y. Kesten and
Z. Manna and
A. Pnueli Temporal Verification of Simulation and
Refinement . . . . . . . . . . . . . . . 273
L. Lamport Verification and Specification of
Concurrent Programs . . . . . . . . . . 347
N. Lynch Simulation Techniques for Proving
Properties of Real-Time Systems . . . . 375
M. Nielsen and
V. Sassone and
G. Winskel Relationships Between Models of
Concurrency . . . . . . . . . . . . . . 425
J. Parrow Interaction Diagrams . . . . . . . . . . 477
J. Parrow and
D. Sangiorgi Algebraic Theories for Name-Passing
Calculi . . . . . . . . . . . . . . . . 509
J. Rutten and
D. Turi Initial Algebra and Final Coalgebra
Semantics for Concurrency . . . . . . . 530
W. Thomas and
H. Lescow Logical Specifications of Infinite
Computations . . . . . . . . . . . . . . 583
J. Zwiers and
W. Janssen Partial Order Based Design of Concurrent
Systems . . . . . . . . . . . . . . . . 622
D. Hernandez Qualitative Representation of Spatial
Knowledge . . . . . . . . . . . . . . . ix + 202
N. Pippenger Juggling Networks . . . . . . . . . . . 1--12
B. Dixon and
R. E. Tarjan Optimal Parallel Verification of Minimum
Spanning Trees in Logarithmic Time . . . 13--22
R. Greenlaw and
J. Machta The Parallel Complexity of Algorithms
for Pattern Formation Models . . . . . . 23--34
S. Waack On the Parallel Complexity of Iterated
Multiplication in Rings of Algebraic
Integers . . . . . . . . . . . . . . . . 35--44
Y. D. Liang and
R. Greenlaw and
G. Manacher NC02 Algorithms Regarding Hamiltonian
Paths and Circuits in Interval Graphs 45--58
B. Dixon Concurrency in an $ O(\log \log N) $
Priority Queue . . . . . . . . . . . . . 59--72
S. Bettayeb and
Z. Miller and
T. Peng and
H. Sudborough Embedding $k$-$D$ Meshes into Optimum
Hypercubes with Dilation $ 2 k - 1 $ . . 73--80
M. Roettger and
U.-P. Schroeder and
W. Unger Embedding $3$-Dimensional Grids into
Optimal Hypercubes . . . . . . . . . . . 81--94
F. Dehne and
R. D. Lins Distributed Cyclic Reference Counting 95--100
P. Baldy and
H. Dicky and
R. Medina and
M. Morvan Efficient Reconstruction of the Causal
Relationship in Distributed Systems . . 101--114
F. Dehne Scalable Parallel Computational Geometry 115--120
D. Krizanc and
L. Narayanan Sorting and Selection on Arrays with
Diagonal Connections . . . . . . . . . . 121--136
S. Ubeda Work-Optimal Thinning Algorithm on SIMD
Machines . . . . . . . . . . . . . . . . 137--152
V.-D. Cung and
B. Le Cun An Efficient Implementation of Parallel
A . . . . . . . . . . . . . . . . . . . 153--168
V. Bokka and
H. Gurla and
S. Olariu and
J. L. Schwing Constant-Time Convexity Problems on
Reconfigurable Meshes . . . . . . . . . 169--180
J. Galtier Deepness Analysis: Bringing Optimal
Fronts to Triangular Finite Element
Method . . . . . . . . . . . . . . . . . 181--196
A. Hily and
D. Solleau Communications in Bus Networks . . . . . 197--206
K. Diks and
A. Pelc Fault-Tolerant Linear Broadcasting . . . 207--218
K. Jansen and
H. Mueller The Minimum Broadcast Time Problem . . . 219--234
J. Hromkovic and
R. Klasing and
W. Unger and
H. Wagener The Complexity of Systolic Dissemination
of Information in Interconnection
Networks . . . . . . . . . . . . . . . . 235--250
D. W. Krumme Representations of Gossip Schemes . . . 251--266
P. Kulasinghe and
S. Bettayeb On the Multiply-Twisted Hypercube . . . 267--278
T. Altenkirch Proving Strong Normalization of CC by
Modifying Realizability Semantics . . . 3--18
L. S. Van Benthem Jutting and
J. McKinna and
R. Pollack Checking Algorithms for Pure Type
Systems . . . . . . . . . . . . . . . . 19--61
T. Coquand Infinite Objects in Type Theory . . . . 62--78
H. Geuvers Conservativity Between Logics and Typed
Lamda Calculi . . . . . . . . . . . . . 79--107
S. Hayashi Logic of Refinement Types . . . . . . . 108--126
L. Helmink and
A. Sellink and
F. Vaandrager Proof-Checking a Data Link Protocol . . 127--165
M. Hofmann Elimination of Extensionality in
Martin-Loef Type Theory . . . . . . . . 166--190
F. Leclerc and
C. Paulin-Mohring Programming with Streams in Coq --- A
Case Study: The Sieve of Eratosthenes 191--212
L. Magnusson and
B. Nordstroem The ALF Proof Editor and Its Proof
Engine . . . . . . . . . . . . . . . . . 213--237
S. Maharaj Encoding $Z$-Style Schemas in Type
Theory . . . . . . . . . . . . . . . . . 238--262
M. Miculan The Expressive Power of Structural
Operational Semantics with Explicit
Assumptions . . . . . . . . . . . . . . 263--290
C. Parent Developing Certified Programs in the
System Coq --- The Program Tactic . . . 291--312
R. Pollack Closure Under Alpha-Conversion . . . . . 313--332
C. Raffalli Machine Deduction . . . . . . . . . . . 333--351
A. Ranta Type Theory and the Informal Language of
Mathematics . . . . . . . . . . . . . . 352--365
D. A. Wolfram Semantics for Abstract Clauses . . . . . 366--383
G. Benson A Space Efficient Algorithm for Finding
the Best Non-Overlapping Alignment Score 1--14
H. Bodlaender and
R. G. Downey and
M. R. Fellows and
H. T. Wareham The Parameterized Complexity of Sequence
Alignment and Consensus . . . . . . . . 15--30
K.-M. Chao Computing all Suboptimal Alignments in
Linear Space . . . . . . . . . . . . . . 31--42
V. Bafna and
E. L. Lawler and
P. A. Peuzner Approximation Algorithms for Multiple
Sequence Alignment . . . . . . . . . . . 43--53
X. Huang A Context Dependent Method for Comparing
Sequences . . . . . . . . . . . . . . . 54--63
A. L. Cobbs Fast Identification of Approximately
Matching Substrings . . . . . . . . . . 64--74
T. Jiang and
L. Wang and
K. Zhang Alignment of Trees --- an Alternative to
Tree Edit . . . . . . . . . . . . . . . 75--86
X. Huang and
P. A. Pevzner and
W. Miller Parametric Recomputing in Alignment
Graphs . . . . . . . . . . . . . . . . . 87--101
T. Luczak and
W. Szpankowski A Lossy Data Compression Based on String
Matching: Preliminary Analysis and
Suboptimal Algorithms . . . . . . . . . 102--112
U. Manber A Text Compression Scheme that Allows
Fast Searching Directly in the
Compressed File . . . . . . . . . . . . 113--124
M. Karpinski and
W. Rytter An Alphabet-Independent Optimal Parallel
Search for Three Dimensional Pattern . . 125--135
L. Lestree Unit Route Upper Bound for
String-Matching on Hypercube . . . . . . 136--145
S. Rao Kosaraju Computation of Squares in a String . . . 146--150
M. Mohri Minimization of Sequential Transducers 151--163
K. S. Alexander Shortest Common Superstrings for Strings
of Random Letters . . . . . . . . . . . 164--172
R. W. Irving and
C. B. Fraser Maximal Common Subsequences and Minimal
Common Supersequences . . . . . . . . . 173--183
D. Breslauer Dictionary-Matching on Unbounded
Alphabets: Uniform-Length Dictionaries 184--197
R. Baeza-Yates and
W. Cunto and
U. Manber and
S. Wu Proximity Matching Using Fixed-Queries
Trees . . . . . . . . . . . . . . . . . 198--212
P. Kilpelainen and
H. Mannila Query Primitives for Tree-Structured
Data . . . . . . . . . . . . . . . . . . 213--225
R. M. Idury and
A. A. Schaeffer Multiple Matching of Parameterized
Patterns . . . . . . . . . . . . . . . . 226--239
T. Akutsu Approximate String Matching with Don't
Care Characters . . . . . . . . . . . . 240--249
S. Tang and
K. Zhang and
X. Wu Matching with Matrix Norm Minimization 250--258
W. I. Chang and
T. G. Marr Approximate String Matching and Local
Similarity . . . . . . . . . . . . . . . 259--273
M. Ito and
K. Shimizu and
M. Nakanishi and
A. Hashimoto Polynomial-Time Algorithms for Computing
Characteristic Strings . . . . . . . . . 274--288
Y. Sakakibara and
M. Brown and
R. Hughey and
I. S. Mian Recent Methods for RNA Modeling Using
Stochastic Context-Free Grammars . . . . 289--306
J. Kececioglu and
D. Sankoff Efficient Bounds for Oriented Chromosome
Inversion Distance . . . . . . . . . . . 307--325
P. Gaerdenfors The Role of Expectations in Reasoning 1
P. Hajek On Logics of Approximate Reasoning . . . 17
Churn Jung Liau and
B. I.-P. Lin Gentzen Sequent Calculus for
Possibilistic Reasoning . . . . . . . . 31
P. A. Flach A Model of Inductive Reasoning . . . . . 41
F. S. Correa da Silva and
D. S. Robertson and
J. Hesketh Automated Reasoning with Uncertainties 57
J. Lawry and
G. M. Wilmers An Axiomatic Approach to Systems of
Prior Distributions in Inexact Reasoning 81
L. M. Pereira and
J. J. Alferes and
J. N. Aparicio Contradiction Removal Semantics with
Explicit Negation . . . . . . . . . . . 91
L. M. Pereira and
J. N. Aparicio and
J. J. Alferes Logic Programming for Non-Monotonic
Reasoning . . . . . . . . . . . . . . . 107
Y. Shoham Agent Oriented Programming . . . . . . . 123
K. Nakata An Application of Temporal Logic for
Representation and Reasoning About
Design . . . . . . . . . . . . . . . . . 131
K. Georgatos Knowledge Theoretic Properties of
Topological Spaces . . . . . . . . . . . 147
C. M. Rauszer Rough Logic for Multi-Agent Systems . . 161
L. Cholvy A Logical Approach to Multi-Sources
Reasoning . . . . . . . . . . . . . . . 183
K. Devlin Situation Theory and Social Structure 197
J. Massey SAFER K-64: A Byte-Oriented
Block-Ciphering Algorithm . . . . . . . 1
J. Daemen and
R. Govaerts and
J. Vandewalle A New Approach To Block Cipher Design 18
B. Kaliski and
M. Robshaw Fast Block Cipher Proposal . . . . . . . 33
U. Bloecher and
M. Dichtl Fish: A Fast Software Stream Cipher . . 41
H. Krawczyk The Shrinking Generator: Some Practical
Considerations . . . . . . . . . . . . . 45
R. Anderson A Modern Rotor Machine . . . . . . . . . 47
B. Chambers Two Stream Ciphers . . . . . . . . . . . 51
P. Rogaway and
D. Coppersmith A Software-Optimised Encryption
Algorithm . . . . . . . . . . . . . . . 56
M. Lomas Encrypting Network Traffic . . . . . . . 64
B. Preneel Design Principles for Dedicated Hash
Functions . . . . . . . . . . . . . . . 71--82
M. Roe Performance of Symmetric Ciphers and
One-Way Hash Functions . . . . . . . . . 83--89
J. Golic On the Security of Shift Register Based
Keystream Generators . . . . . . . . . . 90
C. Ding The Differential Cryptanalysis and
Design of Natural Stream Ciphers . . . . 101
E. Biham On Modes of Operation . . . . . . . . . 116
D. Gollmann Cryptanalysis of Clock Controlled Shift
Registers . . . . . . . . . . . . . . . 121
D. Wheeler A Bulk Data Encryption Algorithm . . . . 127
R. Tao On Finite Automation One-Key
Cryptosystems . . . . . . . . . . . . . 135
C. Schnorr and
S. Vaudenay Parallel FFT-Hashing . . . . . . . . . . 149
X. Lai and
L. Knudsen Attacks on Double Block Length Hash
Functions . . . . . . . . . . . . . . . 157--165
A. Chan and
R. Games and
J. Rushanan On Quadratic M-Sequences . . . . . . . . 166
A. Klapper and
M. Goresky 2-Adic Shift Registers . . . . . . . . . 174
K. Nyberg New Bent Mappings Suitable for Fast
Implementation . . . . . . . . . . . . . 179
N. MacLaren Cryptographic Pseudorandom Numbers in
Simulation . . . . . . . . . . . . . . . 185
B. Schneier Description of a New Variable-Length
Key, 64-bit Block Cipher (Blowfish) . . 191--204
A. Di Porto and
W. Wolfowicz VINO: A Block Cipher Including Variable
Permutations . . . . . . . . . . . . . . 205
L. Knudsen Practically Secure Feistel Ciphers . . . 211
J. Allgayer and
E. Franconi Collective Entities and Relations in
Concept Languages . . . . . . . . . . . 13
F. Baader and
B. Hollunder Computing Extensions of Terminological
Default Theories . . . . . . . . . . . . 30
C. Bettini A Formalization of Interval-Based
Temporal Subsumption in First Order
Logic . . . . . . . . . . . . . . . . . 53
C. Boutilier Normative, Subjunctive and Autoepistemic
Defaults . . . . . . . . . . . . . . . . 74
L. Console and
D. T. Dupre Abductive Reasoning with Abstraction
Axioms . . . . . . . . . . . . . . . . . 98
F. M. Donini and
M. Lenzerini and
D. Nardi and
W. Nutt Queries, Rules and Definitions as
Epistemic Sentences in Concept Languages 113
G. Gottlob The Power of Beliefs or Translating
Default Logic into Standard
Autoepistemic Logic . . . . . . . . . . 133
R. Greiner and
D. Schuurmans Learning an Optimally Accurate
Representation System . . . . . . . . . 145
A. C. Kakas Default Reasoning via Negation as
Failure . . . . . . . . . . . . . . . . 160
J. Kalinski Weak Autoepistemic Reasoning and
Well-Founded Semantics . . . . . . . . . 179
H. Kautz and
B. Selman Forming Concepts for Fast Inference . . 200
Y. Q. Lin A Common-Sense Theory of Time . . . . . 216
K. L. Myers and
K. Konolige Reasoning with Analogical
Representations . . . . . . . . . . . . 229
W. Nejdl and
M. Banagl Asking About Possibilities --- Revision
and Update Semantics for Subjunctive
Queries . . . . . . . . . . . . . . . . 250
I. Niemelae and
J. Rintanen On the Impact of Stratification on the
Complexity of Nonmonotonic Reasoning . . 275
Y. Shoham and
S. B. Cousins Logics of Mental Attitudes in AI . . . . 296
E. Weydert Hyperrational Conditionals --- Monotonic
Reasoning About Nested Default
Conditionals . . . . . . . . . . . . . . 310
C. Witteveen and
C. Jonker Revision by Expansion in Logic Programs 333
A. I. Wasserman Information Systems Modernization . . . 1
R. Conradi and
M. Hagaseth and
C. Liu Planning Support for Cooperating
Transactions in EPOS . . . . . . . . . . 2--13
P. Marttiin Towards Flexible Process Support with a
CASE Shell . . . . . . . . . . . . . . . 14--27
J. Lonchamp A Collaborative Process-Centered
Environment Kernel . . . . . . . . . . . 28--41
G. Lu and
M. Ader Building Workflow Applications on Top of
WooRKS . . . . . . . . . . . . . . . . . 42--52
J. A. Gulla and
O. I. Lindland Modelling Cooperative Work for Workflow
Management . . . . . . . . . . . . . . . 53--65
H. Tarumi and
A. Tabuchi and
K. Yoshifu IKUMI: A Groupware Development Support
System with Visual Environment . . . . . 66--79
V. Van Swede and
H. Van Vliet Consistent Development: Results of a
First Empirical Study on the Relation
Between Project Scenario and Success . . 80--93
A. I. Anton and
W. M. McCracken and
C. Potts Goal Decomposition and Scenario Analysis
in Business Process Reengineering . . . 94--104
H. F. Hofmann and
R. Holbein Reaching out for Quality: Considering
Security Requirements in the Design of
Information Systems . . . . . . . . . . 105--118
W. Wei Song Capturing Semantics by Object Relativity 119--134
R. B. Jackson and
D. W. Embley and
S. N. Woodfield Automated Support for the Development of
Formal Object-Oriented Requirements
Specifications . . . . . . . . . . . . . 135--148
C. Cauvet and
F. Semmak Abstraction Forms in Object-Oriented
Conceptual Modelling: Localization,
Aggregation and Generalization
Extensions . . . . . . . . . . . . . . . 149--171
C. Nellborn and
P. Holm Capturing Information Systems
Requirements Through Enterprise and
Speech Act Modelling . . . . . . . . . . 172--185
M. Teisseire and
P. Poncelet and
R. Cicchetti Dynamic Modelling with Events . . . . . 186--199
P. Johannesson Representation and Communication in
Information Systems --- A Speech Act
Based Approach . . . . . . . . . . . . . 200--213
K. Kurbel From Analysis to Code Generation:
Experiences from an Information
Engineering Project Using I-CASE
Technology . . . . . . . . . . . . . . . 214--227
P. C.-Y. Sheu and
S. Yoo A Knowledge-Based Program Transformation
System . . . . . . . . . . . . . . . . . 228--241
M. Bonjour and
G. Falquet Concept Bases: A Support to Information
Systems Integration . . . . . . . . . . 242--255
D. Seo and
P. Loucopoulos Formalisation of Data and Process Model
Reuse Using Hierarchic Data Types . . . 256--268
S. Jarzabek and
Chew Lim Tan Modelling Multiple Views of Common
Features in Software Reengineering for
Reuse . . . . . . . . . . . . . . . . . 269--282
B. Freitag A Hypertext-Based Tool for Large Scale
Software Reuse . . . . . . . . . . . . . 283--296
C. Thieme and
A. Siebes An Approach to Schema Integration Based
on Transformations and Behaviour . . . . 297--310
M. R. Sancho and
A. Olive Deriving Transaction from Deductive
Conceptual Models of Information Systems 311--324
L. M. Keszenheimer Utilizing Behavioral Abstractions to
Facilitate Maintenance During Class
Evolution . . . . . . . . . . . . . . . 325--338
N. Prakash A Process View of Methodologies . . . . 339--352
M. Saeki and
K. Wenyin Specifying Software Specification and
Design Methods . . . . . . . . . . . . . 353--366
M. Moreno and
C. Rolland and
C. Souveyet A Generic Approach to Support a
Way-of-Working Definition . . . . . . . 367--379
K. Aberer and
W. Klas and
A. L. Furtado Designing a User-Oriented Query
Modification Facility in Object-Oriented
Database Systems . . . . . . . . . . . . 380--393
P. Rosengren Using Visual ER Query Systems in Real
World Applications . . . . . . . . . . . 394--405
E. Odberg Category Classes: Flexible
Classification and Evolution in
Object-Oriented Databases . . . . . . . 406--419
N. Andersen and
N. D. Jones Generalizing Cook's Transformation to
Imperative Stack Programs . . . . . . . 1--18
J. Berstel A Rewriting of Fife's Theorem About
Overlap-Free Words . . . . . . . . . . . 19--29
W. Brauer and
U. Brauer Reconsidering the Jeep Problem --- Or
How to Transport a Birthday Present to
Salosauna --- . . . . . . . . . . . . . 30--33
A. Brueggemann-Klein and
P. Fischer and
T. Ottmann Learning Picture Sets from Examples . . 34--43
C. Calude and
H. Juergensen Randomness as an Invariant for Number
Representations . . . . . . . . . . . . 44--66
E. Csuhaj-Varju Cooperating Grammars' Systems: Power and
Parameters . . . . . . . . . . . . . . . 67--84
K. Culik and
J. Kari Parallel Pattern Generation with One-Way
Communications . . . . . . . . . . . . . 85--96
A. Ehrenfeucht and
G. Rozenberg Dynamic Labeled 2-Structures with
Variable Domains . . . . . . . . . . . . 97--123
J. Engelfriet Deciding the NTS Property of
Context-Free Grammars . . . . . . . . . 124--130
F. Gecseg Homomorphic Representations by Products
of Tree Automata . . . . . . . . . . . . 131--139
T. Harju and
H. J. Hoogeboom and
H. C. M. Kleijn Identities and Transductions . . . . . . 140--144
T. Harju and
G. Rozenberg Decomposition of Infinite Labeled
2-Structures . . . . . . . . . . . . . . 145--158
J. Honkala An Iteration Property of Lindenmayerian
Power Series . . . . . . . . . . . . . . 159--168
J. Hromkovic and
J. Karhumaeki and
A. Lepistoe Comparing Descriptional and
Computational Complexity of Infinite
Words . . . . . . . . . . . . . . . . . 169--182
O. H. Ibarra and
T. Jiang On Some Open Problems Concerning the
Complexity of Cellular Arrays . . . . . 183--196
L. Kari Power of Controlled Insertion and
Deletion . . . . . . . . . . . . . . . . 197--212
A. Kelemenova and
J. Kelemen From Colonies to Eco(grammar)systems . . 213--231
W. Kuich On the Multiplicity Equivalence Problem
for Context-free Grammars . . . . . . . 232--250
G. S. Makanin and
H. Abdulrab On General Solution of Word Equations 251--263
A. Mateescu On (Left) Partial Shuffle . . . . . . . 264--278
H. Maurer Learning Theoretical Aspects is
Important but (Sometimes) Dangerous . . 279--288
M. Nielsen and
C. Clausen Bisimulation, Games, and Logic . . . . . 289--306
V. Niemi and
A. Renvall Cryptographic Protocols and Voting . . . 307--316
H. Nurmi Cryptographic Protocols for Auctions and
Bargaining . . . . . . . . . . . . . . . 317--324
G. Paun and
J. Dassow and
S. Skalla On the Size of Components of Cooperating
Grammar Systems . . . . . . . . . . . . 325--343
A. Paz An Elementary Algorithmic Problem from
an Advanced Standpoint . . . . . . . . . 344--357
K. Ruohonen Event Detection for ODEs and
Nonrecursive Hierarchies . . . . . . . . 358--371
K. Salomaa and
D. Wood and
S. Yu Rediscovering Pushdown Machines . . . . 372--385
I. Simon String Matching Algorithms and Automata 386--395
M. Steinby Classifying Regular Languages by Their
Syntactic Algebras . . . . . . . . . . . 396--409
P. Turakainen On Polynomial Matrix Equations X0T =
p(X) and X = p(X) Where all Parameters
are Nonnegative . . . . . . . . . . . . 410--421
E. Welzl Gram's Equation --- A Probabilistic
Proof . . . . . . . . . . . . . . . . . 422--424
F. Ablayev Lower Bounds for Probabilistic Space
Complexity: Communication-Automata
Approach . . . . . . . . . . . . . . . . 1
H. R. Andersen On Model Checking Infinite-State Systems 8
D. A. Archangelsky and
M. I. Dekhtyar and
E. Kruglov and
I. K. Musikaev Concurrency Problem for Horn Fragment of
Girard's Linear Logic . . . . . . . . . 18
S. Artemov and
V. Krupski Referential Data Structures and Labeled
Modal Logic . . . . . . . . . . . . . . 23
A. Asperti and
G. Dore Yet Another Correctness Criterion for
Multiplicative Linear Logic with MIX . . 34
S. A. Berezin and
N. V. Shilov An Approach to Effective Model-Checking
of Real-Time Finite-State Machines in
Mu-Calculus . . . . . . . . . . . . . . 47
C. Brown and
A. Jeffrey Allegories of Circuits . . . . . . . . . 56
C.-C. Chen and
I.-P. Lin The Complexity of Propositional Modal
Theories and the Complexity of
Consistency of Propositional Modal
Theories . . . . . . . . . . . . . . . . 69
A. M. Dekhtyar Multiplicative Linear Logic for Resource
Transformation Nets . . . . . . . . . . 81
R. G. Downey and
M. R. Fellows and
B. M. Kapron and
M. T. Hallett The Parameterized Complexity of Some
Problems in Logic and Linguistics . . . 89
D. Galmiche and
G. Perrier Foundations of Proof Search Strategies
Design in Linear Logic . . . . . . . . . 101
X. Ge and
A. Nerode On Extreme Points of Convex Compact
Turing Located Set . . . . . . . . . . . 114
S. Ghilezan Application of Typed Lambda Calculi in
the Untyped Lambda Calculus . . . . . . 129
S. S. Goncharov and
S. A. Badaev Classes with Pairwise Equivalent
Enumerations . . . . . . . . . . . . . . 140
P. De Groote Strong Normalization in a
Non-Deterministic Typed Lambda-Calculus 142
B. Heinemann On Expressive Completeness of Modal
Logic . . . . . . . . . . . . . . . . . 153
R. Hoofman Comparing Models of the Non-Extensional
Typed Lambda-Calculus . . . . . . . . . 164
B. Jacobs Coalgebras and Approximation . . . . . . 173
M. I. Kanovich Computational and Concurrency Models of
Linear Logic . . . . . . . . . . . . . . 184
Z. Khasidashvili The Longest Perpetual Reductions in
Orthogonal Expression Reduction Systems 191
B. Khoussainov and
A. Nerode The Notion of Rank and Games . . . . . . 204
M. Kuchuganov A Predicate Logic of Well-Founded
Actions . . . . . . . . . . . . . . . . 218
D. Leivant Predicative Recurrence in Finite Types 227
J. A. Makowsky and
Y. B. Pnueli Arity vs. Alternation in Second Order
Logic . . . . . . . . . . . . . . . . . 240
H. Nickau Hereditarily Sequential Functionals . . 253
U. Nitsche Propositional Linear Temporal Logic and
Language Homomorphisms . . . . . . . . . 265
R. P. Perez and
C. Even An Abstract Property of Confluence
Applied to the Study of the Lazy Partial
Lambda Calculus . . . . . . . . . . . . 278
A. Pliuskeviciene and
R. Pliuskevicius On Specialization of Derivations in
Axiomatic Equality Theories . . . . . . 291
V. V. Rybakov Preserving of Admissible Inference Rules
in Modal Logic . . . . . . . . . . . . . 304
P. Severi and
E. Poll Pure Type Systems with Definitions . . . 316
T. Sidon Craig Interpolation Property in Modal
Logics with Provability Interpretation 329
B. Traylor and
M. Gelfond Representing Null Values in Logic
Programming . . . . . . . . . . . . . . 341
S. Van Bakel and
L. Liquori and
S. R. Della Rocca and
P. Urzyczyn Comparing Cubes . . . . . . . . . . . . 353
W. Van der Hoek and
B. Van Linder and
J.-J. C. Meyer A Logic of Capabilities . . . . . . . . 366
V. Van Oostrom and
F. Van Raamsdonk Weak Orthogonality Implies Confluence:
The Higher-Order Case . . . . . . . . . 379
J. Slaney The crisis in finite mathematics:
Automated reasoning as cause and cure 1
T. Walsh A divergence critic . . . . . . . . . . 14
D. Hutter Synthesis of induction orderings for
existence proofs . . . . . . . . . . . . 29
M. Protzen Lazy generation of induction hypotheses 42
D. A. Plaisted The search efficiency of theorem proving
strategies . . . . . . . . . . . . . . . 57
C. Bourely and
R. Caferra and
N. Peltier A method for building models
automatically: Experiments with an
extension of OTTER . . . . . . . . . . . 72
P. Baumgartner and
U. Furbach Model elimination without
contrapositives . . . . . . . . . . . . 87
F. Bronsard and
U. S. Reddy and
R. W. Hasker Induction using term orderings . . . . . 102
Jacques Chazarain and
Emmanuel Kounalis Mechanizable inductive proofs for a
class of AE formulas . . . . . . . . . . 118
O. Lysne On the connection between narrowing and
proof by consistency . . . . . . . . . . 133
L. C. Paulson A fixedpoint approach to implementing
(co)inductive definitions . . . . . . . 148
C.-P. Wirth and
B. Gramlich On notions of inductive validity for
first-order equational clauses . . . . . 162
S. Baker A new application for explanation-based
generalisation within automated
deduction . . . . . . . . . . . . . . . 177
H. Chu and
D. A. Plaisted Semantically guided first-order theorem
proving using hyper-linking . . . . . . 192
D. A. De Waal and
J. P. Gallagher The applicability of logic program
analysis and transformation to theorem
proving . . . . . . . . . . . . . . . . 207
S. Bruening Detecting non-provable goals . . . . . . 222
R. S. Boyer and
N. G. De Bruijn and
G. Huet and
A. Trybulec A mechanically proof-checked
encyclopedia of mathematics: Should we
build one? Can we? . . . . . . . . . . . 237
G. Sutcliffe and
C. Suttner and
T. Yemenis The TPTP problem library . . . . . . . . 252
E. Domenjoud and
F. Klay and
C. Ringeissen Combination techniques for non-disjoint
equational theories . . . . . . . . . . 267
G. Salzer Primal grammars and unification modulo a
binary clause . . . . . . . . . . . . . 282
K. Iwanuma Conservative query normalization on
parallel circumscription . . . . . . . . 296
L. Fribourg and
M. Veloso Peixoto Bottom-up evaluation of datalog programs
with arithmetic constraints . . . . . . 311
V. Royer and
J. Joachim Quantz On intuitionistic query answering in
description bases . . . . . . . . . . . 326
M. Stickel and
R. Waldinger and
M. Lowry and
T. Pressburger Deductive composition of astronomical
software from subroutine libraries . . . 341
W. M. Farmer and
J. D. Guttman and
M. E. Nadel and
F. Javier Thayer Proof script pragmatics in IMPS . . . . 356
M. Kerber and
M. Kohlhase A mechanization of strong Kleene logic
for partial functions . . . . . . . . . 371
D. Wang Algebraic factoring and geometry theorem
proving . . . . . . . . . . . . . . . . 386
N. Freitag McPhee and
S.-C. Chou and
X.-S. Gao Mechanically proving geometry theorems
using a combination of Wu's method and
Collins' method . . . . . . . . . . . . 401
L. M. Hines Str+ve and integers . . . . . . . . . . 416
R. Platek What is a proof? . . . . . . . . . . . . 431
U. Martin Termination, geometry and invariants . . 432
L. Bachmair and
H. Ganzinger Ordered chaining for total orderings . . 435
A. Middeldorp and
H. Zantema Simple termination revisited . . . . . . 451
D. A. Basin and
T. Walsh Termination orderings for rippling . . . 466
D. B. Sturgill and
A. M. Segre A novel asynchronous parallelism scheme
for first-order logic . . . . . . . . . 484
J. Goubault Proving with BDDs and control of
information . . . . . . . . . . . . . . 499
P. Graf Extended path-indexing . . . . . . . . . 514
R. L. Constable Exporting and reflecting abstract
metamathematics . . . . . . . . . . . . 529
L. Vigneron Associative-Commutative deduction with
constraints . . . . . . . . . . . . . . 530
R. Nieuwenhuis and
A. Rubio AC-superposition with constraints: No
AC-unifiers needed . . . . . . . . . . . 545
M. Hermann and
P. G. Kolaitis The complexity of counting problems in
equational matching . . . . . . . . . . 560
P. Anderson Representing proof transformations for
program optimization . . . . . . . . . . 575
P. Jackson Exploring abstract algebra in
constructive type theory . . . . . . . . 590
A. Felty and
D. Howe Tactic theorem proving with
refinement-tree proofs and metavariables 605
P. Johann and
M. Kohlhase Unification in an extensional lambda
calculus with ordered function sorts and
constant overloading . . . . . . . . . . 620
C. Prehofer Decidable higher-order unification
problems . . . . . . . . . . . . . . . . 635
O. Mueller and
F. Weber Theory and practice of minimal modular
higher-order E- unification . . . . . . 650
R. Socher-Ambrosius A refined version of general
E-unification . . . . . . . . . . . . . 665
B. Beckert A completion-based method for mixed
universal and rigid E- unification . . . 678
R. Buendgen On pot, pans and pudding or how to
discover generalised critical pairs . . 693
S. Klingenbeck and
R. Haehnle Semantic tableaux with ordering
restrictions . . . . . . . . . . . . . . 708
F. Massacci Strongly analytic tableaux for normal
modal logics . . . . . . . . . . . . . . 723
X. Huang Reconstructing proofs at the assertion
level . . . . . . . . . . . . . . . . . 738
J. Zhang Problems on the generation of finite
models . . . . . . . . . . . . . . . . . 753
E. Clarke and
X. Zhao Combining symbolic computation and
theorem proving: Some problems of
Ramanujan . . . . . . . . . . . . . . . 758
J. Slaney and
E. Lusk and
W. W. McCune SCOTT: Semantically constrained OTTER 764
P. Baumgartner and
U. Furbach PROTEIN: A PROver with a Theory
Extension INterface . . . . . . . . . . 769
J. M. P. Schumann DELTA --- A bottom-up preprocessor for
top-down theorem provers . . . . . . . . 774
C. Goller and
R. Letz and
K. Mayr and
J. M. P. Schumann SETHEO V3.2: Recent developments . . . . 778
W. Bibel and
S. Bruening and
U. Egly and
T. Rath KoMeT . . . . . . . . . . . . . . . . . 783
X. Huang and
M. Kerber and
M. Kohlhase and
E. Melis -MKRP: A proof development environment 788
B. Beckert and
J. Posegga leanTAP: Lean tableau-based theorem
proving . . . . . . . . . . . . . . . . 793
J. Slaney FINDER: Finite domain enumerator . . . . 798
F. D. Portoraro Symlog: Automated advice in Fitch-style
proof construction . . . . . . . . . . . 802
X. Huang and
M. Kerber and
M. Kohlhase and
E. Melis KEIM: A toolkit for automated deduction 807
F. Pfenning Elf: A meta-language for deductive
systems . . . . . . . . . . . . . . . . 811
T. Ohtani and
H. Sawamura and
T. Minami EUODHILOS-II on top of GNU Epoch . . . . 816--820
L.- H. Eriksson Pi: An interactive derivation editor for
the calculus of partial inductive
definitions . . . . . . . . . . . . . . 821
B. L. Richards and
I. Kraan and
A. Smaill and
G. A. Wiggins Mollusc: A general proof-development
shell for sequent-based logics . . . . . 826
T. C. Wang and
A. Goldberg KITP-93: An automated inference system
for program analysis . . . . . . . . . . 831
A. Bouhoula SPIKE: A system for sufficient
completeness and parameterized inductive
proofs . . . . . . . . . . . . . . . . . 836
M. P. Bonacina and
W. W. McCune Distributed theorem proving by Peers . . 841
E. M. Clarke Automatic verification of finite-state
concurrent systems . . . . . . . . . . . 1
F. DiCesare and
P. T. Kulp and
M. Gile and
G. List The application of Petri nets to the
modeling, analysis and control of
intelligent urban traffic networks . . . 2
J. Meseguer and
U. Montanari and
V. Sassone On the model of computation of
place/transition Petri nets . . . . . . 16
C. Anglano and
L. Portinale B-W analysis: a backward reachability
analysis for diagnostic problem solving
suitable to parallel implementation . . 39
N. Bennacer and
G. Florin and
C. Fraize and
S. Natkin Probabilistic validation of a remote
procedure call protocol . . . . . . . . 59
G. Berthelot and
H. Boucheneb Occurrence graphs for interval timed
coloured nets . . . . . . . . . . . . . 79
J. L. Briz and
J. M. Colom Implementation of weighted
place/transition nets based on linear
enabling functions . . . . . . . . . . . 99
P. Buchholz Hierarchical high level Petri nets for
complex system analysis . . . . . . . . 119
G. Chiola and
G. Franceschinis and
R. Gaeta Modelling symmetric computer
architectures by SWNs . . . . . . . . . 139
S. Christensen and
N. D. Hansen Coloured Petri nets extended with
channels for synchronous communication 159
G. Ciardo Petri nets with marking-dependent arc
cardinality: properties and analysis . . 179
J. M. Couvreur and
E. Paviot-Adet New structural invariants for Petri nets
analysis . . . . . . . . . . . . . . . . 199
M. Diaz and
P. Senac Time stream Petri nets: a model for
timed multimedia information . . . . . . 219
C. Dietz and
G. Schreiber A term representation of P/T systems . . 239
S. Donatelli Superposed Generalized Stochastic Petri
nets: definition and efficient solution 258
H. J. Genrich and
H.-M. Hanisch and
K. Woellhaf Verification of recipe-based control
procedures by means of
predicate/transition nets . . . . . . . 278
R. K. Keller and
M. Ozkan and
X. Shen Towards comprehensive support for the
dynamic analysis of Petri net based
models . . . . . . . . . . . . . . . . . 298
M. Koutny Partial order semantics of box
expressions . . . . . . . . . . . . . . 318
C. Lakos and
S. Christensen A general systematic approach to arc
extensions for coloured Petri nets . . . 338
K. Lautenbach and
H. Ridder Liveness in bounded Petri nets which are
covered by $t$-invariants . . . . . . . 358
K. H. Mortensen and
V. Pinci Modelling the work flow of a nuclear
waste management program . . . . . . . . 376
D. S. Nielsen and
L. Kleinrock Data structures and algorithms for
extended state space and structural
level reduction of the GSPN model . . . 396
E. Pastor and
O. Roig and
J. Cortadella and
R. M. Badia Petri net analysis using Boolean
manipulation . . . . . . . . . . . . . . 416
W. Ruckdeschel and
R. Onken Modelling of pilot behaviour using Petri
nets . . . . . . . . . . . . . . . . . . 436
G. Scheschonk and
M. Timpe Simulation and analysis of a document
storage system . . . . . . . . . . . . . 454
C. Sibertin-Blanc Cooperative nets . . . . . . . . . . . . 471
E. Teruel and
M. Silva Well-formedness of equal conflict
systems . . . . . . . . . . . . . . . . 491
M. Tiusanen Symbolic, symmetry, and stubborn set
searches . . . . . . . . . . . . . . . . 511
A. Valmari Compositional analysis with
place-bordered subnets . . . . . . . . . 531
K. Varpaaniemi On combining the stubborn set method
with the sleep set method . . . . . . . 548
A. Yakovlev and
M. Kishinevsky and
A. Kondratyev and
L. Lavagno OR causality: modelling and hardware
implementation . . . . . . . . . . . . . 568
A. Asperti and
C. Laneve Interaction Systems . . . . . . . . . . 1--19
S. Van Bakel and
M. Fernandez Strong Normalization of Typeable Rewrite
Systems . . . . . . . . . . . . . . . . 20--39
F. Bellegarde A Transformation System Combining
Partial Evaluation with Term Rewriting 40--55
R. Berghammer and
T. F. Gritzner and
G. Schmidt Prototyping Relational Specifications
Using Higher-Order Objects . . . . . . . 56--75
A. Van Deursen and
T. B. Dinesh Origin Tracking for Higher-Order Term
Rewriting Systems . . . . . . . . . . . 76--95
W. H. Farmer Theory Interpretation in Simple Type
Theory . . . . . . . . . . . . . . . . . 96--123
R. Grosu and
F. Regensburger The Semantics of Spectrum . . . . . . . 124--145
B. M. Hearn and
K. Meinke ATLAS: A Typed Language for Algebraic
Specification . . . . . . . . . . . . . 146--168
S. Kahrs Compilation of Combinatory Reduction
Systems . . . . . . . . . . . . . . . . 169--188
K. Meinke and
L. J. Steggles Specification and Verification in
Higher-Order Algebra: A Case Study of
Convolution . . . . . . . . . . . . . . 189--222
B. Moeller Ordered and Continuous Models of
Higher-Order Specifications . . . . . . 223--255
V. Van Oostrom and
F. Van Raamsdonk Comparing Combinatory Reduction Systems
and Higher-Order Rewrite Systems . . . . 276--304
J. Van de Pol Termination Proofs for Higher-Order
Rewrite Systems . . . . . . . . . . . . 305--325
P.-Y. Schobbens Extensions of Initial Models and their
Second-Order Proof Systems . . . . . . . 326--344
A. G. Ferreira and
M. D. Grammatikakis Improved Probabilistic Routing on
Generalized Hypercubes . . . . . . . . . 1
J. Liu and
W.-J. Hsu Efficient Data Communication in
Incomplete Hypercubes . . . . . . . . . 13
S. R. Oehring and
S. K. Das Efficient Communication in the Folded
Petersen Interconnection Networks . . . 25
P. Lincoln and
N. Marti-Oliet and
J. Meseguer and
L. Ricciulli Compiling Rewriting onto SIMD and
MIMD/SIMD Machines . . . . . . . . . . . 37
S. Pande and
K. Psarris A Compilation Technique for Varying
Communication Cost NUMA Architectures 49
M. O'Boyle A Data Partitioning Algorithm for
Distributed Memory Compilation . . . . . 61
M. Fiallos Aguilar and
J. Duprat Towards a High Precision Massively
Parallel Computer . . . . . . . . . . . 73
A. Vergis and
V. Verykios On the Testability of Purely Recursive
Digital Filters . . . . . . . . . . . . 85
R. P. Hopkins Voting on Synchronous Communications . . 97
A. Benslimane Protocol Validation: A Parallel
Technique to Reduce the Reachability
Tree . . . . . . . . . . . . . . . . . . 109
E. Bampis and
J.-C. Koenig and
D. Trystram Optimal Parallel Execution of Complete
Binary Trees and Grids into Most Popular
Interconnection Networks . . . . . . . . 122
S. Olariu and
I. Stojmenovic Time-Optimal Nearest-Neighbor
Computations on Enhanced Meshes . . . . 134
V. Leppaenen and
M. Penttonen Simulation of PRAM Models on Meshes . . 146
M. J. Atallah and
A. Fabri On the Multisearching Problem for
Hypercubes . . . . . . . . . . . . . . . 159
P. Prather Pineo Code Liberation --- A Tool for Refitting
Code to a Parallel Environment . . . . . 167
S. D. Prestwich and
A. J. Kusalik High-Level Visualization of Parallel
Logic Program Execution . . . . . . . . 180
S. T. Hackstadt and
A. D. Malony Next-Generation Parallel Performance
Visualization: A Prototyping Environment
for Visualization Development . . . . . 192
J. L. Sharnowski and
B. H. C. Cheng A Formal Approach to Modeling Expected
Behavior in Parallel Program
Visualizations . . . . . . . . . . . . . 202
H. K. Dai An Improvement in the Size-Depth
Tradeoff for Strictly Non-Blocking
Generalized-Concentration Networks . . . 214
T. Ishikawa Bypass Strategy in Hypercube
Multiprocessors by Adding Bus
Connections . . . . . . . . . . . . . . 226
K. Ghose OPTIMUL: A Hybrid Multiprocessor for
Distributed and Shared Memory
Multiprocessing with WDM Optical Fiber
Interconnections . . . . . . . . . . . . 238
L. D. J. C. Loyens and
J. R. Moonen ILIAS: A Sequential Language for
Parallel Matrix Computations . . . . . . 250
D. Gautier de Lahaut and
C. Germain Static Communications in Parallel
Scientific Programs . . . . . . . . . . 262
T. Rauber and
G. Ruenger Load Balancing for Extrapolation Methods
on Distributed Memory Multiprocessors 277
W. Ertel On the Definition of Speedup . . . . . . 289
H. Wabnig and
G. Haring Petri Net Performance Models of Parallel
Systems --- Methodology and Case Study 301
L. H. Ziantz and
C. C. Oezturan and
B. K. Szymanski Run-Time Optimization of Sparse
Matrix-Vector Multiplication on SIMD
Machines . . . . . . . . . . . . . . . . 313
A. Wakatani and
M. Wolfe A New Approach to Array Redistribution:
Strip Mining Redistribution . . . . . . 323
C. Carreras and
C. A. Lopez and
M. Hermenegildo Analytic Model of a Cache only Memory
Architecture . . . . . . . . . . . . . . 336
A. Agarwal and
J. V. Guttag and
C. N. Hadjicostis and
M. C. Papaefthymiou Memory Assignment for Multiprocessor
Caches Through Grey Coloring . . . . . . 351
H. Nilsson and
P. Stenstroem An Adaptive Update-Based Cache Coherence
Protocol for Reduction of Miss Rate and
Traffic . . . . . . . . . . . . . . . . 363
A. J. Bennett and
P. H. J. Kelly Eliminating Invalidation in
Coherent-Cache Parallel Graph Reduction 375
F. Zhang and
E. H. D'Hollander Enhancing Parallelism by Removing Cyclic
Data Dependencies . . . . . . . . . . . 387
K. Takeuchi and
K. Honda and
M. Kubo An Interaction-Based Language and Its
Typing System . . . . . . . . . . . . . 398
C. V. Papadopoulos On the Parallelism of Data . . . . . . . 414
V. Thudichum Vasconcelos Predicative Polymorphism in $ \pi
$-Calculus . . . . . . . . . . . . . . . 425--437
K. Shen Improving the Execution of the Dependent
And-Parallel Prolog DDAS . . . . . . . . 438
P. Kacsuk OR-Parallel Prolog on Distributed Memory
Systems . . . . . . . . . . . . . . . . 453
H. Kuchen and
R. Plasmeijer and
H. Stoltze Efficient Distributed Memory
Implementation of a Data Parallel
Functional Language . . . . . . . . . . 464
D. Abramson and
M. Cope and
R. McKenzie Modelling Photochemical Pollution Using
Parallel and Distributed Computing
Platforms . . . . . . . . . . . . . . . 478
J. M. Bull and
T. L. Freeman Parallel Algorithms and Interval
Selection Strategies for Globally
Adaptive Quadrature . . . . . . . . . . 490
O. Brudaru and
G. M. Megson Systolic Designs for Evaluating Linear
Combinations of Chebyshev Polynomials 502
B. Dageville and
P. Casadessus and
P. Borla-Salamet The Impact of the KSR1 Allcache
Architecture on the Behavior of the DBS3
Parallel DBMS . . . . . . . . . . . . . 514
F. K. Liotopoulos Sparse Generalized HyperGrids for
Performance Scalability . . . . . . . . 526
I. Puaut A Distributed Garbage Collector for
Active Objects . . . . . . . . . . . . . 539
A. G. Ferreira and
A. G. Vel Lejbman and
S. W. Song Bus-Based Parallel Computers: A Viable
Way for Massive Parallelism . . . . . . 553
C. Barrado and
J. Labarta and
P. Borensztejn Implementation of GTS . . . . . . . . . 565
C. Kim and
J.-L. Gaudiot A Hierarchical Activation Management
Technique for Fine-Grain Multithreaded
Execution . . . . . . . . . . . . . . . 577
N. Mehdiratta and
K. Ghose Scheduling Task Graphs onto Distributed
Memory Multiprocessors Under Realistic
Constraints . . . . . . . . . . . . . . 589
C. V. Papadopoulos A Dynamic Algorithm for Online
Scheduling of Parallel Processes . . . . 601
F. Boniol COREA: A Synchronous Calculus of
Parallel Communicating Reactive Automata 611
R. Janicki and
M. Koutny Deriving Histories of Nets with Priority
Relation . . . . . . . . . . . . . . . . 623
M. Radestock and
S. Eisenbach What Do You Get from a $ {\Pi }
$-Calculus Semantics? . . . . . . . . . 635--647
P. Viry Rewriting: An Effective Model of
Concurrency . . . . . . . . . . . . . . 648
R. J. Fowler and
L. Kontothanassis Mercury: Object-Affinity Scheduling and
Continuation Passing on Multiprocessors 661
A.-H. Smai and
L.- E. Thorelli Dynamic Allocation of Communication
Bandwidth in Multicomputers . . . . . . 677
A. K. Gupta and
A. G. Photiou Load-Balanced Priority Queues on
Distributed Memory Machines . . . . . . 689
J. L. Roch and
G. Villard Parallel Computations with Algebraic
Numbers --- A Case Study: Jordan Normal
Form of Matrices . . . . . . . . . . . . 701
P. Ferragina and
F. Luccio Batch Dynamic Algorithms for Two Graph
Problems . . . . . . . . . . . . . . . . 713
M. Schollmeyer and
B. McMillin A General Method for Maximizing the
Error-Detecting Ability of Distributed
Algorithms . . . . . . . . . . . . . . . 725
C. Mourlas and
C. Halatsis MAGE: A Massively Agent Execution System
for Logic Programming . . . . . . . . . 737
G. Caplain and
R. Lalement and
T. Salset Checking the Serial Correctness of
Control-Parallel Programs . . . . . . . 741
G. Stellner and
A. Bode and
S. Lamberts and
T. Ludwig NXLib --- A Parallel Programming
Environment for Workstation Clusters . . 745
A. Hondroudakis and
R. Procter Applying Human Factors Techniques to the
Design of a Tool for Parallel Program
Performance Analysis and Tuning . . . . 749
J. Desbiens and
M. Toulouse and
M. Lavoie and
S. Pouzyreff An Actor-Based Programming System for
Heterogeneous Processing . . . . . . . . 753
R. Peña and
L. A. Galán Introducing Fairness in CSP Systems
Specified with State Variables . . . . . 757--760
S. Kusakabe and
E. Takahashi and
R.-I. Taniguchi and
M. Amamiya A Dataflow-Based Massively Parallel
Programming Language and Its
Implementation . . . . . . . . . . . . . 761
A. Listl Using Subpages for Coherency Control in
Parallel Database Systems . . . . . . . 765
C. Verdier and
A. Lafage and
E. Boutillon and
A. Demeure A New Multi-Dimensional Interconnection
Network for SIMD Architectures . . . . . 769
M. Neschen and
M. Gumm A Scalable Bit-Sequential SIMD
Architecture for Pattern Recognition . . 773
S. P. S. Lam An Iterative Array Processor
Architecture for Matrix Computation . . 777
T. Kawano and
S. Kusakabe and
R.-I. Taniguchi and
M. Amamiya Datarol-II: A Fine-Grain Massively
Parallel Architecture . . . . . . . . . 781
N. Kalantery and
S. C. Winter and
D. R. Wilson From BSP to a Virtual von Neumann
Machine . . . . . . . . . . . . . . . . 785
H. Okada and
K. Matsumoto and
M. Kitsuregawa Data Parallel Relational Database
Processing on the Connection Machine
CM-2 with Data Vault . . . . . . . . . . 789
A. R. Hurson and
J. T. Lim and
B. Shirazi and
K. Kavi Staggered Scheme: A Loop Allocation
Policy . . . . . . . . . . . . . . . . . 793
R. Borut and
J. Silc Using Parallel Simulated Annealing in
the Mapping Problem . . . . . . . . . . 797
T. Johansson and
E. Bengtsson A New Parallel MIND Connected Component
Labeling Algorithm . . . . . . . . . . . 801
E. Markatos and
C. E. Chronaki Using Reference Counters in Update-Based
Coherent Memory . . . . . . . . . . . . 805
H. Schepers Compositional Reasoning About Real-Time
Distributed Systems with Limited
Resources . . . . . . . . . . . . . . . 809
D. Lioupis and
M. Stefanidakis Dynamic Load Balancing on a
Virtually-Shared Memory Parallel
Computer System . . . . . . . . . . . . 813
J. Schumann and
M. Jobmann Analysing the Load Balancing Scheme of a
Parallel System on Multiprocessors --- A
Modeling Approach . . . . . . . . . . . 819
S. S. Nemawarkar and
R. Govindarajan and
G. R. Gao and
V. K. Agarwal Performance of Interconnection Network
in Multithreaded Architectures . . . . . 823
L. M. B. Lopes and
F. M. A. Silva Scheduling Algorithms Performance with
the pSystem Parallel Programming
Environment . . . . . . . . . . . . . . 827
S.-W. Seo and
T.-Y. Feng A New Routing Scheme for Concatenating
Two Omega Networks . . . . . . . . . . . 831
R. Alur and
L. Fix and
T. A. Henzinger A Determinizable Class of Timed Automata 1
R. Gorrieri and
G. Siliprandi Real-Time System Verification Using P/T
Nets . . . . . . . . . . . . . . . . . . 14
W. K. C. Lam and
R. K. Brayton Criteria for the Simple Path Property in
Timed Automata . . . . . . . . . . . . . 27
K. L. McMillan Hierarchical Representations of Discrete
Functions, with Application to Model
Checking . . . . . . . . . . . . . . . . 41
B. Boigelot and
P. Wolper Symbolic Verification with Periodic Sets 55
J. R. Burch and
D. L. Dill Automatic Verification of Pipelined
Microprocessor Control . . . . . . . . . 68
A. Olivero and
J. Sifakis and
S. Yovine Using Abstractions for the Verification
of Linear Hybrid Systems . . . . . . . . 81
A. Puri and
P. Varaiya Decidability of Hybrid Systems with
Rectangular Differential Inclusions . . 95
J. McManis and
P. Varaiya Suspension Automata: A Decidable Class
of Hybrid Automata . . . . . . . . . . . 105
A. Bouajjani and
R. Echahed and
R. Robbana Verification of Context-Free Timed
Systems Using Linear Hybrid Observers 118
M. Mihail and
C. H. Papadimitriou On the Random Walk Method for Protocol
Testing . . . . . . . . . . . . . . . . 132
O. Bernholtz and
M. Y. Vardi and
P. Wolper An Automata-Theoretic Approach to
Branching-Time Model Checking . . . . . 142
A. Anuchitanukul and
Z. Manna Realizability and Synthesis of Reactive
Modules . . . . . . . . . . . . . . . . 156
H. Hungar Model Checking of Macro Processes . . . 169
I. Beer and
S. Ben-David and
D. Geist and
R. Gewirtzman Methodology and System for Practical
Formal Verification of Reactive Hardware 182
V. G. Naik and
A. P. Sistla Modeling and Verification of a Real Life
Protocol Using Symbolic-Model Checking 194
S. Graf Verification of a Distributed Cache
Memory by Using Abstractions . . . . . . 207
Z. Manna Beyond Model Checking . . . . . . . . . 220
R. P. Kurshan Models Whose Checks Don't Explode . . . 222
F. Balarin and
A. L. Sangiovanni-Vincentelli On the Automatic Computation of Network
Invariants . . . . . . . . . . . . . . . 234
D. Cyrluk and
P. Narendran Ground Temporal Logic: A Logic for
Hardware Verification . . . . . . . . . 247
E. T. Schubert A Hybrid Model for Reasoning about
Composed Hardware Systems . . . . . . . 260
S. Hazelhurst and
C.-J. H. Seger Composing Symbolic Trajectory Evaluation
Results . . . . . . . . . . . . . . . . 273
Z. Zhu and
C.-J. H. Seger The Completeness of a Hardware Inference
System . . . . . . . . . . . . . . . . . 286
D. Geist and
I. Beer Efficient Model Checking by Automated
Ordering of Transition Relation
Partitions . . . . . . . . . . . . . . . 299
V. Singhal and
C. Pixley The Verification Problem for Safe
Replaceability . . . . . . . . . . . . . 311
A. Aziz and
T. R. Shiple and
V. Singhal and
A. L. Sangiovanni-Vincentelli Formula-Dependent Equivalence for
Compositional CTL Model Checking . . . . 324
D. E. Long and
A. Browne and
E. M. Clarke and
S. Jha An Improved Algorithm for the Evaluation
of Fixpoint Expressions . . . . . . . . 338
O. V. Sokolsky and
S. A. Smolka Incremental Model Checking in the Modal
Mu-Calculus . . . . . . . . . . . . . . 351
B. Cousin and
J. Helary Performance Improvement of State Space
Exploration by Regular and Differential
Hashing Functions . . . . . . . . . . . 364
D. Peled Combining Partial Order Reductions with
On-the-Fly Model-Checking . . . . . . . 377
R. Hojati and
R. Mueller-Thuns and
R. K. Brayton Improving Language Containment Using
Fairness Graphs . . . . . . . . . . . . 391
I. Lee and
S. Rajasekaran A Parallel Algorithm for Relational
Coarsest Partition Problems and Its
Implementation . . . . . . . . . . . . . 404
E. Clarke and
O. Grumberg and
K. Hamaguchi Another Look at LTL Model Checking . . . 415
B. Victor and
F. Moller The Mobility Workbench: A Tool for the
Pi-Calculus . . . . . . . . . . . . . . 428
R. De Simone and
A. Ressouche Compositional Semantics of Esterel and
Verification by Compositional Reductions 441
D. Dams and
R. Gerth and
G. Doehmen and
R. Herrmann Model Checking Using Adaptive State and
Data Abstraction . . . . . . . . . . . . 455
T. G. Rokicki and
C. J. Myers Automatic Verification of Timed Circuits 468
M. Yap Developing the Singapore National
Information Infrastructure . . . . . . . 1
P. Godfrey and
J. Minker and
L. Novik An Architecture for a Cooperative
Database System . . . . . . . . . . . . 3
H. Samet Spatial Databases . . . . . . . . . . . 25
A. Buchmann Database Management for Real-Time
Applications . . . . . . . . . . . . . . 26
M. Zloof and
R. Krishnamurthy The Evolution of User Interface Tools
for Database Applications . . . . . . . 27
S. M. Sripada and
B. L. Rosser and
J. M. Bedford and
R. A. Kowalski Temporal Database Technology for Air
Traffic Flow Management . . . . . . . . 28
O. Johansson Using an Extended ER-Model Based Data
Dictionary to Automatically Generate
Product Modeling Systems . . . . . . . . 42
B. K. Ehlmann and
G. A. Riccardi A Notation for Describing Aggregate
Relationships in an Object-Oriented Data
Model . . . . . . . . . . . . . . . . . 62
M. Ketabchi and
N. Sehgal and
S. Dasananda and
R. Mikkilineni Modeling Activities of Application
Domains . . . . . . . . . . . . . . . . 78
H. Lu and
B.-C. Ooi and
Kian Lee Tan Efficient Image Retrieval by Color
Contents . . . . . . . . . . . . . . . . 95
J. K. Wu and
B. M. Mehtre and
Y. J. Gao and
P. C. Lam STAR --- A Multimedia Database System
for Trademark Registration . . . . . . . 109
M. P. Consens and
M. Z. Hasan and
A. O. Mendelzon Visualizing and Querying Distributed
Event Traces with Hy0+ . . . . . . . . . 123
M. Arikawa and
H. Kawakita and
Y. Kambayashi Dynamic Maps as Composite Views of
Varied Geographic Database Servers . . . 142
R. Kramer and
H. Spandl Limits Database for an Environmental
Information System --- A Fuzzy Set-based
Querying Approach . . . . . . . . . . . 158
E. Baralis and
S. Ceri and
S. Paraboschi and
G. Monteleone An Intelligent Database System
Application: The Design of EMS . . . . . 172
R. Chandra and
A. Segev Using Next Generation Databases to
Develop Financial Applications . . . . . 190
M. Cochinwala and
J. Bradley and
R. Tanamy and
R. Subramanian A Multidatabase Solution for a Financial
Application . . . . . . . . . . . . . . 204
K. Orsborn Applying Next Generation Object-Oriented
DBMS to Finite Element Analysis . . . . 215
P. De Smedt and
J. Annevelink and
T. Pham and
P. Strong A Physician's Workstation as an
Application of Object-Oriented Database
Technology in Healthcare . . . . . . . . 234
M. Persin and
J. Zobel and
R. Sacks-Davis Fast Document Ranking for Large Scale
Information Retrieval . . . . . . . . . 253
G. E. Blake and
M. P. Consens and
P. Kilpelaeinen and
P.-A. Larson Text/Relational Database Management
Systems: Harmonizing SQL and SGML . . . 267
H. Thimm and
T. C. Rakow A DBMS-Based Multimedia Archiving
Teleservice Incorporating Mail . . . . . 281
J. Carlis and
J. Riedl and
A. Georgopoulos and
G. Wilcox A Zoomable DBMS for Brain Structure,
Function and Behavior . . . . . . . . . 299
G. J. L. Kemp and
Z. Jiao and
P. M. D. Gray and
J. E. Fothergill Combining Computation with Database
Access in Biomolecular Computing . . . . 317
M. Nakanishi and
A. Hashimoto and
M. Ito An Object-Oriented Database of Protein
Structure Data . . . . . . . . . . . . . 336
H.-J. Appelrath and
H. Behrends and
H. Jasper and
V. Kamp Active Database Technology Supports
Cancer Clustering . . . . . . . . . . . 351
F. Matthes and
A. Rudloff and
J. W. Schmidt and
K. Subieta A Gateway from DBPL to Ingres . . . . . 365
E. Radeke and
M. H. Scholl Federation and Stepwise Reduction of
Database Systems . . . . . . . . . . . . 381
D. Aebi and
R. Largo Methods and Tools for Data Value
Re-Engineering . . . . . . . . . . . . . 400
J. Durand and
M. Ganti and
R. Salinas Object View Broker: A Mediation Service
and Architecture to Provide
Object-Oriented Views of Heterogeneous
Databases . . . . . . . . . . . . . . . 415
R. Rastogi and
M.-A. Neimat Enhancing Pre-Existing Data Managers
with Atomicity and Durability . . . . . 429
P. Paradinas and
J.-J. Vandewalle A Personal and Portabel Database Server:
The CQL Card . . . . . . . . . . . . . . 444
R. Gallersdoerfer and
M. Jarke and
K. Klabunde Intelligent Networks as a Data Intensive
Application (INDIA) . . . . . . . . . . 458
P. Pudlak Unexpected Upper Bounds on the
Complexity of Some Communication Games 1
H. Fernau and
L. Staiger Valuations and Unambiguity of Languages,
with Applications to Fractal Geometry 11
H. T. Siegelmann On The Computational Power of
Probabilistic and Faulty Neural Networks 23
K. Cerans Deciding Properties of Integral
Relational Automata . . . . . . . . . . 35
Y. Aumann and
J. Bar-Ilan and
U. Feige On the Cost of Recomputing: Tight Bounds
on Pebbling with Faults . . . . . . . . 47
E. Asarin and
O. Maler On some Relations between Dynamical
Systems and Transition Systems . . . . . 59
N. Globerman and
D. Harel Complexity Results for Multi-Pebble
Automata and their Logics . . . . . . . 73
P. C. Kanellakis and
G. G. Hillebrand and
H. G. Mairson An Analysis of the Core-ML Language:
Expressive Power and Type Reconstruction 83
M. Gyssens and
J. Van den Bussche and
D. Van Gucht Expressiveness of Efficient
Semi-Deterministic Choice Constructs . . 106
E. Graedel and
Y. Gurevich Tailoring Recursion for Complexity . . . 118
N. Klarlund and
M. Mukund and
M. Sohoni Determinizing Asynchronous Automata . . 130
A. Muscholl On the Complementation of Buechi
Asynchronous Cellular Automata . . . . . 142
F. Corradini and
R. De Nicola Distribution and Locality of Concurrent
Systems . . . . . . . . . . . . . . . . 154
R. Gawlick and
R. Segala and
J. Soegaard-Andersen and
N. Lynch Liveness in Timed and Untimed Systems 166
J. R. Sanchez-Couso and
M. I. Fernandez-Camacho Average-case Analysis of
Pattern-Matching in Trees under the BST
Probability Model . . . . . . . . . . . 178
T. Jiang and
M. Li On the Approximation of Shortest Common
Supersequences and Longest Common
Subsequences . . . . . . . . . . . . . . 191
R. Hariharan and
S. Muthukrishnan Optimal Parallel Algorithms for Prefix
Matching . . . . . . . . . . . . . . . . 203
A. Amir and
G. Benson and
M. Farach Optimal Two-Dimensional Compressed
Matching . . . . . . . . . . . . . . . . 215
G. F. Italiano and
R. Ramaswami Maintaining Spanning Trees of Small
Diameter . . . . . . . . . . . . . . . . 227
J. Gil and
Y. Matias Simple Fast Parallel Hashing . . . . . . 239
T. M. Przytycka and
L. L. Larmore The Optimal Alphabetic Tree Problem
Revisited . . . . . . . . . . . . . . . 251
H. Buhrman and
L. Torenvliet On the Cutting Edge of Relativization:
The Resource Bounded Injury Method . . . 263
J.-C. Birget and
S. Margolis and
J. Meakin and
P. Weil PSPACE-completeness of Certain
Algorithmic Problems on the Subgroups of
Free Groups . . . . . . . . . . . . . . 274
M. Hennessy Higher-Order Processes and Their Models 286
B. Vergauwen and
J. Lewi Efficient Local Correctness Checking for
Single and Alternating Boolean Equation
Systems . . . . . . . . . . . . . . . . 304
P. A. Abdulla and
B. Jonsson Undecidable Verification Problems for
Programs with Unreliable Channels . . . 316
L. Fix and
F. B. Schneider Reasoning about Programs by Exploiting
the Environment . . . . . . . . . . . . 328
T. Braeuner A Model of Intuitionistic Affine Logic
from Stable Domain Theory . . . . . . . 340
G. Plotkin and
G. Winskel Bistructures, Bidomains and Linear Logic 352
A. Aziz and
V. Singhal and
F. Balarin and
R. K. Brayton Equivalences for Fair Kripke Structures 364
F. Van Breugel Generalizing Finiteness Conditions of
Labelled Transition Systems . . . . . . 376
M. Droste A Kleene Theorem for Recognizable
Languages over Concurrency Monoids . . . 388
H. Seidl Least Solutions of Equations over $N$ 400
G. Hotz and
G. Pitsch Fast Uniform Analysis of
Coupled-Context-Free Languages . . . . . 412
J.-E. Pin Polynomial Closure of Group Languages
and Open Sets of the Hall Topology . . . 424
A.-C. Caron and
H. Comon and
J.-L. Coquide and
M. Dauchet Pumping, Cleaning and Symbolic
Constraints Solving . . . . . . . . . . 436
C. Hintermeier and
C. Kirchner and
H. Kirchner Dynamically-Typed Computations for
Order-Sorted Equational Presentations 450
R. Di Cosmo and
D. Kesner Combining First Order Algebraic
Rewriting Systems, Recursion and
Extensional Lambda Calculi . . . . . . . 462
E. Upfal On the Theory of Interconnection
Networks for Parallel Computers . . . . 473
N. Garg and
V. V. Vazirani and
M. Yannakakis Multiway Cuts in Directed and Node
Weighted Graphs . . . . . . . . . . . . 487
U. Feige A Fast Randomized LOGSPACE Algorithm for
Graph Connectivity . . . . . . . . . . . 499
S. Nikoletseas and
K. Palem and
P. Spirakis and
M. Yung Short Vertex Disjoint Paths and
Multiconnectivity in Random Graphs:
Reliable Network Computing . . . . . . . 508
J. Lagergren The Size of an Intertwine . . . . . . . 520
R. Yuster and
U. Zwick Finding Even Cycles Even Faster . . . . 532
F. Hoefting and
E. Wanke Polynomial Time Analysis of Toroidal
Periodic Graphs . . . . . . . . . . . . 544
P. Bonizzoni A Tight Lower Bound for Primitivity in
$k$-Structures . . . . . . . . . . . . . 556
C. Blundo and
A. De Santis and
U. Vaccaro Randomness in Distribution Protocols . . 568
R. Freivalds and
M. Karpinski Lower Space Bounds for Randomized
Computation . . . . . . . . . . . . . . 580
A. Jakoby and
R. Reischuk and
C. Schindelhauer and
S. Weis The Average Case Complexity of the
Parallel Prefix Problem . . . . . . . . 593
M. J. Golin and
N. Young Prefix Codes: Equiprobable Words,
Unequal Letter Costs . . . . . . . . . . 605
C. G. Plaxton and
T. Suel A Super-Logarithmic Lower Bound for
Hypercubic Sorting Networks . . . . . . 618
A. Mei and
Y. Igarashi Efficient Strategies for Robot
Navigation in Unknown Environment . . . 630
Luc Steels Beyond Objects . . . . . . . . . . . . . 1
W. L. Huersch Should Superclasses be Abstract? . . . . 12
Walter L. Hürsch Should Superclasses Be Abstract? . . . . 12
Roel Wieringa and
Wiebren de Jonge and
Paul Spruit Roles and Dynamic Subclasses: A Modal
Logic Approach . . . . . . . . . . . . . 32
John Lamping and
Martin Abadi Methods as Assertions . . . . . . . . . 60
Cristina Videira Lopes and
Karl J. Lieberherr Abstracting Process-to-Function
Relations in Concurrent Object-Oriented
Applications . . . . . . . . . . . . . . 81
Vasco T. Vasconcelos Typed Concurrent Objects . . . . . . . . 100
Rachid Guerraoui Atomic Object Composition . . . . . . . 118
Kent Beck and
Ralph Johnson Patterns Generate Architectures . . . . 139
Wolfgang Pree Meta Patterns --- A Means for Capturing
the Essentials of Reusable
Object-Oriented Design . . . . . . . . . 150
W. De Pauw and
D. Kimelman and
J. Vlissides Modeling Object-Oriented Program
Execution . . . . . . . . . . . . . . . 163
Wim De Pauw and
Doug Kimelman and
John Vlissides Modeling Object-Oriented Program
Execution . . . . . . . . . . . . . . . 163
Norbert A. Streitz Putting Objects to Work: Hypermedia as
the Subject Matter and the Medium for
Computer-Supported Cooperative Work . . 183
Andrea Omicini and
Antonio Natali Object-Oriented Computations in Logic
Programming . . . . . . . . . . . . . . 194
Elisa Bertino and
Giovanna Guerrini and
Danilo Montesi Deductive Object Databases . . . . . . . 213
S. Alagic and
R. Sunderraman and
R. Bagai Declarative Object-Oriented Programming:
Inheritance, Subtyping and Prototyping 236
Gus Lopez and
Bjòrn Freeman-Benson and
Alan Borning Constraints and Object Identity . . . . 260
Daniel Hagimont Protection in the Guide Object-Oriented
Distributed System . . . . . . . . . . . 280
Hideaki Okamura and
Yutaka Ishikawa Object Location Control Using Meta-level
Programming . . . . . . . . . . . . . . 299
Giuseppe Attardi and
Tito Flagella Customising Object Allocation . . . . . 320
Ana M. D. Moreira and
Robert G. Clark Combining Object-Oriented Analysis and
Formal Description Techniques . . . . . 344
Ted L. Briggs and
John Werth A Specification Language for Object-
Oriented Analysis and Design . . . . . . 365
Mehmet Aksit and
Jan Bosch and
William van der Sterren and
Lodewijk Bergmans Real-Time Specification Inheritance
Anomalies and Real-Time Filters . . . . 386
Weimin Chen and
Volker Turau and
Wolfgang Klas Efficient Dynamic Look-Up Strategy for
Multi-Methods . . . . . . . . . . . . . 408
Jan Vitek and
R. Nigel Horspool Taming Message Passing: Efficient Method
Look-up for Dynamically Typed Languages 432
Farshad Nayeri and
Ben Hurwitz and
Frank Manola Generalizing Dispatching in a
Distributed Object System . . . . . . . 450
Bernd Bruegge and
Erik Riedel A Geographic Environmental Modeling
System: Towards an Object-Oriented
Framework . . . . . . . . . . . . . . . 474
S. M. G. Freeman and
M. S. Manasse Adding Digital Video to an
Object-Oriented User Interface Toolkit 493
Hannu Peltonen and
Tomi Männistö and
Kari Alho and
Reijo Sulonen Product Configurations --- An
Application for Prototype Object
Approach . . . . . . . . . . . . . . . . 513
Anonymous Author Index . . . . . . . . . . . . . . 535
A. Felty and
D. Howe Generalization and Reuse of Tactic
Proofs . . . . . . . . . . . . . . . . . 1
F. Giunchiglia and
P. Traverso Program Tactics and Logic Tactics . . . 16
P. De Groote On the Relation Between the
lambda-Calculus and the Syntactic Theory
of Sequential Control . . . . . . . . . 31
S. Tupailo On a Proof-Theoretical Analysis of
011-AC, 011-DC and cap delta011-CA . . . 44
R. Monroy and
A. Bundy and
A. Ireland Proof Plans for the Correction of False
Conjectures . . . . . . . . . . . . . . 54
U. Egly On the Value of Antiprenexing . . . . . 69
H. Vandecasteele and
D. De Schreye Implementing a Finite-Domain
CLP-Language on Top of Prolog: A
Transformational Approach . . . . . . . 84
D. Duggan Logical Closures . . . . . . . . . . . . 114
J. Goubault Higher-Order Rigid E-Unification . . . . 129
P. Anderson Program Extraction in a Logical
Framework Setting . . . . . . . . . . . 144
J. Despeyroux and
A. Hirschowitz Higher-Order Abstract Syntax with
Induction in Coq . . . . . . . . . . . . 159
S. Bruening Towards Efficient Calculi for
Resource-Oriented Deductive Planning . . 174
P. Quaresma and
J. G. Lopes A Logic Programming Framework for the
Abductive Inference of Intentions in
Cooperative Dialogues . . . . . . . . . 189
J. Darlington and
Y. Guo Constraint Logic Programming in the
Sequent Calculus . . . . . . . . . . . . 200
J. Avenhaus and
C. Loria-Saenz On Conditional Rewrite Systems with
Extra Variables and Deterministic Logic
Programs . . . . . . . . . . . . . . . . 215
C. Papp A Bottom-up Reconstruction of the
Well-Founded Semantics for Disjunctive
Logic Programs . . . . . . . . . . . . . 230
D. Seipel An Efficient Computation of the Extended
Generalized Closed World Assumption by
Support-for-Negation Sets . . . . . . . 245
D. A. Smith and
T. J. Hickey Multi-SLD Resolution . . . . . . . . . . 260
B. Beckert and
R. Haehnle and
A. Ramesh and
N. V. Murray On Anti-Links . . . . . . . . . . . . . 275
L. Lu A Generic Declarative Diagnoser for
Normal Logic Programs . . . . . . . . . 290
M. Codish and
M. Garcia de la Banda and
M. Bruynooghe and
M. Hermenegildo Goal Dependent vs. Goal Independent
Analysis of Logic Programs . . . . . . . 305
P. Mathieu and
J. P. Delahaye A Kind of Achievement by Parts Method 320
Z. Duan and
M. Koutny and
C. Holt Projection in Temporal Logic Programming 333
L. F. Pollacia and
L. M. L. Delcambre The Object Flow Model: A Formal
Framework for Describing the Dynamic
Construction, Destruction and
Interaction of Complex Objects . . . . . 1
J. Dijkstra On Complex Objects and Versioning in
Complex Environments . . . . . . . . . . 13
M. M. A. Morsi and
S. B. Navathe Application and System Prototyping via
an Extensible Object-Oriented
Environment . . . . . . . . . . . . . . 24
R. J. Peters and
M. Tamer Oezsu Reflection in a Uniform Behavioral
Object Model . . . . . . . . . . . . . . 34
J. B. Behm and
T. J. Teorey Relative Constraints in ER Data Models 46
R. Winter Design and Implementation of Derived
Entities . . . . . . . . . . . . . . . . 60
O. Rauh and
E. Stickel Searching for Compositions in ER Schemes 74
A. Zamperoni and
P. Loehr-Richter Enhancing the Quality of Conceptual
Database Specifications Through
Validation . . . . . . . . . . . . . . . 85
J. Wijsen and
J. Vandenbulcke and
H. Olivie Functional Dependencies Generalized for
Temporal Databases that Include
Object-Identity . . . . . . . . . . . . 99
I. A. Goralwalla and
M. Tamer Oezsu Temporal Extensions to a Uniform
Behavioral Object Model . . . . . . . . 110
E. Rose and
A. Segev TOOSQL --- A Temporal Object-Oriented
Query Language . . . . . . . . . . . . . 122
J. F. Roddick and
N. G. Craske and
T. J. Richards A Taxonomy for Schema Versioning Based
on the Relational and Entity
Relationship Models . . . . . . . . . . 137
S.-J. Yen and
A. L. P. Chen Neighborhood/Conceptual Query Answering
with Imprecise/Incomplete Data . . . . . 149
G. Pernul and
W. Winiwarter and
A. Min Tjoa The Entity-Relationship Model for
Multilevel Security . . . . . . . . . . 166
F. Garzotto and
L. Mainetti and
P. Paolini HDM2: Extending the ER Approach to
Hypermedia Application Design . . . . . 178
E. Metais and
J.-N. Meunier and
G. Levreau Database Schema Design: A Perspective
from Natural Language Techniques to
Validation and View Integration . . . . 190
A. Min Tjoa and
L. Berger Transformation of Requirement
Specifications Expressed in Natural
Language into an EER Model . . . . . . . 206
V. C. Storey and
R. C. Goldstein and
R. H. L. Chiang and
D. Dey A Commonsense Reasoning Facility Based
on the Entity-Relationship Model . . . . 218
E. D. Falkenberg DETERM: Deterministic Event-Tuned
Entity-Relationship Modeling . . . . . . 230
A. H. F. Laender and
D. J. Flynn A Semantic Comparison of the Modeling
Capabilities of the ER and NIAM Models 242
A. Vaz Velho and
R. Carapuca From Entity-Relationship Models to
Role-Attribute Models . . . . . . . . . 257
P. Johannesson Using Conceptual Graph Theory to Support
Schema Integration . . . . . . . . . . . 283
J.-L. Koh and
A. L. P. Chen Integration of Heterogeneous Object
Schemas . . . . . . . . . . . . . . . . 297
P. M. Steele and
A. B. Zaslavsky The Role of Meta Models in Federating
System Modeling Techniques . . . . . . . 315
G. Santucci and
C. Batini and
G. Di Battista Multilevel Schema Integration . . . . . 327
S. Castano and
V. De Antonellis and
P. San Pietro Reuse of Object-Oriented Requirement
Specifications . . . . . . . . . . . . . 339
R. H. L. Chiang and
T. M. Barron and
V. C. Storey Performance Evaluation of Reverse
Engineering Relational Databases into
Extended Entity-Relationship Models . . 352
J.-L. Hainaut and
C. Tonneau and
M. Joris and
M. Chandelon Transformation-Based Database Reverse
Engineering . . . . . . . . . . . . . . 364
M. Gogolla and
R. Herzig and
S. Conrad and
G. Denker Integrating the ER Approach in an OO
Environment . . . . . . . . . . . . . . 376
M. C. Norrie An Extended Entity-Relationship Approach
to Data Management in Object-Oriented
Systems . . . . . . . . . . . . . . . . 390
B. Narasimhan and
S. B. Navathe and
S. Jayaraman On Mapping ER and Relational Models into
OO Schemas . . . . . . . . . . . . . . . 402
W. D. Hurley A Repository Meta Model for Interactive
Systems . . . . . . . . . . . . . . . . 414
P. Rosengren and
U. Wingstedt and
M. Bern and
P. Kool ER-Based Information Retrieval in a
Mixed Database Environment . . . . . . . 426
J. Akoka and
I. Comyn-Wattiau A Framework for Automatic Clustering of
Semantic Models . . . . . . . . . . . . 438
P. Jaeschke and
A. Oberweis and
W. Stucky Extending ER Model Clustering by
Relationship Clustering . . . . . . . . 451
C. De Castro and
F. Grandi and
M. R. Scalas Semantic Interoperability of
Multitemporal Relational Databases . . . 463
S.-K. Kim and
S. Chakravarthy Modeling Time: Adequacy of Three
Distinct Time Concepts for Temporal
Databases . . . . . . . . . . . . . . . 475
J. A. Chudziak and
H. Rybinsky and
J. Vorbach Towards a Unifying Logic Formalism for
Semantic Data Models . . . . . . . . . . 492
J. Fong and
M. Ho Knowledge-Based Approach for Abstracting
Hierarchical and Network Schema
Semantics . . . . . . . . . . . . . . . 508
J. M. Castilho A State-Space Approach for Database
Redesign . . . . . . . . . . . . . . . . 520
P. K. Agarwal and
M. J. Katz and
M. Sharir Computing Depth Orders and Related
Problems . . . . . . . . . . . . . . . . 1
P. K. Agarwal and
S. Sen Selection in Monotone Matrices and
Computing k0t0h Nearest Neighbors . . . 13
S. Albers and
H. Koga New On-Line Algorithms for the Page
Replication Problem . . . . . . . . . . 25
G. Ausiello and
E. Feuerstein and
S. Leonardi and
L. Stougie Serving Requests with On-Line Routing 37
P. Becker A New Algorithm for the Construction of
Optimal B-Trees . . . . . . . . . . . . 49
M. De Berg and
M. De Groot and
M. Overmars New Results on Binary Space Partitions
in the Plane . . . . . . . . . . . . . . 61
P. Berman and
A. Lingas A Nearly Optimal Parallel Algorithm for
the Voronoi Diagram of a Convex Polygon 73
T. Biedl and
G. Kant and
M. Kaufmann On Triangulating Planar Graphs under the
Four-Connectivity Constraint . . . . . . 83
A. Czumaj and
L. Gasieniec and
M. Piotrow and
W. Rytter Parallel and Sequential Approximation of
Shortest Superstrings . . . . . . . . . 95
J. Czyzowicz and
H. Everett and
J.-M. Robert Separating Translates in the Plane:
Combinatorial Bounds and an Algorithm 107
G. Das and
P. J. Heffernan and
G. Narasimhan Finding All Weakly-Visible Chords of a
Polygon in Linear Time . . . . . . . . . 119
P. F. Dietz and
J. I. Seiferas and
J. Zhang A Tight Lower Bound for On-Line
Monotonic List Labeling . . . . . . . . 131
S. Felsner and
R. Mueller and
L. Wernisch Trapezoid Graphs and Generalizations,
Geometry and Algorithms . . . . . . . . 143
D. Fernandez-Baca and
G. Slutzki Optimal Parametric Search on Graphs of
Bounded Tree-Width . . . . . . . . . . . 155
M. L. Fredman Lower Bounds for Dynamic Algorithms . . 167
A. Gupta and
N. Nishimura Sequential and Parallel Algorithms for
Embedding Problems on Classes of Partial
$k$-Trees . . . . . . . . . . . . . . . 172
P. Gupta and
R. Janardan and
M. Smid On Intersection Searching Problems
Involving Curved Objects . . . . . . . . 183
M. M. Halldorsson and
J. Radhakrishnan Improved Approximations of Independent
Sets in Bounded-Degree Graphs . . . . . 195
L. Higham and
T. Przytycka Asymptotically Optimal Election on
Weighted Rings . . . . . . . . . . . . . 207
J. Hromkovic and
R. Klasing and
W. Unger and
H. Wagener Optimal Algorithms for Broadcast and
Gossip in the Edge-Disjoint Path Modes 219
J. Haastad Recent Results in Hardness of
Approximation . . . . . . . . . . . . . 231
B. H. H. Juurlink and
H. A. G. Wijshoff The Parallel Hierarchical Memory Model 240
K. Mulmuley Randomized Geometric Algorithms . . . . 252
L. Palios Connecting the Maximum Number of Grid
Nodes to the Boundary with
Non-Intersecting Line Segments . . . . . 255
M. Papatriantafilou and
P. Tsigas On Self-Stabilizing Wait-Free Clock
Synchronization . . . . . . . . . . . . 267
M. Peinado Hard Graphs for Randomized Subgraph
Exclusion Algorithms . . . . . . . . . . 278
C. Phillips and
C. Stein and
J. Wein Task Scheduling in Networks . . . . . . 290
E. Schenk Parallel Dynamic Lowest Common Ancestors 302
S. Schuierer An $ {O}(\log \log n) $ Algorithm to
Compute the Kernel of a Polygon . . . . 314
S. Schuierer Computing the L1-Diameter and Center of
a Simple Rectilinear Polygon in Parallel 326
J. F. Sibeyn and
T. Harris Exploiting Locality in LT-RAM
Computations . . . . . . . . . . . . . . 338
M. Thorup Efficient Preprocessing of Simple Binary
Pattern Forests . . . . . . . . . . . . 350
X. Zhou and
S.-I. Nakano and
T. Nishizeki A Parallel Algorithm for Edge-Coloring
Partial $k$-Trees . . . . . . . . . . . 359
F. F. Dragan Dominating Cliques in
Distance-Hereditary Graphs . . . . . . . 370
O. Faugeras Cartan's Moving Frame Method and Its
Application to the Geometry and
Evolution of Curves in the Euclidean,
Affine and Projective Planes . . . . . . 11
E. Barrett and
G. Gheen and
P. Payton Representation of Three-Dimensional
Object Structure as Cross-Ratios of
Determinants of Stereo Image Points . . 47
A. Zisserman and
S. J. Maybank A Case Against Epipolar Geometry . . . . 69
J. L. Mundy and
A. Zisserman Repeated Structures: Image
Correspondence Constraints and $3$D
Structure Recovery . . . . . . . . . . . 89
P. Gros How to Use the Cross Ratio to Compute
Projective Invariants from Two Images 107
A. Shashua On Geometric and Algebraic Aspects of
$3$D Affine and Projective Structures
from Perspective $2$D Views . . . . . . 127
S. Carlsson The Double Algebra: An Effective Tool
for Computing Invariants in Computer
Vision . . . . . . . . . . . . . . . . . 145
L. Van Gool and
T. Moons and
M. Van Diest and
E. Pauwels Matching Perspective Views of Parallel
Plane Structures . . . . . . . . . . . . 165
I. Weiss Invariants for Recovering Shape from
Shading . . . . . . . . . . . . . . . . 185
K. Astroem Fundamental Difficulties with Projective
Normalization of Planar Curves . . . . . 199
A. Verri and
C. Uras Invariant Size Functions . . . . . . . . 215
R. I. Hartley Euclidean Reconstruction from
Uncalibrated Views . . . . . . . . . . . 237
R. Mohr and
B. Boufama and
P. Brand Accurate Projective Reconstruction . . . 257
T. Papadopoulo and
O. Faugeras Applications of Motion Field of Curves 277
T. Moons and
L. Van Gool and
M. Van Diest and
E. Pauwels Affine Reconstruction from Perspective
Image Pairs Obtained by a Translating
Camera . . . . . . . . . . . . . . . . . 297
M. Zerroug and
R. Nevatia Using Invariance and Quasi-Invariance
for the Segmentation and Recovery of
Curved Objects . . . . . . . . . . . . . 317
D. Forsyth and
C. Rothwell Representations of $3$D Objects that
Incorporate Surface Markings . . . . . . 341
D. Weinshall Model-based Invariant Functions and
Their Use for Recognition . . . . . . . 359
J. Mao and
A. K. Jain and
P. J. Flynn Integration of Multiple Feature Groups
and Multiple Views into a $3$D Object
Recognition System . . . . . . . . . . . 381
C. A. Rothwell Hierarchical Object Description Using
Invariants . . . . . . . . . . . . . . . 397
D. W. Jacobs Generalizing Invariants for $3$-D to
$2$-D Matching . . . . . . . . . . . . . 415
R. Basri Recognition by Combinations of Model
Views: Alignment and Invariance . . . . 435
S. J. Maybank Classification Based on the Cross Ratio 453
P. Meer and
S. Ramakrishna and
R. Lenz Correspondence of Coplanar Features
Through P02-Invariant Representations 473
D. Keren and
J. Subrahmonia and
D. B. Cooper Integrating Algebraic Curves and
Surfaces, Algebraic Invariants and
Bayesian Methods for $2$D and $3$D
Object Recognition . . . . . . . . . . . 493
R. Barker Managing open systems now that the
``glasshouse'' has gone . . . . . . . . 1
P. M. D. Gray Knowledge reuse through networks of
large KBS . . . . . . . . . . . . . . . 13
S. Schwiderski and
G. Saake Expressing temporal behaviour with
extended ECA rules . . . . . . . . . . . 23
S. Soukeras and
P. J. H. King Temporal databases: an event-oriented
approach . . . . . . . . . . . . . . . . 38
D. K. C. Chan and
P. W. Trinder Object comprehensions: a query notation
for object-oriented databases . . . . . 55
S. Alagic and
R. Sunderraman Expressivity of typed logic paradigms
for object-oriented databases . . . . . 73
R. Bagai and
R. Sunderraman Algebraic computation of the weak
well-founded model for general deductive
databases . . . . . . . . . . . . . . . 90
I. Jelly and
J. Kerridge and
C. Bates Benchmarking parallel SQL database
machines . . . . . . . . . . . . . . . . 105
A. Burger and
P. Thanisch Branching transactions: a transaction
model for parallel databases . . . . . . 121
N. McCarroll and
J. Kerridge A strategy for semantic integrity
enforcement in a parallel database
machine . . . . . . . . . . . . . . . . 137
N. W. Paton and
G. Al-Qaimari and
K. Doan On interface objects in object-oriented
databases . . . . . . . . . . . . . . . 153
G. J. L. Kemp and
J. J. Iriarte and
P. M. D. Gray Efficient access to FDM objects stored
in a relational database . . . . . . . . 170
P. J. Barclay and
J. B. Kennedy A conceptual language for querying
object-oriented data . . . . . . . . . . 187
J. P. Murphy and
J. B. Grimson The Jupiter system: a prototype for
multi-database inter-operability . . . . 205
K. G. Jeffery and
L. Hutchinson and
J. Kalmus and
M. Wilson A model for heterogeneous distributed
database systems . . . . . . . . . . . . 221
M. U. Soerensen and
O. E. Hansen and
H. H. Loevengreen Combining Temporal Specification
Techniques . . . . . . . . . . . . . . . 1
S. Katz Global Equivalence Proofs for ISTL . . . 17
J. C. M. Baeten and
J. A. Bergstra and
R. N. Bol A Real Time Process Logic . . . . . . . 30
J. L. Fiadeiro and
T. Maibaum Sometimes ``Tomorrow'' is ``Sometime''
--- Action Refinement in a Temporal
Logic of Objects . . . . . . . . . . . . 48
A. J. Bonner and
M. Kifer Applications of Transaction Logic to
Knowledge Representation . . . . . . . . 67
P. Doherty and
W. Lukaszewicz Circumscribing Features and Fluents . . 82
S. Badaloni and
M. Berati Dealing with Time Granularity in a
Temporal Planning System . . . . . . . . 101
M. Reynolds Axiomatizing U and S over Integer Time 117
V. Goranko Temporal Logic with Reference Pointers 133
Y. Venema Completeness through Flatness in
Two-Dimensional Temporal Logic . . . . . 149
B. Vergauwen and
J. Lewi and
I. Avau and
A. Pote Efficient Computation of Nested
Fix-Points, with Applications to Model
Checking . . . . . . . . . . . . . . . . 165
O. Grumberg and
R. P. Kurshan How Linear Can Branching-Time Be? . . . 180
G. Kutty and
L. E. Moser and
P. M. Melliar-Smith and
L. K. Dillon First-Order Future Interval Logic . . . 195
O. Bernholtz and
O. Grumberg Buy One, Get One Free !!! . . . . . . . 210
P. Blackburn and
C. Gardent and
M. De Rijke Back and Forth Through Time and Events 225
C. H. Hwang and
L. K. Schubert Interpreting Tense, Aspect and Time
Adverbials: A Compositional, Unified
Approach . . . . . . . . . . . . . . . . 238
M. C. Di Maio and
A. Zanardo Synchronized Histories in Prior-Thomason
Representation of Branching Time . . . . 265
M. Boehlen and
R. Marti On the Completeness of Temporal Database
Query Languages . . . . . . . . . . . . 283
K. Van Belleghem and
M. Denecker and
D. De Schreye The Abductive Event Calculus as a
General Framework for Temporal Databases 301
M. Wooldridge and
M. Fisher A Decision Procedure for a Temporal
Belief Logic . . . . . . . . . . . . . . 317
M. Xu Decidability of Deliberative Stit
Theories with Multiple Agents . . . . . 332
C. Ribeiro and
A. Porto Abduction in Temporal Reasoning . . . . 349
M. Felder and
A. Morzenti A Temporal Logic Approach to
Implementation and Refinement in Timed
Petri Nets . . . . . . . . . . . . . . . 365
A. Mokkedem and
D. Mery A Stuttering Closed Temporal Logic for
Modular Reasoning about Concurrent
Programs . . . . . . . . . . . . . . . . 382
M. Kwiatkowska and
D. Peled and
W. Penczek A Hierarchy of Partial Order Temporal
Properties . . . . . . . . . . . . . . . 398
C. Dixon and
M. Fisher and
H. Barringer A Graph-Based Approach to Resolution in
Temporal Logic . . . . . . . . . . . . . 415
H. McGuire and
Z. Manna and
R. Waldinger Annotation-Based Deduction in Temporal
Logic . . . . . . . . . . . . . . . . . 430
M. A. Orgun and
W. Ma An Overview of Temporal and Modal Logic
Programming . . . . . . . . . . . . . . 445
M. Fisher A Survey of Concurrent METATEM --- The
Language and its Applications . . . . . 480
J. Chomicki Temporal Query Languages . . . . . . . . 506
R. Haehnle and
O. Ibens Improving Temporal Logic Tableaux Using
Integer Constraints . . . . . . . . . . 535
P. M. Melliar-Smith and
L. E. Moser and
Y. S. Ramakrishna and
G. Kutty A System for Automated Deduction in
Graphical Interval Logic . . . . . . . . 540
L. E. Bertossi and
J. C. Ferretti SCDBR: A Reasoner for Specification in
the Situation Calculus of Database
Updates . . . . . . . . . . . . . . . . 543
L. C. Paulson Isabelle: A Generic Theorem Prover . . . xvii + 321
V. A. Artamonov and
A. A. Klyachko and
V. M. Sidelnikov and
V. V. Yashchenko Algebraic Aspects of Key Generation
Systems . . . . . . . . . . . . . . . . 1
M. Alabbadi and
S. B. Wicker Susceptibility of Digital Signature
Schemes Based on Error-Correcting Codes
to Universal Forgery . . . . . . . . . . 6
E. M. Gabidulin and
O. Kjelsen How to Avoid the Sidel'nikov-Shestakov
Attack . . . . . . . . . . . . . . . . . 25
G. R. Blakley and
G. A. Kabatianskii Linear Algebra Approach to Secret
Sharing Schemes . . . . . . . . . . . . 33
T. Helleseth and
T. Kloeve and
O. Yirehus Generalizations of the Griesmer Bound 41
E. M. Gabidulin and
V. V. Zanin Codes that Correct Two-Dimensional Burst
Errors . . . . . . . . . . . . . . . . . 53
I. M. Boyarinov Self-Checking Decoding Algorithm for
Reed--Solomon Codes . . . . . . . . . . 63
V. V. Zyablov and
A. E. Ashikhmin Partial Unit Memory Codes on the Base of
Subcodes of Hadamard Codes . . . . . . . 69
V. Zyablov and
V. Sidorenko On Periodic (Partial) Unit Memory Codes
with Maximum Free Distance . . . . . . . 74
U. Dettmar and
U. K. Sorger and
V. V. Zyablov Concatenated Codes with Convolutional
Inner and Outer Codes . . . . . . . . . 80
F. A. Taubin Reduced-State Decoding for Trellis Coded
Modulation on Nonlineaer Intersymbol
Interference Channels . . . . . . . . . 88
I. L. Asnis and
S. V. Fedorenko and
E. A. Krouk and
E. T. Mironchikov Tables of Coverings for Decoding by
S-Sets . . . . . . . . . . . . . . . . . 97
V. Sidorenko Periodicity of One-Dimensional Tilings 103
I. E. Bocharova and
B. D. Kudryashov Fast Infinite Response Filtering for
Speech Processing . . . . . . . . . . . 109
I. E. Bocharova and
V. D. Kolesnik and
V. Yu Krachkovsky and
B. D. Kudryashov On Trellis Codes for Linear Predictive
Speech Compression . . . . . . . . . . . 115
A. Drogoul and
J. Ferber Multi-Agent Simulation as a Tool for
Modeling Societies: Application to
Social Differentiation in Ant Colonies 3
P. J. Kearney Experiments in Multi-Agent System
Dynamics . . . . . . . . . . . . . . . . 24
F. Cecconi and
D. Denaro and
D. Parisi and
U. Piazzalunga Social Aggregations in Evolving Neural
Networks . . . . . . . . . . . . . . . . 41
J. Bates and
A. B. Loyall and
W. S. Reilly An Architecture for Action, Emotion, and
Social Behavior . . . . . . . . . . . . 55
B. Lomborg Game Theory Versus Multiple Agents: The
Iterated Prisoner's Dilemma . . . . . . 69
S. Marsh Trust in Distributed Artificial
Intelligence . . . . . . . . . . . . . . 94
G. Zlotkin and
J. S. Rosenschein Negotiation with Incomplete Information
About Worth: Strict Versus Tolerant
Mechanisms . . . . . . . . . . . . . . . 115
K. Kuwabara and
T. Ishida Equilibratory Approach to Distributed
Resource Allocation: Toward Coordinated
Balancing . . . . . . . . . . . . . . . 133
J. Castro Caldas and
H. Coelho Strategic Interaction in Oligopolistic
Markets --- Experimenting with Real and
Artificial Agents . . . . . . . . . . . 147
W. Stirling Multi-Agent Coordinated Decision-Making
Using Epistemic Utility Theory . . . . . 164
C. Castelfranchi and
E. Werner The MAAMAW Spirit and this Book . . . . vii
M. Habib and
L. Nourine Bit-Vector Encoding for Partially
Ordered Sets . . . . . . . . . . . . . . 1
K. P. Bogart Intervals and Orders: What Comes After
Interval Orders? . . . . . . . . . . . . 13
J. Spinrad Dimension and Algorithms . . . . . . . . 33
S. M. Hashemi and
I. Rival Upward Drawings to Fit Surfaces . . . . 53
K. Simon and
P. Trunz A Cleanup on Transitive Orientation . . 59
K. Cattel and
M. J. Dinneen A Characterization of Graphs with Vertex
Cover up to Five . . . . . . . . . . . . 86
J. Gustedt and
A. Steger Testing Hereditary Properties
Efficiently on Average . . . . . . . . . 100
P. G. Franciosa and
M. Talamo Orders, $k$-sets and Fast Halfplane
Search on Paged Memory . . . . . . . . . 117
Y.- L. Lin Triangle Graphs and Their Coloring . . . 128
C. Capelle Representation of an Order as Union of
Interval Orders . . . . . . . . . . . . 143
J. Mitas Minimal Representation of Semiorders
with Intervals of Same Length . . . . . 162
M. Talamo and
P. Vocca Fast Lattice Browsing on Sparse
Representations . . . . . . . . . . . . 186
A. Aiken and
D. Kozen and
M. Vardi and
E. Wimmers The Complexity of Set Constraints . . . 1
S. Ambler and
M. Kiviatkowska and
N. Measor On Duality for the Modal-calculus . . . 18
M. Baaz and
R. Zach Short Proofs of Tautologies Using the
Schema of Equivalence . . . . . . . . . 33
J. A. Bergstra and
I. Bethke and
A. Ponse Process Algebra with Combinators . . . . 36
A. Blass Is Game Semantics Necessary? . . . . . . 66
K. J. Compton and
R. Uceda-Sosa The Model Theory of Concurrency . . . . 78
C. Coquand From Semantics to Rules: a Machine
Assisted Analysis . . . . . . . . . . . 91
A. Goerdt and
U. Kamps On the Reasons for Average Superlinear
Speedup in Parallel Backtrack Search . . 106
A. Gomolko Negation as Inconsistency in PROLOG via
Intuitionistic Logic . . . . . . . . . . 128
E. Graedel and
A. Malmstroem Approximable Minimisation Problems and
Optimal Solutions on Random Inputs . . . 139
M. Grohe Bounded-arity Hierarchies in Fixed-point
Logics . . . . . . . . . . . . . . . . . 150
Y. Hirshfeld Petri Nets and the Equivalence Problem 165
D. Kozen Logical Aspects of Set Constraints . . . 175
J. A. Makowsky and
Y. B. Pnueli Oracles and Quantifiers . . . . . . . . 189
J. Marcinkowski A Horn Clause that Implies an
Undecidable Set of Horn Clauses . . . . 223
R. Milner Higher-order Action Calculi . . . . . . 238
C.-H. L. Ong and
E. Ritter A Generic Strong Normalisation Argument:
Application to the Calculus of
Constructions . . . . . . . . . . . . . 261
C. Raffalli Data Types, Infinity and Equality in
System AF2 . . . . . . . . . . . . . . . 280
E. Ritter Normalisation for Typed Lambda Calculi
with Explicit Substitution . . . . . . . 295
W. Sieg and
S. S. Wainer Program Transformation and Proof
Transformation . . . . . . . . . . . . . 305
I. A. Stewart Incorporating Generalised Quantifiers
and the Least Fixed Point Operator . . . 318
Y. Gurevich and
J. K. Huggins Errata to ``The Semantics of the C
Programming Language'' . . . . . . . . . 334
D. Dubois and
H. Prade Basic Issues on Fuzzy Rules and Their
Application to Fuzzy Control . . . . . . 3
M. Mukaidono Algebraic Structures of Truth Values in
Fuzzy Logic . . . . . . . . . . . . . . 15
J. F. Baldwin A Theory of Mass Assignments for
Artificial Intelligence . . . . . . . . 22
W. Pedrycz Fuzzy Dynamic Systems . . . . . . . . . 37
D. Dubois and
J. Lang and
H. Prade Handling Uncertainty, Context, Vague
Predicates, and Partial Inconsistency in
Possibilistic Logic . . . . . . . . . . 45
B. Graham and
R. Newell An Adaptive Fuzzy Model-Based Controller 56
J. Franklin Fuzzy Representations in Neural Nets . . 69
H. Narazaki and
A. L. Ralescu A Method to Implement Qualitative
Knowledge in Multi-Layered Neural
Networks . . . . . . . . . . . . . . . . 82
N. Wakami Fuzzy Control and Neural Networks:
Applications for Consumer Products . . . 99
T. Yokogawa and
T. Sakurai and
A. Nukuzuma and
T. Takagi Case-Based Reasoning for Action Planning
by Representing Situations at the
Abstract Layers . . . . . . . . . . . . 109
S. Venkatesh and
D. Kieronska A Unified Formalism for Landmark-Based
Representation of Maps and Navigation
Plans . . . . . . . . . . . . . . . . . 123
J. Yen and
N. Pfluger Using Fuzzy Logic in a Mobile Robot Path
Controller . . . . . . . . . . . . . . . 133
K. Hirota Fundamentals of Fuzzy Logical Circuits 145
W.-T. Wu Polynomial Equations-Solving and its
Applications . . . . . . . . . . . . . . 1
R. L. Graham Quasi-Random Combinatorial Structures 10
R. Klein and
A. Lingas Hamiltonian Abstract Voronoi Diagrams in
Linear Time . . . . . . . . . . . . . . 11
P. Bose and
M. E. Houle and
G. Toussaint Every Set of Disjoint Line Segments
Admits a Binary Tree . . . . . . . . . . 20
K. Iwano and
P. Raghavan and
H. Tamaki The Traveling Cameraman Problem, with
Applications to Automatic Optical
Inspection . . . . . . . . . . . . . . . 29
T. Akutsu On Determining the Congruity of Point
Sets in Higher Dimensions . . . . . . . 38
R. V. Book and
O. Watanabe On Random Hard Sets for NP . . . . . . . 47
L. A. Hemaspaandra and
A. V. Naik and
M. Ogihara and
A. L. Selman Computing Solutions Uniquely Collapses
the Polynomial Hierarchy . . . . . . . . 56
M. Santha and
S. Tan Verifying the Determinant in Parallel 65
C.-L. Lin Hardness of Approximating Graph
Transformation Problem . . . . . . . . . 74
A. Panconesi and
M. Papatriantafilou and
P. Tsigas and
P. Vitanyi Randomized Wait-Free Naming . . . . . . 83
S. Rajasekaran and
W. Chen and
S. Yooseph Unifying Themes for Network Selection 92
M. Molcho and
S. Zaks Robust Asynchronous Algorithms in
Networks with a Fault Detection Ring . . 101
E. Jennings and
L. Motyckova Distributed Algorithms for Finding Small
Cycle Covers in Arbitrary Networks . . . 110
X.-S. Zhang and
H.-C. Zhu A Neural Network Model for Quadratic
Programming with Simple Upper and Lower
Bounds and its Application to Linear
Programming . . . . . . . . . . . . . . 119
D. Zhu and
S. Ma and
H. Qiu Analysis of the Convergency of Topology
Preserving Neural Networks on Learning 128
V. Arvind and
J. Koebler and
R. Schuler On Helping and Interactive Proof Systems 137
J. Gu and
Q.-P. Gu Average Time Complexity of the SAT 1.2
Algorithm . . . . . . . . . . . . . . . 146
J. Chen Average Cost to Produce Partial Orders 155
D. Li and
S. Ma Two Notes on Low-Density Subset Sum
Algorithms . . . . . . . . . . . . . . . 164
J.-Y. Cai and
M. D. Hirsch Rotation Distance, Triangulations of
Planar Surfaces and Hyperbolic Geometry 172
Y. Chen and
T. R. Smith Finitely Representable Spatial Objects
and Efficient Computation . . . . . . . 181
H. Nagamochi and
K. Nishimura and
T. Ibaraki Computing All Small Cuts in Undirected
Networks . . . . . . . . . . . . . . . . 190
X. Zhou and
T. Nishizeki Edge-Coloring and $f$-Coloring for
Various Classes of Graphs . . . . . . . 199
C. P. Gopalakrishnan and
C. P. Rangan Edge-Disjoint Paths in Permutation
Graphs . . . . . . . . . . . . . . . . . 208
S. Taoka and
T. Watanabe Minimum Augmentation to $k$-Edge-Connect
Specified Vertices of a Graph . . . . . 217
A. Srivastav and
P. Stangier Algorithmic Chernoff--Hoeffding
Inequalities in Integer Programming . . 226
T. Takaoka Approximate Pattern Matching with
Samples . . . . . . . . . . . . . . . . 234
X. Lin and
M. E. Orlowska An Efficient Optimal Algorithm for
Minimizing the Overall Communication
Cost in Replicated Data Management . . . 243
J. Gu Multispace Search: A New Optimization
Approach . . . . . . . . . . . . . . . . 252
S. Arikati and
A. Maheshwari Realizing Degree Sequences in Parallel 261
D. Kavvadias and
G. E. Pantziou and
P. G. Spirakis and
C. D. Zaroliagis Efficient Sequential and Parallel
Algorithms for the Negative Cycle
Problem . . . . . . . . . . . . . . . . 270
D. Z. Chen and
X. Hu Fast and Efficient Operations on
Parallel Priority Queues . . . . . . . . 279
S. Carlsson and
J. Chen and
C. Mattsson Heaps with Bits . . . . . . . . . . . . 288
J. Von zur Gathen and
I. Shparlinski Components and Projections of Curves
over Finite Fields . . . . . . . . . . . 297
M. Middendorf On the Approximation of Finding Various
Minimal, Maximal, and Consistent
Sequences . . . . . . . . . . . . . . . 306
M. Nakanishi and
M. Hasidume and
M. Ito and
A. Hashimoto A Linear-Time Algorithm for Computing
Characteristic Strings . . . . . . . . . 315
K. Makino and
T. Ibaraki The Maximum Latency and Identification
of Positive Boolean Functions . . . . . 324
M. Kaufmann and
H. Lauer and
H. Schroeder Fast Deterministic Hot-Potato Routing on
Processor Arrays . . . . . . . . . . . . 333
Q.-P. Gu and
S. Peng $k$-Pairwise Cluster Fault Tolerant
Routing in Hypercubes . . . . . . . . . 342
M. Kaufmann and
S. Gao and
K. Thulasiraman On Steiner Minimal Trees in Grid Graphs
and Its Application to VLSI Routing . . 351
X. Shen and
Q. Hu and
H. Dai and
X. Wang Optimal Routing of Permutations on Rings 360
K. Ambos-Spies and
S. A. Terwijn and
X. Zheng Resource Bounded Randomness and Weakly
Complete Problems . . . . . . . . . . . 369
S. C. Krishnan and
A. Puri and
R. K. Brayton Deterministic omega Automata vis-a-vis
Deterministic Buchi Automata . . . . . . 378
T. Mihara and
T. Nishino Quantum Computation and NP-Complete
Problems . . . . . . . . . . . . . . . . 387
L. Fortnow and
J. Rogers Separability and One-Way Functions . . . 396
T. Akutsu and
M. M. Halldorsson On the Approximation of Largest Common
Subtrees and Largest Common Point Sets 405
T. Jiang and
L. Wang An Approximation Scheme for Some Steiner
Tree Problems in the Plane . . . . . . . 414
B.-T. Yang and
Y.-F. Xu and
Z.-Y. You A Chain Decomposition Algorithm for the
Proof of a Property on Minimum Weight
Triangulations . . . . . . . . . . . . . 423
J. Ding The Generating Algorithm for Quasi-Full
Steiner Trees . . . . . . . . . . . . . 428
L. Chi Kwong Hui and
C. U. Martel Analysing Deletions in Competitive
Self-Adjusting Linear List Algorithms 433
D. Abuaiadh and
J. H. Kingston Are Fibonacci Heaps Optimal? . . . . . . 442
M.-Y. Kao and
S.-H. Teng Simple and Efficient Graph Compression
Schemes for Dense and Complement Graphs 451
C. R. Subramanian Improved Algorithms for Coloring Random
Graphs . . . . . . . . . . . . . . . . . 460
O. H. Ibarra and
N. Q. Tran On the Parallel Complexity of Solving
Recurrence Equations . . . . . . . . . . 469
C. Iwamoto and
K. Iwama Extended Graph Connectivity and Its
Gradually Increasing Parallel Complexity 478
P. T. Metaxas and
G. E. Pantziou and
A. Symvonis Parallel $h$-$v$ Drawings of Binary
Trees . . . . . . . . . . . . . . . . . 487
S.-Y. Hsieh and
C.-W. Ho An Efficient Parallel Strategy for
Recognizing Series-Parallel Graphs . . . 496
T. Tokuyama Orthogonal Queries in Segments and
Triangles . . . . . . . . . . . . . . . 505
B. Zhu Further Computational Geometry in
Secondary Memory . . . . . . . . . . . . 514
X. Tan and
T. Hirata Shortest Safari Routes in Simple Polygon 523
F. Y. Chin and
Cao An Wang On Greedy Tetrahedralization of Points
in $3$D . . . . . . . . . . . . . . . . 532
K. Fujiyoshi and
Y. Kajitani and
H. Niitsu The Totally-Perfect Bipartite Graph and
Its Construction . . . . . . . . . . . . 541
K.-H. Tsai and
D. T. Lee $k$-Best Cuts for Circular-Arc Graphs 550
L. Chen Revisiting Circular Arc Graphs . . . . . 559
C. P. Rangan and
M.-S. Chang Weighted Irredundance of Interval Graphs 567
S. Tani and
H. Imai A Reordering Operation for an Ordered
Binary Decision Diagram and an Extended
Framework for Combinatorics of Graphs 575
K. Hosaka and
Y. Takenaga and
S. Yajima On the Size of Ordered Binary Decision
Diagrams Representing Threshold
Functions . . . . . . . . . . . . . . . 584
H.-Z. Li and
G.-Y. Li Nonuniform Lowness and Strong Nonuniform
Lowness . . . . . . . . . . . . . . . . 593
I. Biehl Definition and Existence of Super
Complexity Cores . . . . . . . . . . . . 600
G. H. Young and
C.-L. Chan Efficient Algorithms for Assigning
Chain-Like Tasks on a Chain-Like Network
Computer . . . . . . . . . . . . . . . . 607
Hoong Chuin Lau Manpower Scheduling with Shift Change
Constraints . . . . . . . . . . . . . . 616
Y. Xu and
H. N. Gabow Fast Algorithms for Transversal Matroid
Intersection Problems . . . . . . . . . 625
X. Deng A Convex Hull Algorithm on
Coarse-Grained Multiprocessors . . . . . 634
D.-L. Lee and
K. E. Batcher A Multiway Merging Network . . . . . . . 643
T. Asano Reporting and Counting Intersections of
Lines within a Polygon . . . . . . . . . 652
G. Havas and
Jin Xian Lian A New Problem in String Searching . . . 660
S. Sun and
D. H. C. Du and
G. Xue Achieving the Shortest Clock Period by
Inserting the Minimum Amount of Delay 669
F. Bao and
Y. Igarashi A Randomized Algorithm to Finite
Automata Public Key Cryptosystem . . . . 678
P. Hayes Aristotelian and Platonic Views of
Knowledge Representation . . . . . . . . 1
E. C. Way Conceptual Graphs --- Past, Present, and
Future . . . . . . . . . . . . . . . . . 11
M. Willems Pragmatic Semantics by Conceptual Graphs 31
B. Moulin and
S. Dumas The Temporal Structure of a Discourse
and Verb Tense Determination . . . . . . 45
S. H. Myaeng and
C. Khoo and
M. Li Linguistic Processing of Text for a
Large-scale Conceptual Information
Retrieval System . . . . . . . . . . . . 69
A.-M. Rassinoux and
R. H. Baud and
J.-R. Scherrer A Multilingual Analyser of Medical Texts 84
J. T. Sykes and
V. Konstantinou and
P. L. R. Morse Extracting Explicit and Implicit
Knowledge from Natural Language Texts 97
G. A. Mann A Rational Goal-seeking Agent Using
Conceptual Graphs . . . . . . . . . . . 113
W. M. Tepfenhart Attitudes: Keys to Problem
Identification . . . . . . . . . . . . . 127
M. Wermelinger and
J. G. Lopes Basic Conceptual Structures Theory . . . 144
G. W. Mineau Views, Mappings and Functions: Essential
Definitions to the Conceptual Graph
Theory . . . . . . . . . . . . . . . . . 160
J. Esch Contexts and Concepts, Abstraction Duals 175
J. Esch Contexts, Canons and Coreferent Types 185
J. P. Dick Using Contexts to Represent Text . . . . 196
B. C. Ghosh and
V. Wuwongse Inference Systems for Conceptual Graph
Programs . . . . . . . . . . . . . . . . 214
R. Levinson USD: A Universal Data Structure . . . . 230
A. Kabbaj and
C. Frasson and
M. Kaltenbach and
J.-Y. Djamen A Conceptual and Contextual
Object-oriented Logic Programming: The
PROLOG++ Language . . . . . . . . . . . 251
W. R. Cyre and
S. Balanchandar and
A. Thakar Knowledge Visualization from Conceptual
Structures . . . . . . . . . . . . . . . 275
G. Ellis and
F. Lehmann Exploiting the Induced Order on
Type-labeled Graphs for Fast Knowledge
Retrieval . . . . . . . . . . . . . . . 293
B. Carbonneill and
O. Haemmerle Standardizing and Interfacing Relational
Databases Using Conceptual Graphs . . . 311
J.-Y Girard Geometry of interaction . . . . . . . . 1
A. C. Uselton and
S. A. Smolka A compositional semantics for
statecharts using labeled transition
systems . . . . . . . . . . . . . . . . 2
A. Kiehn and
M. Hennessy On the decidability of non-interleaving
process equivalences . . . . . . . . . . 18
S. Mauw and
H. Mulder Regularity of BPA-systems is decidable 34
Y. Hirshfeld and
F. Moller A fast algorithm for deciding
bisimilarity of normed context-free
processes . . . . . . . . . . . . . . . 48
J. C. Fernandez and
J. Sifakis and
R. De Simone Tutorial: Model-based verification
methods and tools . . . . . . . . . . . 64
M. Girkar and
R. Moll New results on the analysis of
concurrent systems with an indefinite
number of processes . . . . . . . . . . 65
A. Bouajjani and
R. Echahed and
R. Robbana Verification of nonregular temporal
properties for context-free processes 81
O. Burkart and
B. Steffen Pushdown processes: Parallel composition
and model checking . . . . . . . . . . . 98
H. Hungar Local model checking for parallel
compositions of context-free processes 114
P. Panangaden Invited Lecture: The logical structure
of concurrent constraint programming
languages . . . . . . . . . . . . . . . 129
P. Di Gianantonio and
F. Honsell and
S. Liani and
G. D. Plotkin Countable non-determinism and
uncountable limits . . . . . . . . . . . 130
J. R. B. Cockett and
D. A. Spooner SProc categorically . . . . . . . . . . 146
C. Courcoubetis Tutorial: From timed graphs to hybrid
automata . . . . . . . . . . . . . . . . 160
D. Dill Hierarchical models of synchronous
circuits . . . . . . . . . . . . . . . . 161
R. Alur and
C. Courcoubetis and
T. A. Henzinger The observational power of clocks . . . 162
J. Gunawardena A dynamic approach to timed behaviour 178
J. Winkowski Algebras of processes of timed Petri
nets . . . . . . . . . . . . . . . . . . 194
M. Koutny and
J. Esparza and
E. Best Operational semantics for the Petri box
calculus . . . . . . . . . . . . . . . . 210
A. Rensink and
H. Wehrheim Weak sequential composition in process
algebras . . . . . . . . . . . . . . . . 226
P. C. Kanellakis and
D. Michailidis and
A. A. Shvartsman Efficient parallelism vs. reliable
distribution: A trade-off for concurrent
computations . . . . . . . . . . . . . . 242
Q. Xu and
A. Cau and
P. Gollette On unifying assumption-commitment style
proof rules for concurrency . . . . . . 267
J. U. Skakkeboek Liveness and fairness in duration
calculus . . . . . . . . . . . . . . . . 283
M. Boreale and
R. De Nicola A symbolic semantics for the $ \pi
$-calculus . . . . . . . . . . . . . . . 299--314
D. Walker On bisimulation in the $ \pi $-calculus 315
X. Liu Characterizing bisimulation congruence
in the $ \pi $-calculus . . . . . . . . 331--350
N. Klarlund The limit view of infinite computations 351
R. J. R. Back and
J. Von Wright Trace refinement of action systems . . . 367
M. Nielsen and
C. Clausen Bisimulation for models in concurrency 385
M. Bezem and
J. F. Groote Invariants in process algebra with data 401
R. Cleaveland and
J. Riely Testing-based abstractions for
value-passing systems . . . . . . . . . 417
C. Verhoef A congruence theorem for structured
operational semantics with predicates
and negative premises . . . . . . . . . 433
L. Aceto Deriving complete inference systems for
a class of GSOS languages generating
regular behaviours . . . . . . . . . . . 449
J. C. M. Baeten and
J. A. Bergstra Process algebra with partial choice . . 465
R. Segala and
N. Lynch Probabilistic simulations for
probabilistic processes . . . . . . . . 481
S. Yuen and
R. Cleaveland and
Z. Dayar and
S. A. Smolka Fully abstract characterizations of
testing preorders for probabilistic
processes . . . . . . . . . . . . . . . 497
S.-H. Wu and
S. A. Smolka and
E. W. Stark Composition and behaviors of
probabilistic I/O automata . . . . . . . 513
J. L. Kolodner Understanding Creativity: A Case-Based
Approach . . . . . . . . . . . . . . . . 3
M. T. Keane Analogical Asides on Case-Based
Reasoning . . . . . . . . . . . . . . . 21
M. M. Veloso Prodigy/Analogy: Analogical Reasoning in
General Problem Solving . . . . . . . . 33
E. Armengol and
E. Plaza A Knowledge Level Model of Case-Based
Reasoning . . . . . . . . . . . . . . . 53
G. Nakhaeizadeh Learning Prediction of Time Series --- A
Theoretical and Empirical Comparison of
CBR with some other Approaches . . . . . 65
S. Wess and
C. Globig Case-Based and Symbolic Classification 77
C. Bento and
E. Costa A Similarity Metric for Retrieval of
Cases Imperfectly Explained . . . . . . 92
H. Bunke and
B. T. Messmer Similarity Measures for Structured
Representations . . . . . . . . . . . . 106
M. Sebag and
M. Schoenauer A Rule-Based Similarity Measure . . . . 119
M. G. Brown An Underlying Memory Model to Support
Case Retrieval . . . . . . . . . . . . . 132
P. Myllymaeki and
H. Tirri Massively Parallel Case-Based Reasoning
with Probabilistic Similarity Metrics 144
S. Rougegrez Similarity Evaluation Between Observed
Behaviours for the Prediction of
Processes . . . . . . . . . . . . . . . 155
S. Wess and
K.-D. Althoff and
G. Derwand Using $k$-$d$ Trees to Improve the
Retrieval Step in Case-Based Reasoning 167
R. Bergmann and
G. Pews and
W. Wilke Explanation-Based Similarity: A Unifying
Approach for Integrating Domain
Knowledge into Case-Based Reasoning for
Diagnosis and Planning Tasks . . . . . . 182
K. Boerner Structural Similarity as Guidance in
Case-Based Design . . . . . . . . . . . 197
B. Smyth and
M. T. Keane Retrieving Adaptable Cases: The Role of
Adaptation Knowledge in Case Retrieval 209
N. Chatterjee and
J. A. Campbell Adaptation through Interpolation for
Time-Critical Case-Based Reasoning . . . 221
P. Cunningham and
D. Finn and
S. Slattery Knowledge Engineering Requirements in
Derivational Analogy . . . . . . . . . . 234
S. O'Hara and
B. Indurkhya Incorporating (Re)-Interpretation in
Case-Based Reasoning . . . . . . . . . . 246
K. Uehara and
M. Tanizawa and
S. Maekawa PBL: Prototype-Based Learning Algorithms 261
A. Aamodt Explanation-Driven Case-Based Reasoning 274
J. L. Arcos and
E. Plaza A Reflective Architecture for Integrated
Memory-Based Learning and Reasoning . . 289
D. J. Macchion and
Dinh Phuoc Vo A Hybrid Knowledge-Based System for
Technical Diagnosis Learning and
Assistance . . . . . . . . . . . . . . . 301
Y. Nakatani and
D. Israel Tuning Rules by Cases . . . . . . . . . 313
L. Portinale and
P. Torasso and
C. Ortalda and
A. Giardino Using Case-Based Reasoning to Focus
Model-Based Diagnostic Problem Solving 325
K. D. Ashley and
V. Aleven A Logical Representation for Relevance
Criteria . . . . . . . . . . . . . . . . 338
U. J. Schild and
Y. Kerner Multiple Explanation Patterns . . . . . 353
C. Bradburn and
J. Zeleznikow The Application of Case-Based Reasoning
to the Tasks of Health Care Planning . . 365
N. Hurley A priori Selection of Mesh Densities for
Adaptive Finite Element Analysis, Using
a Case-Based Reasoning Approach . . . . 379
G. Kamp Integrating Semantic Structure and
Technical Documentation in Case-Based
Service Support Systems . . . . . . . . 392
M. Smail Case-Based Information Retrieval . . . . 404
M. Stadler Case-Based Reasoning for Network
Management . . . . . . . . . . . . . . . 414
O. Wendel Case-Based Reasoning in a Simulation
Environment for Biological Neural
Networks . . . . . . . . . . . . . . . . 424
K. Hua and
I. Smith and
B. Faltings Integrated Case-Based Building Design 436
K. Nakakoji Case-Deliverer: Making Cases Relevant to
the Task at Hand . . . . . . . . . . . . 446
A. Napoli and
J. Lieber A First Study on Case-Based Planning in
Organic Synthesis . . . . . . . . . . . 458
G. Gottlob From Carnap's Modal Logic to
Autoepistemic Logic . . . . . . . . . . 1
H. Herre Compactness Properties of Nonmonotonic
Inference Operations . . . . . . . . . . 19
Y. Moinard and
R. Rolland Around a Powerful Property of
Circumscriptions . . . . . . . . . . . . 34
Y. Dimopoulos The Computational Value of Joint
Consistency . . . . . . . . . . . . . . 50
C. Aravindan and
P. M. Dung Belief Dynamics, Abduction, and
Databases . . . . . . . . . . . . . . . 66
M.-A. Williams On the Logic of Theory Base Change . . . 86
J. J. Alferes and
L. M. Pereira Belief, Provability, and Logic Programs 106
V. W. Marek and
M. Truszczynski Revision Specifications by Means of
Programs . . . . . . . . . . . . . . . . 122
C. Witteveen and
W. Van der Hoek and
H. De Nivelle Revision of Non-Monotonic Theories: Some
Postulates and an Application to Logic
Programming . . . . . . . . . . . . . . 137
U. Petermann A Complete Connection Calculus with
Rigid E-Unification . . . . . . . . . . 152
R. Scherl Equality and Constrained Resolution . . 167
S. Demri Efficient Strategies for Automated
Reasoning in Modal Logics . . . . . . . 182
G. Aguilera and
I. P. De Guzman and
M. Ojeda TAS-D0+0+: Syntactic Trees
Transformations for Automated Theorem
Proving . . . . . . . . . . . . . . . . 198
H. De Nivelle A Unification of Ordering Refinements of
Resolution in Classical Logic . . . . . 217
E. Orlowska Two Logical Dimensions . . . . . . . . . 231
J. Rintanen Prioritized Autoepistemic Logic . . . . 232
G. Brewka Adding Priorities and Specificity to
Default Logic . . . . . . . . . . . . . 247
P. Chatalic Viewing Hypothesis Theories as
Constrained Graded Theories . . . . . . 261
J. Engelfriet and
J. Treur Temporal Theories of Reasoning . . . . . 279
K. Georgatos Reasoning about Knowledge on Computation
Trees . . . . . . . . . . . . . . . . . 300
G. Grosse Propositional State Event Logic . . . . 316
G. De Giacomo and
M. Lenzerini Description Logics with Inverse Roles,
Functional Restrictions, and $N$-ary
Relations . . . . . . . . . . . . . . . 332
L. E. Bertossi and
R. Reiter On the Concept of Generic Object: A
Nonmonotonic Reasoning Approach and
Examples . . . . . . . . . . . . . . . . 347
T. C. Przymusinski Autoepistemic Logic of Minimal Beliefs 364
A. Nonnengart How to Use Modalities and Sorts in
Prolog . . . . . . . . . . . . . . . . . 365
J.- M. Jacquet and
L. Monteiro Towards Resource Handling in Logic
Programming: the PPL Framework and its
Semantics . . . . . . . . . . . . . . . 379
S. Costantini and
P. Dell'Acqua and
G. A. Lanzarone Extending Horn Clause Theories by
Reflection Principles . . . . . . . . . 400
Mitsuru Matsui The First Experimental Cryptanalysis of
the Data Encryption Standard . . . . . . 1--11
Kazuo Ohta and
Kazumaro Aoki Linear Cryptanalysis of the Fast Data
Encipherment Algorithm . . . . . . . . . 12--16
Susan K. Langford and
Martin E. Hellman Differential-Linear Cryptanalysis . . . 17--25
Burton S. Kaliski Jr. and
Matthew J. B. Robshaw Linear Cryptanalysis Using Multiple
Approximations . . . . . . . . . . . . . 26--39
Jean-Pierre Tillich and
Gilles Zémor Hashing with SL$_2$ . . . . . . . . . . 40--49
Jinhui Chao and
Kazuo Tanada and
Shigeo Tsujii Design of Elliptic Curves with
Controllable Lower Boundary of Extension
Degree for Reduction Attacks . . . . . . 50--55
Ingrid Biehl and
Johannes A. Buchmann and
Christoph Thiel Cryptographic Protocols Based on
Discrete Logarithms in Real-Quadratic
Orders . . . . . . . . . . . . . . . . . 56--60
Tatsuaki Okamoto Designated Confirmer Signatures and
Public-Key Encryption Are Equivalent . . 61--74
Daniel Bleichenbacher and
Ueli M. Maurer Directed Acyclic Graphs, One-Way
Functions and Digital Signatures . . . . 75--82
Olivier Delos and
Jean-Jacques Quisquater An Identity-Based Signature Scheme with
Bounded Life-Span . . . . . . . . . . . 83--94
Chae Hoon Lim and
Pil Joong Lee More Flexible Exponentiation with
Precomputation . . . . . . . . . . . . . 95--107
Tamás Horváth and
Spyros S. Magliveras and
Tran van Trung A Parallel Permutation Multiplier for a
PGM Crypto-Chip . . . . . . . . . . . . 108--113
Don Davis and
Ross Ihaka and
Philip Fenstermacher Cryptographic Randomness from Air
Turbulence in Disk Drives . . . . . . . 114--120
Christian Gehrmann Cryptanalysis of the Gemmell and Naor
Multiround Authentication Protocol . . . 121--128
Hugo Krawczyk LFSR-Based Hashing and Authentication 129--139
Kaoru Kurosawa New Bound on Authentication Code with
Arbitration . . . . . . . . . . . . . . 140--149
Carlo Blundo and
Alfredo De Santis and
Giovanni Di Crescenzo and
Antonio Giorgio Gaggia and
Ugo Vaccaro Multi-secret Sharing Schemes . . . . . . 150--163
Jacques Stern Designing Identification Schemes with
Keys of Short Size . . . . . . . . . . . 164--173
Ronald Cramer and
Ivan Bjerre Damgård and
Berry Schoenmakers Proof of Partial Knowledge and
Simplified Design of Witness Hiding
Protocols . . . . . . . . . . . . . . . 174--187
Toshiya Itoh and
Yuji Ohta and
Hiroki Shizuya Language Dependent Secure Bit Commitment 188--201
Marc Girault and
Jacques Stern On the Length of Cryptographic
Hash-Values Used in Identification
Schemes . . . . . . . . . . . . . . . . 202--215
Mihir Bellare and
Oded Goldreich and
Shafi Goldwasser Incremental Cryptography: The Case of
Hashing and Signing . . . . . . . . . . 216--233
Cynthia Dwork and
Moni Naor An Efficient Existentially Unforgeable
Signature Scheme and Its Applications 234--246
Jürgen Bierbrauer and
K. Gopalakrishnan and
Douglas R. Stinson Bounds for Resilient Functions and
Orthogonal Arrays . . . . . . . . . . . 247--256
Benny Chor and
Amos Fiat and
Moni Naor Tracing Traitors . . . . . . . . . . . . 257--270
Ueli M. Maurer Towards the Equivalence of Breaking the
Diffie--Hellman Protocol and Computing
Discrete Logarithms . . . . . . . . . . 271--281
Preda Mihailescu Fast Generation of Provable Primes Using
Search in Arithmetic Progressions . . . 282--293
Don Coppersmith Attack on the Cryptographic Scheme
NIKS--TAS . . . . . . . . . . . . . . . 294--307
Mike V. D. Burmester On the Risk of Opening Distributed Keys 308--317
Thomas Beth and
D. E. Lazic and
A. Mathias Cryptanalysis of Cryptosystems Based on
Remote Chaos Replication . . . . . . . . 318--331
James L. Massey and
Shirlei Serconek A Fourier Transform Approach to the
Linear Complexity of Nonlinearly
Filtered Sequences . . . . . . . . . . . 332--340
Mihir Bellare and
Joe Kilian and
Phillip Rogaway The Security of Cipher Block Chaining 341--358
Henri Gilbert and
Pascal Chauvaud A Chosen Plaintext Attack of the $ 16
$-Round Khufu Cryptosystem . . . . . . . 359--368
Yukiyasu Tsunoo and
Eiji Okamoto and
Tomohiko Uyematsu Ciphertext Only Attack for One-Way
Function of the MAP Using One Ciphertext 369--382
Jennifer Seberry and
Xian-Mo Zhang and
Yuliang Zheng Pitfalls in Designing Substitution Boxes 383--396
Eyal Kushilevitz and
Adi Rosén A Randomness-Rounds Tradeoff in Private
Computation . . . . . . . . . . . . . . 397--410
Kazue Sako and
Joe Kilian Secure Voting Using Partially Compatible
Homomorphisms . . . . . . . . . . . . . 411--424
Ran Canetti and
Amir Herzberg Maintaining Security in the Presence of
Transient Faults . . . . . . . . . . . . 425--438
Anonymous Author Index . . . . . . . . . . . . . . 439
Gerhard Reinelt 1 Introduction . . . . . . . . . . . . . 1
Gerhard Reinelt 2 Basic Concepts . . . . . . . . . . . . 4
Gerhard Reinelt 3 Related Problems and Applications . . 31
Gerhard Reinelt 4 Geometric Concepts . . . . . . . . . . 42
Gerhard Reinelt 5 Candidate Sets . . . . . . . . . . . . 64
Gerhard Reinelt 6 Construction Heuristics . . . . . . . 73
Gerhard Reinelt 7 Improving Solutions . . . . . . . . . 100
Gerhard Reinelt 8 Fast Heuristics for Large Geometric
Problems . . . . . . . . . . . . . . . . 133
Gerhard Reinelt 9 Further Heuristic Approaches . . . . . 153
Gerhard Reinelt 10 Lower Bounds . . . . . . . . . . . . 161
Gerhard Reinelt 11 A Case Study: TSPs in PCB Production 187
Gerhard Reinelt 12 Practical TSP Solving . . . . . . . . 200
Gerhard Reinelt Appendix: TSPLIB . . . . . . . . . . . . 211
Anonymous References . . . . . . . . . . . . . . . 214
Anonymous Index . . . . . . . . . . . . . . . . . 222
G. Reinelt The Traveling Salesman: Computational
Solutions for TSP Applications . . . . . viii + 223
T. Cheatham Models, Languages, and Compiler
Technology for High Performance
Computers . . . . . . . . . . . . . . . 3
M. Cosnard and
M. Matamala On NC-Real Complexity Classes for
Additive Circuits and Their Relations
with NC . . . . . . . . . . . . . . . . 27
P. Duris and
J. D. P. Rolim E-Complete Sets Do Not Have Optimal
Polynomial Time Approximations . . . . . 38
S. L. Bloom and
Z. Esik Solving Polynomial Fixed Point Equations 52
J. A. Makowsky Capturing Complexity Classes with
Lindstroem Quantifiers . . . . . . . . . 68
B. Monien and
R. Diekmann and
R. Lueling Communication Throughput of
Interconnection Networks . . . . . . . . 72
J. Lipton and
M. J. O'Donnell Intuitive Counterexamples for
Constructive Fallacies . . . . . . . . . 87
F. Orejas and
E. Pino and
H. Ehrig Algebraic Methods in the Compositional
Analysis of Logic Programs . . . . . . . 112
M. Paterson and
V. Dancik Longest Common Subsequences . . . . . . 127
P. A. Pevzner and
R. J. Lipshutz Towards DNA Sequencing Chips . . . . . . 143
J. Sgall On-Line Scheduling of Parallel Jobs . . 159
G. Winskel Stable Bistructure Models of PCF . . . . 177
S. Albers A Competitive Analysis of the List
Update Problem with Lookahead . . . . . 201
F. Alessi and
M. Dezani-Ciancaglini and
U. De'Liguoro May and Must Convergency in Concurrent
lambda-Calculus . . . . . . . . . . . . 211
K. Ambos-Spies and
H.-C. Neis and
S. A. Terwijn Genericity and Measure for Exponential
Time . . . . . . . . . . . . . . . . . . 221
R. A. Baeza-Yates Analysis of Bounded Disorder . . . . . . 233
A. Bertoni and
C. Mereghetti and
G. Pighizzini On Languages Accepted with Simultaneous
Complexity Bounds and Their Ranking
Problem . . . . . . . . . . . . . . . . 245
F. S. De Boer and
M. Van Hulst A Proof System for Asynchronously
Communicating Deterministic Processes 256
A. Bouabdallah and
M. C. Heydemann and
J. Opatrny and
D. Sotteau Embedding Complete Binary Trees into
Star Networks . . . . . . . . . . . . . 266
C. Damm and
M. Holzer Inductive Counting below LOGSPACE . . . 276
J. Dassow Decision Problems for Edge Grammars . . 286
F. Dehne and
R. Klein ``The Big Sweep'': On the Power of the
Wavefront Approach to Voronoi Diagrams 296
P. Denejko and
K. Diks and
A. Pelc and
M. Piotrow Reliable Minimum Finding Comparator
Networks . . . . . . . . . . . . . . . . 306
A. Dessmark and
A. Lingas and
O. Garrido On Parallel Complexity of Maximum
$f$-Matching and the Degree Sequence
Problem . . . . . . . . . . . . . . . . 316
M. Dietzfelbinger and
J. Hromkovic and
G. Schnitger A Comparison of Two Lower Bound Methods
for Communication Complexity . . . . . . 326
S. Eyono Obono and
P. Goralcik and
M. Maksimenko Efficient Solving of the Word Equations
in One Variable . . . . . . . . . . . . 336
G. L. Ferrari and
U. Montanari and
P. Quaglia A $ \pi $-Calculus with Explicit
Substitutions: the Late Semantics . . . 342--351
M. Forti and
F. Honsell and
M. Lenisa Processes and Hyperuniverses . . . . . . 352
F. Frayman and
V. Kanevsky and
W. Kirchherr The Combinatorial Complexity of a Finite
String . . . . . . . . . . . . . . . . . 364
R. Gold A Fully Abstract Semantics for
Termination in Petri Nets . . . . . . . 373
M. Halfeld Ferrari Alves and
D. Laurent and
N. Spyratos Passive and Active Rules in Deductive
Databases . . . . . . . . . . . . . . . 383
T. Hegedus Combinatorial Results on the Complexity
of Teaching and Learning . . . . . . . . 393
M. Hermo Degrees and Reducibilities of Easy Tally
Sets . . . . . . . . . . . . . . . . . . 403
H. J. Hoogeboom and
P. Ten Pas MSO Definable Text Languages . . . . . . 413
J. Hromkovic and
J. Kari and
L. Kari and
D. Pardubska Two Lower Bounds on Distributive
Generation of Languages . . . . . . . . 423
P. Inverardi and
M. Venturini Zilli Rational Rewriting . . . . . . . . . . . 433
J. Karhumaeki and
W. Plandowski On the Size of Independent Systems of
Equations in Semigroups . . . . . . . . 443
M. Karpinski and
W. Rytter On a Sublinear Time Parallel
Construction of Optimal Binary Search
Trees . . . . . . . . . . . . . . . . . 453
D. Kavvadias and
G. E. Pantziou and
P. G. Spirakis and
C. D. Zaroliagis Hammock-on-Ears Decomposition: A
Technique for the Efficient Parallel
Solution of Shortest Paths and Other
Problems . . . . . . . . . . . . . . . . 462
R. Klasing The Relationship Between Gossiping in
Vertex-Disjoint Paths Mode and Bisection
Width . . . . . . . . . . . . . . . . . 473
P. K\rurka A Comparison of Finite and Cellular
Automata . . . . . . . . . . . . . . . . 484
K.-J. Lange and
K. Reinhardt Empty Alternation . . . . . . . . . . . 494
B. Le Saec and
I. Litovsky On the Minimization Problem for
omega-Automata . . . . . . . . . . . . . 504
C. Meinel and
A. Slobodova On the Complexity of Constructing
Optimal Ordered Binary Decision Diagrams 515
H. Narayanan and
S. Roy and
S. Patkar Approximation Algorithms for
Min-$k$-Overlap Problems Using the
Principal Lattice of Partitions Approach 525
R. De Nicola and
A. Labella A Completeness Theorem for
Nondeterministic Kleene Algebras . . . . 536
M. Papatriantafilou and
P. Tsigas How a Rainbow Colouring Function Can
Simulate Wait-Free Handshaking . . . . . 546
D. Plump Critical Pairs in Term Graph Rewriting 556
C. Priami and
D. Yankelevich Read-Write Causality . . . . . . . . . . 567
G. Richomme Some Trace Monoids Where Both the Star
Problem and the Finite Power Property
Problem are Decidable . . . . . . . . . 577
K. Salomaa and
D. Wood and
S. Yu Complexity of EOL Structural Equivalence 587
J. F. Sibeyn and
B. S. Chlebus and
M. Kaufmann Shorter Queues for Permutation Routing
on Meshes . . . . . . . . . . . . . . . 597
K. Sieber Full Abstraction for the Second Order
Subset of an ALGOL-like Language . . . . 608
A. Weber and
T. Head The Finest Homophonic Partition and
Related Code Concepts . . . . . . . . . 618
T. Kloks Treewidth: Computations and
Approximations . . . . . . . . . . . . . ix + 209
A. Szepietowski Turing Machines with Sublogarithmic
Space . . . . . . . . . . . . . . . . . viii + 114
C. Palamidessi Concurrent Constraint Programming . . . 1
D. Miller Specifications Using Multiple-Conclusion
Logic Programs . . . . . . . . . . . . . 3
R. Paige Viewing a Program Transformation System
at Work . . . . . . . . . . . . . . . . 5
T. Chikayama and
T. Fujise and
D. Sekita A Portable and Efficient Implementation
of KL1 . . . . . . . . . . . . . . . . . 25
D. A. Smith Why Multi-SLD Beats SLD (Even on a
Uniprocessor) . . . . . . . . . . . . . 40
E. Zaffanella and
R. Giacobazzi and
G. Levi Abstracting Synchronization in
Concurrent Constraint Programming . . . 57
P. Tarau and
U. Neumerkel A Novel Term Compression Scheme and Data
Representation in the BinWAM . . . . . . 73
J. Bevemyr and
T. Lindgren A Simple and Efficient Copying Garbage
Collector for Prolog . . . . . . . . . . 88
W. Schulte Deriving Residual Reference Count
Garbage Collectors . . . . . . . . . . . 102
M. Pettersson RML --- A New Language and
Implementation for Natural Semantics . . 117
L. H. Hamel and
J. A. Goguen Towards a Provably Correct Compiler for
OBJ3 . . . . . . . . . . . . . . . . . . 132
A. Voronkov An Implementation Technique for a Class
of Bottom-Up Procedures . . . . . . . . 147
R. Glueck and
M. H. Soerensen Partial Deduction and Driving are
Equivalent . . . . . . . . . . . . . . . 165
L. Moreau and
C. Queinnec Partial Continuations as the Difference
of Continuations. A Duumvirate of
Control Operators . . . . . . . . . . . 182
L. Birkedal and
M. Welinder Handwriting Program Generator Generators 198
M. Bugliesi and
H. M. Jamil A Logic for Encapsulation in Object
Oriented Languages . . . . . . . . . . . 215
T. Fruehwirth Annotated Constraint Logic Programming
Applied to Temporal Reasoning . . . . . 230
P. Codognet and
D. Diaz clp(B): Combining Simplicity and
Efficiency in Boolean Constraint Solving 244
F. Fages and
J. Fowler and
T. Sola Handling Preferences in Constraint Logic
Programming with Relational Optimization 261
S. Breitinger and
H. C. R. Lock Improving Search for Job-Shop Scheduling
with CLP (FD) . . . . . . . . . . . . . 277
A. Brogi and
A. Chiarelli and
P. Mancarella and
V. Mazzotta Implementations of Program Composition
Operations . . . . . . . . . . . . . . . 292
C. Codognet and
P. Codognet and
V. Loia and
M. Quaggetto Sleepers: a Versatile High-Level Control
Mechanism . . . . . . . . . . . . . . . 308
T. Metzemakers and
A. Miniussi and
D. Sherman and
R. Strandh Improving Arithmetic Performance Using
Fine-Grain Unfolding . . . . . . . . . . 324
M. Gergatsoulis and
M. Katzouraki Unfold/Fold Transformations for Definite
Clause Programs . . . . . . . . . . . . 340
J. Maraist and
F. S. K. Silbermann A Graph Reduction Technique with Sharing
Across Narrowings for Functional-Logic
Languages . . . . . . . . . . . . . . . 355
M. Hanus Combining Lazy Narrowing and
Simplifications . . . . . . . . . . . . 370
P. Arenas-Sanchez and
A. Gil-Luezas and
F. J. Lopez-Fraguas Combining Lazy Narrowing with
Disequality Constraints . . . . . . . . 385
G. Janssens and
M. Bruynooghe and
V. Englebert Abstracting Numerical Values in CLP(H,N) 400
J. Field and
F. Tip Dynamic Dependence in Term Rewriting
Systems and Its Application to Program
Slicing . . . . . . . . . . . . . . . . 415
D. Boulanger and
M. Bruynooghe and
M. Denecker Abstracting S-Semantics Using A
Model-Theoretic Approach . . . . . . . . 432
M. Serrano Using Higher Order Control Flow Analysis
When Compiling Functional Languages . . 447
F. Kluzniak and
M. Milkowska Readable, Runnable Requirements
Specifications in SPILL-2 . . . . . . . 449
J. P. Leal A System to Visualize and Interact with
Prolog Programs . . . . . . . . . . . . 451
J.-B. Hundehege and
W.-M. Lippe and
U. Xanten Semantic-Based Static Program
Transformations for Memory Space and Run
Time Optimization in Hybrid Languages 453
G. Grivas Towards a Constraint Functional Logic
Compiler for Symbolic Computation
Systems . . . . . . . . . . . . . . . . 455
O. Rodrigues and
M. Benevides PROMAL: Programming in Modal Action
Logic . . . . . . . . . . . . . . . . . 457
K. Bsaies Implementing the Synthesis of Properties
in Unfold/Fold Transformations . . . . . 459
F. Saenz and
W. Hans and
J. J. Ruz and
S. Winkler Shared Memory System for Babel: A VHDL
Specification . . . . . . . . . . . . . 461
A. Belkhir and
N. Nemouche Towards Integrating Functional and Logic
styles using Relation . . . . . . . . . 463
J. Barklund Tabulation of Functions in Definite
Clause Programs . . . . . . . . . . . . 465
A. Mantsivoda Flang System: A New Version . . . . . . 467
W. Snyder Automated Deduction with Constraints . . 1
C. Lynch Local Simplification . . . . . . . . . . 3
P. Barth Simplifying Clausal Satisfiability
Problems . . . . . . . . . . . . . . . . 19
T. E. Uribe and
M. E. Stickel Ordered Binary Decision Diagrams and the
Davis--Putnam Procedure . . . . . . . . 34
G. Smolka A Foundation for Higher-Order Concurrent
Constraint Programming . . . . . . . . . 50
F. Nielson and
A. R. Nielson Constraints for Polymorphic Behaviours
of Concurrent ML . . . . . . . . . . . . 73
J. Niehren and
G. Smolka A Confluent Relational Calculus for
Higher-Order Programming with
Constraints . . . . . . . . . . . . . . 89
Z. Quian and
K. Wang Modular AC-Unification of Higher-Order
Patterns . . . . . . . . . . . . . . . . 105
D. Lugiez Higher-Order Disunification: Some
Decidable Cases . . . . . . . . . . . . 121
A. Boudet and
E. Contejean ``Syntactic'' AC-Unification . . . . . . 136
H. Simonis Applications of Constraint Logic
Programming . . . . . . . . . . . . . . 152
S. Michaylov Repeated Redundant Inequalities in
Constraint Logic Programming . . . . . . 154
F. Tsutsumi An Efficient Algorithm of Logic
Programming with Constraint Hierarchy 170
R. Beckmann and
U. Bieker and
I. Markhof Application of Constraint Logic
Programming for VLSI CAD Tools . . . . . 183
P. Codognet and
G. Nardiello Path Consistency in clp(FD) . . . . . . 201
M. Dauchet Symbolic Constraints and Tree Automata 217
A. V. Hense and
G. Smolka A Record Calculus with Principal Types 219
M. Haberstrau ECOLOG: an Environment for COnstraint
LOGics . . . . . . . . . . . . . . . . . 237
C. Prehofer On Modularity in Term Rewriting and
Narrowing . . . . . . . . . . . . . . . 253
J. Avenhaus and
C. Loria-Saenz Higher-Order Conditional Rewriting and
Narrowing . . . . . . . . . . . . . . . 269
L. Bachmair and
H. Ganzinger Buchberger's Algorithm: a
Constraint-Based Completion Procedure 285
D. Kozen Set Constraints and Logic Programming 302
W. Charatonik Set Constraints in Some Equational
Theories . . . . . . . . . . . . . . . . 304
R. Backofen and
R. Treinen How to Win a Game with Features . . . . 320
R. Gilleron and
S. Tison and
M. Tommassi Some New Decidability Results on
Positive and Negative Set Constraints 336
P. Johann and
R. Socher-Ambrosius Solving Simplification Ordering
Constraints . . . . . . . . . . . . . . 352
D. R. McAuley Operating System Support for the Desk
Area Network . . . . . . . . . . . . . . 13
M. B. Jones Adaptive Real-Time Resource Management
Supporting Modular Composition of
Digital Multimedia Services . . . . . . 21
T. Pfeifer Micronet Machines --- New Architectural
Approaches for Multimedia End-systems 29
J. Nieh and
J. G. Hanko and
J. D. Northcutt and
G. A. Wall SVR4 UNIX Scheduler Unacceptable for
Multimedia Applications . . . . . . . . 41
G. Coulson and
G. S. Blair and
P. Robin and
D. Shepherd Extending the Chorus Micro-Kernel to
Support Continuous Media Applications 54
S. Oikawa and
H. Tokuda User-Level Real-Time Threads: An
Approach Towards High Performance
Multimedia Threads . . . . . . . . . . . 66
J. Grinham and
M. Spratt IEEE 802.12 Demand Priority and
Multimedia . . . . . . . . . . . . . . . 77
H. Saran and
S. Keshav and
C. R. Kalmanek and
S. P. Morgan A Scheduling Discipline and Admission
Control Policy for Xunet 2 . . . . . . . 89
J. M. Hyman and
A. A. Lazar and
G. Pacifici Modelling VC, VP and VN Bandwidth
Assignment Strategies in Broadband
Networks . . . . . . . . . . . . . . . . 102
H. Tokuda and
T. Kitayama Dynamic QOS Control Based on Real-Time
Threads . . . . . . . . . . . . . . . . 114
A. Campbell and
G. Coulson and
D. Hutchison A Multimedia Enhanced Transport Service
in a Quality of Service Architecture . . 124
M. Fry and
A. Richards and
A. Seneviratne Framework for Implementing the Next
Generation of Communication Protocols 138
D. L. Stone and
K. Jeffay Queue Monitoring: A Delay Jitter
Management Policy . . . . . . . . . . . 149
R. Keller and
W. Effelsberg and
B. Lamparter Performance Bottlenecks in Digital Movie
Systems . . . . . . . . . . . . . . . . 161
S. Ramanathan and
P. V. Rangan and
H. M. Vin Frame-Induced Packet Discarding: An
Efficient Strategy for Video Networking 173
O. Hagsand and
S. Pink ATM as a Link in an ST-2 Internet . . . 185
L. Delgrossi and
R. G. Herrtwich and
C. Vogt and
L. C. Wolf Reservation Protocols for Internetworks:
A Comparison of ST-II and RSVP . . . . . 195
T. D. C. Little and
D. Venkatesh Probabilistic Assignment of Movies to
Storage Devices in a Video-on-Demand
System . . . . . . . . . . . . . . . . . 204
K. K. Ramakrishnan and
L. Vaitzblit and
C. Gray and
U. Vahalia Operating System Support for a
Video-on-Demand File Service . . . . . . 216
K. Keeton and
R. H. Katz The Evaluation of Video Layout
Strategies on a High-Bandwidth File
Server . . . . . . . . . . . . . . . . . 228
D. Hoffman and
M. Speer and
G. Fernando Network Support for Dynamically Scaled
Multimedia Data Streams . . . . . . . . 240
Z. Wang and
J. Crowcroft A Unified Framework for Multicast
Forwarding . . . . . . . . . . . . . . . 252
J. C. Pasquale and
G. C. Polyzos and
E. W. Anderson and
V. P. Kompella Filter Propagation in Dissemination
Trees: Trading off Bandwidth and
Processing in Continuous Media Networks 259
H. R. Berenji Fuzzy Reinforcement Learning and Dynamic
Programming . . . . . . . . . . . . . . 1
J. F. Baldwin Fuzzy Sets, Fuzzy Clustering and Fuzzy
Rules in AI . . . . . . . . . . . . . . 10
A. Saffiotti and
E. H. Ruspini and
K. Konolige Robust Execution of Robot Plans Using
Fuzzy Logic . . . . . . . . . . . . . . 24
B. Bouchon-Meunier and
M. Ramdani and
L. Valverde Fuzzy Logic, Inductive and Analogical
Reasoning . . . . . . . . . . . . . . . 38
D. Dubois and
H. Prade Possibility Theory, Belief Revision and
Nonmonotonic Logic . . . . . . . . . . . 51
J. F. Baldwin and
M. R. Coyne and
T. P. Martin Querying a Database with Fuzzy Attribute
Values by Iterative Updating of the
Selection Criteria . . . . . . . . . . . 62
K. Woods and
D. Cook and
L. Hall and
L. Stark Learning Fuzzy Membership Functions in a
Function-Based Object Recognition System 77
S. B. Foong and
P. Z. Wang A Factor Space Approach to Concept
Representation . . . . . . . . . . . . . 97
N. K. Kasabov Connectionist Fuzzy Production Systems 114
A. R. Krommer and
C. W. Ueberhuber Numerical Integration on Advanced
Computer Systems . . . . . . . . . . . . xiii + 341
M. Hermann and
W. Hoffmann Fault Modeling and Test Generation for
FPGAs . . . . . . . . . . . . . . . . . 1
R. De Oliveira Duarte and
M. Nicolaidis A Test Methodology Applied to Cellular
Logic Programmable Gate Arrays . . . . . 11
M. Z. Servit and
Z. Muzikar Integrated Layout Synthesis for FPGAs 23
M. Robert and
L. Torres and
F. Moraes and
D. Auvergne Influence of Logic Block Layout
Architecture on FPGA Performance . . . . 34
I. Haritaoglu and
C. Aykanat A Global Routing Heuristic for FPGAs
Based on Mean Field Annealing . . . . . 45
K. Roy and
S. Prasad Power Dissipation Driven FPGA Place and
Route Under Delay Constraints . . . . . 57
A. H. Farrahi and
M. Sarrafzadeh FPGA Technology Mapping for Power
Minimization . . . . . . . . . . . . . . 66
H.-J. Brand and
D. Mueller and
W. Rosenstiel Specification and Synthesis of Complex
Arithmetic Operators for FPGAs . . . . . 78
T. Miyazaki and
H. Nakada and
A. Tsutsui and
K. Yamada A Speed-Up Technique for Synchronous
Circuits Realized as LUT-Based FPGAs . . 89
A. R. Naseer and
M. Balakrishnan and
A. Kumar An Efficient Technique for Mapping RTL
Structures onto FPGAs . . . . . . . . . 99
V. Hamann A Testbench Design Method Suitable for
FPGA-Based Prototyping of Reactive
Systems . . . . . . . . . . . . . . . . 111
E. Goldberg and
L. Krasilnikova Using Consensusless Covers for Fast
Operating on Boolean Functions . . . . . 114
T. Bartos and
N. Fristacky Formal Verification of Timing Rules in
Design Specifications . . . . . . . . . 117
A. Hlawiczka and
J. Binda Optimized Synthesis of Self-Testable
Finite State Machines (FSM) Using
BIST-PST Structures in Altera Structures 120
J. Lichtermann and
G. Neustaedter A High-Speed Rotation Processor . . . . 123
P. Gramata and
P. Trebaticky and
E. Gramatova The MD5 Message-Digest Algorithm in the
XILINX FPGA . . . . . . . . . . . . . . 126
B. Fagin and
P. Chintrakulchai A Reprogrammable Processor for Fractal
Image Compression . . . . . . . . . . . 129
T. Jebelean Implementing GCD Systolic Arrays on FPGA 132
R. B. Hughes and
G. Musgrave Formal CAD Techniques for
Safety-Critical FPGA Design and
Deployment in Embedded Subsystems . . . 135
T. Saluvere and
D. Kerek and
H. Tenhunen Direct Sequence Spread Spectrum Digital
Radio DSP Prototyping Using Xilinx FPGAs 138
R. Nguyen and
P. Nguyen FPGA Based Reconfigurable Architecture
for a Compact Vision System . . . . . . 141
R. W. Hartenstein and
R. Kress and
H. Reinig A New FPGA Architecture for
Word-Oriented Datapaths . . . . . . . . 144
P. M. Athanas and
A. L. Abbott Image Processing on a Custom Computing
Platform . . . . . . . . . . . . . . . . 156
C. Iseli and
E. Sanchez A Superscalar and Reconfigurable
Processor . . . . . . . . . . . . . . . 168
V. Salapura and
M. Gschwind and
O. Maischberger A Fast FPGA Implementation of a General
Purpose Neuron . . . . . . . . . . . . . 175
A. Ast and
J. Becker and
R. W. Hartenstein and
R. Kress Data-Procedural Languages for FPL-Based
Machines . . . . . . . . . . . . . . . . 183
M. Daumas and
J.-M. Muller and
J. Vuillemin Implementing On Line Arithmetic on PAM 196
X.-Y. Chen and
X.-P. Ling and
H. Amano Software Environment for WASMII: a Data
Driven Machine with a Virtual Hardware 208
M. Newman and
W. Luk and
I. Page Constraint-Based Hierarchical Placement
of Parallel Programs . . . . . . . . . . 220
T. Njoelstad and
J. Pihl and
J. Hofstad ZAREPTA: A Zero Lead-Time, All
Reconfigurable System for Emulation,
Prototyping and Testing of ASICs . . . . 230
R. W. Wieler and
Z. Zhang and
R. D. McLeod Simulating Static and Dynamic Faults in
BIST Structures with a FPGA Based
Emulator . . . . . . . . . . . . . . . . 240
T. Benner and
R. Ernst and
I. Koenenkamp and
U. Holtmann FPGA Based Prototyping for Verification
and Evaluation in Hardware-Software
Cosynthesis . . . . . . . . . . . . . . 251
A. Dollas and
B. Ward and
J. D. S. Babcock FPGA Based Low Cost Generic Reusable
Module for the Rapid Prototyping of
Subsystems . . . . . . . . . . . . . . . 259
B. K. Fawcett and
S. H. Kelem FPGA Development Tools: Keeping Pace
with Design Complexity . . . . . . . . . 271
S. H. Kelem Meaningful Benchmarks for Logic
Optimization of Table-Lookup FPGAs . . . 274
D. Lam Educational Use of Field Programmable
Gate Arrays . . . . . . . . . . . . . . 277
B. K. Fawcett and
N. Sawyer and
T. Williams HardWire: A Risk-Free FPGA-to-ASIC
Migration Path . . . . . . . . . . . . . 280
N. Toon Reconfigurable Hardware from
Programmable Logic Devices . . . . . . . 283
A. Katona and
P. Szolgay On some Limits of XILINX Based Control
Logic Implementations . . . . . . . . . 286
G. R. Cadek and
P. C. Thorwartl and
G. P. Westphal Experiences of Using XBLOX for
Implementing a Digital Filter Algorithm 289
N. Toon Continuous Interconnect provides
solution to Density/Performance
Trade-Off in Programmable Logic . . . . 292
O. P. Agrawal A High Density Complex PLD Family
optimized for Flexibility,
Predictability and 100% Routability . . 295
P. Lysaght and
D. McConnell and
H. Dick Design Experience with Fine-Grained
FPGAs . . . . . . . . . . . . . . . . . 298
A. Leaver FPGA Routing Structures from Real
Circuits . . . . . . . . . . . . . . . . 303
A. Klindworth A Tool-Set for Simulating Altera-PLDs
Using VHDL . . . . . . . . . . . . . . . 306
J. A. Hallas and
E. P. Mariatos and
M. K. Birbas and
A. N. Birbas A CAD Tool for the Development of an
Extra-Fast Fuzzy Logic Controller Based
on FPGAs and Memory Modules . . . . . . 309
C. P. Cowen and
S. Monaghan Performance Characteristics of the
Monte-Carlo Clustering Processor (MCCP)
--- a Field Programmable Logic Based
Custom Computing Machine . . . . . . . . 312
G. Boegel Vom and
P. Nauber and
J. Winkler A Design Environment with Emulation of
Prototypes for Hardware/Software Systems
Using XILINX FPGA . . . . . . . . . . . 315
J. Isoaho and
A. Jantsch and
H. Tenhunen DSP Development with Full-Speed
Prototyping Based on HW/SW Codesign
Techniques . . . . . . . . . . . . . . . 318
J. Danecek and
A. Pluhacek and
M. Z. Servit The Architecture of a General-Purpose
Processor Cell . . . . . . . . . . . . . 321
M. Gschwind and
C. Mautner The Design of a Stack-Based
Microprocessor . . . . . . . . . . . . . 326
M. Akil and
M. Alves de Barros Implementation and Performance
Evaluation of an Image Pre-Processing
Chain on FPGA . . . . . . . . . . . . . 332
E. P. Kalosha and
V. N. Yarmolik and
M. G. Karpovsky Signature Testability of PLA . . . . . . 335
I. Mat Bin and
J. M. Noras A FPL Prototyping Package with a C++
Interface for the PC Bus . . . . . . . . 338
J. J. Rodriguez-Andina and
J. Alvarez and
E. Mandado Design of Safety Systems Using Field
Programmable Gate Arrays . . . . . . . . 341
J. C. Debize and
R. J. Glaise A Job Dispatcher-Collector Made of FPGAs
for a Centralized Voice Server . . . . . 344
J. Depreitere and
H. Neefs and
H. Van Marck and
J. Van Campenhout An Optoelectronic $3$-D Field
Programmable Gate Array . . . . . . . . 352
K. Roy and
S. Nag On Channel Architecture and Routability
for FPGAs Under Faulty Conditions . . . 361
T. Isshiki and
W. W.-M. Dai High-Performance Datapath Implementation
on Field-Programmable Multi-Chip Module
(FPMCM) . . . . . . . . . . . . . . . . 373
S. Gehring and
S. Ludwig and
N. Wirth A Laboratory for a Digital Design Course
Using FPGAs . . . . . . . . . . . . . . 385
U. Meyer-Base and
A. Meyer-Baese and
W. Hilberg Coordinate Rotation Digital Computer
(CORDIC) Synthesis for FPGA . . . . . . 397
G. J. Kempa and
P. Rieger MARC: A Macintosh NUBUS-Expansion Board
Based Reconfigurable Test System for
Validating Communication Systems . . . . 409
P. Lysaght and
J. Stockwood and
J. Law and
D. Girma Artificial Neural Network Implementation
on a Fine-Grained FPGA . . . . . . . . . 421
C. Palamidessi Concurrent Constraint Programming . . . 1
D. Miller Specifications Using Multiple-Conclusion
Logic Programs . . . . . . . . . . . . . 3
R. Paige Viewing a Program Transformation System
at Work . . . . . . . . . . . . . . . . 5
M. Codish and
G. Mashevitzky Proving Implications by Algebraic
Approximation . . . . . . . . . . . . . 6
A. Bouhoula Sufficient Completeness and
Parameterized Proofs by Induction . . . 23
M. Bidoit and
R. Hennicker Proving Behavioural Theorems with
Standard First-Order Logic . . . . . . . 41
A. Werner and
A. Bockmayr and
S. Krischer How to Realize LSE Narrowing . . . . . . 59
M. Alpuente and
M. Falaschi and
G. Vidal Compositional Analysis for Equational
Horn Programs . . . . . . . . . . . . . 77
P. Balbiani Equation Solving in Projective Planes
and Planar Ternary Rings . . . . . . . . 95
F. Bueno and
M. Hermenegildo and
U. Montanari and
F. Rossi From Eventual to Atomic and Locally
Atomic CC Programs: A Concurrent
Semantics . . . . . . . . . . . . . . . 114
P. Volpe Concurrent Logic Programming as Uniform
Linear Proofs . . . . . . . . . . . . . 133
F. Teusink Three-Valued Completion for Abductive
Logic Programs . . . . . . . . . . . . . 150
S. Antoy and
A. Middeldorp A Sequential Reduction Strategy . . . . 168
B. Gramlich On Modularity of Termination and
Confluence Properties of Conditional
Rewrite Systems . . . . . . . . . . . . 186
M. C. F. Ferreira and
H. Zantema Syntactical Analysis of Total
Termination . . . . . . . . . . . . . . 204
M. Marchiori Logic Programs as Term Rewriting Systems 223
N. D. Jones and
M. Rosendahl Higher-Order Minimal Function Graphs . . 242
D. Kesner Reasoning About Layered, Wildcard and
Product Patterns . . . . . . . . . . . . 253
A. Bossi and
N. Cocco Prserving Universal Termination Through
Unfold/Fold . . . . . . . . . . . . . . 269
E. Marchiori A Logic for Variable Aliasing in Logic
Programs . . . . . . . . . . . . . . . . 287
K. R. Dickerson and
J. P. Chester Standards for Integrated Services and
Networks . . . . . . . . . . . . . . . . 5
J. Haallstrand and
D. Martin Industrial Requirements on a Service
Creation Environment . . . . . . . . . . 17
D. Keane and
C. Treanor and
C. Licciardi and
T. Mota Defining and Structuring Service
Requirements on the IN in order to
Evaluate IN Architecture Initiatives . . 27
M. Mac an Airchinnigh and
H.- J. Kugler Service Engineering versus Software
Engineering --- A Foundation Study . . . 39
N. A. Hine and
W. Beattie and
I. A. S. Gordon and
J. L. Arnott Integration of Adaptations for People
with Special Needs . . . . . . . . . . . 51
D. Androutsopoulos and
P. Kaijser and
S. Katsikas and
K. Presttun Surveillance and Protection in IBC
Management: The Applicability of Two
RACE Security Projects --- SecureNet II
and SESAME . . . . . . . . . . . . . . . 61
C. Condon and
S. Keuneke Metaphors and Layers of Signification:
The Consequences for Advanced User
Service Interfaces . . . . . . . . . . . 75
M. Abramovici and
N. Klussmann Graphical User Interface Style Guide for
Mobile Communication Services . . . . . 89
M. Boecker and
K. Hopf and
D. Runde Advanced Videocommunications with
Stereoscopy and Individual Perspectives 99
J. M. Haake and
J. Hannemann and
M. Thuering Hypermedia Applications for Distance
Education and Training . . . . . . . . . 109
K. Jakobs Future Communication Networks --- What
(Public) Service Providers Should
Provide . . . . . . . . . . . . . . . . 123
H. Braux and
J. Dreteler and
M. Grasdijk and
J.-L. Le Bail Modelling Services in the Portfolio from
a Service Provisioning Perspective . . . 133
H. Bisseling and
J. Den Hartog and
B. Schrijver Enhanced IN for Personal Communications 145
H. Li A Component Theory for Telecommunication
Architectures . . . . . . . . . . . . . 157
J. Haallstrand and
M. M. Marques and
L. Ponten Building Dedicated Service Creation
Environments for Reuse Based Production 169
A. Carvalho and
F. De Carvalho and
G. Pavlou Management of Optical Networks: SNMP
Agents Enabling TMN . . . . . . . . . . 181
L. H. Bjerring and
M. Tschichholz Requirements of Inter-Domain Management
and their Implications for TMN
Architecture and Implementation . . . . 193
W. Donnelly and
S. O'Connell Security Requirements of the TMN
X-Interface within End-to-End Service
Management of Virtual Private Networks 207
A. Carr and
G. Pavlou and
T. Tin High-Level Access APIs in the OSIMIS TMN
Platform: Harnessing and Hiding . . . . 219
A. M. Clarke and
S. M. Pomfrett User Requirements for Advanced
Communication Services . . . . . . . . . 235
N. Niebert and
E. Geulen Personal Communications --- What is
Beyond Radio? . . . . . . . . . . . . . 247
R. Davison and
P. O'Brien Service Provisioning in a Multi-Provider
Environment . . . . . . . . . . . . . . 259
L. A. De la Fuente and
J. Pavon and
N. Singer Application of TINA-C Architecture to
Management Services . . . . . . . . . . 273
N. Beires and
T. Magedanz and
M. Kockelmans An Evolutionary Approach for TMN
Management of IN Services . . . . . . . 285
I. De Caluwe and
P. Leever and
J. Wester The Use of TMN as an Architectural
Framework for Value Added Services
Management . . . . . . . . . . . . . . . 295
L. H. Bjerring and
J. M. Schneider End-to-End Service Management with
Multiple Providers . . . . . . . . . . . 305
U. Jonsson and
S. Kleier Personal Communication --- Network
Aspects and Implementations . . . . . . 321
P. Mudhar A Service Creation Environment for a
Future Intelligent Network . . . . . . . 333
D. Prevedourou and
G. D. Stamoulis and
I. Toennby and
T. An Providing Services in a World of IBC
Resources: An Architectural Approach . . 343
H. Berndt and
P. Graubmann and
M. Wakano Service Specification Concepts in TINA-C 355
P. Carvalho and
M. Mesquita and
L. Da Silva and
F. Roque Application of Distributed Techniques to
the Modelling of IN Architectures and
Support of Service Execution . . . . . . 367
G. Lacoste Distributed Transaction Processing in
the IBC . . . . . . . . . . . . . . . . 377
W. Bouma and
W. Levelt and
A. Melisse and
K. Middelburg Formalisation of Properties for Feature
Interaction Detection: Experience in a
Real-Life Situation . . . . . . . . . . 393
P. S. Nielsen and
B. Loenvig Development of Telecommunications
Management Systems Using OO Methods and
CASE Tool Support . . . . . . . . . . . 407
A. Newcombe and
D. D. Botvitch and
F. Lodge and
T. Curran A Decision Support System for Assurance
of Quality of Service in Intelligent
Network Service Provisioning . . . . . . 419
J. Keller and
O. Dubuisson Formal Description of OSI Management
Information Structure as a Prerequisite
for Formal Specifications of TMN
Interfaces . . . . . . . . . . . . . . . 433
Z. Lioupas and
Y. Manolessos and
M. Theologou Structuring Principles for Total Quality
Management in IBCN . . . . . . . . . . . 445
D. C. Doyle and
D. S. Cochrane Service/Resource Discovery and
Allocation . . . . . . . . . . . . . . . 455
L. Strick and
J. Meinkoehn Specifying Pan-European Management
Systems . . . . . . . . . . . . . . . . 467
E. Dahle and
P. L. Giganti Computational Modelling --- UPT Split
Charging Management Case . . . . . . . . 479
J. Oelnes and
P. Spilling and
A. Berquist Security in Use and Management of VPN
--- a Banking Scenario . . . . . . . . . 493
B. Baum-Waidner and
H. Bunz and
C. Capellaro SAMSON, Security Management in a Health
Care Scenario . . . . . . . . . . . . . 503
D. Maillot and
J. Oelnes and
P. Spilling IN Service Security and Service
Management Security and their
Relationships --- Using UPT as a Case
Study . . . . . . . . . . . . . . . . . 513
G. Bruno and
F. Lucidi and
J. Insulander and
U. Larsson A Service-Driven Vision of Integrated
Broadband Communications: the OSA
Approach . . . . . . . . . . . . . . . . 529
J.-P. Redlich and
D. Balfanz Concepts for a Flexible Service
Architecture . . . . . . . . . . . . . . 539
D. Sullivan and
P. McLaughlin A Comparison of the PRISM and OMNI-Point
Methodologies for the Specification of
Management Systems . . . . . . . . . . . 553
M. M. Mac an Airchinnigh and
G. O'Regan and
D. Belsnes Formal Methods and Service Specification 563
M. A. Hiltunen and
R. D. Schlichting A Model for Adaptive Fault-Tolerant
Systems . . . . . . . . . . . . . . . . 3
J.-C. Fabre and
Y. Deswartes and
B. Randell Designing Secure and Reliable
Applications using
Fragmentation-Redundancy-Scattering: An
Object-Oriented Approach . . . . . . . . 21
J. G. Silva and
L. M. Silva and
H. Madeira and
J. Bernardino A Fault-Tolerant Mechanism for Simple
Controllers . . . . . . . . . . . . . . 39
C. Bernardeschi and
A. Fantechi and
L. Simoncini Formal Reasoning on Fault Coverage of
Fault Tolerant Techniques . . . . . . . 77
S. Chiaradonna and
A. Bondavalli and
L. Strigini On Performability Modeling and
Evaluation of Software Fault Tolerance
Structures . . . . . . . . . . . . . . . 97
C. Antonelli and
V. Grassi Optimal Design of Fault-Tolerant
Soft-Real-Time Systems with Imprecise
Computations . . . . . . . . . . . . . . 115
A. Bobbio and
M. Telek Computational Restrictions for SPN with
Generally Distributed Transition Times 131
R. Ubar Test Generation for Digital Systems
Based on Alternative Graphs . . . . . . 151
M. Renovell and
P. Huc and
Y. Bertrand The Configuration Ratio: A Model for
Simulating CMOS Intra-Gate Bridge with
Variable Logic Thresholds . . . . . . . 165
A. Krasniewski and
L. B. Wronski Coverage of Delay Faults: When 13% and
99% Mean the Same . . . . . . . . . . . 178
H. Madeira and
M. Rela and
F. Moreira and
J. G. Silva RIFLE: A General Purpose Pin-level Fault
Injector . . . . . . . . . . . . . . . . 199
R. Johansson On Single Event Upset Error
Manifestation . . . . . . . . . . . . . 217
H. Zhu and
P. A. V. Hall and
J. H. R. May and
T. Cockram Injecting Faults into Environment
Simulators for Testing Safety Critical
Software . . . . . . . . . . . . . . . . 235
P. Thevenod-Fosse and
C. Mazuet and
Y. Crouzet On Statistical Structural Testing of
Synchronous Data Flow Programs . . . . . 250
G. Masseboeuf and
J. Pulou and
J. L. Rainard Hierarchical Test Analysis of VLSI
Circuits for Random BIST . . . . . . . . 271
P. Boehlau Zero Aliasing Compression Based on
Groups of Weakly Independent Outputs in
Circuits with High Complexity for Two
Fault Models . . . . . . . . . . . . . . 289
T. Lovric Systematic and Design Diversity ---
Software Techniques for Hardware Fault
Detection . . . . . . . . . . . . . . . 309
S. Gerber and
M. Goessel Detection of Permanent Hardware Faults
of a Floating Point Adder by
Pseudoduplication . . . . . . . . . . . 327
A. Watanabe and
K. Sakamura MLDD (Multi-Layered Design Diversity)
Architecture for Achieving High Design
Fault Tolerance Capabilities . . . . . . 336
B. Bieker and
E. Maehle and
G. Deconinck and
J. Vounckx Reconfiguration and Checkpointing in
Massively Parallel Systems . . . . . . . 353
J. Altmann and
F. Balbach and
A. Hein An Approach for Hierarchical System
Level Diagnosis of Massively Parallel
Computers Combined with a
Simulation-Based Method for
Dependability Analysis . . . . . . . . . 371
I. Majzik and
A. Pataricza and
M. Dal Cin and
W. Hohl Hierarchical Checking of Multiprocessors
Using Watchdog Processors . . . . . . . 386
J.-C. Laprie Dependability: The Challenge for the
Future of Computing and Communication
Technologies . . . . . . . . . . . . . . 407
B. Randell Some Lessons from the SW2000 Workshop 414
E. Schmitter Dependable Computing and its Industrial
Use . . . . . . . . . . . . . . . . . . 417
Y.-Y. Chen and
C.-H. Cheng and
Y.-C. Chou An Effective Reconfiguration Process for
Fault-Tolerant VLSI/WSI Array Processors 421
J. M. Tahir and
S. S. Dlay and
R. N. Gorgui-Naguib and
O. R. Hinton Concurrent Error Detection in Fast FNT
Networks . . . . . . . . . . . . . . . . 439
L. E. LaForge Feasible Regions Quantify the
Configuration Power of Arrays with
Multiple Fault Types . . . . . . . . . . 453
M. Kaaniche and
K. Kanoun and
M. Cukier and
M. Bastos Martini Software Reliability Analysis of Three
Successive Generations of a Switching
System . . . . . . . . . . . . . . . . . 473
G. Muller and
M. Hue and
N. Peyrouze Performance of Consistent Checkpointing
in a Modular Operating System: Results
of the FTM Experiment . . . . . . . . . 491
J.-H. Park and
H.-K. Lee and
J.-H. Cho Ring-Banyan Network: A Fault Tolerant
Multistage Interconnection Network and
its Fault Diagnosis . . . . . . . . . . 511
D. R. Avresky and
K. M. Al-Tawil Reconfiguration of Faulty Hypercubes . . 529
C.-S. Yang and
S.-Y. Wu Fault-Tolerance on Boolean $n$-Cube
Architectures . . . . . . . . . . . . . 546
M. Leu Relative Signatures for Fault Tolerance
and their Implementation . . . . . . . . 563
B. Folliot and
P. Sens GATOSTAR: A Fault Tolerant Load Sharing
Facility for Parallel Applications . . . 581
P. D. V. Van der Stok and
M. M. M. P. J. Claessen and
D. Alstein A Hierarchical Membership Protocol for
Synchronous Distributed Systems . . . . 599
V. Karamcheti and
A. A. Chien Do Faster Routers Imply Faster
Communication? . . . . . . . . . . . . . 1
M. E. Becker and
T. F. Knight Fast Arbitration in Dilated Routers . . 16
Thu Duc Nguyen and
L. Snyder Performance Analysis of a Minimal
Adaptive Router . . . . . . . . . . . . 31
J. Duato and
P. Lopez Performance Evaluation of Adaptive
Routing Algorithms for $k$-ary $n$-cubes 45
D. D. Chinn The Performance of Adaptive Routers on
Worst Case Permutations . . . . . . . . 60
S. Konstantinidou On the Effect of Queues Sizes and
Channel Scheduling Policies in the
Segment Router . . . . . . . . . . . . . 72
D. Scott Wills and
W. Stephen Lacy and
J. Cruz-Rivera The Offset Cube: An Optoelectronic
Interconnection Network . . . . . . . . 86
J. Nguyen and
J. Pezaris and
G. Pratt and
S. Ward Three-Dimensional Network Topologies . . 101
J. Rexford and
K. G. Shin Support for Multiple Classes of Traffic
in Multicomputer Routers . . . . . . . . 116
D. K. Panda and
S. Singal and
P. Prabhakaran Multidestination Message Passing
Mechanism Conforming to Base Wormhole
Routing Scheme . . . . . . . . . . . . . 131
C.-M. Chiang and
L. M. Ni Multi-address Encoding for Multicast . . 146
B. Abali and
C. Aykanat Routing Algorithms for IBM SP1 . . . . . 161
S. Heller Congestion-Free Routing on the CM-5 Data
Router . . . . . . . . . . . . . . . . . 176
T. Nesson and
L. Johnsson ROMM Routing: A Class of Efficient
Minimal Routing Algorithms . . . . . . . 185
F. T. Chong and
E. A. Brewer and
F. T. Leighton and
T. F. Knight Packaging and Multiplexing of
Hierarchical Scalable Expanders . . . . 200
I. Eslick and
A. DeHon and
T. Knight Guaranteeing Idempotence for
Tightly-Coupled, Fault-Tolerant Networks 215
K. Bolding and
W. Yost Design of a Router for Fault-Tolerant
Networks . . . . . . . . . . . . . . . . 226
W. J. Dally and
L. R. Dennison and
D. Harris and
K. Kan The Reliable Router: A Reliable and
High-Performance Communication Substrate
for Parallel Computers . . . . . . . . . 241
C. Dubnicki and
K. Li and
M. Mesarina Network Interface Support for User-Level
Buffer Management . . . . . . . . . . . 256
N. R. McKenzie and
K. Bolding and
C. Ebeling and
L. Snyder CRANIUM: An Interface for Message
Passing on Adaptive Packet Routing
Networks . . . . . . . . . . . . . . . . 266
S. Scott and
G. Thorson Optimized Routing in the Cray T3D . . . 281
A. Davis and
R. Hodgson and
I. Robinson and
L. Cherkasova R2: A Damped Adaptive Router Design . . 295
G. A. Boughton Arctic Routing Chip . . . . . . . . . . 310
K. Hwang Scalability and Programmability of
Massively Parallel Processors . . . . . 1
I. Foster and
C. Kesselman Language Constructs and Runtime Systems
for Compositional Parallel Programming 5
M. S. Lam Locality Optimizations for Parallel
Machines . . . . . . . . . . . . . . . . 17
B. Mohr and
D. Brown and
A. Malony TAU: A Portable Parallel Program
Analysis Environment for pC++ . . . . . 29
H. Wabnig and
G. Haring and
D. Kranzlmueller and
J. Volkert Communication Pattern Based Performance
Prediction on the nCUBE 2 Multiprocessor
System . . . . . . . . . . . . . . . . . 41
A. Ferscha and
J. Johnson Performance Oriented Development of SPMD
Programs Based on Task Structure
Specifications . . . . . . . . . . . . . 53
S. Grabner and
D. Kranzlmueller Monitoring for Detecting Bugs and
Blocking Communication . . . . . . . . . 66
L. J. Levrouw and
K. M. R. Audenaert Minimizing the Log Size for Execution
Replay of Shared-Memory Programs . . . . 76
W. Kastner and
S. Stoeckler and
R. Zeitlberger GOLD MINE: Specification Language for
Event-Based Monitoring . . . . . . . . . 88
L. Bouge and
Y. Le Guyadec and
G. Uiard and
B. Virot On the Expressivity of a Weakest
Precondition Calculus for a Simple
Data-Parallel Programming Language . . . 100
E. Violard and
G.- R. Perrin Reduction in PEI . . . . . . . . . . . . 112
D. K. Arvind and
B. R. J. McConnell Towards the Synthesis of Asynchronous
Concurrent Programs . . . . . . . . . . 124
A. M. Geerling Formal Derivation of SIMD Parallelism
from Non-Linear Recursive Specifications 136
S. Fitzpatrick and
T. J. Harmer and
J. M. Boyle Deriving Efficient Parallel
Implementations of Algorithms Operating
on General Sparse Matrices Using
Automatic Program Transformation . . . . 148
S. Kindermann Flexible Program and Architecture
Specification for Massively Parallel
Systems . . . . . . . . . . . . . . . . 160
S. G. Sedukhin and
I. S. Sedukhin Systematic Approach and Software Tool
for Systolic Design . . . . . . . . . . 172
L. Lau and
M. Rezny and
J. Belward and
K. Burrage ADVISE --- Agricultural Developmental
Visualisation Interactive Software
Environment . . . . . . . . . . . . . . 184
U. Detert and
M. Gerndt TOP02 Tool Suite for the Development and
Testing of Parallel Applications . . . . 196
M. Amor and
M. J. Martin and
D. Blanco and
O. G. Plata Vectorization of the Radix $r$
Self-Sorting FFT . . . . . . . . . . . . 208
M. Clint and
J. S. Weston and
J. B. Flannagan Efficient Gram--Schmidt
Orthogonalisation on an Array Processor 218
M. K. Stojcev and
E. I. Milovanovic and
M. D. Mihajlovic and
I. Z. Milovanovic Parallel Algorithm for Inverting
Tridiagonal Matrix on Linear Processor
Array . . . . . . . . . . . . . . . . . 229
T. Jebelean Systolic Algorithms for Long Integer GCD
Computation . . . . . . . . . . . . . . 241
B. Di Martino and
G. Iannello Parallelization of Non-Simultaneous
Iterative Methods for Systems of Linear
Equations . . . . . . . . . . . . . . . 253
T. Rauber and
G. Ruenger Hypercube Implementation and Performance
Analysis for Extrapolation Models . . . 265
W. Zimmermann and
W. Loewe An Approach to Machine-Independent
Parallel Programming . . . . . . . . . . 277
S. Prestwich On Logic Program Parallelisation
Strategies . . . . . . . . . . . . . . . 289
S. G. Akl and
L. F. Lindon Paradigms Admitting Superunitary
Behaviour in Parallel Computation . . . 301
C. Limongelli and
R. Pirastu Exact Solution of Linear Systems over
Rational Numbers by Parallel $p$-adic
Arithmetic . . . . . . . . . . . . . . . 313
H. Hong and
H. W. Loidl Parallel Computation of Modular
Multivariate Polynomial Resultants on a
Shared Memory Machine . . . . . . . . . 325
Y. Tanaka and
S. Matsui and
A. Maeda and
M. Nakanishi Partial Marking GC . . . . . . . . . . . 337
S. D. Nikolovoulos Parallel Recognition and Location
Algorithms for Chordal Graphs Using
Distance Matrices . . . . . . . . . . . 349
M. Dion and
M. Gengler and
S. Ubeda Comparing two Probabilistic Models of
the Computational Complexity of the
Branch and Bound Algorithm . . . . . . . 359
J. Chen Parallel Heap Construction Using
Multiple Selection . . . . . . . . . . . 371
I. Gorton and
T. S. Chan and
I. Jelly Engineering High Quality Parallel
Software Using PARSE . . . . . . . . . . 381
A. Spalt and
E. Spiegl and
T. Meikl Massively Parallel Volume Rendering . . 393
W. Stuerzlinger and
C. Wild Parallel Visibility Computations for
Parallel Radiosity . . . . . . . . . . . 405
M. Valero and
M. Peiron and
E. Ayguade Memory Access Synchronization in Vector
Multiprocessors . . . . . . . . . . . . 414
M. S. Yousif and
C. R. Das A Switch Cache Design for MIN-Based
Shared-Memory Multiprocessors . . . . . 426
R. Kattner and
M. Eger and
C. Mueller-Schloer Modeling Cache Coherence Overhead with
Geometric Objects . . . . . . . . . . . 438
S. Luepke Accelerated Access to Shared Distributed
Arrays on Distributed Memory Systems by
Access Objects . . . . . . . . . . . . . 449
R. Berrendorf and
M. Gerndt and
Z. Lahjomri and
T. Priol A Comparison of Shared Virtual Memory
and Message Passing Programming
Techniques Based on a Finite Element
Application . . . . . . . . . . . . . . 461
R. Dohmen Comparison Between a Message Passing and
a Global Shared Memory Parallel Computer
by Means of a Concrete Monte-Carlo
Algorithm . . . . . . . . . . . . . . . 473
R. Milikowski and
W. G. Vree Non-homogeneous Parallel Memory
Operations in a VLIW Machine . . . . . . 485
T. Buelck and
A. Held and
W. Kluge and
S. Pantke Experience with the Implementation of a
Concurrent Graph Reduction System on an
nCube/2 Platform . . . . . . . . . . . . 497
P. Lincoln and
J. Meseguer and
L. Ricciulli The Rewrite Rule Machine Node
Architecture and Its Performance . . . . 509
K. Hammond and
J. Mattson and
S. L. Peyton Jones Automatic Spark Strategies and
Granularity for a Parallel Functional
Language Reducer . . . . . . . . . . . . 521
W. Schreiner Virtual Tasks for the PACLIB Kernel . . 533
J.-Y. Le Gall and
F. Simon MUSE: a Message Passing Concurrent
Computer for On-Board Space Systems . . 545
R. S. Hogg and
D. W. Lloyd and
W. I. Hughes Self-Timed Communication Strategies for
Massively Parallel Systolic
Architectures . . . . . . . . . . . . . 557
M. D. Feng and
Y. Q. Gao and
C. K. Yuen Distributed Linda Tuplespace Algorithms
and Implementations . . . . . . . . . . 581
P. Bailey and
M. Newey and
D. Sitsky and
R. Stanton Supporting Coarse and Fine Grain
Parallelism in an Extension of ML . . . 593
C. Calvin and
L. Colombet and
F. Desprez and
B. Jargot Towards Mixed Computation/Communication
in Parallel Scientific Libraries . . . . 605
R. A. Bagley and
P. A. Wilsey and
N. B. Abu-Ghazaleh Composing Functional Unit Blocks for
Efficient Interpretation of MIMD Code
Sequences on SIMD Processors . . . . . . 616
J. Llosa and
M. Valero and
J. A. B. Fortes and
E. Ayguade Using Sacks to Organize Registers in
VLIW Machines . . . . . . . . . . . . . 628
R. Govindarajan and
E. R. Altman and
G. R. Gao A Framework for Resource-Constrained
Rate-Optimal Software Pipelining . . . . 640
J.-Y. Berthou Design of a Meta-Parallelizer for Large
Scientific Applications . . . . . . . . 652
B. Chapman and
P. Mehrotra and
J. V. Rosendale and
H. Zima A Software Architecture for
Multidisciplinary Applications:
Integrating Task and Data Parallelism 664
M. Griebl and
C. Lengauer On Scanning Space-Time Mapped While
Loops . . . . . . . . . . . . . . . . . 677
M. R. Werth and
P. Feautrier Optimizing Communications by Using
Compile Time Analysis . . . . . . . . . 689
R. Andonov and
S. Rajopadhye Optimal Tile Sizing . . . . . . . . . . 701
V. Bouchitte and
P. Boulet and
A. Darte and
Y. Robert Evaluating Array Expressions on
Massively Parallel Machines with
Communication/Computation Overlap . . . 713
S. P. Johnson and
C. S. Ierotheou and
M. Cross and
P. F. Leggett User Interaction and Symbolic Extensions
to Dependence Analysis . . . . . . . . . 725
V. Maslov and
W. Pugh Simplifying Polynomial Constraints Over
Integers to Make Dependence Analysis
More Precise . . . . . . . . . . . . . . 737
S. R. Oehring and
S. K. Das and
D. H. Hohndel Asymptotically Optimal Communication
Algorithms on Faulty Folded Petersen
Networks . . . . . . . . . . . . . . . . 749
R. Trobec and
I. Jerebic Optimization of Diagnostic Examination 761
G. Chen and
F. C. M. Lau Laying Out Midimew Networks with
Constant Dilation . . . . . . . . . . . 773
P. Fraigniaud and
C. Gavoille Optimal Interval Routing . . . . . . . . 785
A. Ferreira and
A. Goldman vel Lejbman and
S. W. Song Broadcasting in Bus Interconnection
Networks . . . . . . . . . . . . . . . . 797
D. Deserable Broadcasting in the Arrowhead Torus . . 808
I. Haritaoglu and
C. Aykanat An Efficient Mapping Heuristic for
Mesh-Connected Parallel Architectures
Based on Mean Field Annealing . . . . . 820
M. Schwehm and
T. Walter Mapping and Scheduling by Genetic
Algorithms . . . . . . . . . . . . . . . 832
J. W. Meyer Self-Organizing Processes . . . . . . . 842
T. Le Sergent and
B. Berthomieu Balancing Load under Large and Fast Load
Changes in Distributed Computing Systems 854
A. Elleuch and
R. Kanawati and
T. Muntean and
E.-G. Talbi Dynamic Load Balancing Mechanisms for a
Parallel Operating System Kernel . . . . 866
J. L. Roch and
A. Vermeerbergen and
G. Villard A New Load-Prediction Scheme Based on
Algorithmic Cost Functions . . . . . . . 878
A. V. Goldberg Optimization Algorithms for Large
Networks . . . . . . . . . . . . . . . . 1
G. H. Gonnet Wanna Buy an Algorithm? Cheap! or:
Algorithms for Text Searching Which
Could Have Commercial Value . . . . . . 10
A. Garg and
R. Tamassia Planar Drawings and Angular Resolution:
Algorithms and Bounds . . . . . . . . . 12
T. Biedl and
G. Kant A Better Heuristic for Orthogonal Graph
Drawings . . . . . . . . . . . . . . . . 24
E. M. Arkin and
M. Held and
J. S. B. Mitchell and
S. S. Skiena Hamiltonian Triangulations for Fast
Rendering . . . . . . . . . . . . . . . 36
S. Arya and
M. Smid Efficient Construction of a Bounded
Degree Spanner with Low Weight . . . . . 48
P. Berman and
U. Foessmeier and
M. Karpinski and
M. Kaufmann Approaching the 5/4-Approximation for
Rectilinear Steiner Trees . . . . . . . 60
A. Brodnik and
J. I. Munro Membership in Constant Time and Minimum
Space . . . . . . . . . . . . . . . . . 72
A. Andersson and
S. Nilsson Faster Searching in Tries and Quadtrees
--- An Analysis of Level Compression . . 82
P. V. Poblete and
A. Viola and
J. I. Munro The Analysis of a Hashing Scheme by the
Diagonal Poisson Transform . . . . . . . 94
S. Carlsson and
J. Chen Some Lower Bounds for Comparison-Based
Algorithms . . . . . . . . . . . . . . . 106
X. Zhou and
T. Nishizeki An Efficient Algorithm for Edge-Ranking
Trees . . . . . . . . . . . . . . . . . 118
K. Weihe Edge-Disjoint $ (s, t) $-Paths in
Undirected Planar Graphs in Linear Time 130
M. Stoer and
F. Wagner A Simple Min Cut Algorithm . . . . . . . 141
J. D. Cho and
S. Raje and
M. Sarrafzadeh Approximation Algorithm on Multi-Way
Maxcut Partitioning . . . . . . . . . . 148
V. Chepoi and
F. Dragan A Linear-Time Algorithm for Finding a
Central Vertex of a Chordal Graph . . . 159
A. Israeli and
A. Shirazi The Time Complexity of Updating Snapshot
Memories . . . . . . . . . . . . . . . . 171
G. Parlati and
M. Yung Non-Exploratory Self-Stabilization for
Constant-Space Symmetry-Breaking . . . . 183
C. Lund and
N. Reingold and
J. Westbrook and
D. Yan On-Line Distributed Data Management . . 202
T. Asano and
N. Katoh and
T. Tokuyama A Unified Scheme for Detecting
Fundamental Curves in Binary Edge Images 215
C. Burnikel and
K. Mehlhorn and
S. Schirra How to Compute the Voronoi Diagram of
Line Segments: Theoretical and Practical
Results . . . . . . . . . . . . . . . . 227
M. H. Overmars and
A. F. Van der Stappen Range Searching and Point Location among
Fat Objects . . . . . . . . . . . . . . 240
J.-D. Boissonnat and
J. Czyzowicz and
O. Devillers and
J.-M. Robert Convex Tours of Bounded Curvature . . . 254
Y.-J. Chiang and
R. Tamassia Optimal Shortest Path and Minimum-Link
Path Queries in the Presence of
Obstacles . . . . . . . . . . . . . . . 266
P. Gupta and
R. Janardan and
M. Smid Fast Algorithms for Collision and
Proximity Problems Involving Moving
Geometric Objects . . . . . . . . . . . 278
I. Schiermeyer Reverse-Fit: A 2-Optimal Algorithm for
Packing Rectangles . . . . . . . . . . . 290
B. Chen and
A. Van Vliet and
G. J. Woeginger An Optimal Algorithm for Preemptive
On-Line Scheduling . . . . . . . . . . . 300
A. Srivastav and
P. Stangier Tight Approximations for Resource
Constrained Scheduling Problems . . . . 307
D. Wedelin An Algorithm for $0$-$1$ Programming
with Application to Airline Crew
Scheduling . . . . . . . . . . . . . . . 319
S. K. Das and
P. Ferragina An o(n) Work EREW Parallel Algorithm for
Updating MST . . . . . . . . . . . . . . 331
P. G. Franciosa and
G. Gambosi and
U. Nanni On the Structure of DFS-Forests on
Directed Graphs and the Dynamic
Maintenance of DFS on DAG's . . . . . . 343
N. Alon and
R. Yuster and
U. Zwick Finding and Counting Given Length Cycles 354
I. Ben-Aroya and
A. Schuster Greedy Hot-Potato Routing on the Mesh 365
J. F. Sibeyn Desnakification of Mesh Sorting
Algorithms . . . . . . . . . . . . . . . 377
A. Pietracaprina and
G. Pucci Tight Bounds on Deterministic PRAM
Emulations with Constant Redundancy . . 391
B. S. Chlebus and
A. Gambin and
P. Indyk PRAM Computations Resilient to Memory
Faults . . . . . . . . . . . . . . . . . 401
G. Bilardi and
P. Bay An Area Lower Bound for a Class of
Fat-Trees . . . . . . . . . . . . . . . 413
H. B. Hunt and
M. V. Marathe and
V. Radhakrishnan and
S. S. Ravi A Unified Approach to Approximation
Schemes for NP- and PSPACE-Hard Problems
for Geometric Graphs . . . . . . . . . . 424
R. Greenlaw and
J. Machta The Parallel Complexity of Eden Growth,
Solid-on-Solid Growth and Ballistic
Deposition . . . . . . . . . . . . . . . 436
A. Schoenhage and
E. Vetter A New Approach to Resultant Computations
and Other Algorithms with Exact Division 448
W. Plandowski Testing Equivalence of Morphisms on
Context-Free Languages . . . . . . . . . 460
L. Gasieniec and
K. Park Work-Time Optimal Parallel Prefix
Matching . . . . . . . . . . . . . . . . 471
D. Breslauer and
L. Colussi and
L. Toniolo On the Exact Complexity of the String
Prefix-Matching Problem . . . . . . . . 483
P. Ferragina Incremental Text Editing: A New Data
Structure . . . . . . . . . . . . . . . 495
D. Tsichritzis Research as a Catalyst for Industrial
Innovation . . . . . . . . . . . . . . . 1
P. Dechamboux and
C. Roncancio Peplom0d: an Object Oriented Database
Programming Language Extended with
Deductive Capabilities . . . . . . . . . 2
U. Hohenstein and
R. Lauffer and
P. Weikert Object-Oriented Database Systems: How
Much SQL Do They Understand? . . . . . . 15
M. A. Ketabchi and
S. Dasananda and
R. Mikkilineni and
X. Li An Object-Centered Application
Development System . . . . . . . . . . . 27
M. Novak and
G. Gardarin and
P. Valduriez Flora: A Functional-Style Language for
Object and Relational Algebra . . . . . 37
Y. Chen and
T. Haerder On the Optimal Top-down Evaluation of
Recursive Queries . . . . . . . . . . . 47
A. Kumar A Study of Spatial Clustering Techniques 57
N. Lorentzos and
Y. Manolopoulos Efficient Management of 2-d Interval
Relations . . . . . . . . . . . . . . . 72
F. Burger and
G. Quirchmayr and
S. Reich and
A. M. Tjoa Managing Structured Documents in
Distributed Publishing Environments . . 83
I. Hawryszkiewycz A Generalized Semantic Model for CSCW
Systems . . . . . . . . . . . . . . . . 93
H. U. Hoppe and
J. Zhao C-TORI: An Interface for Cooperative
Database Retrieval . . . . . . . . . . . 103
W. Rupietta Organization Models for Cooperative
Office Applications . . . . . . . . . . 114
M. Castellanos and
F. Saltor and
M. Garcia-Solaco Semantically Enriching Relational
Databases into an Object Oriented
Semantic Model . . . . . . . . . . . . . 125
X. Li and
Z. Tari Consistency Checking of Evolving Methods 135
N. Sakamoto and
K. Ushijima Designing and Integrating Human Genome
Databases with Object-Oriented
Technology . . . . . . . . . . . . . . . 145
G. Spanoudakis and
P. Constantopoulos On Evidential Feature Salience . . . . . 153
V. Ng and
T. Kameda The R-Link Tree: A Recoverable Index
Structure for Spatial Data . . . . . . . 163
D. Papadias and
Y. Theodoridis and
T. Sellis The Retrieval of Direction Relations
Using R-trees . . . . . . . . . . . . . 173
O. G. Tsatalos and
Y. E. Ioannidis A Unified Framework for Indexing in
Database Systems . . . . . . . . . . . . 183
J. Macedo and
R. R. Usano An Intelligent System to Identify the
Appropriate Organization for a Factory 193
I. P. Tatsiopoulos Object-Oriented Design of Manufacturing
Database Helps Simplify Production
Management in Small Firms . . . . . . . 204
D. A. Xerokostas and
K. G. Aravossis A Solution Procedure for Solving the
Non-Rectangular Cutting Stock Problem of
the Clothing Industry Using Expert
Knowledge within an Intelligent CAD
Environment . . . . . . . . . . . . . . 214
N. Edelweiss and
J. P. M. De Oliveira and
B. Pernici An Object-Oriented Approach to a
Temporal Query Language . . . . . . . . 225
S. Kokkotos and
C. D. Spyropoulos A Framework for Developing Temporal
Databases . . . . . . . . . . . . . . . 236
C.-K. Li and
S. Wang Efficient Storage Structures for
Temporal Object-Oriented Databases . . . 246
S. Soukeras and
P. J. H. King TFDL: A Temporal Functional Language for
the Management of Historical Databases 259
B. Theodoulidis and
A. Ait-Braham and
G. Karvelis The ORES Temporal DBMS and the ERT-SQL
Query Language . . . . . . . . . . . . . 270
F. Bonfatti and
P. D. Monari and
P. Paganelli Object-Oriented Constraint Analysis in
Complex Applications . . . . . . . . . . 280
A. Krotopoulou and
P. Spirakis and
D. Terpou and
A. Tsakalidis A Conceptual Database Approach for
Modelling $3$D Objects of Irregular
Geometry . . . . . . . . . . . . . . . . 290
M. Teisseire and
R. Cicchetti An Algebraic Language for Event-Driven
Modelling . . . . . . . . . . . . . . . 300
A. Toval and
I. Ramos and
O. Pastor Prototyping Object-Oriented
Specifications in an Algebraic
Environment . . . . . . . . . . . . . . 310
A. De Korvin and
G. Quirchmayr and
S. Hashemi Identifying Precedents under Uncertainty 320
D. Merkl and
E. Schweighofer and
W. Winiwarter CONCAT --- Connotation Analysis of
Thesauri Based on the Interpretation of
Context Meaning . . . . . . . . . . . . 329
D. Spinellis The Design and Implementation of a Legal
Text Database . . . . . . . . . . . . . 339--348
J. G. L. Van der Wees Maintenance of Juricas Legal Computer
Advice Systems . . . . . . . . . . . . . 349
J. Mylopoulos Expert Systems for Industrial Process
Control: A Study in Technology Transfer 359
B. Defude and
H. Martin From a Passive to an Active Database
Supporting Exceptions . . . . . . . . . 360
H. Kawano and
S. Nishio and
J. Han and
T. Hasegawa How Does Knowledge Discovery Cooperate
with Active Database Techniques in
Controlling Dynamic Environment? . . . . 370
W. Naqui and
M. T. Ibrahim EECA: An Active Knowledge Model . . . . 380
L. Palopoli and
R. Torlone Active and Passive Rules for Complex
Object Databases . . . . . . . . . . . . 390
S. Gancarski and
G. Jomier Managing Entity Versions within Their
Contexts: A Formal Approach . . . . . . 400
U. Hahn and
M. Klenner Tracking the Evolution of Concepts in
Dynamic Worlds . . . . . . . . . . . . . 410
C. Rolland and
N. Prakash Tracing the Evolution of Artifacts . . . 420
A. H. M. Ter Hofstede and
H. A. Proper and
T. P. Van der Weide Supporting Information Disclosure in an
Evolving Environment . . . . . . . . . . 433
A. I. Abdelmoty and
N. W. Paton and
M. H. Williams and
A. A. A. Fernandes Geographic Data Handling in a Deductive
Object-Oriented Database . . . . . . . . 445
E.- Y. Kettal Expert Spatial Knowledge: An Expert
Geographical Information System in
Diffusion of Water . . . . . . . . . . . 455
C. B. Medeiros and
G. Jomier Using Versions in GIS . . . . . . . . . 465
G. Metakides The Strategic Role of Information
Technology towards the Information
Society . . . . . . . . . . . . . . . . 475
G. Gardarin Federating Object-Oriented and
Relational Databases . . . . . . . . . . 476
R. M. Kaplan Bridging the Gap between Knowledge
Engineering and Efficient Implementation
in an Intelligent Tutoring System . . . 477
D. Landes and
R. Studer Mechanisms for Structuring
Knowledge-Based Systems . . . . . . . . 488
M. Nikolaidu and
D. Lelis and
D. Mouzakis and
P. Georgiadis Distributed System Intelligent Design 498
I. Gaviotis and
D. Christodoulakis A Model for Hypermedia Based Production
Systems . . . . . . . . . . . . . . . . 509
Y. Hara and
R. A. Botafogo Hypermedia Databases: A Specification
and Formal Language . . . . . . . . . . 521
A. Hatzimanikatis and
A. Papadopoulos and
D. Christodoulakis Implementing Open Hypermedia Services on
Top of the Postgres Extended Relational
Database Management System . . . . . . . 531
A. Tsalgatidov and
Z. Palaskas and
C. Halatsis and
M. Hatzopoulos A Support System for Building Hypermedia
Training Applications . . . . . . . . . 540
R. Bayer and
P. Vogel and
S. Wiesener OMNIS/Myriad Document Retrieval and Its
Database Requirements . . . . . . . . . 550
R. Layaida and
M. Boughanem and
A. Caron Constructing an Information Retrieval
System with Neural Networks . . . . . . 561
J. S. Yoo and
Y.- J. Lee and
J. W. Chang and
M. H. Kim The HS File: A New Dynamic Signature
File Method for Efficient Information
Retrieval . . . . . . . . . . . . . . . 571
S. Billet-Coat and
D. Herin-Aime A Multi-Agent Architecture for an
Evolving Expert System Module . . . . . 581
S. Y. Lee and
T. W. Ling Improving Integrity Constraint Checking
for Stratified Deductive Databases . . . 591
J. J. Prichard and
L. C. DiPippo and
J. Peckham and
V. F. Wolfe RTSORAC: A Real-Time Object-Oriented
Database Model . . . . . . . . . . . . . 601
O. Ulusoy Applying Database Technology to
Real-Time Systems . . . . . . . . . . . 611
S. Aggarwal and
I. Kim and
W. Meng Database Exploration with Dynamic
Abstractions . . . . . . . . . . . . . . 621
P. Bosc and
L. Lietard and
O. Pivert Soft Querying, a New Feature for
Database Management Systems . . . . . . 631
E. Gunter and
L. Libkin OR-SML: A Functional Database
Programming Language for Disjunctive
Information and Its Applications . . . . 641
Y.-W. Lee and
S. I. Yoo Semantic Query Optimization in OODB
Systems . . . . . . . . . . . . . . . . 651
C. Goble and
P. Crowther and
D. Solomon A Medical Terminology Server . . . . . . 661
C. Houstis and
T. S. Papatheodorou and
V. Verykios and
A. Floratos BIND: a Biomedical Interoperable
Database system . . . . . . . . . . . . 671
G. Pangalos and
A. Pomporisis and
L. Bozios and
M. Khair Development of Secure Medical Database
Systems . . . . . . . . . . . . . . . . 680
M. Van Dyne and
C. Tsatsoulis and
J. Thorp Using Inductive Machine Learning, Expert
Systems and Case Based Reasoning to
Predict Preterm Delivery in Pregnant
Women . . . . . . . . . . . . . . . . . 690
P. Drescher and
M. Holetha and
R. Kruschinski and
G. Laufkoetter Integrating Frames, Rules and
Uncertainty in a Database-Coupled
Knowledge-Representation System . . . . 703
M. N. Kamel A Prototype Rule-Based Front End System
for Integrity Enforcement in Relational
Databases: An Application to the Naval
Aircraft Flight Records Database . . . . 713
V. S. Lakshmanan and
F. Sadri Modeling Uncertainty in Deductive
Databases . . . . . . . . . . . . . . . 724
G. Papakonstantinou and
C. Voliotis and
N. M. Sgouros Dependency-Directed Binding of Variables
for Constraint Logic Programming . . . . 734
H. Afsarmanesh and
M. Wiedijk and
L. O. Hertzberger Flexible and Dynamic Integration of
Multiple Information Bases . . . . . . . 744
L. Boeszoermenyi and
J. Eder and
C. Weich PPOST: A Parallel Database in Main
Memory . . . . . . . . . . . . . . . . . 754
A. Hameurlain and
F. Morvan Exploiting Inter-Operation Parallelism
for SQL Query Optimization . . . . . . . 759
M. Berndtsson Reactive Object-Oriented Databases and
CIM . . . . . . . . . . . . . . . . . . 769
M. Eberl Advanced Computer Integrated Technology
for Furniture Manufacturing . . . . . . 779
V. Marik and
J. Lazansky and
J. Koutnik and
T. Hazdra A Distributed System for CIM . . . . . . 785
P. Starzacher and
W. Woess Integrated-Company-Software (INCOSOFT)
--- a Special Solution for Small- and
Medium-sized Companies . . . . . . . . . 795
O. Babaoglu and
A. Bartoli and
G. Dini Replicated File Management in
Large-scale Distributed Systems . . . . 1
J. Keller and
W. J. Paul and
D. Scheerer Realization of PRAMs: Processor Design 17
A. K. Lenstra Factoring . . . . . . . . . . . . . . . 28
A. Schiper and
A. Sandoz Primary Partition
``Virtually-synchronous Communication''
Harder than Consensus . . . . . . . . . 39
M. Yung Secure Distributed Computing: Theory and
Practice . . . . . . . . . . . . . . . . 53
S. Chaudhuri and
M. R. Tuttle Fast Increment Registers . . . . . . . . 74
M. Choy and
A. K. Singh Coping with Contention . . . . . . . . . 89
R. Cori and
S. Moran Exotic Behaviour of Consensus Numbers 101
S. Haldar and
P. S. Subramanian Space-optimum Conflict-free Construction
of 1-Writer 1-Reader Multivalued Atomic
Variable . . . . . . . . . . . . . . . . 116
M. Inoue and
W. Chen and
T. Masuzawa and
N. Tokura Linear-time Snapshot Using Multi-writer
Multi-reader Registers . . . . . . . . . 130
M. Moir and
J. H. Anderson Fast, Long-lived Renaming . . . . . . . 141
O. Rachman Anomalies in the Wait-free Hierarchy . . 156
P. Alimonti and
P. Flocchini and
N. Santoro Finding the Extreme of a Distributed
Multiset . . . . . . . . . . . . . . . . 164
H. Attiya and
R. Rappoport The Level of Handshake Required for
Establishing a Connection . . . . . . . 179
H. Attiya and
H. Shachnai and
T. Tamir Local Labeling and Resource Allocation
Using Preprocessing . . . . . . . . . . 194
I. Cidon and
O. Gerstel and
S. Zaks A Scalable Approach to Routing in ATM
Networks . . . . . . . . . . . . . . . . 209
L. Shabtay and
A. Segall Low Complexity Network Synchronization 223
B. Swaminathan and
K. J. Goldman An Incremental Distributed Algorithm for
Computing Biconnected Components . . . . 238
J. A. Garay Reaching (and Maintaining) Agreement in
the Presence of Mobile Faults . . . . . 253
J.-H. Hoepman Uniform Deterministic Self-stabilizing
Ring-orientation on Odd-length Rings . . 265
W.-K. Lo and
V. Hadzilacos Using Failure Detectors to Solve
Consensus in Asynchronous Shared-memory
Systems . . . . . . . . . . . . . . . . 280
Y.-K. Tsay and
R. L. Bagrodia An Algorithm with Optimal Failure
Locality for the Dining Philosophers
Problem . . . . . . . . . . . . . . . . 296
N. Allenberg-Navony and
A. Itai and
S. Moran Average and Randomized Complexity of
Distributed Problems . . . . . . . . . . 311
B. Awerbuch and
B. Patt-Shamir and
G. Varghese and
S. Dolev Self-stabilization by Local Checking and
Global Reset . . . . . . . . . . . . . . 326
T. Basten Breakpoints and Time in Distributed
Computations . . . . . . . . . . . . . . 340
F. Ruget Cheaper Matrix Clocks . . . . . . . . . 355
F. Exertier and
S. Haj Houssain Issues in Extending a Relational System
with Object-Oriented Features . . . . . 1
R. Herzig and
M. Gogolla An SQL-Like Query Calculus for
Object-Oriented Database Systems . . . . 20
J.-L. Chen and
D. McLeod and
D. O'Leary Schema Evolution for Object-Based
Accounting Database Systems . . . . . . 40
A. Carzaniga and
G. P. Picco and
G. Vigna Designing and Implementing Inter-Client
Communication in the O2 Object-Oriented
Database Management System . . . . . . . 53
A. M. D. Moreira and
R. G. Clark Rigorous Object-Oriented Analysis . . . 65
C. Rouxel and
J.-P. Velu and
M. Texier and
D. Leroey Object-Oriented Methodologies for Large
Scale Projects: Does It Work? . . . . . 79
G. Pomberger and
W. Pree Quantitative and Qualitative Aspects of
Object-Oriented Software Development . . 96
F. Bonfatti and
P. D. Monari Towards a General Purpose Approach to
Object-Oriented Analysis . . . . . . . . 108
S. W. Liddle and
D. W. Embley and
S. N. Woodfield A Seamless Model for Object-Oriented
Systems Development . . . . . . . . . . 123
J. Ebert and
G. Engels Structural and Behavioral Views on
OMT-Classes . . . . . . . . . . . . . . 142
L. Mathiassen and
A. Munk-Madsen and
P. A. Nielsen and
J. Stage Combining Two Approaches to
Object-Oriented Analysis . . . . . . . . 158
D. Montesi and
R. Torlone A Rewriting Technique for Implementing
Active Object Systems . . . . . . . . . 171
G. Kappel and
S. Rausch-Schott and
W. Retschitzegger Beyond Coupling Modes: Implementing
Active Concepts on Top of a Commercial
OODBMS . . . . . . . . . . . . . . . . . 189
J. Huffman Hayes Testing of Object-Oriented Programming
Systems (OOPS): A Fault-Based Approach 205
C. Shrivastava and
D. L. Carver and
R. Shrivastava An Ambiguity Resolution Algorithm . . . 221
S. Kochhar On Providing a High-Level C Interface
for an Object-Oriented C++ System . . . 232
M. Paltrinieri Integrating Objects with
Constraint-Programming Languages . . . . 248
G. Boccignone and
A. Chianese and
M. De Santo and
A. Picariello Object-Oriented Representation of Shape
Information . . . . . . . . . . . . . . 266
M. P. Papa and
G. Ragucci and
G. Corrente and
M. Ferrise The Development of an Object-Oriented
Multimedia Information System . . . . . 278
M. L. Damiani An Intelligent Information System for
Heterogeneous Data Exploration . . . . . 298
P. Graham and
K. Barker Effective Optimistic Concurrency Control
in Multiversion Object Bases . . . . . . 313
F. Parisi-Presicce and
A. Pierantonio Reusing Object-Oriented Design: An
Algebraic Approach . . . . . . . . . . . 329
S. Castano and
V. De Antonellis Reuse in Object-Oriented Information
Systems Development . . . . . . . . . . 346
P. Corbellini and
P. Della Vigna and
F. Mercalli and
M. Pugliese An Object-Oriented Approach to the
Integration of Online Services into
Office Automation Environments . . . . . 359
L. Mich and
R. Garigliano A Linguistic Approach to the Development
of Object-Oriented Systems Using the NL
System LOLITA . . . . . . . . . . . . . 371
S. Agerholm LCF Examples in HOL . . . . . . . . . . 1
F. Andersen and
K. D. Petersen and
J. S. Pettersson A Graphical Tool for Proving UNITY
Progress . . . . . . . . . . . . . . . . 17
C. M. Angelo and
L. Claesen and
H. De Man Reasoning About a Class of Linear
Systems of Equations in HOL . . . . . . 33
J.- P. Bodeveix and
M. Filali and
P. Roche Towards a HOL Theory of Memory . . . . . 49
S. H. Brackin Providing Tractable Security Analyses in
HOL . . . . . . . . . . . . . . . . . . 65
N. G. De Bruijn Highlighting the Lambda-free Fragment of
Automath . . . . . . . . . . . . . . . . 81
H. Busch First-Order Automation for
Higher-Order-Logic Theorem Proving . . . 97
J. Camilleri and
V. Zammit Symbolic Animations as a Proof Tool . . 113
N. Chapman and
S. Finn and
M. P. Fourman Datatypes in L2 . . . . . . . . . . . . 128
C.-T. Chou A Formal Theory of Undirected Graphs in
Higher-Order Logic . . . . . . . . . . . 144
C.-T. Chou Mechanical Verification of Distributed
Algorithms in Higher-Order Logic . . . . 158
P. Curzon Tracking Design Changes with Formal
Verification . . . . . . . . . . . . . . 177
T. Forster Weak Systems of Set Theory Related to
HOL . . . . . . . . . . . . . . . . . . 193
D. A. Fura and
A. K. Somani Interval-Semantic Component Models and
the Efficient Verification of
Transaction-Level Circuit Behavior . . . 205
B. T. Graham An Interpretation of NODEN in HOL . . . 221
K. Hanna Reasoning about Real Circuits . . . . . 235
J. Harrison Binary Decision Diagrams as a HOL
Derived Rule . . . . . . . . . . . . . . 254
P. V. Homeier and
D. F. Martin Trustworthy Tools for Trustworthy
Programs: A Verified Verification
Condition Generator . . . . . . . . . . 269
J. Joyce and
N. Day and
M. Donat S: A Machine Readable Specification
Notation Based on Higher Order Logic . . 285
M. Larsson An Engineering Approach to Formal
Digital System Design . . . . . . . . . 300
J.-Y. Lu and
S.-K. Chin Generating Designs Using an Algorithmic
Register Transfer Language with Formal
Semantics . . . . . . . . . . . . . . . 316
T. Laangbacka A HOL Formalisation of the Temporal
Logic of Actions . . . . . . . . . . . . 332
S. Maharaj and
E. Gunter Studying the ML Module System in HOL . . 346
I. S. W. B. Prasetya Towards a Mechanically Supported and
Compositional Calculus to Design
Distributed Algorithms . . . . . . . . . 362
R. Reetz and
T. Kropf Simplifying Deep Embedding: A Formalised
Code Generator . . . . . . . . . . . . . 378
K. Schneider and
R. Kumar and
T. Kropf Automating Verification by Functional
Abstraction at the System Level . . . . 391
K. Slind A Parameterized Proof Manager . . . . . 407
S. Tahar and
R. Kumar Implementational Issues for Verifying
RISC-Pipeline Conflicts in HOL . . . . . 424
P. J. Windley Specifying Instruction-Set Architectures
in HOL: A Primer . . . . . . . . . . . . 440
J. Von Wright Representing Higher Order Logic Proofs
in HOL . . . . . . . . . . . . . . . . . 456
M. F. Laughton Communications and Information
Technology for Persons with Disabilities
--- The Canadian National Strategy as an
Example . . . . . . . . . . . . . . . . 1
T. Kieninger and
N. Kuhn and
K. Seidenschwann and
W. Weiss An Intelligent Information System For
Blind People --- AI Technology and
Philosophical Aspects . . . . . . . . . 9
A. J. Karshmer and
B. Ogden and
P. Brawner and
K. Kaugars Adapting Graphical User Interfaces for
Use by Visually Handicapped Computer
Users: Current Results and Continuing
Research . . . . . . . . . . . . . . . . 16
G. Weber and
H. Petrie and
D. Kochanek and
S. Morley Training Blind People in the Use of
Graphical User Interfaces . . . . . . . 25
H. H. Bothe and
E. A. Wieden Artificial Visual Speech, Synchronized
with a Speech Synthesis System . . . . . 32
J. Lee Notational Representation of Sign
Language: A Structural Description of
Hand Configuration . . . . . . . . . . . 38
J. E. Oakey Further Advances in Real-Time Voice to
Text with Steno Interpreters . . . . . . 46
C. Buehler and
H. Heck and
R. Wallbruch A Uniform Control Interface for Various
Electronic Aids . . . . . . . . . . . . 51
A. Tronconi and
M. Billi An Integrated System for Communication
and Equipments Control Using Radio Link 59
C. Flachberger and
P. Panek and
W. L. Zagler AUTONOMY --- A Flexible and Easy-to-Use
Assistive System to Support the
Independence of Handicapped and Elderly
Persons . . . . . . . . . . . . . . . . 65
J. W. Thatcher Screen Reader/2 --- Programmed Access to
the GUI . . . . . . . . . . . . . . . . 76
D. Kochanek Designing an OffScreen Model for a GUI 89
P. Graziani and
B. Breschi Screen Reader for Windows Based on
Speech Output . . . . . . . . . . . . . 96
W. Schmitt and
W. Zang The New Wireless LinguControl . . . . . 101
W. Kerstner and
G. Pigel and
M. Tscheligi The FeelMouse: Making Computer Screens
Feelable . . . . . . . . . . . . . . . . 106
D. R. Bowes Unexpected Benefits of Voice Type
Computing . . . . . . . . . . . . . . . 115
H. Eftring Robot Control Methods Using the RAID
Workstation . . . . . . . . . . . . . . 120
H. Neverya and
G. Bolmsjoe The Ultrasonic Navigating Robot, WALKY 129
S. P. Levine and
D. A. Bell and
Y. Koren NavChair: An Example of a Shared-Control
System for Assistive Technologies . . . 136
K. Crispien and
W. Wuerz and
G. Weber Using Spatial Audio for the Enhanced
Presentation of Synthesized Speech
within Screen-Readers for Blind Computer
Users . . . . . . . . . . . . . . . . . 144
N. Vigouroux and
B. Oriola Multimodal Concept for a New Generation
of Screen Reader . . . . . . . . . . . . 154
A. R. Kennel Auditory Extension of User Interfaces 162
R. J. Cooper and
J. C. Senge An Attempt to Define Fully-Accessible
Workstation Levels of Accessibility . . 164
J. Kalcher and
D. Flotzinger and
S. Goelly and
C. Neuper Graz Brain-Computer Interface (BCI) II 170
A. D. Cherry and
M. S. Hawley and
M. Freeman and
P. A. Cudd Human-Computer Interfacing for the
Severely Physically Disabled . . . . . . 177
G. Busby Day and Assessment Training Technology
Centres . . . . . . . . . . . . . . . . 185
R. J. Leneway The North America Association of
Rehabilitation Programs in Computer
Technology Seeks to Network with Other
Training Programs . . . . . . . . . . . 189
Q. Li and
M. Guo Disability and Rehabilitation Database
in Chinese Language . . . . . . . . . . 192
J. P. Lane Toward a Single Global Market for
Assistive Technology . . . . . . . . . . 195
N. Ayres and
T. Wesley Using Structure Within Electronic
Documents to Make Editors More
Accessible . . . . . . . . . . . . . . . 198
G. Lokowandt and
W. Schweikhardt Distinguishing Pattern-Types in Printed
Documents . . . . . . . . . . . . . . . 206
B. Bauwens and
J. Engelen and
F. Evenepoel and
C. Tobin Structuring Documents: The Key to
Increasing Access to Information for the
Print Disabled . . . . . . . . . . . . . 214
J. Klaus Study Center for Visually Impaired
Persons --- Supportive System for Blind
and Partially Sighted Students at the
University of Karlsruhe/Germany . . . . 222
L. Moravcikova Support Center for Visually Impaired
Students . . . . . . . . . . . . . . . . 229
R. Wagner and
B. Stoeger and
K. Miesenberger Educational Endeavour ``Computer Science
for the Blind'' --- State of the Art and
Experiences in Supporting Visually
Handicapped Students . . . . . . . . . . 236
B. Stoeger and
K. Miesenberger Modellversuch ``Informatik für Blinde'' 244
K. M. S. Barnes and
R. W. Jotham and
C. I. G. Sherman Cottage Industry at NewLink . . . . . . 246
M. Zampiceni Telework for Handicapped People: An
Experience . . . . . . . . . . . . . . . 249
J. H. Ramseur and
L. S. Gardner and
D. S. Painter AbleProfessionals: A Recruiting and
Accommodation Service for Atlanta
Employers . . . . . . . . . . . . . . . 252
P. Resele and
W. Resele ``NewsReader'' --- A Comfortable-Digital
Newspaper and Bookreading System . . . . 255
K. Hansson and
L. Soennebo and
J. Lindholm Digital Talking Books --- A Report from
a Practical, Ongoing Project . . . . . . 262
A. Schneider and
C. Pescia The Electronic Kiosk --- Accessing
Newspapers with Electronic Media . . . . 269
H.-H. Nagel Al Approaches towards Sensor-Based
Driver Support in Road Vehicles . . . . 1
S.-E. Bornscheuer and
M. Thielscher Representing Concurrent Actions and
Solving Conflicts . . . . . . . . . . . 16
K. Goos Preselection Strategies for Case Based
Classification . . . . . . . . . . . . . 28
E. Stopp and
K.- P. Gapp and
G. Herzog and
T. Laengle Utilizing Spatial Relations for Natural
Language Access to an Autonomous Mobile
Robot . . . . . . . . . . . . . . . . . 39
F. Baader and
M. Buchheit and
B. Hollunder Cardinality Restrictions on Concepts . . 51
M. Pomplun and
B. Velichkovsky and
H. Ritter An Artificial Neural Network for High
Precision Eye Movement Tracking . . . . 63
V. Kuznetsov A Kripke-Kleene Logic over General Logic
Programs . . . . . . . . . . . . . . . . 70
J. Dix and
M. Mueller The Stable Semantics and its Variants: A
Comparison of Recent Approaches . . . . 82
C. Gloeckner and
A. Grieszl and
M. Mueller and
M. Ronthaler TabVer: A Case Study in Table
Verbalization . . . . . . . . . . . . . 94
A. Jameson and
B. Kipper and
A. Ndiaye and
R. Schaefer Cooperating to be Noncooperative: The
Dialog System PRACMA . . . . . . . . . . 106
B. Pfahringer Robust Constructive Induction . . . . . 118
T. Fuhr and
F. Kummert and
G. Sagerer Enriching a Semantic Network Language by
Integrating Qualitative Reasoning
Techniques . . . . . . . . . . . . . . . 130
V. Haarslev and
R. Moeller and
C. Schroeder Combining Spatial and Terminological
Reasoning . . . . . . . . . . . . . . . 142
J. W. Schaaf Detecting Gestalts in CAD-Plans to be
used as Indices for Case-retrieval in
Architecture . . . . . . . . . . . . . . 154
E. Schikuta The NeuDB-System: Towards the
Integration of Neural Networks and
Database Systems . . . . . . . . . . . . 166
J. Quantz and
S. Suska Weighted Defaults in Description Logics:
Formal Properties and Proof Theory . . . 178
A. Becker and
G. Lakemeyer Epistemic Queries in Classic . . . . . . 190
B. Van Linder and
W. Van der Hoek and
J.-J. C. Meyer Communicating Rational Agents . . . . . 202
J. Meyer-Fujara and
B. Heller and
S. Schlegelmilch and
I. Wachsmuth Knowledge-Level Modularization of a
Complex Knowledge Base . . . . . . . . . 214
W. Lukaszewicz and
E. Madalinska-Bugaj Program Verification Techniques as a
Tool for Reasoning about Action and
Change . . . . . . . . . . . . . . . . . 226
L. F. Del Cerro and
A. Herzig A Conditional Logic for Updating in the
Possible Models Approach . . . . . . . . 237
G. Schurz Probabilistic Justification of Default
Reasoning . . . . . . . . . . . . . . . 248
G. Zaverucha A Prioritized Contextual Default Logic:
Curing Anomalous Extensions with a
Simple Abnormality Default Theory . . . 260
J. P. Delgrande and
T. H. Schaub Incorporating Specificity into
Circumscriptive Theories . . . . . . . . 272
H. Rott Coherent Choice and Epistemic
Entrenchment . . . . . . . . . . . . . . 284
Z. Lin and
W. Li A Note on Tableaux of Logic of Paradox 296
N. Asher and
J. Lang When Nonmonotonicity Comes from
Distances . . . . . . . . . . . . . . . 308
G. Becher and
U. Petermann Rigid Unification by Completion and
Rigid Paramodulation . . . . . . . . . . 319
M. Kohlhase Unification in a Sorted lambda-Calculus
with Term Declarations and Function
Sorts . . . . . . . . . . . . . . . . . 331
J. Denzinger and
M. Fuchs Goal Oriented Equational Theorem Proving
Using Team Work . . . . . . . . . . . . 343
I. P. Gent and
T. Walsh The Hardest Random SAT Problems . . . . 355
P. Madden Formal Methods for Automated Program
Improvement . . . . . . . . . . . . . . 367
X. Huang and
M. Kerber and
M. Kohlhase and
J. Richts Adapting Methods to Novel Tasks in Proof
Planning . . . . . . . . . . . . . . . . 379
J. W. Amtrup Using Charts for Transfer in MT . . . . 391
M. Baaz and
K. Hoerwein A New Frame for Common-Sense Reasoning
--- Towards Local Inconsistencies . . . 392
M.-O. Cordier and
P. Siegel Prioritized Transitions for Updates . . 393
J. Eckerle An Optimal Bidirectional Search
Algorithm . . . . . . . . . . . . . . . 394
B. Filipic and
I. Zun and
M. Perpar Learning to Discriminate Phases in
Gas-Liquid Flow . . . . . . . . . . . . 395
J. Giesl and
I. Neumann Strategies for Semantical Contractions 396
J. S. J. H. Penders Conflicts in the Spatial Interaction of
Autonomous Agents . . . . . . . . . . . 397
S. Rapp and
M. Jessen and
G. Dogil Using Rough Sets Theory to Predict
German Word Stress . . . . . . . . . . . 398
K. Schaedler Graph-theoretical Algorithms and
Knowledge-Based Design . . . . . . . . . 399
E. Ternovskaia Interval Situation Calculus . . . . . . 400
A. Itai Learning Morphology --- Practice Makes
Good . . . . . . . . . . . . . . . . . . 5
Y. Takada A Hierarchy of Language Families
Learnable by Regular Language Learners 16
P. Dupont and
L. Miclet and
E. Vidal What Is the Search Space of the Regular
Inference? . . . . . . . . . . . . . . . 25
J. M. Sempere and
P. Garcia A Characterization of Even Linear
Languages and its Application to the
Learning Problem . . . . . . . . . . . . 38
L.-V. Ciortuz Object-Oriented Inferences in a Logical
Framework for Feature Grammars . . . . . 45
M. Jardino and
G. Adda Automatic Determination of a Stochastic
Bi-Gram Class Language Model . . . . . . 57
C. De Marcken The Acquisition of a Lexicon from Paired
Phoneme Sequences and Semantic
Representations . . . . . . . . . . . . 66
S. Della Pietra and
V. Della Pietra and
J. Gillet and
J. Lafferty Inference and Estimation of a Long-Range
Trigram Model . . . . . . . . . . . . . 78
A. Castellanos and
I. Galiano and
E. Vidal Application of OSTIA to Machine
Translation Tasks . . . . . . . . . . . 93
A. Stolcke and
S. Omohundro Inducing Probabilistic Grammars by
Bayesian Model Merging . . . . . . . . . 106
F. Casacuberta Statistical Estimation of Stochastic
Context-Free Grammars Using the
Inside-Outside Algorithm and a
Transformation on Grammars . . . . . . . 119
J. A. Sanchez and
J. M. Benedi Statistical Inductive Learning of
Regular Formal Languages . . . . . . . . 130
R. C. Carrasco and
J. Oncina Learning Stochastic Regular Grammars by
Means of a State Merging Method . . . . 139
H. Ahonen and
H. Mannila and
E. Nikunen Forming Grammars for Structured
Documents: an Application of Grammatical
Inference . . . . . . . . . . . . . . . 153
S. Lucas and
E. Vidal and
A. Amiri and
S. Hanlon A Comparison of Syntactic and
Statistical Techniques for Off-Line OCR 168
J. Ruiz and
P. Garcia The Algorithms RT and k-TTI: a First
Comparison . . . . . . . . . . . . . . . 180
M. Roques Dynamic Grammatical Representations in
Guided Propagation Networks . . . . . . 189
R. Alquezar and
A. Sanfeliu A Hybrid Connectionist-Symbolic Approach
to Regular Grammatical Inference Based
on Neural Learning and Hierarchical
Clustering . . . . . . . . . . . . . . . 203
J.-Y. Giordano Inference of Context-Free Grammars by
Enumeration: Structural Containment as
an Ordering Bias . . . . . . . . . . . . 212
P. Wyard Representational Issues for Context Free
Grammar Induction Using Genetic
Algorithms . . . . . . . . . . . . . . . 222
P. Dupont Regular Grammatical Inference from
Positive and Negative Samples by Genetic
Search: the GIG Method . . . . . . . . . 236
J. H. Wright and
G. J. F. Jones and
H. Lloyd-Thomas Training and Application of Integrated
Grammar/Bigram Language Models . . . . . 246
M. Osborne and
D. Bridge Learning Unification-Based Grammars
Using the Spoken English Corpus . . . . 260
M. D. Dennis and
A. M. Wallington and
G. R. Sampson Stochastic Optimization of a
Probabilistic Language Model . . . . . . 271
S. J. Young and
H.-H. Shih Computer Assisted Grammar Construction 282
L. Fix and
F. B. Schneider Hybrid Verification by Exploiting the
Environment . . . . . . . . . . . . . . 1
J. Hooman Correctness of Real Time Systems by
Construction . . . . . . . . . . . . . . 19
L. Lamport and
S. Merz Specifying and Verifying Fault-Tolerant
Systems . . . . . . . . . . . . . . . . 41
A. Pnueli Development of Hybrid Systems . . . . . 77
C. Zhou Linear Duration Invariants . . . . . . . 86
A. Arora Efficient Reconfiguration of Trees: A
Case Study in Methodical Design of
Nonmasking Fault-Tolerant Programs . . . 110
M. Von der Beeck A Comparison of Statecharts Variants . . 128
A. Benveniste and
B. C. Levy and
E. Fabre and
P. Le Guernic A Calculus of Stochastic Systems for the
Specification, Simulation, and Hidden
State Estimation of Hybrid
Stochastic/Non-stochastic Systems . . . 149
D. Bosscher and
I. Polak and
F. Vaandrager Verification of an Audio Control
Protocol . . . . . . . . . . . . . . . . 170
A. Bouajjani and
R. Echahed and
R. Robbana Verifying Invariance Properties of Timed
Systems with Duration Variables . . . . 193
H. Boucheneb and
G. Berthelot Predicting Logical and Temporal
Properties of Real-Time Systems Using
Synchronized Elementary Nets . . . . . . 211
S. Bradley and
W. Henderson and
D. Kendall and
A. Robson Designing and Implementing Correct
Real-Time Systems . . . . . . . . . . . 228
M. Broy and
K. Stoelen Specification and Refinement of Finite
Dataflow Networks --- a Relational
Approach . . . . . . . . . . . . . . . . 247
V. Gafni and
A. Yehudai and
Y. A. Feldman Activation-Oriented Specification of
Real-Time Systems . . . . . . . . . . . 268
J. He and
C. A. R. Hoare and
M. Fraenzle and
M. Mueller-Olm Provably Correct Systems . . . . . . . . 288
J. He and
J. Zheng Simulation Approach to Provably Correct
Hardware Compilation . . . . . . . . . . 336
T. A. Henzinger and
P. W. Kopke Verification Methods for the Divergent
Runs of Clock Systems . . . . . . . . . 351
T. Janowski Fault-Tolerant Bisimulation and Process
Transformations . . . . . . . . . . . . 373
W. Janssen and
M. Poel and
Q. Xu and
J. Zwiers Layering of Real-Time Distributed
Processes . . . . . . . . . . . . . . . 393
B. Jonsson and
C. Ho-Stuart and
W. Yi Testing and Refinement for
Nondeterministic and Probabilistic
Processes . . . . . . . . . . . . . . . 418
A. Kapur and
T. A. Henzinger and
Z. Manna and
A. Pnueli Proving Safety Properties of Hybrid
Systems . . . . . . . . . . . . . . . . 431
P. Kearney and
M. Utting A Layered Real-Time Specification of a
RISC Processor . . . . . . . . . . . . . 455
J. K. Kishore and
R. S. Manjunatha and
V. K. Agrawal and
N. K. Malik A Real Time Fault Tolerant
Microprocessor based On-Board Computer
System for INSAT-2 Spacecraft . . . . . 476
Y. Lakhneche and
J. Hooman Reasoning about Durations in Metric
Temporal Logic . . . . . . . . . . . . . 488
G. Le Lann Scheduling in Critical Real-Time
Systems: a Manifesto . . . . . . . . . . 511
Z. Liu and
M. Joseph Stepwise Development of Fault-Tolerant
Reactive Systems . . . . . . . . . . . . 529
O. Maffeis and
P. Le Guernic Distributed Implementation of SIGNAL:
Scheduling and Graph Clustering . . . . 547
R. Mori and
N. Yonezaki Derivation of the Input Conditional
Formula from a Reactive System
Specification in Temporal Logic . . . . 567
S. Nadjm-Tehrani and
J.- E. Stroemberg From Physical Modelling to Compositional
Models of Hybrid Systems . . . . . . . . 583
M. Schenke Specification and Transformation of
Reactive Systems with Time Restrictions
and Concurrency . . . . . . . . . . . . 605
R. K. Shyamasundar and
S. Ramesh Languages for Reactive Specifications:
Synchrony Vs Asynchrony . . . . . . . . 621
H. B. Sipma and
Z. Manna Specification and Verification of
Controlled Systems . . . . . . . . . . . 641
Jens Ulrik Skakkebaek and
N. Shankar Towards a Duration Calculus Proof
Assistant in PVS . . . . . . . . . . . . 660
W. Yi Algebraic Reasoning for Real-Time
Probabilistic Processes with Uncertain
Information . . . . . . . . . . . . . . 680
T. Wilke Specifying Timed State Sequences in
Powerful Decidable Logics and Timed
Automata . . . . . . . . . . . . . . . . 694
H. Yu and
P. K. Pandya and
Y. Sun A Calculus for Hybrid Sampled Data
Systems . . . . . . . . . . . . . . . . 716
X. Yu and
J. Wang and
C. Zhou and
P. K. Pandya Formal Design of Hybrid Systems . . . . 738
Y. Zheng and
C. Zhou A Formal Proof of the Deadline Driven
Scheduler . . . . . . . . . . . . . . . 756
T. W. Getzinger The Costs and Benefits of Abstract
Interpretation-driven Prolog
Optimization . . . . . . . . . . . . . . 1
M. Hanus and
F. Zartmann Mode Analysis of Functional Logic
Programs . . . . . . . . . . . . . . . . 26
A. Aiken and
T. K. Lakshman Directional Type Checking of Logic
Programs . . . . . . . . . . . . . . . . 43
D. Boulanger and
M. Bruynooghe A Systematic Construction of Abstract
Domains . . . . . . . . . . . . . . . . 61
O. Agesen Constraint-Based Type Inference and
Parametric Polymorphism . . . . . . . . 78
F. Mueller and
D. B. Whalley Efficient On-the-fly Analysis of Program
Behavior and Static Cache Simulation . . 101
E. Harcourt and
J. Mauney and
T. Cook From Processor Timing Specifications to
Static Instruction Scheduling . . . . . 116
A. Banerjee and
D. A. Schmidt Stackability in the Simply-Typed
Call-by-value Lambda Calculus . . . . . 131
J. Goubault Generalized Boxings, Congruences and
Partial Inlining . . . . . . . . . . . . 147
P. Steckler and
M. Wand Selective Thunkification . . . . . . . . 162
N. Halbwachs About Synchronous Programming and
Abstract Interpretation . . . . . . . . 179
D. Garza-Salazar and
W. Boehm Uniqueness and Completeness Analysis of
Array Comprehensions . . . . . . . . . . 193
B. Lisper and
J.-F. Collard Extent Analysis of Data Fields . . . . . 208
N. Halbwachs and
Y.-E. Proy and
P. Raymond Verification of Linear Hybrid Systems by
Means of Convex Approximations . . . . . 223
K. Yi Compile-time Detection of Uncaught
Exceptions in Standard ML Programs . . . 238
S. K. Debray and
P. Lopez Garcia and
M. Hermenegildo and
N.-W. Lin Estimating the Computational Cost of
Logic Programs . . . . . . . . . . . . . 255
T. Armstrong and
K. Marriott and
P. Schachte and
H. Soendergaard Boolean Functions for Dependency
Analysis: Algebraic Properties and
Efficient Representation . . . . . . . . 266
M. Codish and
B. Demoen Deriving Polymorphic Type Dependencies
for Logic Programs using Multiple
Incarnations of Prop . . . . . . . . . . 281
D. C. Gras and
M. Hermenegildo Extracting Non-strict Independent
And-parallelism using Sharing and
Freeness Information . . . . . . . . . . 297
B. Vergauwen and
J. Wauman and
J. Lewi Efficient FixPoint Computation . . . . . 314
N. Joergensen Finding Fixpoints in Finite Function
Spaces using Neededness Analysis and
Chaotic Iteration . . . . . . . . . . . 329
K. D. Jensen and
P. Hjoeresen and
M. Rosendahl Efficient Strictness Analysis of Haskell 346
L. Mauborgne Abstract Interpretation using TDGs . . . 363
C. Hankin and
D. Le Metayer A Type-based Framework for Program
Analysis . . . . . . . . . . . . . . . . 380
F. Henglein Iterative Fixed Point Computation for
Type-Based Strictness Analysis . . . . . 395
K. L. Solberg and
H. R. Nielson and
F. Nielson Strictness and Totality Analysis . . . . 408
C. Consel Fast Strictness Analysis Via Symbolic
Fixpoint Iteration . . . . . . . . . . . 423
R. Glueck and
J. Joergensen Generating Transformers for
Deforestation and Supercompilation . . . 432
H. Khoshnevisan and
M. Afshar Mechanical Elimination of Commutative
Redundancy . . . . . . . . . . . . . . . 449
N. J. Radcliffe and
P. D. Surry Formal Memetic Algorithms . . . . . . . 1
J. Shapiro and
A. Pruegel-Bennett and
M. Rattray A Statistical Mechanical Formulation of
the Dynamics of Genetic Algorithms . . . 17
D. F. Yates and
A. Fairley Evolutionary Stability in Simple
Classifier Systems . . . . . . . . . . . 28
P. Field Nonbinary Transforms for Genetic
Algorithm Problems . . . . . . . . . . . 38
R. Paton Enhancing Evolutionary Computation Using
Analogues of Biological Mechanisms . . . 51
G. F. Miller Exploiting Mate Choice in Evolutionary
Computation: Sexual Selection as a
Process of Search, Optimisation And
Diversification . . . . . . . . . . . . 65
P. J. B. Hancock An Empirical Comparison of Selection
Methods in Evolutionary Algorithms . . . 80
L. Bull and
T. C. Fogarty An Evolution Strategy and Genetic
Algorithm Hybrid: An Initial
Implementation and First Results . . . . 95
J. Coyne and
R. Paton Genetic Algorithms and Directed
Adaptation . . . . . . . . . . . . . . . 103
C. R. Reeves Genetic Algorithms and Neighbourhood
Search . . . . . . . . . . . . . . . . . 115
A. Kapsalis and
G. D. Smith and
V. J. Rayward-Smith A Unified Paradigm for Parallel Genetic
Algorithms . . . . . . . . . . . . . . . 131
P. Husbands Distributed Coevolutionary Genetic
Algorithms for Multi-Criteria and
Multi-Constraint Optimisation . . . . . 150
A. Fairley and
D. F. Yates Inductive Operators and Rule Repair in a
Hybrid Genetic Learning System: Some
Initial Results . . . . . . . . . . . . 166
M. J. Patel and
M. Dorigo Adaptive Learning of a Robot Arm . . . . 180
T. C. Fogarty Co-Evolving Co-Operative Populations of
Rules in Learning Control Systems . . . 195
B. Carse Learning Anticipatory Behaviour Using a
Delayed Action Classifier System . . . . 210
C. Melhuish and
T. C. Fogarty Applying a Restricted Mating Policy to
Determine State Space Niches Using
Immediate and Delayed Reinforcement . . 224
A. G. Pipe and
B. Carse A Comparison Between Two Architectures
for Searching and Learning in Maze
Problems . . . . . . . . . . . . . . . . 238
D. Corne and
P. Ross and
H.-L. Fang Fast Practical Evolutionary Timetabling 250
B. Paechter Optimising a Presentation Timetable
Using Evolutionary Algorithms . . . . . 264
H. M. Cartwright and
A. L. Tuson Genetic Algorithms and Flowshop
Scheduling: Towards the Development of a
Real-time Process Control System . . . . 277
M. S. White and
S. J. Flockton Genetic Algorithms for Digital Signal
Processing . . . . . . . . . . . . . . . 291
D. Beasley and
D. R. Bull and
R. R. Martin Complexity Reduction Using Expansive
Coding . . . . . . . . . . . . . . . . . 304
E. Howard and
N. Oakley The Application of Genetic Programming
to the Investigation of Short, Noisy,
Chaotic Data Series . . . . . . . . . . 320
D. Whitley and
V. S. Gordon and
K. Mathias Lamarckian Evolution, The Baldwin Effect
and Function Optimization . . . . . . . 6
D. C. Mattfeld and
H. Kopfer and
C. Bierwirth Control of Parallel Population Dynamics
by Social-Like Behavior of
GA-Individuals . . . . . . . . . . . . . 16
E. Chiva and
P. Tarroux Studying Genotype-Phenotype
Interactions: A Model of the Evolution
of the Cell Regulation Network . . . . . 26
Y. Yoshida and
N. Adachi A Diploid Genetic Algorithm for
Preserving Population Diversity ---
Pseudo-Meiosis GA . . . . . . . . . . . 36
J. Paredis Co-evolutionary Constraint Satisfaction 46
H.-G. Beyer Towards a Theory of Evolution
Strategies: Results for $ (1 +, \lambda)
$-Strategies on (Nearly) Arbitrary
Fitness Functions . . . . . . . . . . . 58
J. Dzubera and
D. Whitley Advanced Correlation Analysis of
Operators for the Traveling Salesman
Problem . . . . . . . . . . . . . . . . 68
A. E. Eiben and
P.-E. Raue and
Z. Ruttkay Genetic Algorithms with Multi-parent
Recombination . . . . . . . . . . . . . 78
H. Asoh and
H. Muehlenbein On the Mean Convergence Time of
Evolutionary Algorithms without
Selection and Mutation . . . . . . . . . 88
H. Asoh and
H. Muehlenbein Estimating the Heritability by
Decomposing the Genetic Variance . . . . 98
T. N. Bui and
B.- R. Moon Analyzing Hyperplane Synthesis in
Genetic Algorithms Using Clustered
Schemata . . . . . . . . . . . . . . . . 108
D. Thierens and
D. Goldberg Convergence Models of Genetic Algorithm
Selection Schemes . . . . . . . . . . . 119
R. Nakano and
Y. Davidor and
T. Yamada Optimal Population Size under Constant
Computation Cost . . . . . . . . . . . . 130
G. Rudolph An Evolutionary Algorithm for Integer
Programming . . . . . . . . . . . . . . 139
J. Horn and
D. E. Goldberg and
K. Deb Long Path Problems . . . . . . . . . . . 149
U. Hammel and
T. Baeck Evolution Strategies on Noisy Functions:
How to Improve Convergence Properties 159
K. F. Pal Selection Schemes with Spatial Isolation
for Genetic Optimization . . . . . . . . 170
A. Y.-C. Tang and
K.- S. Leung A Modified Edge Recombination Operator
for the Travelling Salesman Problem . . 180
A. Ostermeier and
A. Gawelczyk and
N. Hansen Step-size Adaptation Based on Non-local
Use of Selection Information . . . . . . 189
D. Schlierkamp-Voosen and
H. Muehlenbein Strategy Adaptation by Competing
Subpopulations . . . . . . . . . . . . . 199
M. Sebag and
M. Schoenauer Controlling Crossover through Inductive
Learning . . . . . . . . . . . . . . . . 209
D. H. Lorenz Derivative Operators for Preference
Predicate Evolution . . . . . . . . . . 219
T. White and
F. Oppacher Adaptive Crossover Using Automata . . . 229
H. Sakanashi and
K. Suzuki and
Y. Kakazu Controlling Dynamics of GA through
Filtered Evaluation Function . . . . . . 239
M. A. Potter and
K. A. De Jong A Cooperative Coevolutionary Approach to
Function Optimization . . . . . . . . . 249
B. Carse and
T. C. Fogarty A Fuzzy Classifier System Using the
Pittsburgh Approach . . . . . . . . . . 260
A. Giani and
F. Baiardi and
A. Starita Q-Learning in Evolutionary Rule-based
Systems . . . . . . . . . . . . . . . . 270
U. Hartmann On the Complexity of Learning in
Classifier Systems . . . . . . . . . . . 280
M. Wineberg and
F. Oppacher A Representation Scheme to Perform
Program Induction in a Canonical Genetic
Algorithm . . . . . . . . . . . . . . . 292
H. Iba and
H. De Garis and
T. Sato Genetic Programming with Local
Hill-Climbing . . . . . . . . . . . . . 302
C. Gathercole and
P. Ross Dynamic Training Subset Selection for
Supervised Learning in Genetic
Programming . . . . . . . . . . . . . . 312
W. Banzhaf Genotype-Phenotype-Mapping and Neutral
Variation --- A Case Study in Genetic
Programming . . . . . . . . . . . . . . 322
C. Jacob Genetic L-System Programming . . . . . . 334
R. Das and
M. Mitchell and
J. P. Crutchfield A Genetic Algorithm Discovers
Particle-Based Computation in Cellular
Automata . . . . . . . . . . . . . . . . 344
P. P. B. De Oliveira Simulation of Exaptive Behaviour . . . . 354
H. Inayoshi Artificial Spacing Patterns in a Network
of Interacting Celloids . . . . . . . . 365
J. Muruzabal and
A. Muthoz Diffuse Pattern Learning with Fuzzy
ARTMAP and PASS . . . . . . . . . . . . 376
J. Heistermann Different Learning Algorithms for Neural
Networks --- A Comparative Study . . . . 386
U.-M. O'Reilly and
F. Oppacher Program Search with a Hierarchical
Variable Length Representation: Genetic
Programming, Simulated Annealing and
Hill Climbing . . . . . . . . . . . . . 397
P. S. Laursen Problem-Independent Parallel Simulated
Annealing Using Selection and Migration 408
T. Baeck Parallel Optimization of Evolutionary
Algorithms . . . . . . . . . . . . . . . 418
H. Chen and
N. S. Flann Parallel Simulated Annealing and Genetic
Algorithms: A Space of Hybrid Methods 428
H. Braun and
P. Zagorski ENZO-M --- A Hybrid Approach for
Optimizing Neural Networks by Evolution
and Learning . . . . . . . . . . . . . . 440
E. Ronald and
M. Schoenauer Genetic Lander: An Experiment in
Accurate Neuro-Genetic Control . . . . . 452
B.-T. Zhang Effects of Occam's Razor in Evolving
Sigma-Pi Neural Nets . . . . . . . . . . 462
J. Born and
I. Santibathez-Koref and
H.-M. Voigt Designing Neural Networks by Adaptively
Building Blocks in Cascades . . . . . . 472
A. G. Pipe and
T. C. Fogarty and
A. Winfield Hybrid Adaptive Heuristic Critic
Architectures for Learning in Mazes with
Continuous Search Spaces . . . . . . . . 482
U. Utecht and
K. Trint Mutation Operators for Structure
Evolution of Neural Networks . . . . . . 492
F. Seredynski Loosely Coupled Distributed Genetic
Algorithms . . . . . . . . . . . . . . . 514
T. Higuchi and
H. Iba and
B. Manderick Applying Evolvable Hardware to
Autonomous Agents . . . . . . . . . . . 524
F. J. Marin and
O. Trelles-Salazar and
F. Sandoval Genetic Algorithms on LAN-Message
Passing Architectures Using Application
to the Routing Problem . . . . . . . . . 534
A. M. Hill and
S.-M. Kang Genetic Algorithm Based Design
Optimization of CMOS VLSI Circuits . . . 546
P. Ross and
D. Corne and
H.-L. Fang Improving Evolutionary Timetabling with
Delta Evaluation and Directed Mutation 556
M. C. Van Wezel and
J. N. Kok and
J. Van den Berg and
W. Van Kampen Genetic Improvement of Railway
Timetables . . . . . . . . . . . . . . . 566
H. G. Cobb and
P. Bock Using a Genetic Algorithm to Search for
the Representational Bias of a
Collective Reinforcement Learner . . . . 576
J. Lienig and
H. Brandt An Evolutionary Algorithm for the
Routing of Multi-Chip Modules . . . . . 588
S. P. Pullen and
B. W. Parkinson System Design under Uncertainty:
Evolutionary Optimization of the Gravity
Probe-B Spacecraft . . . . . . . . . . . 598
I. Karcz-Duleba Soft Selection in D-optimal Designs . . 608
H. Inayoshi and
B. Manderick The Weighted Graph Bi-Partitioning
Problem: A Look at GA Performance . . . 617
P. D. Surry and
N. J. Radcliffe RPL2: A Language and Parallel Framework
for Evolutionary Computing . . . . . . . 628
G. Schreiber and
B. Wielinga and
H. Akkermans and
W. Van de Velde CML: The CommonKADS Conceptual Modelling
Language . . . . . . . . . . . . . . . . 1
F. Ruiz and
F. Van Harmelen and
M. Aben and
J. Van de Plassche Evaluating a Formal Modelling Language 26
D. Fensel and
K. Poeck A Comparison of Two Approaches to
Model-Based Knowledge Acquisition . . . 46
R. Dieng and
O. Corby and
S. Labidi Agent-Based Knowledge Acquisition . . . 63
F. Schmalhofer and
J. Stuart Aitken and
L. E. Bourne Beyond the Knowledge Level: Descriptions
of Rational Behavior for Sharing and
Reuse . . . . . . . . . . . . . . . . . 83
P. Compton and
P. Preston and
B. Kang and
T. Yip Local Patching Produces Compact
Knowledge Bases . . . . . . . . . . . . 104
J. Breuker Components of Problem Solving and Types
of Problems . . . . . . . . . . . . . . 118
R. Benjamins On a Role of Problem Solving Methods in
Knowledge Acquisition --- Experiments
with Diagnostic Strategies . . . . . . . 137
D. Cathamero Modelling Plan Recognition for Decision
Support . . . . . . . . . . . . . . . . 158
G. Van Heijst and
G. Schreiber CUE: Ontology-Based Knowledge
Acquisition . . . . . . . . . . . . . . 178
T. Pirlein and
R. Studer KARO: An Integrated Environment for
Reusing Ontologies . . . . . . . . . . . 200
S. Geldof and
A. Slodzian From Verification to Modelling
Guidelines . . . . . . . . . . . . . . . 226
G. L. Andrienko and
N. V. Andrienko AFORIZM Approach: Creating Situations to
Facilitate Expertise Transfer . . . . . 244
N. Aussenac-Gilles How to Combine Data Abstraction and
Model Refinement: a Methodological
Contribution in MACAO . . . . . . . . . 262
F. M. T. Brazier and
J. Treur User Centered Knowledge-Based System
Design: a Formal Modelling Approach . . 283
P.-A. Tourtier and
S. Boyera Validating at Early Stages with a Causal
Simulation Tool . . . . . . . . . . . . 303
G. R. Yost and
G. Klinker and
M. Linster and
D. Marques The SBF Framework, 1989--1994: From
Applications to Workplaces . . . . . . . 318
N. Major and
J. Cupit and
N. Shadbolt Applying the REKAP Methodology to
Situation Assessment . . . . . . . . . . 342
J. L. Arcos and
E. Plaza Integration of Learning into a Knowledge
Modelling Framework . . . . . . . . . . 355
C. Rouveirol and
P. Albert Knowledge Level Model of a Configurable
Learning System . . . . . . . . . . . . 374
E. Stroulia and
A. K. Goel Reflective, Self-Adaptive Problem
Solvers . . . . . . . . . . . . . . . . 394
N. D. Georganas Self-similar (``Fractal'') Traffic
Driving an ATM Networks . . . . . . . . 1
K. Nahrstedt and
J. Smith A Service Kernel for Multimedia
Endstations . . . . . . . . . . . . . . 8
W. Reinhardt Advance Reservation of Network Resources
for Multimedia Applications . . . . . . 23
T. Kaeppner and
L. C. Wolf Media Scaling in Distributed Multimedia
Object Services . . . . . . . . . . . . 34
N. Achilleoudis and
J. Lamour and
F. Daffara An Interactive Cable Television Network
for Multimedia Applications . . . . . . 44
C. Bertin Eurescom IMS1 Projects (Integrated
Multimedia Services at about 1 Mbit/s) 53
J.-J. Sung and
M.-Y. Huh and
H.-J. Kim and
J.-H. Hahm Hypermedia Information Retrieval System
Using MHEG Coded Representation in a
Networked Environment . . . . . . . . . 67
P. Droz and
J.-Y. Le Boudec Transparent ATM LAN Interconnection over
ISDN . . . . . . . . . . . . . . . . . . 78
H. Wittig and
L. C. Wolf and
C. Vogt CPU Utilization of Multimedia Processes:
HEIPOET --- The Heidelberg Predictor of
Execution Times Measurement Tool . . . . 92
I. Barth Extending the Rate-Monotonic Scheduling
Algorithm to Get Shorter Delays . . . . 104
W. Liu A Multimedia Application Adaptation
Layer (MAAL) Protocol . . . . . . . . . 115
G. Carle Adaptation Layer and Group Communication
Server for Reliable Multipoint Services
in ATM Networks . . . . . . . . . . . . 124
S. Boecking and
P. Vindeby TIP: A Transport and Internetworking
Package for ATM . . . . . . . . . . . . 139
N. B. Pronios and
T. Bozios Multimedia and Hypermedia
Synchronisation: A Unified Framework . . 153
D. Koehler and
H. Mueller Multimedia Playout Synchronisation Using
Buffer Level Control . . . . . . . . . . 167
B. Lamparter and
W. Effelsberg eXtended Color Cell Compression --- A
Runtime-efficient Compression Scheme for
Software Video . . . . . . . . . . . . . 181
N. Yeadon and
F. Garcia and
A. Campbell and
D. Hutchison QoS Adaptation and Flow Filtering in ATM
Networks . . . . . . . . . . . . . . . . 191
J. Frings and
T. Bauschert Optimal Resource Management in ATM
Transport Networks Supporting Multimedia
Traffic . . . . . . . . . . . . . . . . 203
K. Bahr and
E. Hinsch and
G. Schulze Incorporating Security Functions in
Multimedia Conferencing Applications in
the Context of the MICE Project . . . . 216
H. Bunz and
A. Bertsch and
M. Jurecic and
B. Baum-Waidner Secure Multimedia Applications and
Teleservices --- Security Requirements
and Prototype for Health Care . . . . . 224
M. Altenhofen and
J. Schaper and
S. Thomas The BERKOM Multimedia Teleservices . . . 237
A. Rozek and
P. Christ The CIO Multimedia Communication
Platform . . . . . . . . . . . . . . . . 251
A. Mauthe and
D. Hutchison and
G. Coulson and
S. Namuye From Requirements to Services: Group
Communication Support for Distributed
Multimedia Systems . . . . . . . . . . . 266
G. Blakowski and
W. Steinbeck Harmonization of an Infrastructure for
Flexible Distance Learning in Europe
with CTA . . . . . . . . . . . . . . . . 280
J. M. Velez and
M. R. Gomes and
B. Tritsch and
C. Hornung Dedicated --- Modular Training System
(DELTA Project D2014) . . . . . . . . . 300
Y.-H. Pusztaszeri and
M. Alou and
E. W. Biersack and
P. Dubois Multimedia Teletutoring over a
Trans-European ATM Network . . . . . . . 315
T. Schmidt and
J. Schweitzer and
M. Weber A Framework for Synchronous
Tele-Cooperation . . . . . . . . . . . . 328
P. Leydekkers and
V. Gay Multimedia Conferencing Services in an
Open Distributed Environment . . . . . . 339
T. P. De Miguel and
S. Pavon and
J. Salvachua and
J. Quemada Vives ISABEL --- Experimental Distributed
Cooperative Work Application over
Broadband Networks . . . . . . . . . . . 353
R. Strack and
R. Cordes and
D. C. Sutcliffe Demonstrating Image Communication within
Open Distributed Environments . . . . . 363
B. J. Dempsey and
M. T. Lucas and
A. C. Weaver Design and Implementation of a High
Quality Video Distribution System Using
XTP Reliable Multicast . . . . . . . . . 376
W. T. Strayer and
S. Gray and
R. E. Cline An Object-Oriented Implementation of the
Xpress Transfer Protocol . . . . . . . . 387
T. C. Rakow and
P. Dettling and
F. Moser and
B. Paul Development of a Multimedia Archiving
Teleservice Using the DFR Standard . . . 401
R. Kaeckenhoff and
D. Merten and
K. Meyer-Wegener MOSS as a Multimedia-Object Server . . . 413
M.-P. Gervais The Universal Personal Telecommunication
Service in a Multi-Operator Environment 426
T. Eckardt and
T. Magedanz On the Personal Communication Impacts on
Multimedia Teleservices . . . . . . . . 435
W. J. Campbell and
N. M. Short and
P. Coronado and
R. F. Cromp Distributed earth science validation
centers for mission to planet Earth . . 1
B. Chandrasekaran Causal understanding in reasoning about
the world . . . . . . . . . . . . . . . 13
E. A. Fox How to make intelligent digital
libraries . . . . . . . . . . . . . . . 27
R. A. Meersman Some methodology and representation
problems for the semantics of prosaic
application domains . . . . . . . . . . 39
H. M. Jamil and
F. Sadri Recognizing credible experts in
inaccurate databases . . . . . . . . . . 46
S. Kundu and
J. Chen Fuzzy logic or Lukasiewicz logic: a
clarification . . . . . . . . . . . . . 56
T. Y. Lin and
Q. Liu and
Y. Y. Yao Logic systems for approximate reasoning:
via rough sets and topology . . . . . . 65
J. J. Lu and
N. V. Murray and
E. Rosenthal Signed formulas and fuzzy operator
logics . . . . . . . . . . . . . . . . . 75
L. Polkowski and
A. Skowron Rough mereology . . . . . . . . . . . . 85
S. L. Shi and
M. E. Hull and
D. A. Bell A new rule for updating evidence . . . . 95
Z. W. Wang and
S. K. M. Wong A global measure of ambiguity for
classification . . . . . . . . . . . . . 105
S. Zilberstein Meta-level control of approximate
reasoning: a decision theoretic approach 114
Z. Michalewicz and
J. Arabas Genetic algorithms for the 0/1 knapsack
problem . . . . . . . . . . . . . . . . 134
T. Andreasen and
O. Pivert On the weakening of fuzzy relational
queries . . . . . . . . . . . . . . . . 144
Y. Chang and
L. Raschid and
B. Dorr Transforming queries from a relational
schema to an object schema: a prototype
based on F-logic . . . . . . . . . . . . 154
D. W.-I. Cheung and
A. W.-C. Fu and
J. Han Knowledge discovery in databases: a
rule-based attribute-oriented approach 164
S. E. Cross and
D. F. Roberts and
A. M. Mulvehill and
J. A. Sears Case-based reasoning applied to a force
generation decision aid . . . . . . . . 174
G. Fouque and
W. W. Chu and
H. Yau A case-based reasoning approach for
associative query answering . . . . . . 183
S. Greco and
C. Zaniolo Efficient execution of recursive queries
through controlled binding propagation 193
E. Le Strugeon and
R. Mandiau and
G. Libert Towards a dynamic multi-agent
organization . . . . . . . . . . . . . . 203
J. Lever and
B. Richards parcPlan: a planning architecture with
parallel actions, resources and
constraints . . . . . . . . . . . . . . 213
M. Quafafou GAITS II: an intelligent system for
computer-aided education . . . . . . . . 223
N. Zhong and
S. Ohsuga The GLS discovery system: its goal,
architecture and current results . . . . 233
A. Analyti and
S. Pramanik Declarative semantics for contradictory
modular logic programs . . . . . . . . . 245
V. Brusoni and
L. Console and
B. Pernici and
P. Terenziani LaTeR: a general purpose manager of
temporal information . . . . . . . . . . 255
H. Gan Understanding a story with causal
relationships . . . . . . . . . . . . . 265
P. Terenziani Dealing with qualitative and
quantitative temporal information
concerning periodic events . . . . . . . 275
Y. Xiang Distributed multi-agent probabilistic
reasoning with Bayesian networks . . . . 285
J. Calmet and
I. A. Tjandra Building bridges between knowledge
representation and algebraic
specification . . . . . . . . . . . . . 295
J. Hertzberg and
S. Thiebaux Turning an action formalism into a
planner --- Essentials of a case study 305
J. Komorowski and
S. Trcek Towards refinement of definite logic
programs . . . . . . . . . . . . . . . . 315
M. Lowry and
A. Philpot and
T. Pressburger and
I. Underwood AMPHION: automatic programming for
scientific subroutine libraries . . . . 326
H. Ade and
B. Malfait and
L. De Raedt RUTH: an ILP theory revision system . . 336
J. G. Bazan and
A. Skowron and
P. Synak Dynamic reducts as a tool for extracting
laws from decisions tables . . . . . . . 346
M. Botta Learning first order theories . . . . . 356
C. F. Eick and
E. Toto Evaluation and enhancement of Bayesian
rule-sets in a genetic algorithm
learning environment for classification
tasks . . . . . . . . . . . . . . . . . 366
F. Esposito and
D. Malerba and
G. Semeraro and
C. Brunk Traps and pitfalls when learning logical
definitions from relations . . . . . . . 376
X. Hu and
N. Shan and
N. Cercone and
W. Ziarko DBROUGH: a rough set based knowledge
discovery system . . . . . . . . . . . . 386
A. Lopez-Suarez and
M. Kamel Restructuring rule bases to improve
performance . . . . . . . . . . . . . . 396
T. L. McCluskey and
J. M. Porteous Learning heuristics for ordering plan
goals through static operator analysis 406
R. S. Michalski and
I. F. Imam Learning problem-oriented decision
structures from decision rules: the
AQDT-2 system . . . . . . . . . . . . . 416
E. Nissan and
H. Siegelmann and
A. Galperin and
S. Kimhi Towards full automation of the discovery
of heuristics in a nuclear engineering
project: integration with a neural
information language . . . . . . . . . . 427
M. Troxel and
K. Swarm and
R. Zembowicz and
J. M. Zytkow Concept hierarchies: a restricted form
of knowledge derived from regularities 437
J. Zhang and
H.-H. Lu A data-driven approach to feature
construction . . . . . . . . . . . . . . 448
N. Asher Reasoning about action and time with
epistemic conditionals . . . . . . . . . 458
S. Buvac and
V. Buvac and
I. A. Mason The semantics of propositional contexts 468
J. Chen The generalized logic of only knowing
(GOL) that covers the notion of
epistemic specifications . . . . . . . . 478
L. Cholvy and
R. Demolombe and
A. Jones Reasoning about the safety of
information: from logical formalization
to operational definition . . . . . . . 488
Y. Dimopoulos Classical methods in nonmonotonic
reasoning . . . . . . . . . . . . . . . 500
J. Dix and
M. Mueller Partial evaluation and relevance for
approximations of the stable semantics 511
P. Doherty and
W. Lukaszewicz Circumscribing features and fluents: a
fluent logic for reasoning about action
and change . . . . . . . . . . . . . . . 521
S. Ghosh Paraconsistency and beyond: a new
approach to inconsistency handling . . . 531
J. Goubault and
J. Posegga BDDs and automated deduction . . . . . . 541
Y.-T. Hsia A possibility-based propositional logic
of conditionals . . . . . . . . . . . . 551
Y.-N. Huang and
V. Dahl and
J. Han Incremental processing of logic database
relations . . . . . . . . . . . . . . . 561
Y. J. Jiang and
Y. Aramkulchai On the relationship between
assumption-based framework and
autoepistemic logic . . . . . . . . . . 571
T. Schaub Computing queries from prioritized
default theories . . . . . . . . . . . . 584
K. M. Sim Beliefs and bilattices . . . . . . . . . 594
Z. Stachniak Fast termination of the deductive
process in resolution proof systems for
non-classical logics . . . . . . . . . . 604
J. S. Greenfield Distributed Programming Paradigms with
Cryptography Applications . . . . . . . xi + 182
W. L. Hibbard and
C. R. Dyer and
B. E. Paul The VIS-AD Data Model: Integrating
Metadata and Polymorphic Display with a
Scientific Programming Language . . . . 37
D. T. Kao and
R. D. Bergeron and
T. M. Sparr An Extended Schema Model for Scientific
Data . . . . . . . . . . . . . . . . . . 69
K. L. Ryan Data Integration for Visualization
Systems . . . . . . . . . . . . . . . . 83
S. Walther Inherent Logical Structure of
Computational Data: Its Role in Storage
and Retrieval Strategies to Support User
Queries . . . . . . . . . . . . . . . . 94
P. Kochevar Database Management for Data
Visualization . . . . . . . . . . . . . 109
J. P. Lee Data Exploration Interactions and the
ExBase System . . . . . . . . . . . . . 118
V. Vasudevan Database Requirements for Supporting
End-User Visualizations . . . . . . . . 138
A. Wierse and
U. Lang and
R. Ruehle A System Architecture for Data-Oriented
Visualization . . . . . . . . . . . . . 148
M. A. Woyna and
D. G. Zawada and
K. Lee Simunich and
J. H. Christiansen A Hyperspectral Image Data Exploration
Workbench for Environmental Science
Applications . . . . . . . . . . . . . . 160
J. Boyle and
J. E. Fothergill and
P. M. D. Gray Design of a $3$D User Interface to a
Database . . . . . . . . . . . . . . . . 173
S. G. Eick and
E. E. Sumner and
G. J. Wills Visualizing Reference Databases . . . . 186
M. Hemmje A $3$D Based User Interface for
Information Retrieval Systems . . . . . 194
D. A. Keim and
H.-P. Kriegel Using Visualization to Support Data
Mining of Large Existing Databases . . . 210
J. Barzdins Towards Efficient Inductive Synthesis
from Input/Output Examples . . . . . . . 1
W. Bibel and
M. Thielscher Deductive Plan Generation . . . . . . . 2
N. Dershowitz From Specifications to Programs:
Induction in the Service of Synthesis 6
T. Zeugmann Average Case Analysis of Pattern
Language Learning Algorithms . . . . . . 8
A. Ambainis and
J. Smotrovs Enumerable Classes of Total Recursive
Functions: Complexity of Inductive
Inference . . . . . . . . . . . . . . . 10
K. Apsitis Derived Sets and Inductive Inference . . 26
O. Arnold and
K. P. Jantke Therapy Plan Generation as Program
Synthesis . . . . . . . . . . . . . . . 40
S. Bai A Calculus for Logical Clustering . . . 56
G. Baliga and
J. Case Learning with Higher Order Additional
Information . . . . . . . . . . . . . . 64
A. Brazma and
K. Cerans Efficient Learning of Regular
Expressions from Good Examples . . . . . 76
R. Freivalds and
O. Botuscharov and
R. Wiehagen Identifying Nearly Minimal Goedel
Numbers from Additional Information . . 91
R. Freivalds and
D. Gobleja and
M. Karpinski and
C. H. Smith Co-Learnability and FIN-Identifiability
of Enumerable Classes of Total Recursive
Functions . . . . . . . . . . . . . . . 100
C. Globig and
S. Lange On Case-Based Representability and
Learnability of Languages . . . . . . . 106
K. Hirata Rule-Generating Abduction for Recursive
Prolog . . . . . . . . . . . . . . . . . 121
T. Iwatani and
S. Tano and
A. Inoue and
W. Okamoto Fuzzy Analogy Based Reasoning and
Classification of Fuzzy Analogies . . . 137
Y. Koga and
E. Hirowatari and
S. Arikawa Explanation-Based Reuse of Prolog
Programs . . . . . . . . . . . . . . . . 149
C. R. Mofizur and
M. Numao Constructive Induction for Recursive
Programs . . . . . . . . . . . . . . . . 161
N. Abe Towards Realistic Theories of Learning 187
M. M. Richter A Unified Approach to Inductive Logic
and Case-Based Reasoning . . . . . . . . 210
C. H. Smith Three Decades of Team Learning . . . . . 211
P. Auer and
N. Cesa-Bianchi On-line Learning with Malicious Noise
and the Closure Algorithm . . . . . . . 229
S. Ben-David and
E. Dichterman Learnability with Restricted Focus of
Attention Guarantees Noise-Tolerance . . 248
A. Brazma Efficient Algorithm for Learning Simple
Regular Expressions from Noisy Examples 260
Z. Chen A Note on Learning DNF Formulas Using
Equivalence and Incomplete Membership
Queries . . . . . . . . . . . . . . . . 272
C. Ferretti and
G. Mauri Identifying Regular Languages over
Partially-Commutative Monoids . . . . . 282
W. I. Gasarch and
M. G. Pleszkoch and
M. Velauthapillai Classification Using Information . . . . 290
A. Ishino and
A. Yamamoto Learning from Examples with Typed
Equational Programming . . . . . . . . . 301
H. Ishizaka and
H. Arimura and
T. Shinohara Finding Tree Patterns Consistent with
Positive and Negative Examples Using
Queries . . . . . . . . . . . . . . . . 317
S. Jain Program Synthesis in the Presence of
Infinite Number of Inaccuracies . . . . 333
S. Jain and
A. Sharma On Monotonic Strategies for Learning
r.e. Languages . . . . . . . . . . . . . 349
S. Kapur Language Learning under Various Types of
Constraint Combinations . . . . . . . . 365
S. Kimura and
A. Togashi and
N. Shiratori Synthesis Algorithm for Recursive
Processes by $ \mu $-Calculus . . . . . 379--394
E. Kinber Monotonicity versus Efficiency for
Learning Languages from Texts . . . . . 395
S. Kobayashi and
T. Yokomori Learning Concatenations of Locally
Testable Languages from Positive Data 407
S. Lange and
J. Nessel and
R. Wiehagen Language Learning from Good Examples . . 423
S. Lange and
P. Watson Machine Discovery in the Presence of
Incomplete or Ambiguous Data . . . . . . 438
S. Lange and
T. Zeugmann Set-Driven and Rearrangement-Independent
Learning of Recursive Languages . . . . 453
S. Matsumoto and
A. Shinohara Refutably Probably Approximately Correct
Learning . . . . . . . . . . . . . . . . 469
Y. Mukouchi Inductive Inference of an Approximate
Concept from Positive Data . . . . . . . 484
A. Nakamura and
N. Abe and
J. Takeuchi Efficient Distribution-Free Population
Learning of Simple Concepts . . . . . . 500
Y. Okubo and
M. Haraguchi Constructing Predicate Mappings for
Goal-Dependent Abstraction . . . . . . . 516
Y. Sakakibara and
K. P. Jantke and
S. Lange Learning Languages by Collecting Cases
and Tuning Parameters . . . . . . . . . 532
E. Takimoto and
I. Tajika and
A. Maruoka Mutual Information Gaining Algorithm and
Its Relation to PAC-Learning Algorithm 547
N. Tanida and
T. Yokomori Inductive Inference of Monogenic Pure
Context-Free Languages . . . . . . . . . 560
R. J. R. Back and
K. Sere From Action Systems to Modular Systems 1
B. Dehbonei and
F. Mejia Formal Methods in the Railways
Signalling Industry . . . . . . . . . . 26
J. S. Fitzgerald and
T. M. Brookes and
M. A. Green and
P. G. Larsen Formal and Informal Specifications of a
Secure System Component: First Results
in a Comparative Study . . . . . . . . . 35
T. King Formalising British Rail's Signalling
Rules . . . . . . . . . . . . . . . . . 45
J. D. Guttman and
D. M. Johnson Three Applications of Formal Methods at
MITRE . . . . . . . . . . . . . . . . . 55
O. Cherkaoui and
N. Rico and
A. Bernardi Specification and Analysis of a Security
Management System . . . . . . . . . . . 66
U. Martin and
M. Thomas Verification Techniques for LOTOS . . . 83
B. Ritchie and
J. Bicarregui and
H. Haughton Experiences in Using the Abstract
Machine Notation in a GKS Case Study . . 93
J. P. Bowen and
M. G. Hinchey Seven More Myths of Formal Methods:
Dispelling Industrial Prejudices . . . . 105
T. Clement Comparing Approaches to Data Reification 118
I. Maung and
J. R. Howse and
R. J. Mitchell Towards a Formalization of
Programming-by-Difference . . . . . . . 134
B. Paech and
B. Rumpe A New Concept of Refinement used for
Behaviour Modelling with Automata . . . 154
M. Elvang-Goransson and
R. E. Fields An Extended VDM Refinement Relation . . 175
P. A. Lindsay On Transferring VDM Verification
Techniques to Z . . . . . . . . . . . . 190
Y. Ledru Proof-Based Development of
Specifications with KIDS/VDM . . . . . . 214
P. Gorm Larsen Evaluation of Underdetermined Explicit
Definitions . . . . . . . . . . . . . . 233
K. J. Ross and
P. A. Lindsay A Precise Examination of the Behaviour
of Process Models . . . . . . . . . . . 251
D. J. Duke and
M. D. Harrison A Theory of Presentations . . . . . . . 271
J. A. Keane and
J. Sa and
B. C. Warboys Applying a Concurrent Formal Framework
to Process Modelling . . . . . . . . . . 291
V. A. O. Cordeiro and
A. Sampaio and
S. L. Meira From MooZ to Eiffel --- A Rigorous
Approach to System Development . . . . . 306
T. Mens and
K. Mens and
P. Steyaert OPUS: a Formal Approach to
Object-Orientation . . . . . . . . . . . 326
A. C. Storey and
H. P. Haughton A Strategy for the Production of
Verifiable Code Using the B Method . . . 346
A. S. Evans Specifying and Verifying Concurrent
Systems Using Z . . . . . . . . . . . . 366
R. Collinson A Critical Look at Functional
Specifications . . . . . . . . . . . . . 381
M. Naftalin Informal Strategies in Design by
Refinement . . . . . . . . . . . . . . . 401
M. Anlauff and
S. Jaehnichen and
M. Simons An Experimental Support System for
Formal Mathematical Reasoning . . . . . 421
M. Weber Literate Mathematical Development of a
Revision Management System . . . . . . . 441
P. D. Mosses and
M. Musicante An Action Semantics for ML Concurrency
Primitives . . . . . . . . . . . . . . . 461
P. Mukherjee A Semantics for NewSpeak in VDM-SL . . . 480
C. O'Halloran Evaluation Semantics in Z . . . . . . . 502
D. Jackson Abstract Model Checking of Infinite
Specifications . . . . . . . . . . . . . 519
K. Seidel Specification and Refinement of the
PI-Bus . . . . . . . . . . . . . . . . . 532
F. Erasmy and
E. Sekerinski Stepwise Refinement of Control Software
--- A Case Study Using RAISE . . . . . . 547
J. Gortz Specifying Safety and Progress
Properties with RSL . . . . . . . . . . 567
K. M. Hansen Validation of a Railway Interlocking
Model . . . . . . . . . . . . . . . . . 582
A. Simpson A Formal Specification of an Automatic
Train Protection System . . . . . . . . 602
C. Fidge Adding Real Time to Formal Program
Development . . . . . . . . . . . . . . 618
J. Cuellar and
I. Wildgruber and
D. Barnard Combining the Design of Industrial
Systems with Effective Verification
Techniques . . . . . . . . . . . . . . . 639
F. Wang and
A. K. Mok RTL and Refutation by Positive Cycles 659
P. C. Fencott and
A. J. Galloway and
M. A. Lockyer and
S. J. O'Brien Formalising the Semantics of Ward/Mellor
SA/RT Essential Models Using a Process
Algebra . . . . . . . . . . . . . . . . 681
R. S. M. De Barros Deriving Relational Database Programs
from Formal Specifications . . . . . . . 703
P. Jeavons and
D. Cohen and
M. Cooper A Substitution Operation for Constraints 1
D. Sabin and
E. C. Freuder Contradicting Conventional Wisdom in
Constraint Satisfaction . . . . . . . . 10
Y. Jiang and
T. Richards and
B. Richards Nogood Backmarking with Min-Conflict
Repair in Constraint Satisfaction and
Optimization . . . . . . . . . . . . . . 21
D. Haroud and
B. Faltings Global Consistency for Continuous
Constraints . . . . . . . . . . . . . . 40
H. Hosobe and
K. Miyashita and
S. Takahashi and
S. Matsuoka Locally Simultaneous Constraint
Satisfaction . . . . . . . . . . . . . . 51
M. Sannella Analyzing and Debugging Hierarchies of
Multi-Way Local Propagation Constraints 63
S. Thennarangam and
G. Singh Inferring $3$-Dimensional Constraints
with DEVI . . . . . . . . . . . . . . . 78
J. Jaffar and
M. J. Maher and
P. J. Stuckey and
R. H. C. Yap Beyond Finite Domains . . . . . . . . . 86
G. Pesant and
M. Boyer QUAD-CLP(R): Adding the Power of
Quadratic Constraints . . . . . . . . . 95
A. Rajasekar Applications in Constraint Logic
Programming with Strings . . . . . . . . 109
M. Hermenegildo Some Methodological Issues in the Design
of CIAO, a Generic, Parallel Concurrent
Constraint Logic Programming System . . 123
C. Schulte and
G. Smolka and
J. Wuertz Encapsulated Search and Constraint
Programming in Oz . . . . . . . . . . . 134
U. Montanari and
F. Rossi and
F. Bueno and
M. Garcia de la Banda Towards a Concurrent Semantics Based
Analysis of CC and CLP . . . . . . . . . 151
U. Montanari and
F. Rossi and
V. Saraswat CC Programs with both In-and
Non-Determinism: A Concurrent Semantics 162
A. Gupta and
Y. Sagiv and
J. D. Ullman and
J. Widom Efficient and Complete Tests for
Database Integrity Constraint Checking 173
F. Afrati and
S. S. Cosmadakis and
S. Grumbach and
G. M. Kuper Linear vs. Polynomial Constraints in
Database Query Languages . . . . . . . . 181
K. A. Ross and
D. Srivastava and
P. J. Stuckey and
S. Sudarshan Foundations of Aggregation Constraints 193
M. Baudinet and
J. Chomicki and
P. Wolper Constraint-Generating Dependencies . . . 205
D. Srivastava and
R. Ramakrishnan and
P. Z. Revesz Constraint Objects . . . . . . . . . . . 218
Y. Zhang and
A. K. Mackworth Specification and Verification of
Constraint-Based Dynamic Systems . . . . 229
M. L. Ginsberg and
D. A. McAllester GSAT and Dynamic Backtracking . . . . . 243
M. Koubarakis Foundations of Indefinite Constraint
Databases . . . . . . . . . . . . . . . 266
N. Heintze and
J. Jaffar Set Constraints and Set-Based Analysis 281
M. Paltrinieri On the Design of Constraint Satisfaction
Problems . . . . . . . . . . . . . . . . 299
W. Pugh and
D. Wonnacott Experiences with Constraint-Based Array
Dependence Analysis . . . . . . . . . . 312
A. Aiken Set Constraints: Results, Applications
and Future Directions . . . . . . . . . 326
J. N. Hooker Logic-Based Methods for Optimization . . 336
D. Kurlander and
J.-F. Puget and
J. Heisserman Panel Session: Commercial Applications
of Constraint Programming . . . . . . . 350
T. Beth and
M. Borcherding and
B. Klein Valuation of Trust in Open Networks . . 3
V. Zorkadis Security Versus Performance Requirements
in Data Communication Systems . . . . . 19
A. W. Roscoe and
J. C. P. Woodcock and
L. Wulf Non-Interference Through Determinism . . 33
J.-P. Banatre and
C. Bryce and
D. Le Metayer Compile-Time Detection of Information
Flow in Sequential Programs . . . . . . 55
C. O'Halloran and
C. T. Sennett Security Through Type Analysis . . . . . 75
C. Boyd and
W. Mao Designing Secure Key Exchange Protocols 93
R. Hauser and
P. Janson and
R. Molva and
G. Tsudik Robust and Secure Password and Key
Change Method . . . . . . . . . . . . . 107
A. Jiwa and
J. Seberry and
Y. Zheng Beacon Based Authentication . . . . . . 125
T. Hardjono and
J. Seberry Authentication via Multi-Service Tickets
in the Kuperee Server . . . . . . . . . 143
L. Chen Oblivious Signatures . . . . . . . . . . 161
U. M. Maurer and
P. E. Schmid A Calculus for Secure Channel
Establishment in Open Networks . . . . . 175
W. Mao and
C. Boyd On Strengthening Authentication
Protocols to Foil Cryptanalysis . . . . 193
J. L. Camenisch and
J. M. Piveteau and
M. A. Stadler An Efficient Electronic Payment System
Protecting Privacy . . . . . . . . . . . 207
J.-P. Boly and
A. Bosselaers and
R. Cramer and
R. Michelsen The ESPRIT Project CAFE --- High
Security Digital Payment Systems . . . . 217
R. J. Anderson Liability and Computer Security: Nine
Principles . . . . . . . . . . . . . . . 231
B. D'Ausbourg Implementing Secure Dependencies over a
Network by Designing a Distributed
Security SubSystem . . . . . . . . . . . 249
P. Siron and
B. D'Ausbourg A Secure Medium Access Control Protocol:
Security vs Performances . . . . . . . . 267
C. Calas Distributed File System over a
Multilevel Secure Architecture ---
Problems and Solutions . . . . . . . . . 281
R. S. Sandhu and
S. Ganta On the Expressive Power of the Unary
Transformation Model . . . . . . . . . . 301
M. Dacier and
Y. Deswarte Privilege Graph: an Extension to the
Typed Access Matrix Model . . . . . . . 319
C. L. Robinson and
S. R. Wiseman A Consideration of the Modes of
Operation for Secure Systems . . . . . . 335
A. Ciampichetti and
E. Bertino and
L. Mancini Mark-and-Sweep Garbage Collection in
Multilevel Secure Object-Oriented
Database Systems . . . . . . . . . . . . 359
N. Boulahia-Cuppens and
F. Cuppens and
A. Gabillon and
K. Yazdanian Decomposition of Multilevel Objects in
an Object-Oriented Database . . . . . . 375
R. K. Thomas and
R. S. Sandhu Supporting Object-Based High-Assurance
Write-up in Multilevel Databases for the
Replicated Architecture . . . . . . . . 403
A. Motro and
D. G. Marks and
S. Jajodia Aggregation in Relational Databases:
Controlled Disclosure of Sensitive
Information . . . . . . . . . . . . . . 431
F. Cuppens and
G. Trouessin Information Flow Controls vs.
Interference Controls: An Integrated
Approach . . . . . . . . . . . . . . . . 447
G. Uzilevsky Ergosemiotics of User Interface Research
and Design: Foundations, Objectives,
Potential . . . . . . . . . . . . . . . 1
O. Bertelsen Fitts' Law as a Design Artefact: A
Paradigm Case of Theory in Software
Design . . . . . . . . . . . . . . . . . 11
C. Rueckert and
S. Klein Empirical Study on the Use of a
Knowledge-Based System for Selecting
Standard Engineering Components . . . . 19
M. Rauterberg and
E. Styger Positive Effects of Sound Feedback
During the Operation of a Plant
Simulator . . . . . . . . . . . . . . . 35
B. Meyer Retail User Assistant: Evaluation of a
User-Adapted Performance Support System 45
L. G. Tudor Growing an Icon Set: User Acceptance of
Abstract and Concrete Icon Styles . . . 56
F. Modugno and
B. A. Myers Exploring Graphical Feedback in a
Demonstrational Visual Shell . . . . . . 64
D. Conway ARGS: Autogenerating Documented Command
Line Interfaces . . . . . . . . . . . . 77
D. Hix and
H. R. Hartson IDEAL: An Environment to Support
Usability Engineering . . . . . . . . . 95
S. Schreiber Specification and Generation of User
Interfaces with the BOSS-System . . . . 107
M. V. Donskoy An Architecture for Object Oriented User
Interfaces . . . . . . . . . . . . . . . 121
D. S. Kosbie and
B. A. Myers Extending Programming by Demonstration
with Hierarchical Event Histories . . . 128
M. S. Levin Hierarchical Design of User Interfaces 140
I. V. Kotenko Conflict Resolution in
Computer-Supported Cooperative Design 152
K. Hurts and
P. De Greef Cognitive Ergonomics of Multi-Agent
Systems: Observations, Principles and
Research Issues . . . . . . . . . . . . 164
R. K. E. Bellamy and
E. B. W. Cooper and
R. D. Borovoy Supporting Collaborative Learning
through the Use of Electronic
Conversational Props . . . . . . . . . . 181
D. Nitsche-Ruhland A Knowledge-Based Authoring System for
Hypermedia-Based Learning Environments 192
P. Brusilovsky Explanatory Visualization in an
Educational Programming Environment:
Connecting Examples with General
Knowledge . . . . . . . . . . . . . . . 202
V. M. Chelnokov and
V. L. Zephyrova Cultivating and Harvesting Semantic
Coherence in SMIsC Hypertext Networks 213
L. Leventhal and
K. Instone and
B. Teasley Hypertext-Based Kiosk Systems: Seven
Challenges and an Empirical Study . . . 226
W. R. Alford and
A. Granville and
C. Pomerance On the difficulty of finding reliable
witnesses . . . . . . . . . . . . . . . 1
W. Bosma and
P. Stevenhagen Density computations for real quadratic
2-class groups . . . . . . . . . . . . . 17
R. A. Golliver and
A. K. Lenstra and
K. S. McCurley Lattice sieving and trial division . . . 18
L. M. Adleman and
J. DeMarrais and
M.-D. Huang A subexponential algorithm for discrete
logarithms over the rational subgroup of
the Jacobians of large genus
hyperelliptic curves over finite fields 28
B. A. Dodson and
M. J. Haines Computing rates of growth of division
fields on CM abelian varieties . . . . . 41
S. Paulus Algorithms for CM-fields . . . . . . . . 42
J.-M. Couveignes and
F. Morain Schoof's algorithm and isogeny cycles 43
N. Stephens Integer points on rational elliptic
curves . . . . . . . . . . . . . . . . . 59
F. Lehmann and
M. Maurer and
V. Mueller and
V. Shoup Counting the number of points on
elliptic curves over finite fields of
characteristic greater than three . . . 60
R. J. Lipton Straight-line complexity and integer
factorization . . . . . . . . . . . . . 71
D. Kozen and
S. Landau and
R. Zippel Decomposition of algebraic functions . . 80
R. Rubinfeld and
R. Zippel A new modular interpolation algorithm
for factoring multivariate polynomials 93
L. M. Adleman The function held sieve . . . . . . . . 108
N. D. Elkies Heegner point computations . . . . . . . 122
J. E. Cremona Computing the degree of a modular
parametrization . . . . . . . . . . . . 134
M. McConnell Galois representations from the
cohomology of SL(3,Z) . . . . . . . . . 143
H. Daude and
P. Flajolet and
B. Vallee An analysis of the Gaussian algorithm
for lattice reduction . . . . . . . . . 144
M. Kaib A fast variant of the Gaussian reduction
algorithm . . . . . . . . . . . . . . . 159
J. Buchmann Reducing lattice bases by means of
approximations . . . . . . . . . . . . . 160
J. Shallit and
J. Sorenson Analysis of a left-shift binary GCD
algorithm . . . . . . . . . . . . . . . 169
B. S. Majewski and
G. Havas The complexity of greatest common
divisor computations . . . . . . . . . . 184
A. J. Van der Poorten Explicit formulas for units in certain
quadratic number fields . . . . . . . . 194
S. Evdokimov Factorization of polynomials over finite
fields in subexponential time under GRH 209
S. Gao and
S. A. Vanstone On orders of optimal normal basis
generators . . . . . . . . . . . . . . . 220
E. J. Volcheck Computing in the Jacobian of a plane
algebraic curve . . . . . . . . . . . . 221
C. Thiel Under the assumption of the generalized
Riemann Hypothesis verifying the class
number belongs to NPCo-NP . . . . . . . 234
F. Hajir Calculating the class number of certain
Hilbert class fields . . . . . . . . . . 248
L. M. Adleman and
M.-D. Huang and
K. Kompella Efficient checking of computations in
number theory . . . . . . . . . . . . . 249
G.-J. Lay and
H. G. Zimmer Constructing elliptic curves with given
group order over large finite fields . . 250
M. Deleglise and
J. Rivat Computing (x), M(x) and psi(x) . . . . . 264
I. E. Shparlinski On some applications of finitely
generated semi-groups . . . . . . . . . 265
P. Pritchard Improved incremental prime number sieves 280
P. W. Shor Polynomial time algorithms for discrete
logarithms and factoring on a quantum
computer . . . . . . . . . . . . . . . . 289
G. Ji and
H. Lu On dispersion and Markov constants . . . 290
L. M. Adleman and
K. S. McCurley Open problems in number theoretic
complexity, II . . . . . . . . . . . . . 291
A. Aalund and
P. Loetstedt and
R. Ryden Computational Fluid Dynamics on
Workstation Clusters in Industrial
Environments . . . . . . . . . . . . . . 1--10
B. S. Andersen and
P. Kaae and
C. Keable and
W. Owczarz PVM Implementations of
Advection-Chemistry Modules of Air
Pollution Models . . . . . . . . . . . . 11--16
V. Antonuccio-Delogu and
U. Becciani A Parallel Tree $N$-Body Code for
Heterogeneous Clusters . . . . . . . . . 17--32
J. M. Badia and
A. M. Vidal Parallel Computation of the
Eigenstructure of Toeplitz-plus-Hankel
Matrices on Multicomputers . . . . . . . 33--40
S. M. Balle and
P. M. Pedersen Singular Value Decomposition on the
Connection Machine CM-5/CM-5E . . . . . 41--50
V. A. Barker and
C. Yingqun Computing Eigenvalues of Sparse Matrices
on the Connection Machine . . . . . . . 51--58
C. Bendtsen Preliminary Experiences with
Extrapolation Methods for Parallel
Solution of Differential Algebraic
Equations . . . . . . . . . . . . . . . 59--66
P. Berkhin and
J. Brown A Transform Approach to Fast Matrix
Multiplication . . . . . . . . . . . . . 67--79
G. D. Billing Quantum Mechanical Treatment of Reactive
Scattering Problems . . . . . . . . . . 80--88
A. Bode and
N. Eicker and
T. Lippert and
K. Schilling Visualizing the Critical Dynamics of
Monopole Current Clusters ---
Global/Local Programming on the
Connection Machine CM-5 . . . . . . . . 89--99
K. Boryczko and
J. Kitowski and
J. Moscinski Load-Balancing Procedure for Distributed
Short-Range Molecular Dynamics . . . . . 100--109
J. Brown and
P. C. Hansen and
J. Wasniewski and
Z. Zlatev Comparison of Massively Parallel SIMD
Computers Using Air Pollution Models . . 110--126
M. Bubak and
J. Moscinski and
M. Pogoda and
W. Zdechlikiewicz Parallel Distributed $2$-D Short-Range
Molecular Dynamics on Networked
Workstations . . . . . . . . . . . . . . 127--135
M. Bubak and
J. Moscinski and
R. Slota Implementation of Parallel Lattice Gas
Program on Workstations under PVM . . . 136--146
J. Choi and
J. J. Dongarra and
R. Pozo and
D. W. Walker Constructing Numerical Software
Libraries for High-Performance Computing
Environments . . . . . . . . . . . . . . 147--168
M. J. Dayde and
I. S. Duff The CERFACS Experience . . . . . . . . . 169--176
R. Dohmen Towards an Automatic Portation of
Programs from nCUBE2 to KSR1 . . . . . . 177--189
V. D. Elinov and
O. G. Monakhov and
I. I. Ushatinsky Seismic Data Processing: Parallel and
Conservative Computations on the
Multitransputer System . . . . . . . . . 190--193
Y. I. Fet and
A. P. Vazhenin Heterogeneous Processing: A Combined
Approach . . . . . . . . . . . . . . . . 194--206
S. Filippone and
M. L. Sales Experiences in Numerical Software on IBM
Distributed Memory Architectures . . . . 207--218
T. L. Freeman and
J. M. Bull Shared Memory and Message Passing
Implementations of Parallel Algorithms
for Numerical Integration . . . . . . . 219--228
M. Gajecki and
J. Moscinski A New Algorithm for the Traveling
Salesman Problem on Networked
Workstations . . . . . . . . . . . . . . 229--235
G. A. Geist Cluster Computing: The Wave of the
Future? . . . . . . . . . . . . . . . . 236--246
L. Grosz and
C. Roll and
W. Schoenauer Nonlinear Finite Element Problems on
Parallel Computers . . . . . . . . . . . 247--261
H. Hakula and
J. Malinen and
P. Kallberg and
P. Valve The Finite Element Method Applied to the
Exterior Helmholtz Problem on the IBM
SP-1 . . . . . . . . . . . . . . . . . . 262--269
S. Hammarling The Challenge of Portable Libraries for
High Performance Machines . . . . . . . 270--286
P. C. Hansen Parallel Issues of Regularization
Problems . . . . . . . . . . . . . . . . 287--295
P. C. Hansen and
T. Ostromsky and
Z. Zlatev Two Enhancements in a Partitioned Sparse
Code . . . . . . . . . . . . . . . . . . 296--303
W. J. Harrod and
M. Sidani Numerical Algorithms for the Cray T3D 304--311
A. Hunding Nonlinear Dynamics in Biochemical
Control Systems . . . . . . . . . . . . 312--317
S. L. Johnsson and
K. K. Mathur Scientific Software Libraries for
Scalable Architectures . . . . . . . . . 318--332
J. G. Kienhoefer The EFECT System for Parallel
Programming . . . . . . . . . . . . . . 333--343
T. Larsen and
W. Joosen and
J. Perram The Object-Oriented Development of a
Parallel Application in Polymer Dynamics 344--348
H. Leszczynski and
J. Pieniazek On Some Difference Analogues of PDEs
with a Delay . . . . . . . . . . . . . . 349--357
K. Madsen and
O. Toft Parallel Interval Methods for Perturbed
Linear Systems . . . . . . . . . . . . . 358--361
O. A. McBryan Limiting Factors in High Performance
Computing . . . . . . . . . . . . . . . 362--373
P. Michielse Programming the Convex Exemplar Series
SPP System . . . . . . . . . . . . . . . 374--382
K. Museth and
G. D. Billing and
J. Linderberg The Full Quantum Mechanical Three Body
Problem of H0+2 . . . . . . . . . . . . 383--391
O. H. Nielsen Molecular dynamics: experiences with
Connection Machines CM-200 and CM-5 . . 392--396
P. Nordling and
P. Fritzson Solving Ordinary Differential Equations
on Parallel Computers --- Applied to
Dynamic Rolling Bearings Simulation . . 397--415
M. Paprzycki and
P. Stpiczynski Solving Linear Recurrence Systems on a
Cray Y-MP . . . . . . . . . . . . . . . 416--424
P. M. Pedersen and
S. M. Balle Selected Techniques for Efficient
Parallel Implementation of Dense Linear
Algebra Algorithms on the Connection
Machine CM-5/CM-5E . . . . . . . . . . . 425--433
R. Skaalin and
D. Bjoerge and
N. Gustafsson and
I. Lie Parallelization of HIRLAM on MIMD
Platforms . . . . . . . . . . . . . . . 434--457
J. N. Soerensen and
M. O. L. Hansen and
E. Jensen Simulation of Fluid Dynamical Flow
Problems . . . . . . . . . . . . . . . . 458--468
M. Szularz and
J. Weston and
K. Murphy and
M. Clint Parallel Algorithms for the Partial
Eigensolution of Large Sparse Matrices
on Novel Architecture Computers . . . . 469--482
C. G. Tengwall SP2 Architecture and Performance . . . . 483--492
P. G. Thomsen Real Time Simulation in a Cluster
Computing Environment . . . . . . . . . 493--497
S. Toxvaerd Parallel Computations in Molecular
Dynamics . . . . . . . . . . . . . . . . 498--504
A. P. Vazhenin Efficient High-Accuracy Computations in
Massively Parallel Systems . . . . . . . 505--519
P. Y. Yalamov Stability of Parallel Bidiagonal Solvers 520--533
A. Zemla Wavelet Transforms Computing on PVM . . 534--546
Z. Zlatev and
J. Wasniewski PARASPAR: Parallel Solvers for Sparse
Linear Algebraic Systems . . . . . . . . 547--556
A. Zrimsek and
T. Smukavec Fair Metacomputer --- FMC . . . . . . . 557--566
D. Kozen Efficient Resolution of Singularities of
Plane Curves . . . . . . . . . . . . . . 1--11
J.-M. Couveignes and
J. F. Diaz-Frias and
M. De Rougemont and
M. Santha On the Interactive Complexity of Graph
Reliability . . . . . . . . . . . . . . 12--23
M. Dietzfelbinger and
M. Huehne Matching Upper and Lower Bounds for
Simulations of Several Tapes on One
Multidimensional Tape . . . . . . . . . 24--35
H. Caussinus and
F. Lemieux The Complexity of Computing over
Quasigroups . . . . . . . . . . . . . . 36--47
M. Mahajan and
V. Vinay Non-commutative Computation, Depth
Reduction and Skew Circuits . . . . . . 48--59
T. Coquand and
P. Dybjer Inductive Definitions and Type Theory an
Introduction (Preliminary Version) . . . 60--76
M. Broy and
U. Hinkel and
T. Nipkow and
C. Prehofer Interpreter Verification for a
Functional Language . . . . . . . . . . 77--88
V. S. Lakshmanan An Epistemic Foundation for Logic
Programming with Uncertainty . . . . . . 89--100
H. Tsuiki On Typed Calculi with a Merge Operator 101--112
D. Frigioni and
A. Marchetti-Spaccamela and
U. Nanni Incremental Algorithms for the
Single-Source Shortest Path Problem . . 113--124
S. Rao Arikati and
A. Maheshwari An $ O(n) $ Algorithm for Realizing
Degree Sequences . . . . . . . . . . . . 125--136
C. R. Subramanian and
C. E. Veni Madhavan Coloring Semi-Random Graphs in
Polynomial Expected Time . . . . . . . . 137--148
W. Thomas Finite-State Strategies in Regular
Infinite Games . . . . . . . . . . . . . 149--158
S. C. Nandy and
A. Sinha and
B. B. Bhattacharya Location of the Largest Empty Rectangle
among Arbitrary Obstacles . . . . . . . 159--170
E. Dahlhaus Efficient Parallel and Linear Time
Sequential Split Decomposition . . . . . 171--180
S. Biswas and
D. C. Prasad and
S. P. Pal Algorithms for Convex Visibility
Problems . . . . . . . . . . . . . . . . 181--192
S. Sen Lower Bounds for Parallel Algebraic
Decision Trees, Complexity of Convex
Hulls and Related Problems . . . . . . . 193--204
R. M. Amadio and
S. Prasad Localities and Failures . . . . . . . . 205--216
V. Natarajan and
I. Christoff and
L. Christoff and
R. Cleaveland Priority and Abstraction in Process
Algebra . . . . . . . . . . . . . . . . 217--230
K. Narayan Kumar and
P. K. Pandya On the Computational Power of Operators
in ICSP with Fairness . . . . . . . . . 231--242
W. Yi and
B. Jonsson Decidability of Timed Language-Inclusion
for Networks of Real-Time Communicating
Sequential Processes . . . . . . . . . . 243--255
L. Fortnow My Favorite Ten Complexity Theorems of
the Past Decade . . . . . . . . . . . . 256--275
Y. Kaji and
T. Fujiwara and
T. Kasami Solving a Unification Problem under
Constrained Substitutions Using Tree
Automata . . . . . . . . . . . . . . . . 276--287
R. Ramesh and
I. V. Ramakrishnan and
R. C. Sekar Automata-Driven Efficient Subterm
Unification . . . . . . . . . . . . . . 288--299
P. Raghavan Randomized Approximation Algorithms in
Combinatorial Optimization . . . . . . . 300--317
V. Arora and
V. Santosh and
H. Saran and
V. V. Vazirani A Limited-Backtrack Greedy Schema for
Approximation Algorithms . . . . . . . . 318--329
P. Crescenzi and
L. Trevisan On Approximation Scheme Preserving
Reducibility and its Applications . . . 330--341
H. B. Hunt and
M. V. Marathe and
V. Radhakrishnan and
S. S. Ravi Approximation Schemes Using
$L$-Reductions . . . . . . . . . . . . . 342--353
A. Subramanian An Explanation of Splaying . . . . . . . 354--365
J. Desel and
M.-D. Radola Proving Non-Reachability by
Modulo-Place-Invariants . . . . . . . . 366--377
E. Knapp Soundness and Completeness of UNITY
Logic . . . . . . . . . . . . . . . . . 378--389
P. Savicky and
I. Wegener Efficient Algorithms for the
Transformation between Different Types
of Binary Decision Diagrams . . . . . . 390--401
M. Siegel and
F. A. Stomp Extending the Limits of Sequentially
Phased Reasoning . . . . . . . . . . . . 402--413
V. Estivill-Castro and
D. Wood Foundations for Faster External Sorting 414--425
J. N. Hooker and
V. Vinay Branching Rules for Satisfiability . . . 426--437
D. Kapur and
M. Subramaniam Using Linear Arithmetic Procedure for
Generating Induction Schemes . . . . . . 438--449
B. Kervella and
V. Gay and
E. Horlait Towards a Complete Multimedia Mail: Use
of MHEG in Standard Messaging Systems 1
H. Thimm and
K. Roehr and
T. C. Rakow A Mail-Based Teleservice Architecture
for Archiving and Retrieving Dynamically
Composable Multimedia Documents . . . . 14
C. Blum and
L. Neumann The Global Store Server --- A Multimedia
Teleservice Component . . . . . . . . . 35
H. Leopold and
K. Frimpong-Ansah and
N. Singer From Broadband Network Services to a
Distributed Multimedia
Support-Environment . . . . . . . . . . 47
S. Shenker and
A. Weinrib and
E. Schooler Managing Shared Ephemeral
Teleconferencing State: Policy and
Mechanism . . . . . . . . . . . . . . . 69
C. Loge and
V. Gay and
E. Horlait Computational Components for Synchronous
Cooperation on Multimedia Information 89
A. A. Lazar and
S. K. Bhonsle and
K. S. Lim A Binding Architecture for Multimedia
Networks . . . . . . . . . . . . . . . . 103
L. Fedaoui and
A. Seneviratne and
E. Horlait Implementation of an End-to-End Quality
of Service Management Scheme . . . . . . 124
H. Bowman and
L. Blair and
G. S. Blair and
A. G. Chetwynd A Formal Description Technique
Supporting Expression of Quality of
Service and Media Synchronisation . . . 145
W. Yen and
I. F. Akyildiz On the Synchronization Mechanisms for
Multimedia Integrated Services Networks 168
C. Szyperski and
G. Ventre Efficient Support for Multiparty
Communication . . . . . . . . . . . . . 185
L. Mathy and
O. Bonaventure QoS Negotiation for Multicast
Communications . . . . . . . . . . . . . 199
G. Carle and
J. Schiller and
C. Schmidt Support for High-Performance Multipoint
Multimedia Services . . . . . . . . . . 219
R. Schatzmayr and
R. Popescu-Zeletin Providing Support for Data Transfer in a
New Networking Environment . . . . . . . 241
T. Sakatani Congestion Avoidance for Video over IP
Networks . . . . . . . . . . . . . . . . 256
H. Wittig and
J. Winckler and
J. Sandvoss Network Layer Scaling: Congestion
Control in Multimedia Communication with
Heterogeneous Networks and Receivers . . 274
M. Hamdi and
P. Rolin and
Y. Duboc and
M. Ferry Resource Requirements for VBR MPEG
Traffic in Interactive Applications . . 294
T. Andrade and
A. P. Alves Transmission of MPEG2 Applications over
ATM Networks . . . . . . . . . . . . . . 310
W. J. Clark Protocols for Multimedia Conferencing
--- An Introduction to the ITU-T T.120
series . . . . . . . . . . . . . . . . . 322
G. Dermler and
T. Gutekunst and
E. Ostrowski and
N. Pires A Platform for Multimedia
Telecooperation Bridging Endsystem
Heterogeneity . . . . . . . . . . . . . 334
N. B. Pronios and
T. Bozios A Scheme for Multimedia and Hypermedia
Synchronisation . . . . . . . . . . . . 340
D. Riexinger and
K. Werner Integration of Existing Applications
into a Conference System . . . . . . . . 346
A. Rozek and
P. Christ The CIO Multimedia Communication
Platform . . . . . . . . . . . . . . . . 356
M. A. Blanco and
R. Montero and
F. Almerico and
G. Venuti Broadband Multimedia and Collaboration
Tools. Idea Project . . . . . . . . . . 368