The SCEAS System
Navigation Menu

Conferences in DBLP

TAPSOFT (tapsoft)
1987 (conf/tapsoft/1987-1)

  1. Ingo Wegener
    On the Complexity of Branching Programs and Decision Trees for Clique Functions. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1987, pp:1-12 [Conf]
  2. Wojciech Szpankowski
    Average Complexity of Additive Properties for Multiway Tries: A Unified Approach (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1987, pp:13-25 [Conf]
  3. Maxime Crochemore
    Longest Common Factor of Two Words. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1987, pp:26-36 [Conf]
  4. Simona Ronchi Della Rocca
    An Unification Semi-Algorithm for Intersection Type Schemes. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1987, pp:37-51 [Conf]
  5. Bernhard Steffen
    Optimal Run Time Optimization Proved by a New Look at Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1987, pp:52-68 [Conf]
  6. Françoise Bellegarde, Pierre Lescanne
    Transformation Ordering. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1987, pp:69-80 [Conf]
  7. Martin Gogolla
    On Parametric Algebraic Specifications with Clean Error Handling. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1987, pp:81-95 [Conf]
  8. Donald Sannella, Andrzej Tarlecki
    Toward Formal Development of Programs from Algebraic Specifications: Implementations Revisited (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1987, pp:96-110 [Conf]
  9. Gabriele Marongiu, Sauro Tulipani
    Finite Algebraic Specifications of Semicomputable Data Types. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1987, pp:111-122 [Conf]
  10. Gérard Boudol, Ilaria Castellani
    On the Semantics of Concurrency: Partial Orders and Transition Systems. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1987, pp:123-137 [Conf]
  11. Rocco De Nicola, Matthew Hennessy
    CCS without tau's. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1987, pp:138-152 [Conf]
  12. Philippe Darondeau, B. Gamatie
    A Fullt Observational Model for Infinite Behaviours of Communicating Systems. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1987, pp:153-168 [Conf]
  13. Egidio Astesiano, Gianna Reggio
    SMoLCS-Driven Concurrent Calculi. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1987, pp:169-201 [Conf]
  14. Marisa Navarro, Fernando Orejas
    Parameterized Horn Clause Specifications: Proof Theory and Correctness. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1987, pp:202-216 [Conf]
  15. Francesco Parisi-Presicce
    Partial Composition and Recursion of Module Specifications. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1987, pp:217-231 [Conf]
  16. Giorgio Gambosi, Jaroslav Nesetril, Maurizio Talamo
    Efficient Representation of Taxonomies. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1987, pp:232-240 [Conf]
  17. John-Jules Ch. Meyer, Erik P. de Vink
    Applications of Compactness in the Smyth Powerdomain of Streams (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1987, pp:241-255 [Conf]
  18. Michael C. Browne, Edmund M. Clarke, Orna Grumberg
    Characterizing Kripke Structures in Temporal Logic. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1987, pp:256-270 [Conf]
  19. Robin Milner
    Dialogue with a Proof System. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1987, pp:271-275 [Conf]
  20. Gérard P. Huet
    Induction Principles Formalized in the Calculus of Constructions. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1987, pp:276-286 [Conf]
  21. James W. Thatcher
    Algebraic Semantics (Abstract). [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1987, pp:287- [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002