Abstract is missing.
- Goldilocks and the Three SpecificationsJohn V. Guttag. 1-14
- On Relating Some Models for ConcurrencyPierpaolo Degano, Roberto Gorrieri, Sebastiano Vigna. 15-30
- Compositionality Results for Different Types of Parameterization and Parameter Passing in Specification LanguagesHartmut Ehrig, Rosa M. Jiménez, Fernando Orejas. 31-45
- Proving Ground Confluence and Inductive Validity in Constructor Based Equational SpecificationsKlaus Becker. 46-60
- Associative-Commutative Discrimination NetsLeo Bachmair, Ta Chen, I. V. Ramakrishnan. 61-74
- Algebraic Specification and Development in Geometric ModelingYves Bertrand, Jean-François Dufourd, Jean Françon, Pascal Lienhardt. 75-89
- A Case Study in Transformational Design of Concurrent SystemsErnst-Rüdiger Olderog, Stephan Rössig. 90-104
- Yeast: A Case Study for a Practical Use of Formal MethodsPaola Inverardi, Balachander Krishnamurthy, Daniel Yankelevich. 105-120
- Verification and Comparison of Transition SystemsAndré Arnold. 121-135
- Constraining Inference in an Object-Based Design ModelCliff B. Jones. 136-150
- From pi-Calculus to Higher-Order pi-Calculus - and BackDavide Sangiorgi. 151-166
- Hyperedge Replacement with RendevousGnanamalar David, Frank Drewes, Hans-Jörg Kreowski. 167-181
- True Concurrency Semantics for a Linear Logic Programming Language with Braodcast CommunicationJean-Marc Andreoli, Lone Leth, Remo Pareschi, Bent Thomsen. 182-198
- A General Framework for Modular Implementations of Modular System SpecificationsMichel Bidoit, Rolf Hennicker. 199-214
- Specifications Can Make Programs Run FasterMark T. Vandevoorde. 215-229
- Application of the Composition Principle to Unity-like SpecificationsPierre Collette. 230-242
- Trees, Ordinals and TerminationNachum Dershowitz. 243-250
- When Is a Functional Tree Transduction Deterministic?Helmut Seidl. 251-265
- Automata on Infinite Trees with Counting ConstraintsDanièle Beauquier, Damian Niwinski. 266-281
- Directed Column-Convex Polyominoes by Recurrence RelationsElena Barcucci, Renzo Pinzani, Renzo Sprugnoli. 282-298
- Object Organisation in Software Environments for Formal MethodsJun Han, Jim Welsh. 299-313
- Monads, Indexes and TransformationsFrançoise Bellegarde, James Hook. 314-327
- A Technique for Specifying and Refining TCSP Processes by Using Guards and Liveness ConditionsRicardo Pena, Luis M. Alonso. 328-342
- Applications of Type TheoryBernd Mahr. 343-355
- Feature Automata and Recognizable Sets of Feature TreesJoachim Niehren, Andreas Podelski. 356-375
- About the Theory of Tree EmbeddingAlexandre Boudet, Hubert Comon. 376-390
- Linear Unification of Higher-Order PatternsZhenyu Qian. 391-405
- A Theory of Requirements Capture and Its ApplicationsWei Li. 406-420
- Exception Handling and Term LabellingGilles Bernot, Pascale Le Gall. 421-436
- Gate Splitting in LOTOS Specifications Using Abstract InterpretationFosca Giannotti, Diego Latella. 437-452
- Constructing Systems as Object CommunitiesHans-Dieter Ehrich, Grit Denker, Amílcar Sernadas. 453-467
- Term Rewriting in CT-SigmaAndrea Corradini. 468-484
- Optimal Reductions in Interaction SystemsAndrea Asperti, Cosimo Laneve. 485-500
- Optimal Solutions to Pattern Matching ProblemsLaurence Puel, Ascánder Suárez. 501-518
- Testing for a Conformance Relation Based on AcceptanceMing Yu Yao, Gregor von Bochmann. 519-528
- Testability of a Communicating System Through an EnvironmentKhalil Drira, Pierre Azéma, B. Soulas, A. M. Chemali. 529-543
- Automating (Specififation = Implementation) Using Equational Reasoning and LOTOSCarron Kirkwood. 544-558
- On the Ehrenfeucht-Fraïssé Game in Theoretical Computer ScienceWolfgang Thomas. 559-568
- On Asymptotic Probabilities in Logics That Capture DSPACE(log n) in Presence of OrderingJerzy Tyszkiewicz. 569-583
- A Propositional Dense Time Logic (Based on Nested Sequences)Mohsin Ahmed, G. Venkatesh. 584-598
- La Vraie Forme d un ArbreJ. Bétréma, A. K. Zvonkin. 599-612
- Model Checking Using Net UnfoldingsJavier Esparza. 613-628
- Reachability Analysis on Distributed ExecutionsClaire Diehl, Claude Jard, Jean-Xavier Rampon. 629-643
- Property Preserving Abstractions under Parallel CompositionSusanne Graf, Claire Loiseaux. 644-657
- Types as ParametersGiuseppe Longo. 658-670
- Polymorphic Type Inference with Overloading and SubtypingGeoffrey Smith. 671-685
- Type Reconstruction with Recursive Types and Atomic SubtypingJerzy Tiuryn, Mitchell Wand. 686-701
- (Un)expected Path Lengths of Asymmetric Binary Search TreesUwe Trier. 702-716
- Trie Size in a Dynamic List StructureGuy Louchard. 717-731
- A Fully Parallel Calculus of Synchronizing ProcessesDiego Latella, Paola Quaglia. 732-745
- Generic Systolic Arrays: A Methodology for Systolic DesignE. Pascal Gribomont, Vincent Van Dongen. 746-761