Foundations of Software Science and Computation Structures: First International Conference, FoSSaCS'98, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS'98, Lisbon, Portugal, March 28 - April 4, 1998, Proceedings, Volume 1
Springer Science & Business Media, Mar 11, 1998 - Computers - 287 pages
This book constitutes the refereed proceedings of the First International Conference on the Foundations of Software Science and Computation Structures, FoSSaCS'98, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS'98, in Lisbon, Portugal, in March/April 1998.
The 19 revised full papers presented in the book were carefully selected from a total of 44 submissions. Among the topics covered are formal specification, automata theory, term rewriting and rewriting systems, process algebras, formal language theory, type theory, event structures, and iteration theory.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Generalizing Domain Theory
A Cooks Tour of Equational Axiomatizations for Prefix Iteration
The WHILE Hierarchy of Program Schemes Is Infinite
Analysis of a Guard Condition in Type Theory
Asymmetric Event Structures
Pumping Lemmas for Timed Automata
Asynchronous Observations of Processes
Two Applications Based on Enumerations by Graph Relabelling
The Appearance of Big Integers in Exact Real Arithmetic Based on Linear Fractional Transformations
Net Refinement by Fullback Rewriting
On Piecewise Testable Starfree and Recognizable Picture Languages
Functor Categories and TwoLevel Languages
Deciding Properties for Message Sequence Charts
The ChurchRosser Languages Are the Deterministic Variants of the Growing ContextSensitive Languages
Deterministic Rational Transducers and Random Sequences
Resource Based Models for Asynchrony
Other editions - View all
Foundations of Software Science and Computation Structures: First ...
No preview available - 2014
algebraic algorithm ambient asymmetric conflict asynchronous automata automaton axiom bisimulation c-net calculus causal Church-Rosser languages clock co-inductive type compact elements configuration consider context dcpo defined Definition denote Dijkstra scheme domain theory edge equivalence event structures example exists finite function functor category graph rewriting system hypergraph i-term implies induced infinite input integer interpretation labelled graph mapping matches matrix morphism MSC graph multiset node notion obtain occurrence c-net open sets operation output partial metrics partial order Petri nets picture language preorder proof properties Proposition pullback Pumping Lemma random sequence rational term real numbers recursive reduction refinement regular languages relation relaxed metric resource graphs result rules satisfies Scott Scott topology semantics set of redexes simple path Springer star height strongly connected component subset tensor term rewriting Theorem topology transducer transition systems unbounded nondeterminism valuations variables vertex