The SCEAS System
Navigation Menu

Conferences in DBLP

TAPSOFT (tapsoft)
1997 (conf/tapsoft/1997)

  1. Corrado Böhm
    Theoretical Computer Science and Software Science: The Past, the Present and the Future (Position Paper). [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:3-5 [Conf]
  2. Hartmut Ehrig, Bernd Mahr
    Future Trends of TAPSOFT. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:6-10 [Conf]
  3. Maurice Nivat
    New Challenges for Theoretical Computer Science. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:11-14 [Conf]
  4. Donald Sannella
    What Does the Future Hold for Theoretical Computer Science? [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:15-19 [Conf]
  5. Wolfgang Thomas
    Automata Theory on Trees and Partial Orders. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:20-38 [Conf]
  6. Frits W. Vaandrager
    A Theory of Testing for Timed Automata (Abstract). [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:39- [Conf]
  7. T. S. E. Maibaum
    Conservative Extensions, Interpretations Between Theories and All That! [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:40-66 [Conf]
  8. Adel Bouhoula, Jean-Pierre Jouannaud, José Meseguer
    Specification and Proof in Membership Equational Logic. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:67-92 [Conf]
  9. Egidio Astesiano, Gianna Reggio
    Formalism and Method. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:93-114 [Conf]
  10. Peter D. Mosses
    CoFI: The Common Framework Initiative for Algebraic Specification and Development. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:115-137 [Conf]
  11. Toshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz, Aart Middeldorp
    Logicality of Conditional Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:141-152 [Conf]
  12. Bruno Salinier, Robert Strandh
    Simulating Forward-Branching Systems with Constructor Systems. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:153-164 [Conf]
  13. Iabelle Biermann, Brigitte Rozoy
    Reliable Generalized and Context Dependent Commutation Relations. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:165-176 [Conf]
  14. Yves Andre, Francis Bossut
    Word-into-Tree Transducers with Bounded Difference. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:177-188 [Conf]
  15. E. Allen Emerson, Richard J. Trefler
    Generalized Quantitative Temporal Reasoning: An Automata Theoretic Approach. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:189-200 [Conf]
  16. Danièle Beauquier, Anatol Slissenko
    The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:201-212 [Conf]
  17. Jean-Michel Ilié, Khalil Ajami
    Model Checking Through Symbolic Reachability Graph. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:213-224 [Conf]
  18. Eric Goubault
    Optimal Implementation of Wait-Free Binary Relations. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:225-236 [Conf]
  19. Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema
    Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:237-248 [Conf]
  20. Thomas Genet, Isabelle Gnaedig
    Termination Proofs Using gpo Ordering Constraints. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:249-260 [Conf]
  21. Thomas Arts, Jürgen Giesl
    Automatically Proving Termination Where Simplification Orderings Fail. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:261-272 [Conf]
  22. Jonathan C. Martin, Andy King
    Generating Efficient, Terminating Logic Programs. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:273-284 [Conf]
  23. Michael Baldamus, Jürgen Dingel
    Modal Characterization of Weak Bisimulation for Higher-order Processes (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:285-296 [Conf]
  24. Irek Ulidowski, Iain Phillips
    Formats of Ordered SOS Rules with Silent Actions. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:297-308 [Conf]
  25. Marina Lenisa
    A Uniform Syntactical Method for Proving Coinduction Principles in Lambda-Calculi. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:309-320 [Conf]
  26. Franck van Breugel
    A Labelled Transition Systems for pi-epsilon-Calculus. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:321-332 [Conf]
  27. Ali Amaniss, Miki Hermann, Denis Lugiez
    Set Operations for Recurrent Term Schematizations. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:333-344 [Conf]
  28. Martin Müller, Joachim Niehren, Andreas Podelski
    Inclusion Constraints over Non-empty Sets of Trees. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:345-356 [Conf]
  29. Franck Seynhaeve, Marc Tommasi, Ralf Treinen
    Grid Structure and Undecidable Constraint Theories. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:357-368 [Conf]
  30. Daniel Leivant, Jean-Yves Marion
    Predicative Functional Recurrence and Poly-space. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:369-380 [Conf]
  31. Robert Muth, Saumya K. Debray
    On the Complexity of Function Pointer May-Alias Analysis. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:381-392 [Conf]
  32. Tomas Kovacs, Andrzej Lingas
    Maximum Packing for Biconnected Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:393-404 [Conf]
  33. Salvatore La Torre, Margherita Napoli, Mimmo Parente
    Synchronization of a Line of Identical Processors at a Given Time. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:405-416 [Conf]
  34. Sabrina Mantaci, Daniele Micciancio
    An Algorithm for the Solution of Tree Equations. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:417-428 [Conf]
  35. Sébastien Limet, Pierre Réty
    E-Unification by Means of Tree Tuple Synchronized Grammars. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:429-440 [Conf]
  36. Aleksy Schubert
    Linear Interpolation for the Higher-Order Matching Problem. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:441-452 [Conf]
  37. Puri Arenas-Sánchez, Mario Rodríguez-Artalejo
    A Semantic Framework for Functional Logic Programming with Algebraic Polymorphic Types. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:453-464 [Conf]
  38. Viviana Bono, Michele Bugliesi, Mariangiola Dezani-Ciancaglini, Luigi Liquori
    Subtyping Constraints for Incomplete Objects (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:465-477 [Conf]
  39. Fabio Alessi, Paolo Baldan, Furio Honsell
    Partializing Stone Spaces using SFP Domains (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:478-489 [Conf]
  40. Chuck Liang
    Let-Polymorphism and Eager Type Schemes. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:490-501 [Conf]
  41. José Luiz Fiadeiro, Antónia Lopes
    Semantics of Architectural Connectors. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:505-519 [Conf]
  42. Gary T. Leavens, Jeannette M. Wing
    Protective Interface Specifications. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:520-534 [Conf]
  43. Wolfgang May
    Specifying Complex and Structured Systems with Evolving Algebras. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:535-549 [Conf]
  44. Henrik Reif Andersen, Jørgen Staunstrup, Niels Maretti
    A Comparison of Modular Verification Techniques. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:550-564 [Conf]
  45. Kåre J. Kristoffersen, François Laroussinie, Kim Guldstrand Larsen, Paul Pettersson, Wang Yi
    A Compositional Proof of a Real-Time Mutual Exclusion Protocol. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:565-579 [Conf]
  46. Olaf Müller, Tobias Nipkow
    Traces of I/O-Automata in Isabelle/HOLCF. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:580-594 [Conf]
  47. Jean-Pierre Talpin
    Reactive Types. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:595-606 [Conf]
  48. Dennis M. Volpano, Geoffrey Smith
    A Type-Based Approach to Program Security. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:607-621 [Conf]
  49. Judicaël Courant
    An Applicative Module Calculus. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:622-636 [Conf]
  50. Jan Phillips, Peter Scholz
    Compositional Specification of Embedded Systems with Statecharts. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:637-651 [Conf]
  51. Vladimir Levin, Doron Peled
    Verification of Message Sequence Charts via Template Matching. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:652-666 [Conf]
  52. S. Purushothaman Iyer, Murali Narasimha
    Probabilistic Lossy Channel Systems. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:667-681 [Conf]
  53. Martín Abadi, K. Rustan M. Leino
    A Logic of Object-Oriented Programs. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:682-696 [Conf]
  54. Thomas Schreiber
    Auxiliary Variables and Recursive Procedures. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:697-711 [Conf]
  55. Rocco De Nicola, Gian Luigi Ferrari, Rosario Pugliese
    Locality Based Linda: Programming with Explicit Localities. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:712-726 [Conf]
  56. Luc Moreau
    A Syntactic Theory of Dynamic Binding. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:727-741 [Conf]
  57. Peter Thiemann
    A Unified Framework for Binding-Time Analysis. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:742-756 [Conf]
  58. J. B. Wells, Allyn Dimock, Robert Muller, Franklyn A. Turbak
    A Typed Intermediate Language for Flow-Directed Compilation. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:757-771 [Conf]
  59. Arend Rensink, Roberto Gorrieri
    Action Refinement as an Implementation Relations. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:772-786 [Conf]
  60. Bart Jacobs
    Behaviour-Refinement of Coalgebraic Specifications with Coinductive Correctness Proofs. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:787-802 [Conf]
  61. Staffan Bonnier, Tim Heyer
    COMPASS: A Comprehensible Assertion Method. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:803-817 [Conf]
  62. Maritta Heisel, Nicole Lévy
    Using LOTOS Patterns to Characterize Architectural Styles. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:818-832 [Conf]
  63. Michael R. Donat
    Automating Formal Specification-Based Testing. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:833-847 [Conf]
  64. Friedrich W. von Henke, Marko Luther, Martin Strecker
    Typelab: An Environment for Modular Program Development. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:851-854 [Conf]
  65. Kolyang, Christoph Lüth, Thomas Meyer, Burkhart Wolff
    TAS and IsaWin: Generic Interfaces for Transformational Program Development and Theorem Proving. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:855-858 [Conf]
  66. Wolfgang Reif, Gerhard Schellhorn, Kurt Stenzel
    Proving System Correctness with KIV. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:859-862 [Conf]
  67. Frédéric Voisin
    A new Proof-Manager and Graphic Interface for the Larch Prover. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:863-866 [Conf]
  68. Mark Richters, Martin Gogolla
    A Web-based Animator for Object Specifications in a Persistent Environment. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:867-870 [Conf]
  69. Lubos Mikusiak, Miroslav Adámy, Thomas Seidmann
    Publishing Formal Specifications in Z Notation on World Wide Web. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:871-874 [Conf]
  70. Klaus Didrich, Torsten Klein
    DOSFOP - A Documentation Tool for the Algebraic Programming Language OPAL. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:875-878 [Conf]
  71. Pascal Caron
    AG: A Set of Maple Packages for Symbolic Computing of Automata and Semigroups. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:879-882 [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