Volume 65, Number 1, 2002

• 
  Jirí Adámek, Stefan Milius, Jiri Velebil: Final Coalgebras And a Solution Theorem for Arbitrary Endofunctors. 1-28
• 
  Falk Bartels: GSOS for Probabilistic Transition Systems. 29-53
• 
  Corina Cîrstea: Institutionalizing Coalgebraic Modal Logic. 54-70
• 
  Neil Ghani, Christoph Lüth, Federico De Marchi: Coalgebraic Monads. 71-91
• 
  Jesse Hughes: Some Co-Birkhoff Type Theorems. 92-111
• 
  Bart Jacobs: Comprehension for Coalgebras. 112-134
• 
  Alexander Kurz, Dirk Pattinson: Definability, Canonical Models, and Compactness for Finitary Coalgebraic Modal Logic. 135-155
• 
  Alexander Kurz, Jirí Rosický: Modal Predicates and Co-equations. 156-175
• 
  Dragan Masulovic: Towards Coalgebraic Behaviourism. 176-196
• 
  José Meseguer, Grigore Rosu: Towards Behavioral Maude: Behavioral Membership Equational Logic. 197-253
• 
  Alessandra Palmigiano: Abstract Logics as Dialgebras. 254-269
• 
  Jan Rothe: A Syntactical Approach to Weak (Bi-)Simulation for Coalgebras. 270-285
• 
  Jan J. M. M. Rutten: Coinductive Counting: Bisimulation in Enumerative Combinatorics. 286-304
• 
  Luigi Santocanale: From Parity Games to Circular Proofs. 305-316
• 
  Hendrik Tews: Greatest Bisimulations for Binary Methods. 317-336
• 
  Hiroshi Watanabe: Well-behaved Translations between Structural Operational Semantics. 337-357
• 
  James Worrell: A Note on Coalgebras and Presheaves. 358-364
• 
  Lawrence S. Moss: Preface. 365-366

Volume 65, Number 2, 2002

• 
  Gerhard Goos: Compiler Verification and Compiler Architecture. 1
• 
  Lenore D. Zuck, Amir Pnueli, Yi Fang, Benjamin Goldberg: VOC: A Translation Validator for Optimizing Compilers. 2-18
• 
  Sabine Glesner, Rubino Geiß, Boris Boesler: Verified Code Generation for Embedded Systems. 19-36
• 
  Carl Christian Frederiksen: Correctness of Classical Compiler Optimizations using CTL. 37-51
• 
  Thi Viet Nga Nguyen, François Irigoin: Alias verification for Fortran code optimization. 52-66
• 
  K. C. Shashidhar, Maurice Bruynooghe, Francky Catthoor, Gerda Janssens: Geometric Model Checking: An Automatic Verification Technique for Loop and Data Reuse Transformations. 67-82
• 
  Clara Jaramillo, Rajiv Gupta, Mary Lou Soffa: Debugging and Testing Optimizers through Comparison Checking. 83-99
• 
  Wolfgang Goerigk: Towards Acceptability of Optimizations: An Extended View of Compiler Correctness. 100-114
• 
  Jens Knoop, Wolf Zimmermann: Preface. 115-116

Volume 65, Number 3, 2002

• 
  Charles Consel: Domain-Specific Languages: What, Why, How. 1
• 
  Peter D. Mosses: Action Semantics and ASF+SDF: System Demonstration. 2-8
• 
  John Boyland: Incremental Evaluators for Remote Attribute Grammars. 9-29
• 
  Katsuhiko Gondow, Hayato Kawashima: Towards ANSI C Program Slicing using XML. 30-49
• 
  Mark van den Brand, Pierre-Etienne Moreau, Christophe Ringeissen: The ELAN Environment: a Rewriting Logic Environment based on ASF+SDF Technology - System Demonstration. 50-56
• 
  Eelco Dolstra, Eelco Visser: Building Interpreters with Rewriting Strategies. 57-76
