TAPSOFT

Keyphrases

Publications

1997

Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema
Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules. TAPSOFT (1997)
Friedrich W. von Henke, Marko Luther, Martin Strecker
Typelab: An Environment for Modular Program Development. TAPSOFT (1997)
Sabrina Mantaci, Daniele Micciancio
An Algorithm for the Solution of Tree Equations. TAPSOFT (1997)
Eric Goubault
Optimal Implementation of Wait-Free Binary Relations. TAPSOFT (1997)
Martín Abadi, K. Rustan M. Leino
A Logic of Object-Oriented Programs. TAPSOFT (1997)
Daniel Leivant, Jean-Yves Marion
Predicative Functional Recurrence and Poly-space. TAPSOFT (1997)
Puri Arenas-Sánchez, Mario Rodríguez-Artalejo
A Semantic Framework for Functional Logic Programming with Algebraic Polymorphic Types. TAPSOFT (1997)
Adel Bouhoula, Jean-Pierre Jouannaud, José Meseguer
Specification and Proof in Membership Equational Logic. TAPSOFT (1997)
Kåre J. Kristoffersen, François Laroussinie, Kim Guldstrand Larsen, Paul Pettersson, Wang Yi
A Compositional Proof of a Real-Time Mutual Exclusion Protocol. TAPSOFT (1997)
Thomas Schreiber
Auxiliary Variables and Recursive Procedures. TAPSOFT (1997)
Judicaël Courant
An Applicative Module Calculus. TAPSOFT (1997)
Franck van Breugel
A Labelled Transition Systems for pi-epsilon-Calculus. TAPSOFT (1997)
Jan Phillips, Peter Scholz
Compositional Specification of Embedded Systems with Statecharts. TAPSOFT (1997)
Wolfgang Thomas
Automata Theory on Trees and Partial Orders. TAPSOFT (1997)
Lubos Mikusiak, Miroslav Adámy, Thomas Seidmann
Publishing Formal Specifications in Z Notation on World Wide Web. TAPSOFT (1997)
Jonathan C. Martin, Andy King
Generating Efficient, Terminating Logic Programs. TAPSOFT (1997)
J. B. Wells, Allyn Dimock, Robert Muller, Franklyn A. Turbak
A Typed Intermediate Language for Flow-Directed Compilation. TAPSOFT (1997)
Klaus Didrich, Torsten Klein
DOSFOP - A Documentation Tool for the Algebraic Programming Language OPAL. TAPSOFT (1997)
E. Allen Emerson, Richard J. Trefler
Generalized Quantitative Temporal Reasoning: An Automata Theoretic Approach. TAPSOFT (1997)
Dennis M. Volpano, Geoffrey Smith
A Type-Based Approach to Program Security. TAPSOFT (1997)
Salvatore La Torre, Margherita Napoli, Mimmo Parente
Synchronization of a Line of Identical Processors at a Given Time. TAPSOFT (1997)
Frédéric Voisin
A new Proof-Manager and Graphic Interface for the Larch Prover. TAPSOFT (1997)
Donald Sannella
What Does the Future Hold for Theoretical Computer Science? TAPSOFT (1997)
Pascal Caron
AG: A Set of Maple Packages for Symbolic Computing of Automata and Semigroups. TAPSOFT (1997)
Iabelle Biermann, Brigitte Rozoy
Reliable Generalized and Context Dependent Commutation Relations. TAPSOFT (1997)
T. S. E. Maibaum
Conservative Extensions, Interpretations Between Theories and All That! TAPSOFT (1997)
Corrado Böhm
Theoretical Computer Science and Software Science: The Past, the Present and the Future (Position Paper). TAPSOFT (1997)
Chuck C. Liang
Let-Polymorphism and Eager Type Schemes. TAPSOFT (1997)
Henrik Reif Andersen, Jørgen Staunstrup, Niels Maretti
A Comparison of Modular Verification Techniques. TAPSOFT (1997)
Yves Andre, Francis Bossut
Word-into-Tree Transducers with Bounded Difference. TAPSOFT (1997)
Hartmut Ehrig, Bernd Mahr
Future Trends of TAPSOFT. TAPSOFT (1997)
Michael Baldamus, Jürgen Dingel
Modal Characterization of Weak Bisimulation for Higher-order Processes (Extended Abstract). TAPSOFT (1997)
Olaf Müller, Tobias Nipkow
Traces of I/O-Automata in Isabelle/HOLCF. TAPSOFT (1997)
Gary T. Leavens, Jeannette M. Wing
Protective Interface Specifications. TAPSOFT (1997)
Staffan Bonnier, Tim Heyer
COMPASS: A Comprehensible Assertion Method. TAPSOFT (1997)
Jean-Pierre Talpin
Reactive Types. TAPSOFT (1997)
Wolfgang Reif, Gerhard Schellhorn, Kurt Stenzel
Proving System Correctness with KIV. TAPSOFT (1997)
José Luiz Fiadeiro, Antónia Lopes
Semantics of Architectural Connectors. TAPSOFT (1997)
S. Purushothaman Iyer, Murali Narasimha
Probabilistic Lossy Channel Systems. TAPSOFT (1997)
Robert Muth, Saumya K. Debray
On the Complexity of Function Pointer May-Alias Analysis. TAPSOFT (1997)
Aleksy Schubert
Linear Interpolation for the Higher-Order Matching Problem. TAPSOFT (1997)
Fabio Alessi, Paolo Baldan, Furio Honsell
Partializing Stone Spaces using SFP Domains (Extended Abstract). TAPSOFT (1997)
Mark Richters, Martin Gogolla
A Web-based Animator for Object Specifications in a Persistent Environment. TAPSOFT (1997)
Tomas Kovacs, Andrzej Lingas
Maximum Packing for Biconnected Outerplanar Graphs. TAPSOFT (1997)
Wolfgang May
Specifying Complex and Structured Systems with Evolving Algebras. TAPSOFT (1997)
Rocco De Nicola, Gian Luigi Ferrari, Rosario Pugliese
Locality Based Linda: Programming with Explicit Localities. TAPSOFT (1997)
Michael R. Donat
Automating Formal Specification-Based Testing. TAPSOFT (1997)
Sébastien Limet, Pierre Réty
E-Unification by Means of Tree Tuple Synchronized Grammars. TAPSOFT (1997)
Marina Lenisa
A Uniform Syntactical Method for Proving Coinduction Principles in Lambda-Calculi. TAPSOFT (1997)

volume 1214, 1997

TAPSOFT'97: Theory and Practice of Software Development, 7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997, Proceedings TAPSOFT 1214 (1997)