Conferences in DBLP
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 ] Hartmut Ehrig , Bernd Mahr Future Trends of TAPSOFT. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:6-10 [Conf ] Maurice Nivat New Challenges for Theoretical Computer Science. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:11-14 [Conf ] Donald Sannella What Does the Future Hold for Theoretical Computer Science? [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:15-19 [Conf ] Wolfgang Thomas Automata Theory on Trees and Partial Orders. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:20-38 [Conf ] Frits W. Vaandrager A Theory of Testing for Timed Automata (Abstract). [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:39- [Conf ] T. S. E. Maibaum Conservative Extensions, Interpretations Between Theories and All That! [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:40-66 [Conf ] 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 ] Egidio Astesiano , Gianna Reggio Formalism and Method. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:93-114 [Conf ] Peter D. Mosses CoFI: The Common Framework Initiative for Algebraic Specification and Development. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:115-137 [Conf ] 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 ] Bruno Salinier , Robert Strandh Simulating Forward-Branching Systems with Constructor Systems. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:153-164 [Conf ] Iabelle Biermann , Brigitte Rozoy Reliable Generalized and Context Dependent Commutation Relations. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:165-176 [Conf ] Yves Andre , Francis Bossut Word-into-Tree Transducers with Bounded Difference. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:177-188 [Conf ] 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 ] 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 ] Jean-Michel Ilié , Khalil Ajami Model Checking Through Symbolic Reachability Graph. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:213-224 [Conf ] Eric Goubault Optimal Implementation of Wait-Free Binary Relations. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:225-236 [Conf ] 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 ] Thomas Genet , Isabelle Gnaedig Termination Proofs Using gpo Ordering Constraints. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:249-260 [Conf ] Thomas Arts , Jürgen Giesl Automatically Proving Termination Where Simplification Orderings Fail. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:261-272 [Conf ] Jonathan C. Martin , Andy King Generating Efficient, Terminating Logic Programs. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:273-284 [Conf ] 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 ] Irek Ulidowski , Iain Phillips Formats of Ordered SOS Rules with Silent Actions. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:297-308 [Conf ] Marina Lenisa A Uniform Syntactical Method for Proving Coinduction Principles in Lambda-Calculi. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:309-320 [Conf ] Franck van Breugel A Labelled Transition Systems for pi-epsilon-Calculus. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:321-332 [Conf ] Ali Amaniss , Miki Hermann , Denis Lugiez Set Operations for Recurrent Term Schematizations. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:333-344 [Conf ] 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 ] Franck Seynhaeve , Marc Tommasi , Ralf Treinen Grid Structure and Undecidable Constraint Theories. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:357-368 [Conf ] Daniel Leivant , Jean-Yves Marion Predicative Functional Recurrence and Poly-space. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:369-380 [Conf ] 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 ] Tomas Kovacs , Andrzej Lingas Maximum Packing for Biconnected Outerplanar Graphs. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:393-404 [Conf ] 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 ] Sabrina Mantaci , Daniele Micciancio An Algorithm for the Solution of Tree Equations. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:417-428 [Conf ] 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 ] Aleksy Schubert Linear Interpolation for the Higher-Order Matching Problem. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:441-452 [Conf ] 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 ] 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 ] 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 ] Chuck Liang Let-Polymorphism and Eager Type Schemes. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:490-501 [Conf ] José Luiz Fiadeiro , Antónia Lopes Semantics of Architectural Connectors. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:505-519 [Conf ] Gary T. Leavens , Jeannette M. Wing Protective Interface Specifications. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:520-534 [Conf ] Wolfgang May Specifying Complex and Structured Systems with Evolving Algebras. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:535-549 [Conf ] 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 ] 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 ] Olaf Müller , Tobias Nipkow Traces of I/O-Automata in Isabelle/HOLCF. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:580-594 [Conf ] Jean-Pierre Talpin Reactive Types. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:595-606 [Conf ] Dennis M. Volpano , Geoffrey Smith A Type-Based Approach to Program Security. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:607-621 [Conf ] Judicaël Courant An Applicative Module Calculus. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:622-636 [Conf ] Jan Phillips , Peter Scholz Compositional Specification of Embedded Systems with Statecharts. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:637-651 [Conf ] Vladimir Levin , Doron Peled Verification of Message Sequence Charts via Template Matching. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:652-666 [Conf ] S. Purushothaman Iyer , Murali Narasimha Probabilistic Lossy Channel Systems. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:667-681 [Conf ] Martín Abadi , K. Rustan M. Leino A Logic of Object-Oriented Programs. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:682-696 [Conf ] Thomas Schreiber Auxiliary Variables and Recursive Procedures. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:697-711 [Conf ] 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 ] Luc Moreau A Syntactic Theory of Dynamic Binding. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:727-741 [Conf ] Peter Thiemann A Unified Framework for Binding-Time Analysis. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:742-756 [Conf ] 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 ] Arend Rensink , Roberto Gorrieri Action Refinement as an Implementation Relations. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:772-786 [Conf ] Bart Jacobs Behaviour-Refinement of Coalgebraic Specifications with Coinductive Correctness Proofs. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:787-802 [Conf ] Staffan Bonnier , Tim Heyer COMPASS: A Comprehensible Assertion Method. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:803-817 [Conf ] Maritta Heisel , Nicole Lévy Using LOTOS Patterns to Characterize Architectural Styles. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:818-832 [Conf ] Michael R. Donat Automating Formal Specification-Based Testing. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:833-847 [Conf ] 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 ] 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 ] Wolfgang Reif , Gerhard Schellhorn , Kurt Stenzel Proving System Correctness with KIV. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1997, pp:859-862 [Conf ] 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 ] 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 ] 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 ] 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 ] 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 ]