16. MFCS 1991: Kazimierz Dolny, Poland

Invited Lectures

• Jean-Louis Lassez, Michael J. Maher, Kim Marriott:
  Elimination of Negation in Term Algebras. 1-16
  
• Pierre Lescanne:
  Rewrite Orderings and Termination of Rewrite Systems. 17-27
  
• Zohar Manna, Amir Pnueli:
  On the Faithfulness of Formal Models. 28-42
  
• Mogens Nielsen:
  Models for Concurrency. 43-46
  
• Andrzej Salwicki:
  On a Hierarchy of File Types and a Tower of Their Theories. 47-63
  

Contributions

• Fabio Alessi, Franco Barbanera:
  Strong Conjunction and Intersection Types. 64-73
  
• Egidio Astesiano, Maura Cerioli:
  Partial Higher-Order Specifications. 74-83
  
• Staffan Bonnier:
  Unification in Incompletely Specified Theories: A Case Study. 84-92
  
• Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn:
  Observing Localities (Extended Abstract). 93-102
  
• Gerardo Costa, Gianna Reggio:
  Abstract Dynamic Data Types: A Temporal Logic Approach. 103-112
  
• Anton Cerný:
  Generating Words by Cellular Automata. 113-120
  
• Pierpaolo Degano, Roberto Gorrieri:
  Atomic Refinement in Process Description Languages. 121-130
  
• Volker Diekert, Paul Gastin, Antoine Petit:
  Recognizable Complex Trace Languages. 131-140
  
• Eric Domenjoud:
  Solving Systems of Linear Diophantine Equations: An Algebraic Approach. 141-150
  
• Gilles Dowek:
  A Second-Order Pattern Matching Algorithm for the Cube of Typed Lambda-Calculi. 151-160
  
• Lavinia Egidi, Furio Honsell, Simona Ronchi Della Rocca:
  The lazy call-by-value Lamda-Calculus. 161-169
  
• Roberto Gorrieri, Cosimo Laneve:
  The Limit of Split_n-Bisimulations for CCS Agents. 170-180
  
• Georges Hansel, Daniel Krob, Christian Michaux:
  Stochastic Automata and Length Distributions of Rational Languages. 181-190
  
• Barney P. Hilken, David E. Rydeheard:
  Towards a Categorical Semantics Type Classes. 191-201
  
• Rodney R. Howell, Petr Jancar, Louis E. Rosier:
  Single-Path Petri Nets. 202-210
  
• Juraj Hromkovic, Burkhard Monien:
  The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems). 211-220
  
• Oscar H. Ibarra, Tao Jiang, Hui Wang:
  Some Results Concerning 2-D On-line Tessellation Acceptors and 2-D Alternating Finite Automata. 221-230
  
• Paola Inverardi, Monica Nesi:
  Infinite Normal Forms for Non-Linear Term Rewriting Systems. 231-239
  
• Petteri Jokinen, Esko Ukkonen:
  Two Algorithms for Approximate String Matching in Static Texts. 240-248
  
• Juhani Karhumäki, Wojciech Rytter, Stefan Jarominek:
  Efficient Constructions of Test Sets for Regular and Context-Free Languages. 249-258
  
• Dimitris Kavadias, Lefteris M. Kirousis, Paul G. Spirakis:
  The Complexity of The Reliable Connectivity Problem. 259-266
  
• Delia Kesner:
  Pattern Matching in Order-Sorted Languages. 267-276
  
• Beata Konikowska:
  Two Over Three: A Two-Valued Logic for Software Specification and Validation Over a Three-Valued Predicate Calculus. 277-286
  
• Emmanuel Kounalis, Denis Lugiez, Loic Pottier:
  A Solution of the Complement Problem in Associative-Commutative Theories. 287-297
  
• Padmanabhan Krishnan:
  A Model for Real-Time Systems. 298-307
  
• Nguyen Huong Lam, Do Long Van:
  On Strict Codes. 308-317
  
• Hans Leiß, Fritz Henglein:
  A Decidable Case of the Semi-Unification Problem. 318-327
  
• Claudia Leopold:
  Maintaining Dictionaries in a Hierarchical Memory. 328-336
  
• Christoph Meinel, Stephan Waack:
  Upper and Lower Bounds for Certain Graph-Accessibility Problems on Bounded Alternating Omega-Branching Programs. 337-345
  
• Ugo Montanari, Vladimiro Sassone:
  CCS Dynamic Bisimulation is Progressing. 346-356
  
• M. A. Nait Abdallah:
  Syntax and Semantics of a Monotonic Framework for Non-Monotonic Reasoning. 357-366
  
• Damian Niwinski:
  On the Cardinality of Sets of Infinite Trees Recognizable by Finite Automata. 367-376
  
• Barbara Paech:
  Extending Temporal Logic by Explicit Concurrency. 377-386
  
• Ramón Pino Pérez:
  An Extensional Partial Combinatory Algebra Based on Lamda-Terms. 387-396
  
• Axel Poigné:
  Once More on Order-Sorted Algebras. 397-405
  
• Yves Roos, Pierre-André Wacrenier:
  Composition of Two Semi Commutations. 406-414
  
• Peter Ruzicka:
  An Efficient Decision Algorithm for the Uniform Semi-Unification Problem. 415-425
  
• Konstantin V. Shvachko:
  Different Modifications of Pointer Machines and Their Computational Power. 426-435
  

Last update Fri May 25 08:26:26 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page