Marie-Claude Gaudel, Jean-Pierre Jouannaud
Proceedings of the Fifth International Joint Conference on Theory and Practice of Software Development
TAPSOFT CAAP/FASE, 1993.

@proceedings{TAPSOFT-1993,
	doi           = "10.1007/3-540-56610-4",
	editor        = "Marie-Claude Gaudel and Jean-Pierre Jouannaud",
	isbn          = "3-540-56610-4",
	publisher     = "{Springer}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Fifth International Joint Conference on Theory and Practice of Software Development}",
	volume        = 668,
	year          = 1993,
}

Contents (51 items)

TAPSOFT-1993-Guttag #specification

Goldilocks and the Three Specifications (JVG), pp. 1–14.

TAPSOFT-1993-DeganoGV #concurrent #modelling #on the

On Relating Some Models for Concurrency (PD, RG, SV), pp. 15–30.

TAPSOFT-1993-EhrigJO #composition #parametricity #specification

Compositionality Results for Different Types of Parameterization and Parameter Passing in Specification Languages (HE, RMJ, FO), pp. 31–45.

TAPSOFT-1993-Becker #confluence #equation #induction #proving #specification

Proving Ground Confluence and Inductive Validity in Constructor Based Equational Specifications (KB0), pp. 46–60.

TAPSOFT-1993-BachmairCR #commutative

Associative-Commutative Discrimination Nets (LB, TC, IVR), pp. 61–74.

TAPSOFT-1993-BertrandDFL #algebra #development #geometry #modelling #specification

Algebraic Specification and Development in Geometric Modeling (YB, JFD, JF, PL), pp. 75–89.

TAPSOFT-1993-OlderogR #case study #concurrent #design

A Case Study in Transformational Design of Concurrent Systems (ERO, SR), pp. 90–104.

TAPSOFT-1993-InverardiKY #case study #formal method #named #using

Yeast: A Case Study for a Practical Use of Formal Methods (PI, BK, DY), pp. 105–120.

TAPSOFT-1993-Arnold #comparison #verification

Verification and Comparison of Transition Systems (AA), pp. 121–135.

TAPSOFT-1993-Jones #design

Constraining Inference in an Object-Based Design Model (CBJ), pp. 136–150.

TAPSOFT-1993-Sangiorgi #higher-order #π-calculus

From pi-Calculus to Higher-Order pi-Calculus - and Back (DS), pp. 151–166.

TAPSOFT-1993-DavidDK

Hyperedge Replacement with Rendevous (NGD, FD, HJK), pp. 167–181.

TAPSOFT-1993-AndreoliLPT #communication #concurrent #linear #logic programming #programming language #semantics

True Concurrency Semantics for a Linear Logic Programming Language with Braodcast Communication (JMA, LLT, RP, BT), pp. 182–198.

TAPSOFT-1993-BidoitH #composition #framework #implementation #specification

A General Framework for Modular Implementations of Modular System Specifications (MB, RH), pp. 199–214.

TAPSOFT-1993-Vandevoorde #performance #source code #specification

Specifications Can Make Programs Run Faster (MTV), pp. 215–229.

TAPSOFT-1993-Collette #composition #specification

Application of the Composition Principle to Unity-like Specifications (PC), pp. 230–242.

TAPSOFT-1993-Dershowitz #termination

Trees, Ordinals and Termination (ND), pp. 243–250.

TAPSOFT-1993-Seidl #functional #question

When Is a Functional Tree Transduction Deterministic? (HS), pp. 251–265.

TAPSOFT-1993-BeauquirerN #automaton #constraints #infinity

Automata on Infinite Trees with Counting Constraints (DB, DN), pp. 266–281.

TAPSOFT-1993-BarcucciPS

Directed Column-Convex Polyominoes by Recurrence Relations (EB, RP, RS), pp. 282–298.

TAPSOFT-1993-HanW #formal method

Object Organisation in Software Environments for Formal Methods (JH, JW), pp. 299–313.

TAPSOFT-1993-BellegardeH #monad

Monads, Indexes and Transformations (FB, JH), pp. 314–327.

TAPSOFT-1993-PenaA #liveness #process #specification #using