• 
  Pedro Rangel Henriques, Maria João Varanda Pereira, Marjan Mernik, Mitja Lenic, Enis Avdicausevic, Viljem Zumer: Automatic Generation of Language-based Tools. 77-96
• 
  Didier Parigot, Carine Courbis, Pascal Degenne, Alexandre Fau, Claude Pasquier, Joël Fillon, Christophe Held, Isabelle Attali: Aspect and XML-oriented Semantic Framework Generator: SmartTools. 97-116
• 
  Jan Kort, Ralf Lämmel, Chris Verhoef: The Grammar Deployment Kit - System Demonstration. 117-123
• 
  Jean-Michel Hufflen: Lessons from a Bibliography Program's Reimplementation. 124-138
• 
  Uwe Kastens, Carsten Schmidt: VL-Eli: A Generator for Visual Languages - System Demonstration. 139-143
• 
  Mark van den Brand, Ralf Lämmel: Foreword. 144-145

Volume 65, Number 4, 2002

• 
  Jiang Guo: Interoperability Technology Assessment. 1-12
• 
  Thaís Vasconcelos Batista, Milano Gadelha Carvalho: Component-Based Applications: A Dynamic Reconfiguration Approach with Fault Tolerance Support. 13-21
• 
  Humberto Cervantes, Jean-Marie Favre, Frédéric Duclos: Describing Hierarchical Compositions of Java Beans with the Beanome Language. 22-33
• 
  Christoph Pohl, Alexander Schill: Middleware Support for Transparent Client-Side Caching. 34-44
• 
  Claus Pahl, David Ward: Towards a Component Composition and Interaction Architecture for the Web. 45-55
• 
  Judith Bishop, Karen Renaud, Basil Worrall: Composition of Distributed Software with Algon - Concepts and Possibilities. 56-67
• 
  Wim Vanderperren, Bart Wydaeghe: Separating concerns in a high-level component-based context. 68-80
• 
  Stavros Tripakis: Automated Composition of Module Chains. 81-90
• 
  Klaus-Peter Löhr: Towards Automatic Mediation between Heterogeneous Software Components. 91-105
• 
  Welf Löwe, Markus L. Noga: Metaprogramming Applied to Web Component Deployment. 106-116
• 
  Lyrene Fernandes da Silva, Virginia C. Carneiro de Paula: Comparative Analysis of Architectural Views Based on UML. 117-128
• 
  Valérie Monfort, Hubert Kadima: Extending The Unified Process With Composition. 129-141
• 
  Elke Pulvermüller: Composition and Correctness. 142-154
• 
  Elke Pulvermüller, Isabelle Borne, Noury Bouraqadi, Pierre Cointe, Uwe Aßmann: Preface. 155-156

Volume 65, Number 5, 2002

• 
  Florence Maraninchi, Alain Girault, Éric Rutten: Preface. 1-2
• 
  Arcot Sowmya, David Tsz-Wang So, Wan Hung Tang: Design of a Mobile Robot Controller Using Esterel Tools. 3-10
• 
  David Garriou: Symbolic Simulation of Synchronous Programs. 11-18
• 
  Lionel Morel: Efficient Compilation of Array Iterators for Lustre. 19-26
• 
  Pascal Raymond, Yvan Roux: Describing Non-Deterministic Reactive Systems by Means of Regular Expressions. 27-34
• 
  Michael Baldamus, Thomas Stauner: Modifying Esterel Concepts to Model Hybrid Systems. 35-49
• 
  Vinod Ganapathy, S. Ramesh: Slicing Synchronous Reactive Programs. 50-64
• 
  Jean-Louis Colaço, Marc Pouzet: Type-Based Initialisation Analysis of a Synchronous Data-Flow Language. 65-78
• 
  Stephen Edwards: ESUIF: An Open Esterel Compiler. 79
• 
  Etienne Closse, Michel Poize, Jacques Pulou, Patrick Venier, Daniel Weil: SAXO-RT: Interpreting Esterel Semantic on a Sequential Execution Structure. 80-94
