TAPSOFT '93: Theory and Practice of Software Development

1. Front Matter

   PDF

2. Goldilocks and the three specifications

   • John V. Guttag

   Pages 1-14

3. On relating some models for concurrency

   • Pierpaolo Degano, Roberto Gorrieri, Sebastiano Vigna

   Pages 15-30

4. Compositionality results for different types of parameterization and parameter passing in specification languages

   • H. Ehrig, R. M. Jimenez, F. Orejas

   Pages 31-45

5. Proving ground confluence and inductive validity in constructor based equational specifications

   • Klaus Becker

   Pages 46-60

6. Associative-commutative discrimination nets

   • Leo Bachmair, Ta Chen, I. V. Ramakrishnan

   Pages 61-74

7. Algebraic specification and development in geometric modeling

   • Y. Bertrand, J. -F. Dufourd, J. Françon, P. Lienhardt

   Pages 75-89

8. A case study in transformational design of concurrent systems

   • Ernst-Rüdiger Olderog, Stephan Rössig

   Pages 90-104

9. Yeast: A case study for a practical use of formal methods

   • Paola Inverardi, Balachander Krishnamurthy, Daniel Yankelevich

   Pages 105-120

10. Verification and comparison of transition systems

    • André Arnold

    Pages 121-135

11. Constraining interference in an object-based design method

    • C. B. Jones

    Pages 136-150

12. From π-calculus to higher-order π-calculus — and back

    • Davide Sangiorgi

    Pages 151-166

13. Hyperedge replacement with rendezvous

    • Gnanamalar David, Frank Drewes, Hans-Jörg Kreowski

    Pages 167-181

14. True concurrency semantics for a linear logic programming language with broadcast communication

    • Jean-Marc Andreoli, Lone Leth, Remo Pareschi, Bent Thomsen

    Pages 182-198

15. A general framework for modular implementations of modular system specifications

    • Michel Bidoit, Rolf Hennicker

    Pages 199-214

16. Specifications can make programs run faster

    • Mark T. Vandevoorde

    Pages 215-229

17. Application of the composition principle to unity-like specifications

    • Pierre Collette

    Pages 230-242

18. Trees, ordinals and termination

    • Nachum Dershowitz

    Pages 243-250

19. When is a functional tree transduction deterministic?

    • Helmut Seidl

    Pages 251-265

20. Automata on infinite trees with counting constraints

    • Danièle Beauquier, Damian Niwiński

    Pages 266-281

This volume contains the proceedings of the fourth International Joint Conference on the Theory and Practice of Software Development, TAPSOFT '93. Since the first in 1985, the aim of these conferences has been to bring together theoretical computer scientists and researchers in software engineering with a view to discussing how formal methods can usefully be applied in software development. TAPSOFT '93 consists ofthree parts: an advanced seminar, the Colloquium on Trees in Algebra and Programming (CAAP), and the Colloquium on Formal Approaches of Software Engineering (FASE). The advanced seminar includes four invited surveys and four invited conferences. The selected papers for CAAP are organized in seven sessions: specifications and proofs, concurrency, automata and counting, constraints solving, rewriting, logic and trees, analysis of algorithms, and a common session with FASE on type inference. The selected papers for FASE are presented in eight sessions: case studies in formal design and development, compositionality modules and development, formal development, foundations and analysis of formal specifications, verification of concurrent systems, model checking, parallel calculus, and a common session with CAAP on type inference.

• Automat
• algorithm
• algorithms
• automata
• design
• formal method
• formal specification
• logic
• model checking
• programming
• software engineering
• verification
• algorithm analysis and problem complexity

Policies and ethics