The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. C. A. R. Hoare
    The Varieties of Programming Language. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:1-18 [Conf]
  2. Jean-Louis Lassez, Ken McAloon
    Independence of Negative Constraints. [Citation Graph (1, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:19-27 [Conf]
  3. Pierre Lescanne
    Completion Procedures as Transition Rules + Control. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:28-41 [Conf]
  4. Martin Wirsing, Manfred Broy
    A Modular Framework for Specification and Implementation. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:42-73 [Conf]
  5. Egidio Astesiano, Maura Cerioli
    On the Existence of Initial Models for Partial (Higher-Order) Conditional Specifications. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:74-88 [Conf]
  6. Eric Badouel
    Terms and Infinite Trees as Monads Over a Signature. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:89-103 [Conf]
  7. Ricardo A. Baeza-Yates
    The Subsequence Graph of a Text. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:104-118 [Conf]
  8. Joffroy Beauquier, Annie Choquet, Antoine Petit, Guy Vidal-Naquet
    Syntactical Properties of Unbounded Nets of Processors. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:119-133 [Conf]
  9. Stephen L. Bloom, Klaus Sutner
    Shuffle Equations, Parallel Transition Systems and Equational Petri Nets. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:134-148 [Conf]
  10. Gérard Boudol
    Towards a Lambda-Calculus for Concurrent and Communicating Systems. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:149-161 [Conf]
  11. Antonio Brogi, Roberto Gorrieri
    A Distributed, Net Oriented Semantics for Delta Prolog. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:162-177 [Conf]
  12. Arie de Bruin, Erik P. de Vink
    Continuation Semantics for PROLOG with Cut. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:178-192 [Conf]
  13. Marie-Pierre Delest, Jean-Marc Fedou
    Labeled Trees and Relations on Generating Functions. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:193-206 [Conf]
  14. Pierre Deransart
    Proofs of Declarative Properties of Logic Programs. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:207-226 [Conf]
  15. Aline Deruyver, Rémi Gilleron
    The Reachability Problem for Ground TRS and Some Extensions. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:227-243 [Conf]
  16. Harald Ganzinger
    Order-Sorted Completion: The Many-Sorted Way (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:244-258 [Conf]
  17. Martin Gogolla
    Algebraization and Integrity Constraints for an Extended Entity-Relationship Approach. [Citation Graph (1, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:259-274 [Conf]
  18. Annegret Habel, Hans-Jörg Kreowski, Walter Vogler
    Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammar. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:275-289 [Conf]
  19. Rolf Hennicker
    Implementation of Parameterized Observational Specifications. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:290-305 [Conf]
  20. Simon M. Kaplan, Steven K. Goering
    Priority Controlled Incremental Attribute Evaluation in Attributed Graph Grammars. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:306-336 [Conf]
  21. Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi
    Semi-Constructive Formal Systems and Axiomatization of Abstract Data Types. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:337-351 [Conf]
  22. Peter Padawitz
    Inductive Proofs by Resolution and Paramodulation. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:352-368 [Conf]
  23. Colin Stirling, David Walker
    Local Model Checking in the Modal Mu-Calculus. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:369-383 [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