- Bart Jacobs:
Behaviour-Refinement of Coalgebraic Specifications with Coinductive Correctness Proofs. TAPSOFT 1997: 787-802 - Kolyang, Christoph Lüth, Thomas Meyer, Burkhart Wolff:
TAS and IsaWin: Generic Interfaces for Transformational Program Development and Theorem Proving. TAPSOFT 1997: 855-858 - Tomas Kovacs, Andrzej Lingas:
Maximum Packing for Biconnected Outerplanar Graphs. TAPSOFT 1997: 393-404 - 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: 565-579 - Gary T. Leavens, Jeannette M. Wing:
Protective Interface Specifications. TAPSOFT 1997: 520-534 - Daniel Leivant, Jean-Yves Marion:
Predicative Functional Recurrence and Poly-space. TAPSOFT 1997: 369-380 - Marina Lenisa:
A Uniform Syntactical Method for Proving Coinduction Principles in Lambda-Calculi. TAPSOFT 1997: 309-320 - Vladimir Levin, Doron A. Peled:
Verification of Message Sequence Charts via Template Matching. TAPSOFT 1997: 652-666 - Chuck C. Liang:
Let-Polymorphism and Eager Type Schemes. TAPSOFT 1997: 490-501 - Sébastien Limet, Pierre Réty:
E-Unification by Means of Tree Tuple Synchronized Grammars. TAPSOFT 1997: 429-440 - T. S. E. Maibaum:
Conservative Extensions, Interpretations Between Theories and All That! TAPSOFT 1997: 40-66 - Sabrina Mantaci, Daniele Micciancio:
An Algorithm for the Solution of Tree Equations. TAPSOFT 1997: 417-428 - Jonathan C. Martin, Andy King:
Generating Efficient, Terminating Logic Programs. TAPSOFT 1997: 273-284 - Wolfgang May:
Specifying Complex and Structured Systems with Evolving Algebras. TAPSOFT 1997: 535-549 - Lubos Mikusiak, Miroslav Adámy, Thomas Seidmann:
Publishing Formal Specifications in Z Notation on World Wide Web. TAPSOFT 1997: 871-874 - Luc Moreau:
A Syntactic Theory of Dynamic Binding. TAPSOFT 1997: 727-741 - Peter D. Mosses:
CoFI: The Common Framework Initiative for Algebraic Specification and Development. TAPSOFT 1997: 115-137 - Olaf Müller, Tobias Nipkow:
Traces of I/O-Automata in Isabelle/HOLCF. TAPSOFT 1997: 580-594 - Martin Müller, Joachim Niehren, Andreas Podelski:
Inclusion Constraints over Non-empty Sets of Trees. TAPSOFT 1997: 345-356 - Robert Muth, Saumya K. Debray:
On the Complexity of Function Pointer May-Alias Analysis. TAPSOFT 1997: 381-392 - Rocco De Nicola, Gian-Luigi Ferrari, Rosario Pugliese:
Locality Based Linda: Programming with Explicit Localities. TAPSOFT 1997: 712-726 - Maurice Nivat:
New Challenges for Theoretical Computer Science. TAPSOFT 1997: 11-14 - Jan Phillips, Peter Scholz:
Compositional Specification of Embedded Systems with Statecharts. TAPSOFT 1997: 637-651 - Wolfgang Reif, Gerhard Schellhorn, Kurt Stenzel:
Proving System Correctness with KIV. TAPSOFT 1997: 859-862 - Arend Rensink, Roberto Gorrieri:
Action Refinement as an Implementation Relations. TAPSOFT 1997: 772-786 - Mark Richters, Martin Gogolla:
A Web-based Animator for Object Specifications in a Persistent Environment. TAPSOFT 1997: 867-870 - Bruno Salinier, Robert Strandh:
Simulating Forward-Branching Systems with Constructor Systems. TAPSOFT 1997: 153-164 - Donald Sannella:
What Does the Future Hold for Theoretical Computer Science? TAPSOFT 1997: 15-19 - Thomas Schreiber:
Auxiliary Variables and Recursive Procedures. TAPSOFT 1997: 697-711 - Aleksy Schubert:
Linear Interpolation for the Higher-Order Matching Problem. TAPSOFT 1997: 441-452
