FSTTCS 2006: foundations of software technology and theoretical computer science [electronic resource]


Book Description

This book constitutes the refereed proceedings of the 26th International Conference on the Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2006, held in Kolkata, India, in December 2006. It contains 38 papers that cover a broad variety of current topics from the theory of computing, ranging from formal methods, discrete mathematics, complexity theory, and automata theory to theoretical computer science in general.







Optimized Cloud Resource Management and Scheduling


Book Description

Optimized Cloud Resource Management and Scheduling identifies research directions and technologies that will facilitate efficient management and scheduling of computing resources in cloud data centers supporting scientific, industrial, business, and consumer applications. It serves as a valuable reference for systems architects, practitioners, developers, researchers and graduate level students. Explains how to optimally model and schedule computing resources in cloud computing Provides in depth quality analysis of different load-balance and energy-efficient scheduling algorithms for cloud data centers and Hadoop clusters Introduces real-world applications, including business, scientific and related case studies Discusses different cloud platforms with real test-bed and simulation tools




Modelling and implementation of a microscopic traffic simulation system


Book Description

This thesis presents the foundations, the initial state, and the progress made in modelling and implementing a real-world and real-time online microscopic traffic simulation system for highway traffic. To successfully model and implement such a simulation system, this thesis recommends the use of a number of formal methods applied at the right places. As part of the recommendation, this thesis proposes a microscopic traffic simulation system. To explore the feasibility and the potential of the recommended methods, it observes and examines the proposed system from multiple views and under various different aspects. As part of the examination, this thesis provides a (semi-)formal specification, a model implementation, an implementation of a productive system, and the benefits that result from validating such a system. The results and any proper application of them have the potential to increase the reliability and the trustworthiness for any future implementation of the proposed simulation system. The presented results additionally motivate to apply the proposed approach to similar simulation systems. The thesis concludes the presentation of the results with some considerations for future implementations.




Automata on Infinite Words


Book Description







Foundations of Probabilistic Programming


Book Description

This book provides an overview of the theoretical underpinnings of modern probabilistic programming and presents applications in e.g., machine learning, security, and approximate computing. Comprehensive survey chapters make the material accessible to graduate students and non-experts. This title is also available as Open Access on Cambridge Core.




FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science


Book Description

This book constitutes the refereed proceedings of the 26th International Conference on the Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2006, held in Kolkata, India, in December 2006. It contains 38 papers that cover a broad variety of current topics from the theory of computing, ranging from formal methods, discrete mathematics, complexity theory, and automata theory to theoretical computer science in general.




Handbook of Model Checking


Book Description

Model checking is a computer-assisted method for the analysis of dynamical systems that can be modeled by state-transition systems. Drawing from research traditions in mathematical logic, programming languages, hardware design, and theoretical computer science, model checking is now widely used for the verification of hardware and software in industry. The editors and authors of this handbook are among the world's leading researchers in this domain, and the 32 contributed chapters present a thorough view of the origin, theory, and application of model checking. In particular, the editors classify the advances in this domain and the chapters of the handbook in terms of two recurrent themes that have driven much of the research agenda: the algorithmic challenge, that is, designing model-checking algorithms that scale to real-life problems; and the modeling challenge, that is, extending the formalism beyond Kripke structures and temporal logic. The book will be valuable for researchers and graduate students engaged with the development of formal methods and verification tools.




Modeling Time in Computing


Book Description

Models that include a notion of time are ubiquitous in disciplines such as the natural sciences, engineering, philosophy, and linguistics, but in computing the abstractions provided by the traditional models are problematic and the discipline has spawned many novel models. This book is a systematic thorough presentation of the results of several decades of research on developing, analyzing, and applying time models to computing and engineering. After an opening motivation introducing the topics, structure and goals, the authors introduce the notions of formalism and model in general terms along with some of their fundamental classification criteria. In doing so they present the fundamentals of propositional and predicate logic, and essential issues that arise when modeling time across all types of system. Part I is a summary of the models that are traditional in engineering and the natural sciences, including fundamental computer science: dynamical systems and control theory; hardware design; and software algorithmic and complexity analysis. Part II covers advanced and specialized formalisms dealing with time modeling in heterogeneous software-intensive systems: formalisms that share finite state machines as common “ancestors”; Petri nets in many variants; notations based on mathematical logic, such as temporal logic; process algebras; and “dual-language approaches” combining two notations with different characteristics to model and verify complex systems, e.g., model-checking frameworks. Finally, the book concludes with summarizing remarks and hints towards future developments and open challenges. The presentation uses a rigorous, yet not overly technical, style, appropriate for readers with heterogeneous backgrounds, and each chapter is supplemented with detailed bibliographic remarks and carefully chosen exercises of varying difficulty and scope. The book is aimed at graduate students and researchers in computer science, while researchers and practitioners in other scientific and engineering disciplines interested in time modeling with a computational flavor will also find the book of value, and the comparative and conceptual approach makes this a valuable introduction for non-experts. The authors assume a basic knowledge of calculus, probability theory, algorithms, and programming, while a more advanced knowledge of automata, formal languages, and mathematical logic is useful.