Bøger af Alessandro Aldini

This volume presents the set of papers accompanying some of the lectures of the 10th International School on Formal Methods for the Design of Computer, Communication and Software Systems (SFM). Thisseriesofschoolsaddressestheuseofformalmethodsincomputerscience as a prominent approachto the rigorousdesign of the above-mentionedsystems. The main aim of the SFM series is to o?er a good spectrum of current research in foundations as well as applications of formal methods, which can be of help for graduate students and young researchers who intend to approach the ?eld. SFM 2010 was devoted to formal methods for quantitative aspects of p- gramminglanguagesandcoveredseveraltopicsincludingprobabilisticandtimed models, model checking, static analysis, quantum computing, real-time and - bedded systems, and security. This volume comprises four articles. The paper by Di Pierro, Hankin, and Wiklicky investigates the relation between the operational semantics of pro- bilistic programming languages and discrete-time Markov chains and presents a framework for probabilistic program analysis inspired by classical abstract interpretation. Broadbent, Fitzsimons, and Kashe? review the mathematical model underlying measurement-based quantum computation, a novel approach to quantum computation where measurement is the main driving force of c- putation instead of the unitary operations of the more traditional quantum c- cuit model. The paper by Malacaria and Heusser illustrates the informati- theoretical basis of quantitative information ?ow by showing the relationship betweenlattices, partitions, andinformation-theoreticalconcepts, aswellastheir applicabilitytoquantifyleakageofcon?dentialinformationinprograms. Finally, Wolter and Reinecke discuss the trade-o? between performance and security by formulating metrics that explicitly express the trade-o? and by showing how to ?nd system parameters that optimize those metri

Concurrency theory, software architecture, system modeling and verification, and dependability and performance evaluation may seem unrelated disciplines, but in reality they are deeply intertwined and should be part of an integrated view in order to successfully manage the increasing complexity of software systems today.This book introduces a process algebraic approach to software architecture design. Process algebra, originally conceived for reasoning about the semantics of concurrent programs, provides a foundational basis for the modeling and verification of functional and nonfunctional aspects of communicating concurrent systems. This can be exploited at the software architecture level of design to improve the formality of design documents and make possible the analysis of system properties at the early design stages.The first part of the book offers an overview of the concepts and results of process algebra theory providing background material on the syntax and semantics for process calculi as well as on the bisimulation, testing, and trace approaches to the definition of behavioral equivalences for nondeterministic, deterministically timed, and stochastically timed processes.Part two gives guidelines for a principled transformation of process algebra into an architectural description language, before demonstrating how to use process algebraic techniques to address the detection of architecture-level mismatches, performance-driven selection among alternative designs, and the achievement of a tradeoff between dependability features and performance indices.Graduate students and software professionals, will find A Process Algebraic Approach to Software Architecture Design a useful addition to their bookshelf.

This book presents a new paradigm that allows modeling and analysis of software applications at an early stage of the design process. It covers foundational aspects before introducing guidelines and methodologies to exemplify case studies.