TAPSOFT '93: theory and practice of software development. 4th international joint conference CAAP/FASE, Orsay, France, April 13--17, 1993. Proceedings (Q1310275)

From MaRDI portal





scientific article; zbMATH DE number 478345
Language Label Description Also known as
English
TAPSOFT '93: theory and practice of software development. 4th international joint conference CAAP/FASE, Orsay, France, April 13--17, 1993. Proceedings
scientific article; zbMATH DE number 478345

    Statements

    TAPSOFT '93: theory and practice of software development. 4th international joint conference CAAP/FASE, Orsay, France, April 13--17, 1993. Proceedings (English)
    0 references
    8 December 1993
    0 references
    The articles of this volume will be reviewed individually. Indexed articles: \textit{Guttag, John V.}, Goldilocks and the three specifications, 1-14 [Zbl 1497.68306] \textit{Degano, Pierpaolo; Gorrieri, Roberto; Vigna, Sebastiano}, On relating some models for concurrency, 15-30 [Zbl 1497.68332] \textit{Ehrig, H.; Jimenez, R. M.; Orejas, F.}, Compositionality results for different types of parameterization and parameter passing in specification languages, 31-45 [Zbl 1497.68296] \textit{Becker, Klaus}, Proving ground confluence and inductive validity in constructor based equational specifications, 46-60 [Zbl 1497.68286] \textit{Bachmair, Leo; Chen, Ta; Ramakrishnan, I. V.}, Associative-commutative discrimination nets, 61-74 [Zbl 1497.68237] \textit{Bertrand, Y.; Dufourd, J.-F.; Françon, J.; Lienhardt, P.}, Algebraic specification and development in geometric modeling, 75-89 [Zbl 1497.68324] \textit{Olderog, Ernst-Rüdiger; Rössig, Stephan}, A case study in transformational design of concurrent systems, 90-104 [Zbl 1497.68350] \textit{Inverardi, Paola; Krishnamurthy, Balachander; Yankelevich, Daniel}, Yeast: a case study for a practical use of formal methods, 105-120 [Zbl 1497.68343] \textit{Arnold, André}, Verification and comparison of transition systems, 121-135 [Zbl 1497.68325] \textit{Jones, C. B.}, Constraining interference in an object-based design method, 136-150 [Zbl 1497.68100] \textit{Sangiorgi, Davide}, From \(\pi \)-calculus to higher-order \(\pi \)-calculus -- and back, 151-166 [Zbl 1497.68351] \textit{David, Gnanamalar; Drewes, Frank; Kreowski, Hans-Jörg}, Hyperedge replacement with rendezvous, 167-181 [Zbl 1497.68243] \textit{Andreoli, Jean-Marc; Leth, Lone; Pareschi, Remo; Thomsen, Bent}, True concurrency semantics for a linear logic programming language with broadcast communication, 182-198 [Zbl 1497.68083] \textit{Bidoit, Michel; Hennicker, Rolf}, A general framework for modular implementations of modular system specifications, 199-214 [Zbl 1497.68288] \textit{Vandevoorde, Mark T.}, Specifications can make programs run faster, 215-229 [Zbl 1497.68103] \textit{Collette, Pierre}, Application of the composition principle to unity-like specifications, 230-242 [Zbl 1497.68292] \textit{Dershowitz, Nachum}, Trees, ordinals and termination, 243-250 [Zbl 1497.68140] \textit{Seidl, Helmut}, When is a functional tree transduction deterministic?, 251-265 [Zbl 1497.68280] \textit{Beauquier, Danièle; Niwiński, Damian}, Automata on infinite trees with counting constraints, 266-281 [Zbl 1497.68249] \textit{Barcucci, Elena; Pinzani, Renzo; Sprugnoli, Renzo}, Directed column-convex polyominoes by recurrence relations, 282-298 [Zbl 1497.05032] \textit{Han, Jun; Welsh, Jim}, Object organisation in software environments for formal methods, 299-313 [Zbl 1497.68112] \textit{Bellegarde, Françoise; Hook, James}, Monads, indexes and transformations, 314-327 [Zbl 1497.68091] \textit{Peña, R.; Alonso, Luis M.}, A technique for specifying and refining TCSP processes by using guards and liveness conditions, 328-342 [Zbl 1497.68318] \textit{Mahr, Bernd}, Applications of type theory, 343-355 [Zbl 1497.68118] \textit{Niehren, Joachim; Podelski, Andreas}, Feature automata and recognizable sets of feature trees, 356-375 [Zbl 1497.68146] \textit{Boudet, Alexandre; Comon, Hubert}, About the theory of tree embedding, 376-390 [Zbl 1497.03029] \textit{Qian, Zhenyu}, Linear unification of higher-order patterns, 391-405 [Zbl 1497.68096] \textit{Li, Wei}, A theory of requirements capture and its applications, 406-420 [Zbl 1497.68315] \textit{Bernot, Gilles; Le Gall, Pascale}, Exception handling and term labelling, 421-436 [Zbl 1497.68323] \textit{Giannotti, Fosca; Latella, Diego}, Gate splitting in LOTOS specifications using abstract interpretation, 437-452 [Zbl 1497.68302] \textit{Ehrich, Hans-Dieter; Denker, Grit; Sernadas, Amilcar}, Constructing systems as object communities, 453-467 [Zbl 1497.68336] \textit{Corradini, Andrea}, Term rewriting in \(\mathrm{CT}_\Sigma \), 468-484 [Zbl 1497.68241] \textit{Asperti, Andrea; Laneve, Cosimo}, Optimal reductions in interaction systems, 485-500 [Zbl 1497.68236] \textit{Puel, Laurence; Suárez, Ascánder}, Optimal solutions to pattern matching problems, 501-518 [Zbl 1497.68121] \textit{Yao, Ming Yu; Bochmann, Gregor V.}, Testing for a conformance relation based on acceptance, 519-528 [Zbl 1497.68101] \textit{Drira, K.; Azema, P.; Soulas, B.; Chemali, A. M.}, Testability of a communicating system through an environment, 529-543 [Zbl 1497.68335] \textit{Kirkwood, Carron}, Automating (specification \(\equiv\) implementation) using equational reasoning and LOTOS, 544-558 [Zbl 07611287] \textit{Thomas, Wolfgang}, On the Ehrenfeucht-Fraïssé game in theoretical computer science (extended abstract), 559-568 [Zbl 1497.03049] \textit{Tyszkiewicz, Jerzy}, On asymptotic probabilities in logics that capture \(\mathrm{DSPACE}(\log n)\) in presence of ordering, 569-583 [Zbl 1497.03050] \textit{Ahmed, Mohsin; Venkatesh, G.}, A propositional dense time logic, 584-598 [Zbl 1497.03034] \textit{Bétréma, J.; Zvonkin, A.}, The true form of a tree, 599-612 [Zbl 1502.05031] \textit{Esparza, Javier}, Model checking using net unfoldings, 613-628 [Zbl 1498.68157] \textit{Diehl, Claire; Jard, Claude; Rampon, Jean-Xavier}, Reachability analysis on distributed executions, 629-643 [Zbl 1497.68097] \textit{Graf, Susanne; Loiseaux, Claire}, Property preserving abstractions under parallel composition, 644-657 [Zbl 1497.68340] \textit{Longo, Giuseppe}, Types as parameters, 658-670 [Zbl 1497.68115] \textit{Smith, Geoffrey S.}, Polymorphic type inference with overloading and subtyping, 671-685 [Zbl 1497.68125] \textit{Tiuryn, Jerzy; Wand, Mitchell}, Type reconstruction with recursive types and atomic subtyping, 686-701 [Zbl 1497.68127] \textit{Trier, Uwe}, (Un)expected path lengths of asymmetric binary search trees, 702-716 [Zbl 1497.68147] \textit{Louchard, G.}, Trie size in a dynamic list structure, 717-731 [Zbl 1497.68144] \textit{Latella, Diego; Quaglia, Paola}, A fully parallel calculus of synchronizing processes, 732-745 [Zbl 1497.68348] \textit{Gribomont, Pascal; van Dongen, Vincent}, Generic systolic arrays: a methodology for systolic design, 746-761 [Zbl 1497.68609]
    0 references
    Orsay (France)
    0 references
    Conference
    0 references
    Proceedings
    0 references
    CAAP/FASE
    0 references
    TAPSOFT '93
    0 references
    Software development
    0 references

    Identifiers