Mathematical Foundations of Advanced Informatics


Book Description

The books in this trilogy capture the foundational core of advanced informatics. The authors make the foundations accessible, enabling students to become effective problem solvers. This first volume establishes the inductive approach as a fundamental principle for system and domain analysis. After a brief introduction to the elementary mathematical structures, such as sets, propositional logic, relations, and functions, the authors focus on the separation between syntax (representation) and semantics (meaning), and on the advantages of the consistent and persistent use of inductive definitions. They identify compositionality as a feature that not only acts as a foundation for algebraic proofs but also as a key for more general scalability of modeling and analysis. A core principle throughout is invariance, which the authors consider a key for the mastery of change, whether in the form of extensions, transformations, or abstractions. This textbook is suitable for undergraduate and graduate courses in computer science and for self-study. Most chapters contain exercises and the content has been class-tested over many years in various universities.




Mathematics for Informatics and Computer Science


Book Description

How many ways do exist to mix different ingredients, how many chances to win a gambling game, how many possible paths going from one place to another in a network ? To this kind of questions Mathematics applied to computer gives a stimulating and exhaustive answer. This text, presented in three parts (Combinatorics, Probability, Graphs) addresses all those who wish to acquire basic or advanced knowledge in combinatorial theories. It is actually also used as a textbook. Basic and advanced theoretical elements are presented through simple applications like the Sudoku game, search engine algorithm and other easy to grasp applications. Through the progression from simple to complex, the teacher acquires knowledge of the state of the art of combinatorial theory. The non conventional simultaneous presentation of algorithms, programs and theory permits a powerful mixture of theory and practice. All in all, the originality of this approach gives a refreshing view on combinatorial theory.




Mathematical Foundations of Advanced Informatics


Book Description

The books in this trilogy capture the foundational core of advanced informatics. The authors make the foundations accessible, enabling students to become effective problem solvers. This first volume establishes the inductive approach as a fundamental principle for system and domain analysis. After a brief introduction to the elementary mathematical structures, such as sets, propositional logic, relations, and functions, the authors focus on the separation between syntax (representation) and semantics (meaning), and on the advantages of the consistent and persistent use of inductive definitions. They identify compositionality as a feature that not only acts as a foundation for algebraic proofs but also as a key for more general scalability of modeling and analysis. A core principle throughout is invariance, which the authors consider a key for the mastery of change, whether in the form of extensions, transformations, or abstractions. This textbook is suitable for undergraduate and graduate courses in computer science and for self-study. Most chapters contain exercises and the content has been class-tested over many years in various universities.




Mathematical Foundation of Computer Science


Book Description

The Interesting Feature Of This Book Is Its Organization And Structure. That Consists Of Systematizing Of The Definitions, Methods, And Results That Something Resembling A Theory. Simplicity, Clarity, And Precision Of Mathematical Language Makes Theoretical Topics More Appealing To The Readers Who Are Of Mathematical Or Non-Mathematical Background. For Quick References And Immediate Attentions3⁄4Concepts And Definitions, Methods And Theorems, And Key Notes Are Presented Through Highlighted Points From Beginning To End. Whenever, Necessary And Probable A Visual Approach Of Presentation Is Used. The Amalgamation Of Text And Figures Make Mathematical Rigors Easier To Understand. Each Chapter Begins With The Detailed Contents, Which Are Discussed Inside The Chapter And Conclude With A Summary Of The Material Covered In The Chapter. Summary Provides A Brief Overview Of All The Topics Covered In The Chapter. To Demonstrate The Principles Better, The Applicability Of The Concepts Discussed In Each Topic Are Illustrated By Several Examples Followed By The Practice Sets Or Exercises.




Concise Guide to Software Verification


Book Description

This textbook overviews the whole spectrum of formal methods and techniques that are aimed at verifying correctness of software, and how they can be used in practice. It focuses on techniques whereby the user has some control over the properties that are being checked. More specifically, it shows a wide range of techniques covering the whole spectrum: from abstract system design to implementation, from bug finding to full proofs, and from techniques that are push-button by design and give a yes/no answer to techniques that require the user to provide explicit guidance to steer the analysis process. Topics and features: Covers a broad spectrum of software verification techniques, from model checking to annotation checking Provides numerous examples to demonstrate the techniques Focuses on how techniques can be used (and the main ideas behind how they work), as opposed to how they are implemented Explains strengths and weaknesses of the techniques, providing insight into when to use which technique in practice This unique textbook has been written primarily for master’s level students in computer science studying embedded systems and specializing in software technology. The book will also be of interest for students studying cyber security and data science technology, as well as for system or software developers interested in techniques that offer formal guarantees about software.




