This Festschrift volume contains papers presented at a conference, Prakash Fest, held in honor of Prakash Panangaden, in Oxford, UK, in May 2014, to celebrate his 60th birthday. Prakash Panangaden has worked on a large variety of topics including probabilistic and concurrent computation, logics and duality and quantum information and computation. Despite the enormous breadth of his research, he has made significant and deep contributions. For example, he introducedlogic and a real-valued interpretation of the logic to capture equivalence of probabilistic processes quantitatively. The 25 papers included in this volume were carefully reviewed. They cover a large variety of topics in theoretical computer science."

This book constitutes the thoroughly refereed post-conference proceedings of the 7th International Symposium on Trustworthy Global Computing, TGC 2012, held in Newcastle upon Tyne, UK, in September 2012. The 9 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 14 submissions. The papers cover a wide range of topics in the area of global computing and reliable computation in the so-called global computers, i.e., those computational abstractions emerging in large-scale infrastructures such as service-oriented architectures, autonomic systems and cloud computing, providing frameworks, tools, algorithms and protocols for designing open-ended, large-scale applications and for reasoning about their behavior and properties in a rigorous way.

This book constitutes the thoroughly refereed post-conference proceedings of the Joint Workshop on Theory of Security and Applications (formely known as ARSPA-WITS), TOSCA 2011, held in Saarbrucken, Germany, in March/April 2011, in association with ETAPS 2011. The 9 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 24 submissions. The papers feature topics including various methods in computer security, including the formal specification, analysis and design of security protocols and their applications, the formal definition of various aspects of security such as access control mechanisms, mobile code security and denial-of-service attacks, and the modeling of information flow and its application.

This book constitutes the refereed proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2009, held in Spindleruv Mlyn, Czech Republic, in January 2009.

The 49 revised full papers, presented together with 9 invited contributions, were carefully reviewed and selected from 132 submissions. SOFSEM 2009 was organized around the following four tracks: Foundations of Computer Science; Theory and Practice of Software Services; Game Theoretic Aspects of E-commerce; and Techniques and Tools for Formal Verification.

This volume contains the proceedings of the 19th International Conference on Logic Programming, ICLP 2003, which was held at the Tata Institute of F- damental Research in Mumbai, India, during 9-13 December, 2003. ICLP 2003 was colocated with the 8th Asian Computing Science Conference, ASIAN 2003, andwasfollowedbythe23rdConferenceonFoundationsofSoftwareTechnology and Theoretical Computer Science, FSTTCS 2003. The latter event was hosted by the Indian Institute of Technology in Mumbai. In addition, there were ?ve satellite workshops associated with ICLP 2003: - PPSWR 2003, Principles and Practice of Semantic Web Reasoning, 8th Dec. 2003, organized by Fran, cois Bry, Nicola Henze, and Jan Maluszynski. - COLOPS 2003, COnstraint & LOgic Programming in Security, 8th Dec. 2003, organized by Martin Leucker, Justin Pearson, Fred Spiessens, and Frank D. Valencia. - WLPE 2003, Workshop on Logic Programming Environments, organized by Alexander Serebrenik and Fred Mesnard. - CICLOPS2003, ImplementationofConstraintandLOgicProgrammingS- tems, 14th Dec. 2003, organized by Michel Ferreira and Ricardo Lopes. - SVV 2003, Software Veri?cation and Validation, 14th Dec. 2003, organized by Sandro Etalle, Supratik Mukhopadhyay, and Abhik Roychoudhury."

This volume contains the proceedings of the 11th International Conference on Concurrency Theory (CONCUR 2000) held in State College, Pennsylvania, USA, during 22-25 August 2000. The purpose of the CONCUR conferences is to bring together researchers, developers, and students in order to advance the theory of concurrency and promote its applications. Interest in this topic is continuously growing, as a consequence of the importance and ubiquity of concurrent systems and their - plications, and of the scienti?c relevance of their foundations. The scope covers all areas of semantics, logics, and veri?cation techniques for concurrent systems. Topics include concurrency related aspects of: models of computation, semantic domains, process algebras, Petri nets, event structures, real-time systems, hybrid systems, decidability, model-checking, veri?cation techniques, re?nement te- niques, term and graph rewriting, distributed programming, logic constraint p- gramming, object-oriented programming, typing systems and algorithms, case studies, tools, and environments for programming and veri?cation. The ?rst two CONCUR conferences were held in Amsterdam (NL) in 1990 and 1991. The following ones in Stony Brook (USA), Hildesheim (D), Uppsala (S), Philadelphia (USA), Pisa (I), Warsaw (PL), Nice (F), and Eindhoven (NL). The proceedings have appeared in Springer LNCS, as Volumes 458, 527, 630, 715, 836, 962, 1119, 1243, 1466, and 1664.

This book constitutes the refereed proceedings of the 10th International Symposium on Programming Languages, Implementations, Logics, and Programs, PLILP'98, held jointly with the 6th International Conference on Algebraic and Logic Programming, ALP'98, in Pisa, Italy, in September 1998.
The 26 revised full papers presented were carefully reviewed and selected from a total of 68 submissions. Also included are two invited papers and abstracts of two tutorials. The papers are organized in topical sections on verification, logic programming, static analysis, software methodologies, object oriented programming, term rewriting, functional programming, metaprogramming, optimal evaluation, integration, and constraint solving.

This book presents a comprehensive mathematical theory that explains precisely what information flow is, how it can be assessed quantitatively - so bringing precise meaning to the intuition that certain information leaks are small enough to be tolerated - and how systems can be constructed that achieve rigorous, quantitative information-flow guarantees in those terms. It addresses the fundamental challenge that functional and practical requirements frequently conflict with the goal of preserving confidentiality, making perfect security unattainable. Topics include: a systematic presentation of how unwanted information flow, i.e., "leaks", can be quantified in operationally significant ways and then bounded, both with respect to estimated benefit for an attacking adversary and by comparisons between alternative implementations; a detailed study of capacity, refinement, and Dalenius leakage, supporting robust leakage assessments; a unification of information-theoretic channels and information-leaking sequential programs within the same framework; and a collection of case studies, showing how the theory can be applied to interesting realistic scenarios. The text is unified, self-contained and comprehensive, accessible to students and researchers with some knowledge of discrete probability and undergraduate mathematics, and contains exercises to facilitate its use as a course textbook.

This book constitutes the proceedings of the 34th IFIP WG 6.1 International Conference on Formal Techniques for Distributed Objects, Components and Systems, FORTE 2014, held in Berlin, Germany, in June 2014, as part of the 9th International Federated Conference on Distributed Computing Techniques, DisCoTec 2014. The 18 revised full papers presented were carefully reviewed and selected from 50 submissions. The papers present a wide range of topics on specification languages and type systems, monitoring and testing, security analysis and bisimulation, abstraction and reduction.

In recent years, the growing popularity of mobile devices equipped with GPS chips, in combination with the increasing availability of wireless data connections, has led to an incremental rise in the use of Location-Based Services (LBSs), namely applications in which a user obtains, typically in real-time, a service related to his current location. The growing popularity of location-based services, allowing for the collection of vast amounts of information regarding users' location, has started raising serious privacy concerns. Methods for Location Privacy: A Comparative Overview examines the various kinds of privacy breaches that may arise due to the use of LBSs, and considers and compares some of the mechanisms and the metrics that have been proposed to protect user privacy, focusing in particular on a comparison between probabilistic spatial obfuscation techniques.