MFCS B

69 papers

YearTitle / Authors
1993A Calculus for Higher Order Procedures with Global Variables.
Werner Stephan, Andreas Wolpers
1993A Characterization of Sturmian Morphisms.
Jean Berstel, Patrice Séébold
1993A Complete Axiomatization for Branching Bisimulation Congruence of Finite-State Behaviours.
Rob J. van Glabbeek
1993A Model for Real-Time Process Algebras (Extended Abstract).
Liang Chen
1993A Representation Theorem for Lambda Abstraction Algebras.
Don Pigozzi, Antonino Salibra
1993A Taste of Linear Logic.
Philip Wadler
1993A Taxonomy of Forgetting Automata.
Petr Jancar, Frantisek Mráz, Martin Plátek
1993A Uniform Universal CREW PRAM.
Bruno Martin
1993Action Calculi, or Syntactic Action Structures.
Robin Milner
1993An Expressive Logic for Basic Process Algebra.
Alessandro Fantechi, Stefania Gnesi, V. Perticaroli
1993An Introduction to Dynamic Labled 2-Structures.
Andrzej Ehrenfeucht, Grzegorz Rozenberg
1993Analytic Tableaux for Finite and Infinite Post Logics.
Nicolas Zabel
1993Approximate and Exact Deterministic Parallel Selection.
Shiva Chaudhuri, Torben Hagerup, Rajeev Raman
1993Between Min Cut and Graph Bisection.
Dorothea Wagner, Frank Wagner
1993Comparative Semantics for Linear Arrays of Communicating Processes: A Study of the UNIX Fork and Pipe Commands.
J. W. de Bakker, Franck van Breugel, Arie de Bruin
1993Completeness Results for Linear Logic on Petri Nets.
Uffe Engberg, Glynn Winskel
1993Complex and Complex-Like Traces.
Volker Diekert
1993Constant Time Reductions in Lambda-Caculus.
Michel Parigot, Paul Rozière
1993Data Encapsulation and Modularity: Three Views of Inheritance.
José Félix Costa, Amílcar Sernadas, Cristina Sernadas
1993Deciding Testing Equivalence for Real-Time Processes with Dense Time.
Bernhard Steffen, Carsten Weise
1993Defining Soft Sortedness by Abstract Interpretation.
Jian Chen, John Staples
1993Deliverables: A Categorial Approach to Program Development in Type Theory.
James McKinna, Rod M. Burstall
1993Deterministic Behavioural Models for Concurrency.
Vladimiro Sassone, Mogens Nielsen, Glynn Winskel
1993Efficient Parallel Graph Algorithms Based on Open Ear Decomposition.
Louis Ibarra, Dana S. Richards
1993Efficient Type Reconstruction in the Presence of Inheritance.
Marcin Benke
1993Equivalences and Preorders of Transition Systems.
André Arnold, Anne Dicky
1993Feature Constraints with First-Class Features.
Ralf Treinen
1993Filter Models for a Parallel and Non Deterministic Lambda-Calculus.
Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro, Adolfo Piperno
1993Global Properties of 2D Cellular Automata: Some Complexity Results.
Bruno Durand
1993Hausdorff Reductions to Sparse Sets and to Sets of High Information Content.
Vikraman Arvind, Johannes Köbler, Martin Mundhenk
1993Heterogeneous Unified Algebras.
Francesco Parisi-Presicce, S. Veglioni
1993Hybrid Parallel Programming and Implementation of Synchronised Communication.
Jifeng He
1993Ignoring Nonessential Interleavings in Assertional Reasoning on Concurrent Programs.
Pawel Paczkowski
1993Image Compression Using Weighted Finite Automata.
Karel Culík II, Jarkko Kari
1993Isomorphisms between Predicates and State Transformers.
Marcello M. Bonsangue, Joost N. Kok
1993Lambda Substitution Algebras.
Zinovy Diskin, Ilya Beylin
1993Learning Decision Lists from Noisy Examples.
Jilei Yin, Hong Zhu
1993Mathematical Foundations of Computer Science 1993, 18th International Symposium, MFCS'93, Gdansk, Poland, August 30 - September 3, 1993, Proceedings
Andrzej M. Borzyszkowski, Stefan Sokolowski
1993May I Borrow Your Logic?
Maura Cerioli, José Meseguer
1993New Algorithms for Detecting Morphic Images of a Word.
Jean Néraud
1993Object Oriented Application Flow Graphs and their Semantics.
Erik de Haas, Peter van Emde Boas
1993Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new?
Andrew M. Pitts, Ian David Bede Stark
1993Observing Distribution in Processes.
Ilaria Castellani
1993Observing Located Concurrency.
David Murphy
1993On Saturated Calculi for a Linear Temporal Logic.
Regimantas Pliuskevicius
1993On Time-Space Trade-Offs in Dynamic Graph Pebbling.
Peter Ruzicka, Juraj Waczulík
1993On the Adequacy of Per Models.
Roberto M. Amadio
1993On the Amount of Nondeterminism and the Power of Verifying (Extended Abstract).
Liming Cai, Jianer Chen
1993On the Communication Complexity of Parallel Computation.
Oscar H. Ibarra, Nicholas Q. Trân
1993On the Complexity of Scheduling Incompatible Jobs with Unit-Times.
Hans L. Bodlaender, Klaus Jansen
1993On the Tree Inclusion Problem.
Laurent Alonso, René Schott
1993On the Unification Free Prolog Programs.
Krzysztof R. Apt, Sandro Etalle
1993Paths and Cycles in Finite Periodic Graphs.
Egon Wanke
1993Post Correspondence Problem: Primitivity and Interrelations with Complexity Classes.
Alexandru Mateescu, Arto Salomaa
1993Proof Systems for Cause Based Equivalences.
Astrid Kiehn
1993Rabin Tree Automata and Finite Monoids.
Danièle Beauquier, Andreas Podelski
1993Real Number Computability and Domain Theory.
Pietro Di Gianantonio
1993Real-Time Refinement: Semantics and Application.
David Scholefield, Hussein S. M. Zedan, Jifeng He
1993Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems.
Juraj Hromkovic, Jarkko Kari, Lila Kari
1993Some Results on the Full Abstraction Problem for Restricted Lambda Calculi.
Furio Honsell, Marina Lenisa
1993Speedup of Recognizable Trace Languages.
Christophe Cérin, Antoine Petit
1993Stores as Homomorphisms and their Transformations.
Egidio Astesiano, Gianna Reggio, Elena Zucca
1993Symbolic Bisimulations (Abstract).
Matthew Hennessy
1993The Boundary of Substitution Systems.
Philippe Narbel
1993The Complexity of Finding Replicas Using Equality Tests.
Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum
1993The Second Calculus of Binary Relations.
Vaughan R. Pratt
1993The Snack Powerdomain for Database Semantics.
Hermann Puhlmann
1993Variable Substitution with Iconic Combinators.
David Stevens
1993Verifying Properties of Module Construction in Type Theory.
Bernhard Reus, Thomas Streicher