+612 9045 4394
TAPSOFT '97 - Theory and Practice of Software Development : 7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997, Proceedings :  7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997, Proceedings - Michel Bidoit

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

7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997, Proceedings

By: Michel Bidoit (Editor), Max Dauchet (Editor)

Paperback Published: May 1997
ISBN: 9783540627814
Number Of Pages: 892

Share This Book:


or 4 easy payments of $51.04 with Learn more
Ships in 5 to 9 business days

This book constitutes the refereed proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development (TAPSOFT'97), held in Lille, France, in April 1997.The volume is organized in three parts: The first presents invited contributions, the second is devoted to trees in algebra in programming (CAAP) and the third to formal approaches in software engineering (FASE). The 30 revised full papers presented in the CAAP section were selected from 77 submissions; the 23 revised full papers presented in the FASE section were selected from 79 submissions.

Theoretical Computer Science and Software Science: The Past, the Present and the Futurep. 3
Future Trends of TAPSOFTp. 6
New Challenges for Theoretical Computer Sciencep. 11
What Does the Future Hold for Theoretical Computer Science?p. 15
Automata Theory on Trees and Partial Ordersp. 20
A Theory of Testing for Timed Automatap. 39
Conservative Extensions, Interpretations Between Theories and All Thatp. 40
Specification and Proof in Membership Equational Logicp. 67
Formalism and Methodp. 93
CoFI: The Common Framework Initiative for Algebraic Specification and Developmentp. 115
Logicality of Conditional Rewrite Systemsp. 141
Simulating Forward-Branching Systems with Constructor Systemsp. 153
Reliable Generalized and Context Dependent Commutation Relationsp. 165
Word-into-Trees Transducers with Bounded Differencep. 177
Generalized Quantitative Temporal Reasoning: An Automata-Theoretic Approachp. 189
The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model-Checking in High-Level Languagesp. 201
Model Checking Through Symbolic Reachability Graphp. 213
Optimal Implementation of Wait-Free Binary Relationsp. 225
Relative Undecidability in the Termination Hierarchy of Single Rewrite Rulesp. 237
Termination Proofs Using gpo Ordering Constraintsp. 249
Automatically Proving Termination Where Simplification Orderings Failp. 261
Generating Efficient, Terminating Logic Programsp. 273
Modal Characterization of Weak Bisimulation for Higher-Order Processesp. 285
Formats of Ordered SOS Rules with Silent Actionsp. 297
A Uniform Syntactical Method for Proving Coinduction Principles in Lambda-calculip. 309
A Labelled Transition Systems for pi-epsilon-Calculusp. 321
Set Operations for Recurrent Term Schematizationsp. 333
Inclusion Constraints over Non-empty Sets of Treesp. 345
Grid Structures and Undecidable Constraint Theoriesp. 357
Predicative Functional Recurrence and Poly-spacep. 369
On the Complexity of Function Pointer May-Alias Analysisp. 381
Maximum Packing for Biconnected Outerplanar Graphsp. 393
Synchronization of a Line of Identical Processors at a Given Timep. 405
An Algorithm for the Solution of Tree Equationsp. 417
E-unification by Means of Tree Tuple Synchronized Grammarsp. 429
Linear Interpolation for the Higher-Order Matching Problemp. 441
A Semantic Framework for Functional Logic Programming with Algebraic Polymorphic Typesp. 453
Subtyping Constraints for Incomplete Objectsp. 465
Partializing Stone Spaces Using SFP Domainsp. 478
Let-Polymorphism and Eager Type Schemesp. 490
Semantics of Architectural Connectorsp. 505
Protective Interface Specificationsp. 520
Specifying Complex and Structured Systems with Evolving Algebrasp. 535
A Comparison of Modular Verification Techniquesp. 550
A Compositional Proof of a Real-Time Mutual Exclusion Protocolp. 565
Traces of I/O-Automata in Isabelle/HOLCFp. 580
Reactive Typesp. 595
A Type-Based Approach to Program Securityp. 607
An Applicative Module Calculusp. 622
Compositional Specification of Embedded Systems with Statechartsp. 637
Verification of Message Sequence Charts via Template Matchingp. 652
Probabilistic Lossy Channel Systemsp. 667
A Logic of Object-Oriented Programsp. 682
Auxiliary Variables and Recursive Proceduresp. 697
Locality Based Linda: Programming with Explicit Localitiesp. 712
A Syntactic Theory of Dynamic Bindingp. 727
A Unified Framework for Binding-Time Analysisp. 742
A Typed Intermediate Language for Flow-Directed Compilationp. 757
Action Refinement as an Implementation Relationp. 772
Behaviour-Refinement of Coalgebraic Specifications with Conductive Correctness Proofsp. 787
COMPASS: A Comprehensible Assertion Methodp. 803
Using LOTOS Patterns to Characterize Architectural Stylesp. 818
Automating Formal Specification-Based Testingp. 833
Typelab: An Environment for Modular Program Developmentp. 851
TAS and IsaWin: Generic Interfaces for Transformational Program Development and Theorem Provingp. 855
Proving System Correctness with KIVp. 859
A New Proof-Manager and Graphic Interface for the Larch Proverp. 863
A Web-Based Animator for Object Specifications in a Persistent Environmentp. 867
Publishing Formal Specifications in Z Notation on World Wide Webp. 871
DOSFOP - A Documentation Tool for the Algebraic Programming Language Opalp. 875
AG: A Set of Maple Packages for Symbolic Computing of Automata and Semigroupsp. 879
Author Indexp. 883
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9783540627814
ISBN-10: 3540627812
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English
Number Of Pages: 892
Published: May 1997
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 4.55
Weight (kg): 1.25