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