A Technique for Specifying and Refining TCSP Processes by Using Guards and Liveness Conditions (RP, LMA), pp. 328–342.

TAPSOFT-1993-Mahr #type system

Applications of Type Theory (BM), pp. 343–355.

TAPSOFT-1993-NiehrenP #automaton #set

Feature Automata and Recognizable Sets of Feature Trees (JN, AP), pp. 356–375.

TAPSOFT-1993-BoudetC #formal method

About the Theory of Tree Embedding (AB, HC), pp. 376–390.

TAPSOFT-1993-Qian #higher-order #linear #unification

Linear Unification of Higher-Order Patterns (ZQ), pp. 391–405.

TAPSOFT-1993-Li #formal method #requirements

A Theory of Requirements Capture and Its Applications (WL0), pp. 406–420.

TAPSOFT-1993-BernotG #exception

Exception Handling and Term Labelling (GB, PLG), pp. 421–436.

TAPSOFT-1993-GiannottiL #abstract interpretation #specification #using

Gate Splitting in LOTOS Specifications Using Abstract Interpretation (FG, DL), pp. 437–452.

TAPSOFT-1993-EhrichDS #community

Constructing Systems as Object Communities (HDE, GD, AS), pp. 453–467.

TAPSOFT-1993-Corradini #term rewriting

Term Rewriting in CT-Sigma (AC), pp. 468–484.

TAPSOFT-1993-AspertiL #interactive #reduction

Optimal Reductions in Interaction Systems (AA, CL), pp. 485–500.

TAPSOFT-1993-PuelS #pattern matching #problem

Optimal Solutions to Pattern Matching Problems (LP, AS), pp. 501–518.

TAPSOFT-1993-YaoB #consistency #testing

Testing for a Conformance Relation Based on Acceptance (MYY, GvB), pp. 519–528.

TAPSOFT-1993-DriraASC #communication #testing

Testability of a Communicating System Through an Environment (KD, PA, BS, AMC), pp. 529–543.

TAPSOFT-1993-Kirkwood #automation #equation #implementation #reasoning #using

Automating (Specififation = Implementation) Using Equational Reasoning and LOTOS (CK), pp. 544–558.

TAPSOFT-1993-Thomas #game studies #on the

On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science (WT), pp. 559–568.

TAPSOFT-1993-Tyszkiewicz #logic #on the

On Asymptotic Probabilities in Logics That Capture DSPACE(log n) in Presence of Ordering (JT), pp. 569–583.

TAPSOFT-1993-AhmedV #logic #sequence

A Propositional Dense Time Logic (Based on Nested Sequences) (MA, GV), pp. 584–598.

TAPSOFT-1993-BetremaZ

La Vraie Forme d'un Arbre (JB, AKZ), pp. 599–612.

TAPSOFT-1993-Esparza #model checking #using

Model Checking Using Net Unfoldings (JE), pp. 613–628.

TAPSOFT-1993-DiehlJR #analysis #distributed #reachability

Reachability Analysis on Distributed Executions (CD, CJ, JXR), pp. 629–643.

TAPSOFT-1993-GrafL #abstraction #composition #parallel

Property Preserving Abstractions under Parallel Composition (SG, CL), pp. 644–657.

TAPSOFT-1993-Longo #parametricity

Types as Parameters (GL), pp. 658–670.

TAPSOFT-1993-Smith #polymorphism #type inference #type system

Polymorphic Type Inference with Overloading and Subtyping (GS), pp. 671–685.

TAPSOFT-1993-TiurynW #re-engineering #recursion #type system

Type Reconstruction with Recursive Types and Atomic Subtyping (JT, MW), pp. 686–701.

TAPSOFT-1993-Trier #symmetry

(Un)expected Path Lengths of Asymmetric Binary Search Trees (UT), pp. 702–716.

TAPSOFT-1993-Louchard

Trie Size in a Dynamic List Structure (GL), pp. 717–731.

TAPSOFT-1993-LatellaQ #calculus #parallel #process

A Fully Parallel Calculus of Synchronizing Processes (DL, PQ), pp. 732–745.

TAPSOFT-1993-GribomontD #array #design

Generic Systolic Arrays: A Methodology for Systolic Design (EPG, VVD), pp. 746–761.