Abstract is missing.
- Theoretical Computer Science and Software Science: The Past, the Present and the Future (Position Paper)Corrado Böhm. 3-5
- Future Trends of TAPSOFTHartmut Ehrig, Bernd Mahr. 6-10
- New Challenges for Theoretical Computer ScienceMaurice Nivat. 11-14
- What Does the Future Hold for Theoretical Computer Science?Donald Sannella. 15-19
- Automata Theory on Trees and Partial OrdersWolfgang Thomas. 20-38
- A Theory of Testing for Timed Automata (Abstract)Frits W. Vaandrager. 39
- Conservative Extensions, Interpretations Between Theories and All That!T. S. E. Maibaum. 40-66
- Specification and Proof in Membership Equational LogicAdel Bouhoula, Jean-Pierre Jouannaud, José Meseguer. 67-92
- Formalism and MethodEgidio Astesiano, Gianna Reggio. 93-114
- CoFI: The Common Framework Initiative for Algebraic Specification and DevelopmentPeter D. Mosses. 115-137
- Logicality of Conditional Rewrite SystemsToshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz, Aart Middeldorp. 141-152
- Simulating Forward-Branching Systems with Constructor SystemsBruno Salinier, Robert Strandh. 153-164
- Reliable Generalized and Context Dependent Commutation RelationsIabelle Biermann, Brigitte Rozoy. 165-176
- Word-into-Tree Transducers with Bounded DifferenceYves Andre, Francis Bossut. 177-188
- Generalized Quantitative Temporal Reasoning: An Automata Theoretic ApproachE. Allen Emerson, Richard J. Trefler. 189-200
- The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level LanguagesDanièle Beauquier, Anatol Slissenko. 201-212
- Model Checking Through Symbolic Reachability GraphJean-Michel Ilié, Khalil Ajami. 213-224
- Optimal Implementation of Wait-Free Binary RelationsEric Goubault. 225-236
- Relative Undecidability in the Termination Hierarchy of Single Rewrite RulesAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema. 237-248
- Termination Proofs Using gpo Ordering ConstraintsThomas Genet, Isabelle Gnaedig. 249-260
- Automatically Proving Termination Where Simplification Orderings FailThomas Arts, Jürgen Giesl. 261-272
- Generating Efficient, Terminating Logic ProgramsJonathan C. Martin, Andy King. 273-284
- Modal Characterization of Weak Bisimulation for Higher-order Processes (Extended Abstract)Michael Baldamus, Jürgen Dingel. 285-296
- Formats of Ordered SOS Rules with Silent ActionsIrek Ulidowski, Iain C. C. Phillips. 297-308
- A Uniform Syntactical Method for Proving Coinduction Principles in Lambda-CalculiMarina Lenisa. 309-320
- A Labelled Transition Systems for pi-epsilon-CalculusFranck van Breugel. 321-332
- Set Operations for Recurrent Term SchematizationsAli Amaniss, Miki Hermann, Denis Lugiez. 333-344
- Inclusion Constraints over Non-empty Sets of TreesMartin Müller, Joachim Niehren, Andreas Podelski. 345-356
- Grid Structure and Undecidable Constraint TheoriesFranck Seynhaeve, Marc Tommasi, Ralf Treinen. 357-368
- Predicative Functional Recurrence and Poly-spaceDaniel Leivant, Jean-Yves Marion. 369-380
- On the Complexity of Function Pointer May-Alias AnalysisRobert Muth, Saumya K. Debray. 381-392
- Maximum Packing for Biconnected Outerplanar GraphsTomas Kovacs, Andrzej Lingas. 393-404
- Synchronization of a Line of Identical Processors at a Given TimeSalvatore La Torre, Margherita Napoli, Mimmo Parente. 405-416
- An Algorithm for the Solution of Tree EquationsSabrina Mantaci, Daniele Micciancio. 417-428
- E-Unification by Means of Tree Tuple Synchronized GrammarsSébastien Limet, Pierre Réty. 429-440
- Linear Interpolation for the Higher-Order Matching ProblemAleksy Schubert. 441-452
- A Semantic Framework for Functional Logic Programming with Algebraic Polymorphic TypesPuri Arenas-Sánchez, Mario Rodríguez-Artalejo. 453-464
- Subtyping Constraints for Incomplete Objects (Extended Abstract)Viviana Bono, Michele Bugliesi, Mariangiola Dezani-Ciancaglini, Luigi Liquori. 465-477
- Partializing Stone Spaces using SFP Domains (Extended Abstract)Fabio Alessi, Paolo Baldan, Furio Honsell. 478-489
- Let-Polymorphism and Eager Type SchemesChuck Liang. 490-501
- Semantics of Architectural ConnectorsJosé Luiz Fiadeiro, Antónia Lopes. 505-519
- Protective Interface SpecificationsGary T. Leavens, Jeannette M. Wing. 520-534
- Specifying Complex and Structured Systems with Evolving AlgebrasWolfgang May. 535-549
- A Comparison of Modular Verification TechniquesHenrik Reif Andersen, Jørgen Staunstrup, Niels Maretti. 550-564
- A Compositional Proof of a Real-Time Mutual Exclusion ProtocolKåre J. Kristoffersen, François Laroussinie, Kim Guldstrand Larsen, Paul Pettersson, Wang Yi. 565-579
- Traces of I/O-Automata in Isabelle/HOLCFOlaf Müller, Tobias Nipkow. 580-594
- Reactive TypesJean-Pierre Talpin. 595-606
- A Type-Based Approach to Program SecurityDennis M. Volpano, Geoffrey Smith. 607-621
- An Applicative Module CalculusJudicaël Courant. 622-636
- Compositional Specification of Embedded Systems with StatechartsJan Phillips, Peter Scholz. 637-651
- Verification of Message Sequence Charts via Template MatchingVladimir Levin, Doron Peled. 652-666
- Probabilistic Lossy Channel SystemsS. Purushothaman Iyer, Murali Narasimha. 667-681
- A Logic of Object-Oriented ProgramsMartín Abadi, K. Rustan M. Leino. 682-696
- Auxiliary Variables and Recursive ProceduresThomas Schreiber. 697-711
- Locality Based Linda: Programming with Explicit LocalitiesRocco De Nicola, Gian Luigi Ferrari, Rosario Pugliese. 712-726
- A Syntactic Theory of Dynamic BindingLuc Moreau. 727-741
- A Unified Framework for Binding-Time AnalysisPeter Thiemann. 742-756
- A Typed Intermediate Language for Flow-Directed CompilationJ. B. Wells, Allyn Dimock, Robert Muller, Franklyn A. Turbak. 757-771
- Action Refinement as an Implementation RelationsArend Rensink, Roberto Gorrieri. 772-786
- Behaviour-Refinement of Coalgebraic Specifications with Coinductive Correctness ProofsBart Jacobs. 787-802
- COMPASS: A Comprehensible Assertion MethodStaffan Bonnier, Tim Heyer. 803-817
- Using LOTOS Patterns to Characterize Architectural StylesMaritta Heisel, Nicole Lévy. 818-832
- Automating Formal Specification-Based TestingMichael R. Donat. 833-847
- Typelab: An Environment for Modular Program DevelopmentFriedrich W. von Henke, Marko Luther, Martin Strecker. 851-854
- TAS and IsaWin: Generic Interfaces for Transformational Program Development and Theorem ProvingKolyang, Christoph Lüth, Thomas Meyer, Burkhart Wolff. 855-858
- Proving System Correctness with KIVWolfgang Reif, Gerhard Schellhorn, Kurt Stenzel. 859-862
- A new Proof-Manager and Graphic Interface for the Larch ProverFrédéric Voisin. 863-866
- A Web-based Animator for Object Specifications in a Persistent EnvironmentMark Richters, Martin Gogolla. 867-870
- Publishing Formal Specifications in Z Notation on World Wide WebLubos Mikusiak, Miroslav Adámy, Thomas Seidmann. 871-874
- DOSFOP - A Documentation Tool for the Algebraic Programming Language OPALKlaus Didrich, Torsten Klein. 875-878
- AG: A Set of Maple Packages for Symbolic Computing of Automata and SemigroupsPascal Caron. 879-882