Foundation of Software Science and Computation Structures

Third International Conference, FOSSACS 2000 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000 Berlin, Germany, March 25 - April 2, 2000 Proceedings

Häftad, Engelska, 2000

709 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

This volume constitutes the refereed proceedings of the Third International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2000, held as part of ETAPS 2000 in Berlin, Germany in March/April 2000. The 25 revised full papers presented were carefully reviewed and selected from a total of 68 submissions. Among the topics covered are rewriting, pi-calculus, lambda-calculus, formal languages, proof systems, type theory, mobile processes, automata theory, predicate logic, etc.

Produktinformation

Utgivningsdatum2000-03-15
Mått155 x 233 x 23 mm
Vikt616 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor398
Upplaga2000
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540672579

Tillhör följande kategorier

Norm Functions for Probabilistic Bisimulations with Delays.- Constructor Subtyping in the Calculus of Inductive Constructions.- Verifying Performance Equivalence for Timed Basic Parallel Processes.- On Word Rewriting Systems Having a Rational Derivation.- Proof Nets and Explicit Substitutions.- Typing Local Definitions and Conditional Expressions with Rank 2 Intersection (Extended Abstract).- Hierarchical Graph Transformation.- A Program Refinement Framework Supporting Reasoning about Knowledge and Time.- A Higher-Order Simulation Relation for System F.- Probabilistic Asynchronous ?-Calculus.- Constructive Data Refinement in Typed Lambda Calculus.- On Recognizable Stable Trace Languages.- The State Explosion Problem from Trace to Bisimulation Equivalence.- A Proof System for Timed Automata.- Categorical Models for Intuitionistic and Linear Type Theory.- Locality and Polyadicity in Asynchronous Name-Passing Calculi.- On Rational Graphs.- Sequential and Concurrent Abstract Machines for Interaction Nets.- On Synchronous and Asynchronous Mobile Processes.- Type Inference for First-Order Logic.- An Algebraic Foundation for Adaptive Programming.- Predicate Logic and Tree Automata with Tests.- Compositional Verification in Linear-Time Temporal Logic.- On the Semantics of Refinement Calculi.- Subtyping and Typing Algorithms for Mobile Ambients.