The SCEAS System
Navigation Menu

Conferences in DBLP

TAPSOFT (tapsoft)
1993 (conf/tapsoft/1993)

  1. John V. Guttag
    Goldilocks and the Three Specifications. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:1-14 [Conf]
  2. Pierpaolo Degano, Roberto Gorrieri, Sebastiano Vigna
    On Relating Some Models for Concurrency. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:15-30 [Conf]
  3. Hartmut Ehrig, Rosa M. Jiménez, Fernando Orejas
    Compositionality Results for Different Types of Parameterization and Parameter Passing in Specification Languages. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:31-45 [Conf]
  4. Klaus Becker
    Proving Ground Confluence and Inductive Validity in Constructor Based Equational Specifications. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:46-60 [Conf]
  5. Leo Bachmair, Ta Chen, I. V. Ramakrishnan
    Associative-Commutative Discrimination Nets. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:61-74 [Conf]
  6. Yves Bertrand, Jean-François Dufourd, Jean Françon, Pascal Lienhardt
    Algebraic Specification and Development in Geometric Modeling. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:75-89 [Conf]
  7. Ernst-Rüdiger Olderog, Stephan Rössig
    A Case Study in Transformational Design of Concurrent Systems. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:90-104 [Conf]
  8. Paola Inverardi, Balachander Krishnamurthy, Daniel Yankelevich
    Yeast: A Case Study for a Practical Use of Formal Methods. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:105-120 [Conf]
  9. André Arnold
    Verification and Comparison of Transition Systems. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:121-135 [Conf]
  10. Cliff B. Jones
    Constraining Inference in an Object-Based Design Model. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:136-150 [Conf]
  11. Davide Sangiorgi
    From pi-Calculus to Higher-Order pi-Calculus - and Back. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:151-166 [Conf]
  12. Gnanamalar David, Frank Drewes, Hans-Jörg Kreowski
    Hyperedge Replacement with Rendevous. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:167-181 [Conf]
  13. Jean-Marc Andreoli, Lone Leth, Remo Pareschi, Bent Thomsen
    True Concurrency Semantics for a Linear Logic Programming Language with Braodcast Communication. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:182-198 [Conf]
  14. Michel Bidoit, Rolf Hennicker
    A General Framework for Modular Implementations of Modular System Specifications. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:199-214 [Conf]
  15. Mark T. Vandevoorde
    Specifications Can Make Programs Run Faster. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:215-229 [Conf]
  16. Pierre Collette
    Application of the Composition Principle to Unity-like Specifications. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:230-242 [Conf]
  17. Nachum Dershowitz
    Trees, Ordinals and Termination. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:243-250 [Conf]
  18. Helmut Seidl
    When Is a Functional Tree Transduction Deterministic? [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:251-265 [Conf]
  19. Danièle Beauquier, Damian Niwinski
    Automata on Infinite Trees with Counting Constraints. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:266-281 [Conf]
  20. Elena Barcucci, Renzo Pinzani, Renzo Sprugnoli
    Directed Column-Convex Polyominoes by Recurrence Relations. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:282-298 [Conf]
  21. Jun Han, Jim Welsh
    Object Organisation in Software Environments for Formal Methods. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:299-313 [Conf]
  22. Françoise Bellegarde, James Hook
    Monads, Indexes and Transformations. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:314-327 [Conf]
  23. Ricardo Pena, Luis M. Alonso
    A Technique for Specifying and Refining TCSP Processes by Using Guards and Liveness Conditions. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:328-342 [Conf]
  24. Bernd Mahr
    Applications of Type Theory. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:343-355 [Conf]
  25. Joachim Niehren, Andreas Podelski
    Feature Automata and Recognizable Sets of Feature Trees. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:356-375 [Conf]
  26. Alexandre Boudet, Hubert Comon
    About the Theory of Tree Embedding. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:376-390 [Conf]
  27. Zhenyu Qian
    Linear Unification of Higher-Order Patterns. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:391-405 [Conf]
  28. Wei Li
    A Theory of Requirements Capture and Its Applications. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:406-420 [Conf]
  29. Gilles Bernot, Pascale Le Gall
    Exception Handling and Term Labelling. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:421-436 [Conf]
  30. Fosca Giannotti, Diego Latella
    Gate Splitting in LOTOS Specifications Using Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:437-452 [Conf]
  31. Hans-Dieter Ehrich, Grit Denker, Amílcar Sernadas
    Constructing Systems as Object Communities. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:453-467 [Conf]
  32. Andrea Corradini
    Term Rewriting in CT-Sigma. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:468-484 [Conf]
  33. Andrea Asperti, Cosimo Laneve
    Optimal Reductions in Interaction Systems. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:485-500 [Conf]
  34. Laurence Puel, Ascánder Suárez
    Optimal Solutions to Pattern Matching Problems. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:501-518 [Conf]
  35. Ming Yu Yao, Gregor von Bochmann
    Testing for a Conformance Relation Based on Acceptance. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:519-528 [Conf]
  36. Khalil Drira, Pierre Azéma, B. Soulas, A. M. Chemali
    Testability of a Communicating System Through an Environment. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:529-543 [Conf]
  37. Carron Kirkwood
    Automating (Specififation = Implementation) Using Equational Reasoning and LOTOS. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:544-558 [Conf]
  38. Wolfgang Thomas
    On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:559-568 [Conf]
  39. Jerzy Tyszkiewicz
    On Asymptotic Probabilities in Logics That Capture DSPACE(log n) in Presence of Ordering. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:569-583 [Conf]
  40. Mohsin Ahmed, G. Venkatesh
    A Propositional Dense Time Logic (Based on Nested Sequences). [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:584-598 [Conf]
  41. J. Bétréma, A. K. Zvonkin
    La Vraie Forme d'un Arbre. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:599-612 [Conf]
  42. Javier Esparza
    Model Checking Using Net Unfoldings. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:613-628 [Conf]
  43. Claire Diehl, Claude Jard, Jean-Xavier Rampon
    Reachability Analysis on Distributed Executions. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:629-643 [Conf]
  44. Susanne Graf, Claire Loiseaux
    Property Preserving Abstractions under Parallel Composition. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:644-657 [Conf]
  45. Giuseppe Longo
    Types as Parameters. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:658-670 [Conf]
  46. Geoffrey Smith
    Polymorphic Type Inference with Overloading and Subtyping. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:671-685 [Conf]
  47. Jerzy Tiuryn, Mitchell Wand
    Type Reconstruction with Recursive Types and Atomic Subtyping. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:686-701 [Conf]
  48. Uwe Trier
    (Un)expected Path Lengths of Asymmetric Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:702-716 [Conf]
  49. Guy Louchard
    Trie Size in a Dynamic List Structure. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:717-731 [Conf]
  50. Diego Latella, Paola Quaglia
    A Fully Parallel Calculus of Synchronizing Processes. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:732-745 [Conf]
  51. E. Pascal Gribomont, Vincent Van Dongen
    Generic Systolic Arrays: A Methodology for Systolic Design. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:746-761 [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