Title: Foundations of Software Science and Computation Structures
Description: Foundations of Software Science and Computation Structures: 7th International Conference, FOSSACS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 – April 2, 2004. Proceedings<br />Author: Igor Walukiewicz<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-21298-0<br /> DOI: 10.1007/b95995<br /><br />Table of Contents:<p></p><ul><li>Intruder Theories (Ongoing Work)
</li><li>Theories for the Global Ubiquitous Computer
</li><li>Choice in Dynamic Linking
</li><li>Soft lambda-Calculus: A Language for Polynomial Time Computation
</li><li>On the Existence of an Effective and Complete Inference System for Cryptographic Protocols
</li><li>Hypergraphs and Degrees of Parallelism: A Completeness Result
</li><li>Behavioral and Spatial Observations in a Logic for the π-Calculus
</li><li>Election and Local Computations on Edges
</li><li>Decidability of Freshness, Undecidability of Revelation
</li><li>LTL over Integer Periodicity Constraints
</li><li>Unifying Recursive and Co-recursive Definitions in Sheaf Categories
</li><li>Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting
</li><li>A Denotational Account of Untyped Normalization by Evaluation
</li><li>On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds
</li><li>Specifying and Verifying Partial Order Properties Using Template MSCs
</li><li>Angelic Semantics of Fine-Grained Concurrency
</li><li>On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi
</li><li>safeDpi: A Language for Controlling Mobile Code
</li><li>Distance Desert Automata and the Star Height One Problem
</li><li>Adhesive Categories</li></ul>
Subjects: System analysis, Congresses, Computer software