Foundations of Software Science and Computation Structures
Subtitle: 4th International Conference, FOSSACS 2001 Held as Part of the Joint European Conferences on ... (Lecture Notes in Computer Science)
Contributors: Furio Honsell (Editor); Marino Miculan (Editor)
Edition: 1 edition
Publisher: Springer
Published: April 27, 2001
Language: eng
Format: Paperback
Number of pages: 413
ISBN-13: 9783540418641
Subjects: Software engineering; Software Design; Congresses; Systems Analysis (Computer Science); Computers; Computers - Languages / Programming; Programming Languages - General; Computer Books: General; Programming - Systems Analysis & Design; Logic Design; Programming - Software Development; Computers / Logic Design; complexity theory; computational structures; formal methods; formal verification; mathematical foundations; Computer Science; System analysis; Computer software
Description: Foundations of Software Science and Computation Structures: 4th International Conference, FOSSACS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2–6, 2001 Proceedings<br />Author: Furio Honsell, Marino Miculan<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-41864-1<br /> DOI: 10.1007/3-540-45315-6<br /><br />Table of Contents:<p></p><ul><li>Adequacy for Algebraic Effects
</li><li>Secrecy Types for Asymmetric Communication
</li><li>Axiomatizing Tropical Semirings
</li><li>Type Isomorphisms and Proof Reuse in Dependent Type Theory
</li><li>On the Duality between Observability and Reachability
</li><li>The Finite Graph Problem for Two-Way Alternating Automata
</li><li>High-Level Petri Nets as Type Theories in the Join Calculus
</li><li>Temporary Data in Shared Dataspace Coordination Languages
</li><li>On Garbage and Program Logic
</li><li>The Complexity of Model Checking Mobile Ambients
</li><li>The Rho Cube
</li><li>Type Inference with Recursive Type Equations
</li><li>On the Modularity of Deciding Call-by-Need
</li><li>Synchronized Tree Languages Revisited and New Applications
</li><li>Computational Completeness of Programming Languages Based on Graph Transformation
</li><li>Axioms for Recursion in Call-by-Value
</li><li>Class Analysis of Object-Oriented Programs through Abstract Interpretation
</li><li>On the Complexity of Parity Word Automata
</li><li>Foundations for a Graph-Based Approach to the Specification of Access Control Policies
</li><li>Categories of Processes Enriched in Final Coalgebras</li></ul>