Models, Mindsets, Meta: The What, the How, and the Why Not?


Book Description

This Festschrift volume is published in honor of Bernhard Steffen, Professor at the Technical University of Dortmund, on the occasion of his 60th birthday. His vision as well as his theoretical and practical work span the development and implementation of novel, specific algorithms, and the establishment of cross-community relationships with the effect to obtain simpler, yet more powerful solutions. He initiated many new lines of research through seminal papers that pioneered various fields, starting with the Concurrency Workbench, a model checking toolbox that significantly influenced the research and development of mode based high assurance systems worldwide. The contributions in this volume reflect the breadth and impact of his work. The introductory paper by the volume editors, the 23 full papers and two personal statements relate to Bernhard’s research and life. This volume, the talks and the entire B-Day at ISoLA 2018 are a tribute to the first 30 years of Bernhard’s passion, impact and vision for many facets of computer science in general and for formal methods in particular. Impact and vision include the many roles that formal methods-supported software development should play in education, in industry and in society.




Leveraging Applications of Formal Methods, Verification and Validation: Tools and Trends


Book Description

The four-volume set LNCS 12476 - 12479 constitutes the refereed proceedings of the 9th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2020, which was planned to take place during October 20–30, 2020, on Rhodes, Greece. The event itself was postponed to 2021 due to the COVID-19 pandemic. The papers presented were carefully reviewed and selected for inclusion in the proceedings. Each volume focusses on an individual topic with topical section headings within the volume: Part I, Verification Principles: Modularity and (De-)Composition in Verification; X-by-Construction: Correctness meets Probability; 30 Years of Statistical Model Checking; Verification and Validation of Concurrent and Distributed Systems. Part II, Engineering Principles: Automating Software Re-Engineering; Rigorous Engineering of Collective Adaptive Systems. Part III, Applications: Reliable Smart Contracts: State-of-the-art, Applications, Challenges and Future Directions; Automated Verification of Embedded Control Software; Formal methods for DIStributed COmputing in future RAILway systems. Part IV, Tools and Trends: From Verification to Explanation; Engineering of Digital Twins for Cyber-Physical Systems; Software Verification Tools.




Mathematical Foundations of Information Theory


Book Description

First comprehensive introduction to information theory explores the work of Shannon, McMillan, Feinstein, and Khinchin. Topics include the entropy concept in probability theory, fundamental theorems, and other subjects. 1957 edition.




Informatics in Schools. Fundamentals of Computer Science and Software Engineering


Book Description

This book constitutes the proceedings of the 11th International Conference on Informatics in Schools: Situation, Evolution and Perspectives, ISSEP 2018, held in St. Petersburg, Russia, in October 2018. The 29 full papers presented in this volume were carefully reviewed and selected from 74 submissions. They were organized in topical sections named: role of programming and algorithmics in informatics for pupils of all ages; national concepts of teaching informatics; teacher education in informatics; contests and competitions in informatics; socio-psychological aspects of teaching informatics; and computer tools in teaching and studying informatics.




Mathematical Foundations of Information Retrieval


Book Description

This book offers a comprehensive and consistent mathematical approach to information retrieval (IR) without which no implementation is possible, and sheds an entirely new light upon the structure of IR models. It contains the descriptions of all IR models in a unified formal style and language, along with examples for each, thus offering a comprehensive overview of them. The book also creates mathematical foundations and a consistent mathematical theory (including all mathematical results achieved so far) of IR as a stand-alone mathematical discipline, which thus can be read and taught independently. Also, the book contains all necessary mathematical knowledge on which IR relies, to help the reader avoid searching different sources. Audience: The book will be of interest to computer or information scientists, librarians, mathematicians, undergraduate students and researchers whose work involves information retrieval.