6. TAPSOFT 1995: Aarhus, Denmark
Peter D. Mosses, Mogens Nielsen, Michael I. Schwartzbach (Eds.): TAPSOFT'95: Theory and Practice of Software Development, 6th International Joint Conference CAAP/FASE, Aarhus, Denmark, May 22-26, 1995, Proceedings. Springer 1995 Lecture Notes in Computer Science ISBN 3-540-59293-8
Invited Lectures
Hartmut Ehrig, Bernd Mahr: A Decade of TAPSOFT: Aspects of Process and Prospects in Theory and Practice of Software Development. 3-24
Christiane Floyd: Theory and Practice of Software Development: Stages in a Debate. 25-41
Dexter Kozen: Rational Spaces and Set Constraints. 42-61
Marie-Claude Gaudel: Testing Can Be Formal, Too. 82-96
Vaughan R. Pratt: Anatomy of the Pentium Bug. 97-107
Vaughan R. Pratt: Rational Mechanisms and Natural Mathematics. 108-122
CAAP
Trees & Automata
Andreas Potthoff: First-Order Logic on Finite Trees. 125-139
Kai Salomaa: Decidability of Equivalence for Deterministic Synchronized Tree Automata. 140-154
Yves Andre, Francis Bossut: The Equivalence Problem for Letter-to-Letter Bottom-up Tree Transducers is Solvable. 155-171
Concurrency I
Davide Sangiorgi: Pi-I: A Symmetric Calculus Based on Internal Mobility. 172-186
Huimin Lin: Complete Inference Systems for Weak Bisimulation Equivalences in the pi-Calculus. 187-201

Logic & Specification
Burghard von Karger: An Algebraic Approach to Temporal Logic. 232-246
Martin Hofmann, Donald Sannella: On Behavioral Abstraction and Behavioural Satisfaction in Higher-Order Logic. 247-261
Bengt Jonsson, Yih-Kuen Tsay: Assumption/Guarantee Specifications in Linear-Time Temporal Logic (Extended Abstract). 262-276
Formal Languages
Victor L. Selivanov: Fine Hierarchy of Regular omega-Languages. 277-287
Thomas Wilke, Haiseung Yoo: Computing the Wadge Degree, the Lifschitz Degree, and the Rabin Index of a Regular Language of Infinite Words in Polynomial Time. 288-302
Pierre-André Wacrenier: Semi-Trace Morphisms and Rational Transductions. 303-317
Concurrency II
Vladimiro Sassone: On the Category of Petri Net Computations. 334-348
Petr Jancar: High Undecidability of Weak Bisimilarity for Petri Nets. 349-363
Eric Badouel, Luca Bernardinello, Philippe Darondeau: Polynomial Algorithms for the Synthesis of Bounded Nets. 364-378
Rewriting Systems
M. R. K. Krishna Rao: Semi-Completeness of Hierarchical and Super-Hierarchical Combinations of Term Rewriting Systems. 379-393
Satoshi Okui, Aart Middeldorp, Tetsuo Ida: Lazy Narrowing: Strong Completeness and Eager Variable Elimination (Extended Abstract). 394-408
Annika Wagner: On the Expressive Power of Algebraic Graph Grammars with Application Conditions. 409-423
Semantics
Michal Walicki, Sigurd Meldal: Generated Models and the omega-Rule: The Nondeterministic Case. 424-438
Adriano Peron: Statecharts, Transition Structures and Transformations. 454-468
FASE
Types

Isambo Karali, Constantin Halatsis: A Refinement of Import/Export Declarations in Modular Logic Programming and its Semantics. 486-500
Kirsten Lackner Solberg: Strictness and Totality Analysis with Conjunction. 501-515
Tools
Frank Tip: Generic Techniques for Source-Level Debugging and Dynamic Program Slicing. 516-530
Richard B. Kieburtz, Françoise Bellegarde, Jeffrey M. Bell, James Hook, Jeffrey Lewis, Dino Oliva, Tim Sheard, Lisa Walton, Tong Zhou: Calculating Software Generators from Solution Specifications. 546-560
Static Analysis
Jens Palsberg: Comparing Flow-Based Binding-Time Analyses. 561-574
Peter Ørbæk: Can you Trust your Data? 575-589
Hanne Riis Nielson, Flemming Nielson: Static and Dynamic Processor Allocation for Higher-Order Concurrent Languages. 590-604
Case Studies
Alfons Geser: Mechanized Inductive Proof of Properties of a Simple Code Optimizer. 605-619
Henrik Reif Andersen, Michael Mendler: Describing a Signal Analyzer in the Process Algebra PMC - A Case Study. 620-635
Stephan Kleuker: A Gentle Introduction to Specification Engineering Using a Case Study in Telecommunications. 636-650
Transformations
Shmuel Sagiv, Thomas W. Reps, Susan Horwitz: Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation. 651-665
Sandrine Blazy, Philippe Facon: Formal Specification and Prototyping of a Program Specializer. 666-680
David Sands: Proving the Correctness of Recursion-Based Automatic Program Transformations. 681-695
Concurrency
Kevin Lano: Reactive System Specification and Refinement. 696-710
Cyrille Bareau, Benoît Caillaud, Claude Jard, René Thoraval: Measuring Concurrency of Regular Distributed Computations. 711-725
Luc Moreau: Non-Speculative and Upward Invocation of Continuations in a Parallel Language. 726-740
Specifications
Didier Bert, Catherine Oriat: A Model Inference System for Generic Specification with Application to Code Sharing. 741-755
Hubert Baumeister: Relations as Abstract Datatypes: An Institution to Specify Relations between Algebras. 756-771
Ina Schieferdecker: Performance-Oriented Formal Specifications - the LotoTis Approach. 772-786
TOOLS
Paul Le Guernic: Signal: A Formal Design Environment for Real-Time Systems. 789-790
Bernhard Steffen, Tiziana Margaria, Andreas Claßen: The META-Frame: An Environment for Flexible Tool Management. 791-792
Zohar Manna, Nikolaj Bjørner, Anca Browne, Edward Y. Chang, Michael Colón, Luca de Alfaro, Harish Devarajan, Arjun Kapur, Jaejin Lee, Henny Sipma, Tomás E. Uribe: STeP: The Stanford Temporal Prover. 793-794
Flemming Andersen, Ulla Binau, Karsten Nyblad, Kim Dam Petersen, Jimmi S. Pettersson: The HOL-UNITY Verification System. 795-796
Andre J. Sampaio, Armando Martin Haeberer, Claudio T. Prates, Cristina D. Ururahy, Marcelo F. Frias, Neudson C. Albuquerque: PLATO: A Tool to Assist Programming as Term Rewriting and Therem Proving. 797-798
Bruno Marre: LOFT: A Tool for Assisting Selection of Test Data Sets from Algebraic Specifications. 799-800
Mark van den Brand, Eelco Visser: The Asf+Sdf Meta-Environment Documentation Tools for Free! 803-804
B-Core: The B-Toolkit Demonstration. 805-806
Luiz Carlos Castro Guedes, Edward Hermann Haeusler, José Lucas Rangel: Object Oriented Semantics Directed Compiler Generation: A Prototype. 807-808



