Amazon cover image
Image from Amazon.com

Foundations of software science and computation structures : 5th International Conference, FOSSACS 2002, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002, Grenoble, France, April 8-12, 2002 : proceedings / Mogens Nielsen, Uffe Engberg, eds.

By: Contributor(s): Material type: TextTextSeries: Lecture notes in computer science ; 2303.Publication details: Berlin ; New York : Springer, ©2002.Description: 1 online resource (xiii, 433 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540459316
  • 3540459316
Subject(s): Genre/Form: Additional physical formats: Print version:: Foundations of software science and computation structures.DDC classification:
  • 005.1 21
LOC classification:
  • QA76.751 .F67 2002
Other classification:
  • 54.50
  • 54.10
  • 28
  • DAT 300f
  • DAT 500f
  • SS 2002
  • SS 4800
Online resources:
Contents:
Invited Paper -- Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations -- Contributed Papers -- Verification for Java's Reentrant Multithreading Concept -- On the Integration of Observability and Reachability Concepts -- Proving Correctness of Timed Concurrent Constraint Programs -- Generalised Regular MSC Languages -- On Compositional Reasoning in the Spi-calculus -- On Specification Logics for Algebra-Coalgebra Structures: Reconciling Reachability and Observability -- A First-Order One-Pass CPS Transformation -- The Demonic Product of Probabilistic Relations -- Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation -- Varieties of Effects -- A Characterization of Families of Graphs in Which Election Is Possible -- Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds* -- Efficient Type Matching -- Higher-Order Pushdown Trees Are Easy -- Conflict Detection and Resolution in Access Control Policy Specifications -- Logics Admitting Final Semantics -- Model Checking Fixed Point Logic with Chop -- On Model Checking Durational Kripke Structures -- Model-Checking Infinite Systems Generated by Ground Tree Rewriting -- Bounded MSC Communication -- The Informatic Derivative at a Compact Element -- Heterogeneous Development Graphs and Heterogeneous Borrowing -- Notions of Computation Determine Monads -- A Calculus of Circular Proofs and Its Categorical Semantics -- Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes -- Note on the Tableau Technique for Commutative Transition Systems -- A Semantic Basis for Local Reasoning -- Linearity and Bisimulation.
In: Springer Nature eBookSummary: This book constitutes the refereed proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2002, held in Grenoble, France, in April 2002. The 28 revised full papers presented together with an extended abstract of an invited paper were carefully reviewed and selected from a total of 67 submissions. Among the topics addressed are algebraic, categorical, logical, and geometric theories, models and methods which support the specification, synthesis, verification, analysis, and transformation of sequential, concurrent, distributed, and mobile programs and software systems.
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

Includes bibliographical references and index.

This book constitutes the refereed proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2002, held in Grenoble, France, in April 2002. The 28 revised full papers presented together with an extended abstract of an invited paper were carefully reviewed and selected from a total of 67 submissions. Among the topics addressed are algebraic, categorical, logical, and geometric theories, models and methods which support the specification, synthesis, verification, analysis, and transformation of sequential, concurrent, distributed, and mobile programs and software systems.

Invited Paper -- Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations -- Contributed Papers -- Verification for Java's Reentrant Multithreading Concept -- On the Integration of Observability and Reachability Concepts -- Proving Correctness of Timed Concurrent Constraint Programs -- Generalised Regular MSC Languages -- On Compositional Reasoning in the Spi-calculus -- On Specification Logics for Algebra-Coalgebra Structures: Reconciling Reachability and Observability -- A First-Order One-Pass CPS Transformation -- The Demonic Product of Probabilistic Relations -- Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation -- Varieties of Effects -- A Characterization of Families of Graphs in Which Election Is Possible -- Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds* -- Efficient Type Matching -- Higher-Order Pushdown Trees Are Easy -- Conflict Detection and Resolution in Access Control Policy Specifications -- Logics Admitting Final Semantics -- Model Checking Fixed Point Logic with Chop -- On Model Checking Durational Kripke Structures -- Model-Checking Infinite Systems Generated by Ground Tree Rewriting -- Bounded MSC Communication -- The Informatic Derivative at a Compact Element -- Heterogeneous Development Graphs and Heterogeneous Borrowing -- Notions of Computation Determine Monads -- A Calculus of Circular Proofs and Its Categorical Semantics -- Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes -- Note on the Tableau Technique for Commutative Transition Systems -- A Semantic Basis for Local Reasoning -- Linearity and Bisimulation.

Powered by Koha