• 
  Gerald Lüttgen, Michael Mendler: Towards a Model-Theory for Esterel. 95-109
• 
  Paritosh K. Pandya: The Saga of Synchronous Bus Arbiter: On Model Checking Quantitative Timing Properties of Synchronous Programs. 110-124
• 
  Ramesh Bharadwaj: SOL: A Verifiable Synchronous Language for Reactive Systems. 140-154
• 
  Mirabelle Nebut, Sophie Pinchinat: A Decidable Clock Language for Synchronous Specifications. 125-139

Volume 65, Number 6, 2002

• 
  Hanifa Boucheneb, Gérard Berthelot: Contraction of the ITCPN State Space. 1-15
• 
  Marc Boyer: Translation from timed Petri nets with intervals on transitions to intervals on places (with urgency). 16-46
• 
  Marius Bozga, Jianmin Hou, Oded Maler, Sergio Yovine: Verification of Asynchronous Circuits using Timed Automata. 47-59
• 
  Víctor A. Braberman, Carlos López Pombo, Alfredo Olivero: On Improving Backwards Verification of Timed Automata. 60-67
• 
  Jérôme Ermont, Frédéric Boniol: TPAP: an Algebra of Preemptive Processes for Verifying Real-Time Systems with Shared Resources. 68-85
• 
  Nawel Gharbi, Malika Ioualalen: Performance Analysis of Retrial Queueing Systems Using Generalized Stochastic Petri Nets. 86-100
• 
  Dimitar P. Guelev, Dang Van Hung: Prefix and Projection onto State in Duration Calculus. 101-119
• 
  Martijn Hendriks, Kim Guldstrand Larsen: Exact Acceleration of Real-Time Model Checking. 120-139
• 
  Pao-Ann Hsiung, Chuen-Hau Gao: Formal Synthesis of Real-Time Embedded Software by Time-Memory Scheduling of Colored Time Petri Nets. 140-159
• 
  Philipp Lucas: Timed Semantics of Message Sequence Charts Based on Timed Automata. 160-179
• 
  Eric Mercer, Chris J. Myers, Tomohiro Yoneda: Modular Synthesis of Timed Circuits using Partial Order Reduction. 180-201
• 
  M. Oliver Möller: Parking can get you there faster - Model Augmentation to Speed up Real-Time Model-Checking. 202-217
• 
  M. Oliver Möller, Harald Rueß, Maria Sorea: Predicate Abstraction for Dense Real-Time System. 218-237
• 
  Arnaldo V. Moura, Guilherme A. Pinto: Classes of Timed Automata and the Undecidability of Universality. 238-253
• 
  Paritosh K. Pandya: Interval Duration Logic: Expressiveness and Decidability. 254-272
• 
  Eugene Asarin, Oded Maler, Sergio Yovine: Preface. 273-274
• 
  Giorgio C. Buttazzo, Avi Efrati, John N. Hooker, Claude Le Pape, Joseph Sifakis: Abstracts of Invited Talks. 275-276

Volume 65, Number 7, 2002

• 
  Purandar Bhaduri, R. Venkatesh, Girish Keshav Palshikar: Formal Techniques for Analysing Scenarios using Message Sequence Charts. 1-17
• 
  Manfred Broy: Message Sequence Charts in the Development Process - Role and Limitations. 18-33
• 
  Ingolf Krüger: Specifying Services with UML and UML-RT: Foundations, Challenges and Limitations. 34-50
• 
  Doron Peled: Specification and Verification using Message Sequence Charts. 51-64
• 
  Sebastián Uchitel, Jeff Kramer, Jeff Magee: Implied Scenario Detection in the Presence of Behaviour Constraints. 65-84
• 
  Tong Zheng, Ferhat Khendek, Loïc Hélouët: A Semantics for Timed MSC. 85-99
• 
  Benoît Caillaud, Anca Muscholl: Preface. 100

last updated on Sat May 25 06:08:12 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page