TAPSOFT '93: Theory and Practice of Software Development

4th International Joint Conference CAAP/FASE, Orsay, France, April 13-17, 1993. Proceedings

AvMarie-Claude Gaudel,Jean-Pierre Jouannaud

Häftad, Engelska, 1993

Del i serien Lecture Notes in Computer Science

1 124 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This volume contains the proceedings of the fourthInternational Joint Conference on the Theory and Practice ofSoftware Development, TAPSOFT '93. Since the first in 1985,the aim of these conferences has been to bring togethertheoretical computer scientists and researchers in softwareengineering with a view to discussing how formal methods canusefully be applied in software development.TAPSOFT '93 consists ofthree parts: an advanced seminar,the Colloquium on Trees in Algebra and Programming (CAAP),and the Colloquium on Formal Approaches of SoftwareEngineering (FASE). The advanced seminar includes fourinvited surveys and four invited conferences. The selectedpapers for CAAP are organized in seven sessions:specifications and proofs, concurrency, automata andcounting, constraints solving, rewriting, logic and trees,analysis of algorithms, and a common session with FASE ontype inference. The selected papers for FASE are presentedin eight sessions: case studies in formal design anddevelopment, compositionality modules and development,formal development, foundations and analysis of formalspecifications, verification of concurrent systems, modelchecking, parallel calculus, and a common session with CAAPon type inference.

Produktinformation

Utgivningsdatum:1993-04-06
Mått:155 x 235 x 42 mm
Vikt:1 159 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:768
Upplaga:1993
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540566106

Utforska kategorier

Programvaruutveckling inom Data och IT

Innehållsförteckning

Goldilocks and the three specifications.- On relating some models for concurrency.- Compositionality results for different types of parameterization and parameter passing in specification languages.- Proving ground confluence and inductive validity in constructor based equational specifications.- Associative-commutative discrimination nets.- Algebraic specification and development in geometric modeling.- A case study in transformational design of concurrent systems.- Yeast: A case study for a practical use of formal methods.- Verification and comparison of transition systems.- Constraining interference in an object-based design method.- From ?-calculus to higher-order ?-calculus — and back.- Hyperedge replacement with rendezvous.- True concurrency semantics for a linear logic programming language with broadcast communication.- A general framework for modular implementations of modular system specifications.- Specifications can make programs run faster.- Application of the composition principle to unity-like specifications.- Trees, ordinals and termination.- When is a functional tree transduction deterministic?.- Automata on infinite trees with counting constraints.- Directed column-convex polyominoes by recurrence relations.- Object organisation in software environments for formal methods.- Monads, indexes and transformations.- A technique for specifying and refining TCSP processes by using guards and liveness conditions.- Applications of type theory.- Feature automata and recognizable sets of feature trees.- About the theory of tree embedding.- Linear unification of higher-order patterns.- A theory of requirements capture and its applications.- Exception handling and term labelling.- Gate splitting in LOTOS specifications using abstract interpretation.-Constructing systems as object communities.- Term rewriting in CT?.- Optimal reductions in interaction systems.- Optimal solutions to pattern matching problems.- Testing for a conformance relation based on acceptance.- Testability of a communicating system through an environment.- Automating (specification = implementation) using equational reasoning and LOTOS.- On the Ehrenfeucht-Fraïssé game in theoretical computer science.- On asymptotic probabilities in logics that capture DSPACE(log n) in presence of ordering.- A propositional dense time logic.- La Vraie Forme d'un Arbre.- Model checking using net unfoldings.- Reachability analysis on distributed executions.- Property preserving abstractions under parallel composition.- Types as parameters.- Polymorphic type inference with overloading and subtyping.- Type reconstruction with recursive types and atomic subtyping.- (Un)expected path lengths of asymmetric binary search trees.- Trie size in a dynamic list structure.- A fully parallel calculus of synchronizing processes.- Generic systolic arrays: A methodology for systolic design.