This book constitutes the refereed proceedings of the 6th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2003, held in Warsaw, Poland in April 2003. The 26 revised full papers presented together with an invited paper were carefully reviewed and selected from 96 submissions. Among the topics covered are algebraic models; automata and language theory; behavioral equivalences; categorical models; computation processes over discrete and continuous data; computation structures; logics of programs; models of concurrent, reactive, distributed, and mobile systems; process algebras and calculi; semantics of programming languages; software specification and refinement; transition systems; and type systems and type theory.

This book constitutes the thoroughly refereed post-workshop proceedings of the 5th International Workshop on Formal Aspects in Security and Trust, FAST 2008, held under the auspices of IFIP WG 1.7 in Malaga, Spain, in October 2008 as a satellite event of 13th European Symposium on Research in Computer Security. The 20 revised papers presented were carefully reviewed and selected from 59 submissions. The papers focus of formal aspects in security, trust and reputation, security protocol design and analysis, logics for security and trust, trust-based reasoning, distributed trust management systems, digital asset protection, data protection, privacy and id management issues, information flow analysis, language-based security, security and trust aspects in ubiquitous computing, validation/analysis tools, Web/grid services security/trust/privacy, security and risk assessment, resource and access control, as well as case studies.

Security is a rapidly growing area of computer science, with direct and increasing relevance to real-life applications, such as Internet transactions, e-commerce, information protection, network and systems security, etc. Foundations for the analysis and design of security features of such applications are badly needed in order to validate and prove their correctness. This book presents thoroughly revised versions of six tutorial lectures given by leading researchers during two International Schools on Foundations of Security Analysis and Design, FOSAD 2001/2002, held in Bertinoro, Italy, in September 2001 and September 2002. The lectures are devoted to: - Formal Approaches to Approximating Noninterference Properties - The Key Establishment Problem - Name-Passing Calculi and Cryptoprimitives - Classification of Security Properties; Network Security - Cryptographic Algorithms for Multimedia Traffic - Security for Mobility

This book constitutes the thoroughly refereed post-proceedings of the 14th International Workshop on Security Protocols, held in Cambridge, UK, in March 2006. The 21 revised full papers presented together with edited transcriptions of some of the discussions following the presentations have passed through multiple rounds of reviewing, revision, and selection. Among the topics addressed are authentication, anonymity, cryptographics and biometrics, cryptographic protocols, network security, privacy, SPKI, user-friendliness, access control, API security, costs of security, and others.

This book constitutes the refereed proceedings of the 9th International Static Analysis Symposium, SAS 2002, held in Madrid, Spain in September 2002. The 32 revised full papers presented were carefully reviewed and selected from 86 submissions. The papers are organized in topical sections on theory, data structure analysis, type inference, analysis of numerical problems, implementation, data flow analysis, compiler optimizations, security analyses, abstract model checking, semantics and abstract verification, and termination analysis.

This book constitutes the refereed proceedings of the 16th European Symposium on Programming, ESOP 2007, held in Braga, Portugal in March/April 2007. It covers models and languages for Web services, verification, term rewriting, language based security, logics and correctness proofs, static analysis and abstract interpretation, semantic theories for object oriented languages, process algebraic techniques, applicative programming, and types for systems properties.

Security protocols are widely used to ensure secure communications over insecure networks, such as the internet or airwaves. These protocols use strong cryptography to prevent intruders from reading or modifying the messages. However, using cryptography is not enough to ensure their correctness. Combined with their typical small size, which suggests that one could easily assess their correctness, this often results in incorrectly designed protocols. The authors present a methodology for formally describing security protocols and their environment. This methodology includes a model for describing protocols, their execution model, and the intruder model. The models are extended with a number of well-defined security properties, which capture the notions of correct protocols, and secrecy of data. The methodology can be used to prove that protocols satisfy these properties. Based on the model they have developed a tool set called Scyther that can automatically find attacks on security protocols or prove their correctness. In case studies they show the application of the methodology as well as the effectiveness of the analysis tool. The methodology’s strong mathematical basis, the strong separation of concerns in the model, and the accompanying tool set make it ideally suited both for researchers and graduate students of information security or formal methods and for advanced professionals designing critical security protocols.

This book constitutes the refereed proceedings of the 12th International Conference on Algebraic Methodology and Software Technology, AMAST 2008, held in Urbana, IL, USA, in July 2008. The 28 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 58 submissions. Among the topics covered are all current issues in formal methods related to algebraic and logical foundations, software technology, and to programming methodology including concurrent and reactive systems, evolutionary software/adaptive systems, logic and functional programming, object paradigms, constraint programming and concurrency, program verification and transformation, programming calculi, specification languages and tools, formal specification and development case studies, logic, category theory, relation algebra, computational algebra, algebraic foundations for languages and systems, coinduction, theorem proving and logical frameworks for reasoning, logics of programs, as well as algebra and coalgebra.

"This book provides empirical research on the engineering of social network infrastructures, the development of novel applications, and the impact of social network- based services over the internet"--Provided by publisher.