Description
Springer Foundations Of Software Science And Computational Structures 13Th International Conference2010 Edition by Luke Ong
ETAPS 2010 was the 13th instance of the European Joint Conferences on T- oryand Practiceof Software. ETAPS is anannual federatedconference that was establishedin1998bycombininganumberofexistingandnewconferences. This yearitcomprisedtheusual?vesisterconferences(CCESOPFASEFOSSACS TACAS) 19 satellite workshops (ACCAT ARSPA-WITS Bytecode CMCS COCV DCC DICE FBTC FESCA FOSS-AMA GaLoP GT-VMT LDTA MBT PLACES QAPL SafeCert WGT and WRLA) and seven invited l- tures (excluding those that were speci?c to the satellite events). The ?ve main conferences this year received 497 submissions (including 31 tool demonstration papers) 130 of which were accepted (10 tool demos) giving an overall acc- tance rate of 26% with most of the conferences at around 24%. Congratulations thereforetoalltheauthorswhomadeittothe?nalprogramme!Ihopethatmost of the other authors will still have found a way of participating in this exciting event and that you will all continue submitting to ETAPS and contributing to make of it the best conference on software science and engineering. The events that comprise ETAPS address various aspects of the system - velopment process including speci?cation design implementation analysis and improvement.The languages methodologies and tools which support these - tivities are all well within its scope. Di?erent blends of theory and practice are representedwithaninclinationtowardtheorywithapracticalmotivationonthe one hand and soundly based practice on the other. Many of the issues involved in software design apply to systems in general including hardware systems and the emphasis on software is not intended to be exclusive. ETAPS is a confederation in which each event retains its own identity with a separate Programme Committee and proceedings. Table of contents : FoSSaCS 2010 Invited Talk.- to Decidability of Higher-Order Matching.- Semantics of Programming Languages.- A Semantic Foundation for Hidden State.- Linearly-Used Continuations in the Enriched Effect Calculus.- Block Structure vs. Scope Extrusion: Between Innocence and Omniscience.- Completeness for Algebraic Theories of Local State.- Probabilistic and Randomised Computation.- Fair Adversaries and Randomization in Two-Player Games.- Retaining the Probabilities in Probabilistic Testing Theory.- Concurrency and Process Theory.- Forward Analysis of Depth-Bounded Processes.- Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization.- Parameterised Multiparty Session Types.- On the Relationship between Spatial Logics and Behavioral Simulations.- Modal and Temporal Logics.- An Easy Completeness Proof for the Modal ?-Calculus on Finite Trees.- When Model-Checking Freeze LTL over Counter Machines Becomes Decidable.- Model Checking Is Static Analysis of Modal Logic.- Counting CTL.- Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems.- Verification.- Toward a Compositional Theory of Leftist Grammars and Transformations.- Degrees of Lookahead in Regular Infinite Games.- Reachability Analysis of Communicating Pushdown Systems.- The Complexity of Synchronous Notions of Information Flow Security.- Categorical and Coalgebraic Methods.- Monads Need Not Be Endofunctors.- CIA Structures and the Semantics of Recursion.- Coalgebraic Correspondence Theory.- Lambda Calculus and Types.- Untyped Recursion Schemes and Infinite Intersection Types.- Solvability in Resource Lambda-Calculus.- A Hierarchy for Delimited Continuations in Call-by-Name.