default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2. TAPSOFT 1987: Pisa, Italy
- Hartmut Ehrig, Robert A. Kowalski, Giorgio Levi, Ugo Montanari:
TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 23-27, 1987, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming (CAAP'87). Lecture Notes in Computer Science 249, Springer 1987, ISBN 3-540-17660-8
Algorithms (CAAP Session 1)
- Ingo Wegener:
On the Complexity of Branching Programs and Decision Trees for Clique Functions. 1-12 - Wojciech Szpankowski:
Average Complexity of Additive Properties for Multiway Tries: A Unified Approach (Extended Abstract). 13-25 - Maxime Crochemore:
Longest Common Factor of Two Words. 26-36
Proving Techniques (CAAP Session 2)
- Simona Ronchi Della Rocca:
An Unification Semi-Algorithm for Intersection Type Schemes. 37-51 - Bernhard Steffen:
Optimal Run Time Optimization Proved by a New Look at Abstract Interpretation. 52-68 - Françoise Bellegarde, Pierre Lescanne:
Transformation Ordering. 69-80
Algebraic Specifications I (CAAP Session 3)
- Martin Gogolla:
On Parametric Algebraic Specifications with Clean Error Handling. 81-95 - Donald Sannella
, Andrzej Tarlecki:
Toward Formal Development of Programs from Algebraic Specifications: Implementations Revisited (Extended Abstract). 96-110 - Gabriele Marongiu, Sauro Tulipani:
Finite Algebraic Specifications of Semicomputable Data Types. 111-122
Concurrency (CAAP Session 4)
- Gérard Boudol, Ilaria Castellani:
On the Semantics of Concurrency: Partial Orders and Transition Systems. 123-137 - Rocco De Nicola, Matthew Hennessy:
CCS without tau's. 138-152 - Philippe Darondeau, B. Gamatie:
A Fullt Observational Model for Infinite Behaviours of Communicating Systems. 153-168
AS Session 4
- Egidio Astesiano, Gianna Reggio:
SMoLCS-Driven Concurrent Calculi. 169-201
Algebraic Specifications II (CAAP Session 5)
- Marisa Navarro, Fernando Orejas:
Parameterized Horn Clause Specifications: Proof Theory and Correctness. 202-216 - Francesco Parisi-Presicce:
Partial Composition and Recursion of Module Specifications. 217-231
Foundations (CAAP Session 6)
- Giorgio Gambosi, Jaroslav Nesetril, Maurizio Talamo:
Efficient Representation of Taxonomies. 232-240 - John-Jules Ch. Meyer, Erik P. de Vink:
Applications of Compactness in the Smyth Powerdomain of Streams (Extended Abstract). 241-255 - Michael C. Browne, Edmund M. Clarke, Orna Grumberg:
Characterizing Kripke Structures in Temporal Logic. 256-270
AS Session 5
- Robin Milner:
Dialogue with a Proof System. 271-275 - Gérard P. Huet:
Induction Principles Formalized in the Calculus of Constructions. 276-286
AS Session 2
- James W. Thatcher:
Algebraic Semantics (Abstract). 287
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-27 20:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
