The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Luca Aceto
    Full Abstraction for Series-Parallel Pomsets. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1991, pp:1-25 [Conf]
  2. Gian Luigi Ferrari
    On Causality Observed Incrementally, Finally. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1991, pp:26-41 [Conf]
  3. Marta Z. Kwiatkowska
    On the Domain of Traces and Sequential Composition. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1991, pp:42-56 [Conf]
  4. Emmanuel Kounalis, Denis Lugiez
    Compilation of Pattern Matching with Associative-Commutative Functions. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1991, pp:57-73 [Conf]
  5. Anne-Cécile Caron
    Linear Bounded Automata and Rewrite Systems: Influence of Initial Configurations on Decision Properties. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1991, pp:74-89 [Conf]
  6. P. M. van den Broek
    Algebraic Graph Rewriting Using a Single Pushout. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1991, pp:90-102 [Conf]
  7. Hubert Baumeister
    Unifying Initial and Loose Semantics of Parameterized Specifications in an Arbitrary Institution. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1991, pp:103-120 [Conf]
  8. Egidio Astesiano, Maura Cerioli
    Non-Strict Don't Care Algebras and Specifications. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1991, pp:121-142 [Conf]
  9. Zhaohui Luo
    Program Specification and Data Refinement in Type Theory. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1991, pp:143-168 [Conf]
  10. Philippe Granger
    Static Analysis of Linear Congruence Equalities among Variables of a Program. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1991, pp:169-192 [Conf]
  11. Fabrizio Luccio, Linda Pagli
    Simple Solutions for Approximate Tree Matching Problems. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1991, pp:193-201 [Conf]
  12. Pekka Kilpeläinen, Heikki Mannila
    The Tree Inclusion Problem. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1991, pp:202-214 [Conf]
  13. Stefano Kasangian, Sebastiano Vigna
    Introducing a Calculus of Trees. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1991, pp:215-240 [Conf]
  14. Roberto M. Amadio
    Domains in a Realizability Framework. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1991, pp:241-263 [Conf]
  15. Stephen L. Bloom, Zoltán Ésik
    Iteration Algebras (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1991, pp:264-274 [Conf]
  16. Andrea Corradini, Francesca Rossi, Francesco Parisi-Presicce
    Logic Programming as Hypergraph Rewriting. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1991, pp:275-295 [Conf]
  17. Frank S. de Boer, Catuscia Palamidessi
    A Fully Abstract Model for Concurrent Constraint Programming. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1991, pp:296-319 [Conf]
  18. Maurizio Gabbrielli, Giorgio Levi
    A Solved Form Algorithm for Ask and Tell Herbrand Constraints. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1991, pp:320-337 [Conf]
  19. K. V. S. Prasad
    A Calculus of Broadcasting Systems. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1991, pp:338-358 [Conf]
  20. Elie Najm, Jean-Bernard Stefani
    Object-Based Concurrency: A Process Calculus Analysis. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1991, pp:359-380 [Conf]
  21. Bengt Jonsson, Kim Guldstrand Larsen
    On the Complexity of Equation Solving in Process Algebra. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1991, pp:381-396 [Conf]
  22. Franck van Breugel
    Comparative Semantics for a Real-Time Programming Language with Integration. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1991, pp:397-411 [Conf]
  23. Yolanda Ortega-Mallén, David de Frutos-Escrig
    A Complete Proof System for Timed Observations. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1991, pp:412-440 [Conf]
  24. Michael I. Schwartzbach
    Type Inference with Inequalities. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1991, pp:441-455 [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