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 /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Nielsen, Mogens (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Engberg, Uffe (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
• Έκδοση: 1st ed. 2002.
• Σειρά: Lecture Notes in Computer Science, 2303
• Θέματα: Computers.; Software engineering.; Computer logic.; Mathematical logic.; Programming languages (Electronic computers).; Theory of Computation.; Software Engineering/Programming and Operating Systems.; Logics and Meanings of Programs.; Mathematical Logic and Formal Languages.; Programming Languages, Compilers, Interpreters.; Software Engineering.

ETAPS 2002 is the ?fth instance of the European Joint Conferences on Theory and Practice of Software. ETAPS is an annual federated conference that was established in 1998by combining a number of existing and new conferences. This year it comprises ?ve conferences (FOSSACS, FASE, ESOP, CC, TACAS), th...

Πίνακας περιεχομένων:

• 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.