Table of Contents

• Interface for Reusable Software ComponentsDeng-Jyi Chen, Shih-Kun Huang. 3-9
• Parallelism as a Structuring Technique: Call Processing using the Estrel LanguageGary J. Murakami, Ravi Sethi. 10-16
• Entropy as a Complexity Measure, and the Optimal Module Size of Object Oriented ProgramsArne Maus. 17-23
• Design Validation Using Probe MechanismSuresh C. Gupta, Mukul K. Sinha. 24-31
• Functional Programming and MirandaD. A. Turner. 32-41
• An Overview of Specification Language UniverseMing-Yuan Zhu, Cheng-Wei Wang. 42-48
• Oyster-2: Bringing Type Theory into PracticeChristian Horn. 49-56
• Toward A Problem Solving Approach To Software Technology TransitionPriscilla J. Fowler, Linda Levine. 57-64
• From Research to Practice: Self-reliance of the Developing World through own Software Technology: Education, Development, Management & ResearchDines Bjørner. 65-71
• Software Life Cycle Support - Decision Based Software DevelopmentJ. Christian Wild, Kurt Maly. 72-78
• An Approach to Modelling and Analysis of Parallel Information SystemsGeoff Cutts. 79-85
• The Effect of Collaboration on Problem-Solving Performance Among ProgrammersJudith D. Wilson, John T. Nosek, Nathan Hoskin, Lin L. Liou. 86-93
• GeSEM: A Model for Software Engineering ActivitiesJacques Hagelstein, G. Hulin. 94-102
• On Constructing Large Software SystemsJean-Raymond Abrial. 103-112
• Functional Verification of Hard Real-Time ProgramsPeter Kearney, John Staples, A. Abbas. 113-119
• A Multiformalism Approach to Formalize Complex Distributed SystemsHaféda Bachatène, Pascal Estraillier. 120-126
• A Temporal Logic Approach for Analyzing Safety Properties of Predicate Transition NetsXudong He, Yingjia Ding. 127-133
• A Formal Approach to Software ArchitecturesRobert J. Allen, David Garlan. 134-141
• An Overview of ALCOHOL: an Applicative Logic Concurrent Object-oriented Higher-Order LanguagePier Giorgio Bosco, Laura Ferrari, Elio Giovannetti, Corrado Moiso. 142-148
• Code SCheduling Via Time ModelY. A. Frantsuzov. 149-155
• Multimodal Systems: Aspects of Events Fusion and a TaxonomyArno P. J. Gourdol, Laurence Nigay, Daniel Salber, Joëlle Coutaz. 156-162
• A Declarative Environment for Distributed ProgrammingManuel Díaz, Ernesto Pimentel, José M. Troya. 163-169
• G-system: A Functionally-Based Communication System Model for Parallel ProcessingMyuhng Joo Kim, Chu Shik Jhon, Tetsuo Ida. 170-178
• Component Enhancement: An Adaptive Reusability Mechanism for Groups of Collaborating ClassesKarl J. Lieberherr. 179-185
• On the Design and Implementation of NDSAIL: A Software Automation System with Automated Learning MechanismsJiafu Xu, Daoxu Chen, Lu Jian, Wang Zhijian, Zongming Fei, Zhang Yousong, Qin Ding, Zhu Yingchun. 186-192
• PMMS: A Framework and System for High Level Program Monitoring and MeasuringYingsha Liao, Donald Cohen. 193-199
• The Precise Determination of Definition-Use Pairs in the Interprocedural CaseIstván Forgács. 200-209
• VTM: A Graph Editor for Large TreesToshio Matsuura, Tohru Nakamura, Teruo Higashino, Kenichi Taniguchi, Sumio Masuda. 210-216
• Development Environments for Software ArchitectureDavid Garlan. 217
• Program Visualization: Where We Go From HereSteven P. Reiss. 218-227
• The Configuration Management of Families of ProgramsThomas Cheatham. 228-236
• Automatic Generation of a Compact Test SuitRajiv Gupta, Mary Lou Soffa. 237-243
• The Past, Present, and Future of Configuration ManagementSusan A. Dart. 244-251
• A Knowledge-Based Approach to Generating Target System Specifications from a Domain ModelHassan Gomaa, Larry Kerschberg, Vijayan Sugumaran. 252-258
• An Accurate, High Speed Implementation of Division by the Quasi-Unity Divisor MethodHiraku Nakano, Masaitsu Nakajima, Yasuhiro Nakakura, Tadahiro Yoshida, Yoshiyuki Goi, Yuji Nakai, Reiji Segawa, Takeshi Kishida. 261-267
• Reducing Multiplicative Complexity of Polynomial Algebra AlgorithmsRyszard Stasinski. 268-274
• Constructing Priority Queues and Deques Optimally in ParallelJingsen Chen. 275-283
• Parallel Algorithms for Finding the Most Vital Edge with Respect to Minimum Spanning TreeLih-Hsing Hsu, Peng-fei Wang, Chu-Tao Wu. 284-290
• The Role of Randomness in the Design of Interconnection NetworksFrank Thomson Leighton, Bruce M. Maggs. 291-305
• Optimal Algorithms for Sorting on Single-tape Turing MachinesJuraj Wiedermann. 306-314
• Characterizations of Logarithmic Advice Complexity ClassesJosé L. Balcázar, Montserrat Hermo, Elvira Mayordomo. 315-321
• Random Generation of Satisfiable and Unsatisfiable CNF PredicatesKazuo Iwama, Hidetoshi Abeta, Eiji Miyano. 322-328
• The Complexity of Language Recognition by Neural NetworksHava T. Siegelmann, Eduardo D. Sontag, C. Lee Giles. 329-335
• Complexity Term to Generate Explicit Internal Representation in Recurrent Neural NetworksRyotaro Kamimura. 336-342
• Learning with the Recurrent Random Neural NetworkErol Gelenbe. 343-349
• Competitive Distributed Decision-MakingXiaotie Deng, Christos H. Papadimitriou. 350-356
• Token Scheme: An Algorithm for Distributed Termination Detection and Its Proof of CorrectnessXinfeng Ye, John A. Keane. 357-364
• An Optimistic Algorithm for Concurrent Accesses to a Single Replicated FileXiaohua Jia, Yanchun Zhang. 365-371
• HSIM: A Hybrid of Sequential and Parallel Discrete-Event SimulationZiqiang Liu, Lars-Erik Thorelli, Handong Wu. 372-378
• Some New Research Directions in Robot Motion PlanningJean-Daniel Boissonnat. 379-380
• A Path Planning Algorithm for Three Link ManipulatorA. El-Dessouki, T. El-Shishtawy, A. El-Mahdi. 381-387
• Generation of 3-D Delaunay Meshes for Complex Geometries using Iterative RefinementNancy Hitschfeld, Stephan Müller, Wolfgang Fichtner. 388-394
• A Generalization of the Maximal Closure of a DigraphArlene Fortunato Machado, Clovis Perin Filho. 395-401
• Efficient Algorithms for the Domination Problems on Interval and Circular-Arc GraphsMaw-Shang Chang. 402-408
• Derefinement Algorithms of Nested MeshesA. Plaza, L. Ferragut, R. Montenegro. 409-415
• On-Line Algorithms Versus Off-Line Algorithms: How Much is it Worth to Know the Future?Richard M. Karp. 416-429
• Polynomial Algorithms for the k-Chinese Postman ProblemLei Zhang. 430-435
• Data Structure for Graph Representations of a Network Having Double Euler TrailsTing-Yi Sung, Lih-Hsing Hsu, Jeng-Yan Hwang. 436-442
• A New Algorithm for Selecting the Median, Two Quartiles, Minimum and Maximum of a Set of NumbersWalter Cunto, S. Kashima, Manuel Rey. 443-448
• An Improved ShellsortNaoyuki Tokuda. 449-457
• Analysis of Online Algorithms for Organ AllocationShmuel Ur, Michael A. Trick, Daniel Dominic Sleator. 458-464
• Text-Retrieval: Theory and PracticeRicardo A. Baeza-Yates. 465-476
• Compact Balanced TriesPierre Nicodème. 477-483
• Constructing Suffix Trees On-Line in Linear TimeEsko Ukkonen. 484-492
• Algorithm Design and Software Libraries: Recent Developments in the LEDA ProjectKurt Mehlhorn, Stefan Näher. 493-505
• Update-Dataflow Computing: A Way to Supercomputing in Discrete Simulation of Digital SystemsWinfried Hahn, Andreas Hagerer, H. Anger. 509-517
• Asynchronous Polycyclic Architecture: An OverviewGeraldo Lino de Campos. 518-524
• Linear Programming on TransputersJ. Luo, Gerard L. Reijns. 525-534
• Parallelism Control and Storage Management in Datarol PEShigeru Kusakabe, Takahide Hoshide, Rin-ichiro Taniguchi, Makoto Amamiya. 535-541
• Technology for TeraFLOPS ComputingThomas Bemmerl. 542
• Panel: Parallel and Distributed Computing - Distributed Memory or Shared Memory Systems?Gerard L. Reijns. 543-544
• A Deadlock-free Adaptive Routing Algorithm for Direct Binary HypercubesQiang Li. 545-554
• Design and Implementation of an Interconnection Network for the AP1000Takeshi Horie, Hiroaki Ishihata, Morio Ikesaka. 555-561
• Xbar: A VLSI Circuit for Bit-sliced Packet Switching NetworksD. J. Rogers, Roland N. Ibbett. 562-570
• SSS (Simple Serial Synchronized)-MIN: A Novel Multi Stage Interconnection Architecture for MultiprocessorsHideharu Amano, Luo Zhou, Kalidou Gaye. 571-577
• A Programmable Communication Architecture Based on Kautz NetworksGerard J. M. Smit, Paul J. M. Havinga, Pierre G. Jansen. 578-584
• Dependability: A Unifying Concept for Reliable, Safe, Secure ComputingJean-Claude Laprie. 585-593
• Active Redundancy in Distributed Real-Time SystemsHermann Kopetz. 595
• Pre-2000 Maturing of the Real-Time Fault-Tolerant Distributed Computing TechnologyK. H. Kim. 595
• What Are the Correct Paradigms for Designing Dependable Distributed and Real-Time Systems?Gérard Le Lann. 596-597
• Design Description Languages for the Design of Predictability Dependable Real-Time SystemsLuca Simoncini. 598
• Coping with Timing Uncertainties in Distributed Real-Time SystemsT. Basil Smith. 599
• Dependability Issues in TelecommunicationsMichele Morganti. 600-607
• Distributed Reliability AnalysisMin-Sheng Lin, Deng-Jyi Chen. 608-614
• Operating System SXO for Continuous OperationHiroshi Muramatsu, Masahiro Date, Hiroshi Yoshida, Masaharu Kitaoka, Norio Kurobane. 615-621
• Performance and Performability Evaluation of Client Server Systems by Stochastic Petri NetsSatoshi Moriguchi. 622-628
• Performability Modeling and Its Evaluation Tool for Network DisconnectionRodrigo Torres, Kiichi Shibata, Mitsuru Yokoi. 629-635
• The Role of Modeling and Evaluation in the Design ProcessJohn F. Meyer. 636-644
• Multiprocessor Architectures for High Speed Networks: A Performance StudyKurt Maly, Sanjeev Khanna, C. Michael Overstreet, Ravi Mukkamala, Mohammad Zubair, Y. S. Sekhar. 645-651
• Fault-Tolerant Microcomputer Design and Application for Railway Train ControlHideo Nakamura, Kiyoshi Takeshi. 652-658
• Design for a Ray Casting Integrated CircuitWieslaw Lucjan Nowinski. 659-666
• Three-Layer Neural Network Models for Rotated Patterns RecognitionKenichi Suzaki, Shinji Araya, Ryozo Nakamura. 667-673
• Progress Trends and Perspective of VLSI TechnologyHajime Ishikawa. 674-682
• Reliable Systems Enginerring (Position Statement)Manfred Broy. 683
• Tomorrow s Digital Hardware will be Asynchronous and VerifiedAlain J. Martin. 684-695
• Efficient RT-Level Verification by Theorem ProvingTiziana Margaria. 696-702
• Performance Through Hierarchy in Static Timing VerificationP. Johannes, Luc J. M. Claesen, Hugo De Man. 703-709
• Formal Methods For DesignGerry Musgrave. 710
• Declarative Languages For CAD: The Return From Algorithm Design Back To System DesignRaymond T. Boute. 711
• Formal Verification: A Slow, but Certain EvolutionRandal E. Bryant. 712
• The CAD Tool of the FutureMichael P. Fourman. 713
• System Level Design: The New ChallengeFranz J. Rammig. 714