Search

The ISoLA 2024 proceedings constitutes contributions of the associated events held at the 12th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2024, which took place in Crete, Greece, in October 2024. ISoLA 2024 provides a forum for developers, users, and researchers to discuss issues related to the adoption and use of rigorous tools and methods for the specification, analysis, verification, certification, construction, test, and maintenance of systems from the point of view of their different application domains.

The ISoLA 2024 proceedings constitutes contributions of the associated events held at the 12th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2024, which took place in Crete, Greece, in October 2024. ISoLA 2024 provides a forum for developers, users, and researchers to discuss issues related to the adoption and use of rigorous tools and methods for the specification, analysis, verification, certification, construction, test, and maintenance of systems from the point of view of their different application domains.

This book constitutes the refereed proceedings of the 17th International Conference on Intelligent Computer Mathematics, CICM 2024, held in Montréal, Québec, Canada, during August 5–9, 2024. The 21 full papers presented were carefully reviewed and selected from 28 submissions. These papers have been categorized into the following sections: AI and LLM; Proof Assistants; Logical Frameworks and Transformations; Knowledge Representation and Certification; Proof Search and Formalization & System Descriptions.

This book constitutes the post-conference proceedings of the 17th International Workshop on Coalgebraic Methods in Computer Science, CMCS 2024, colocated with ETAPS 2024, held in Luxembourg in April 2024. The 10 papers included in these proceedings were carefully reviewed and selected from 15 submissions. The papers cover a wide range of topics on theory, logics, and applications of coalgebras.

This is a book about the'Halting Problem', arguably the most (in)famous computer-related problem: can an algorithm decide in finite time whether an arbitrary computer program eventually stops? This seems a dull, petty question: after all, you run the program and wait till it stops. However, what if the program does not stop in a reasonable time, a week, a year, or a decade? Can you infer that it will never stop? The answer is negative. Does this raise your interest? If not, consider these questions: Can mathematics be done by computers only? Can software testing be fully automated? Can you write an anti-virus program which never needs any updates? Can we make the Internet perfectly secure? Your guess is correct: the answer to each question is negative. The Halting Problem is'hidden'in many subjects, from logic (is mathematics free of contradictions?), physics (is quantum randomness perfect?), to philosophy (do humans have free will, or do our brains generate our thoughts and decisions in a deterministic way?) and quantum computing (why we don't have a quantum Halting Problem?) — this book will visit each of them.Written in an informal and thought-provoking language, supported with suggestive illustrations and applications and almost free of arcane mathematics (formal arguments are relegated to particular parts dedicated to the mathematically-oriented reader), the book will stimulate the curiosity and participation of the reader interested in the consequences of the limits of computing and in various attempts to cope with them.

The French School of Programming is a collection of insightful discussions of programming and software engineering topics, by some of the most prestigious names of French computer science. The authors include several of the originators of such widely acclaimed inventions as abstract interpretation, the Caml, OCaml and Eiffel programming languages, the Coq proof assistant, agents and modern testing techniques.The book is divided into four parts: Software Engineering (A), Programming Language Mechanisms and Type Systems (B), Theory (C), and Language Design and Programming Methodology (D). They are preceded by a Foreword by Bertrand Meyer, the editor of the volume, a Preface by Jim Woodcock providing an outsider's appraisal of the French school's contribution, and an overview chapter by Gérard Berry, recalling his own intellectual journey. Chapter 2, by Marie-Claude Gaudel, presents a 30-year perspective on the evolution of testing starting with her own seminal work. In chapter 3, Michel Raynal covers distributed computing with an emphasis on simplicity. Chapter 4, by Jean-Marc Jézéquel, former director of IRISA, presents the evolution of modeling, from CASE tools to SLE and Machine Learning. Chapter 5, by Joëlle Coutaz, is a comprehensive review of the evolution of Human-Computer Interaction. In part B, chapter 6, by Jean-Pierre Briot, describes the sequence of abstractions that led to the concept of agent. Chapter 7, by Pierre-Louis Curien, is a personal account of a journey through fundamental concepts of semantics, syntax and types. In chapter 8, Thierry Coquand presents “some remarks on dependent type theory”. Part C begins with Patrick Cousot's personal historical perspective on his well-known creation, abstract interpretation, in chapter 9. Chapter 10, by Jean-Jacques Lévy, is devoted to tracking redexes in the Lambda Calculus. The final chapter of that part, chapter 11 by Jean-Pierre Jouannaud, presents advances in rewriting systems, specifically the confluence of terminating rewriting computations. Part D contains two longer contributions. Chapter 12 is a review by Giuseppe Castagna of a broad range of programming topics relying on union, intersection and negation types. In the final chapter, Bertrand Meyer covers “ten choices in language design” for object-oriented programming, distinguishing between “right” and “wrong” resolutions of these issues and explaining the rationale behind Eiffel's decisions.This book will be of special interest to anyone with an interest in modern views of programming — on such topics as programming language design, the relationship between programming and type theory, object-oriented principles, distributed systems, testing techniques, rewriting systems, human-computer interaction, software verification… — and in the insights of a brilliant group of innovators in the field.

This volume results from two programs that took place at the Institute for Mathematical Sciences at the National University of Singapore: Aspects of Computation — in Celebration of the Research Work of Professor Rod Downey (21 August to 15 September 2017) and Automata Theory and Applications: Games, Learning and Structures (20-24 September 2021).The first program was dedicated to the research work of Rodney G. Downey, in celebration of his 60th birthday. The second program covered automata theory whereby researchers investigate the other end of computation, namely the computation with finite automata, and the intermediate level of languages in the Chomsky hierarchy (like context-free and context-sensitive languages).This volume contains 17 contributions reflecting the current state-of-art in the fields of the two programs.

This book constitutes the refereed proceedings of the 24th International Conference on Runtime Verification, RV 2024, held in Istanbul, Turkey, during October 15-17, 2024. The 11 full papers, 5 short papers and 2 tool papers included in this book were carefully reviewed and selected from 31 submissions. They were organized in topical sections as follows: Invited Paper; Cyber-physical Systems; Temporal Logics; Speci cation and Visualization; Deep Neural Networks; and Distributed Systems.

This book constitutes revised selected papers from the refereed proceedings of the 15th International Workshop on Rewriting Logic and Its Applications, WRLA 2024, held in Luxembourg City, Luxembourg, during April 6–7, 2024. The 11 full papers included in this book were carefully reviewed and selected from 16 submissions. They focus on several topics, e.g., foundations; rewriting as a logical and semantic framework; rewriting languages; verification techniques; applications; and education.

This book constitutes the proceedings of the Second International Conference on Human and Artificial Rationalities, HAR 2023, which took place in Paris, France, in September 2023. The 18 full and 5 short papers included in this book were carefully reviewed and selected from 39 submissions. They were organized in topical sections as follows: Human and artificial thinking; human thinking and reasoning; neuropsychology and interaction; artificial agents and interaction; and applied reasoning. This volume also contains 2 invited talks in full-paper length.

Jumping Computation: Updating Automata and Grammars for Discontinuous Information Processing is primarily a theoretically oriented treatment of jumping automata and grammars, covering all essential theoretical topics concerning them, including their power, properties, and transformations. From a practical viewpoint, it describes various concepts, methods, algorithms, techniques, case studies and applications based upon these automata and grammars.In today's computerized world, the scientific development and study of computation, referred to as the theory of computation, plays a crucial role. One important branch, language theory, investigates how to define and study languages and their models, which formalize algorithms according to which their computation is executed. These language-defining models are classified into two basic categories: automata, which define languages by recognizing their words, and grammars, which generate them. Introduced many decades ago, these rules reflect classical sequential computation. However, today's computational methods frequently process information in a fundamentally different way, frequently “jumping” over large portions of the information as a whole. This book adapts classical models to formalize and study this kind of computation properly. Simply put, during their language-defining process, these adapted versions, called jumping automata and grammars, jump across the words they work on.The book selects important models and summarizes key results about them in a compact and uniform way. It relates each model to a particular form of modern computation, such as sequential, semi-parallel and totally parallel computation, and explains how the model in question properly reflects and formalizes the corresponding form of computation, thus allowing us to obtain a systematized body of mathematically precise knowledge concerning the jumping computation. The book pays a special attention to power, closure properties, and transformations, and also describes many algorithms that modify jumping grammars and automata so they satisfy some prescribed properties without changing the defined language. The book will be of great interest to anyone researching the theory of computation across the fields of computer science, mathematics, engineering, logic and linguistics.

This book constitutes the refereed proceedings of the 20th International Conference on Formal Aspects of Component Software, FACS 2024, held in Milan, Italy, during September 9-10, 2024. The 7 full papers and 1 short paper included in this book were carefully reviewed and selected from 16 submissions. They are organized in topical sections as follows: verification and testing, formal models, and security and blockchain.

Starting with a Laurea in Ingegneria Elettronica and a PhD in Computer and Systems Engineering at the Politecnico di Torino, Tiziana has stayed faithful to her love of organized management of composable functionalities in software and systems, with building blocks and MDD, and she strives for coherence and alignment in complex systems through verification, model checking and workflow synthesis. Her quest for simplicity spans technologies (low-code/no-code; ITSy project), business (Business Model Canvas; tools for innovative business models) and disciplines with her concept of the Digital Thread, a metaphor for IT-mediated interoperation of reusable and ideally verified tools and systems in new platforms where reuse, repurposing and evolution are supported by design. Her most recent initiative, R@ISE, aims at opening the world of IT production and adaptation to a wider range of users and professions. Tiziana is a cofounder and managing editor of the International Journal on Software Tools for Technology Transfer, she cofounded the ISoLA conference, and cofounded METAFrame Technologies serving as CEO. She is a Fellow of the Society for Design and Process Science and a Fellow and President of the Irish Computer Society. Throughout her career Tiziana's successes have been motivated by how best to advance science and engineering through the implementation of techniques in challenging applications, and the contributions in this volume by leading researchers are representative of a community that shares this drive.

This Festschrift reflects Professor Wang Yi's contributions to the fields of formal methods, real-time systems and scheduling, and multicore systems. Wang Yi received a PhD in Computer Science from Chalmers University of Technology in 1991, since 2000 he has been Chair in Embedded Systems at Uppsala University. He has not only pushed the boundaries of theoretical research but also pioneered practical implementations in software tools that have had a profound impact on both academia and industry. He codeveloped the UPPAAL tool, the foremost system for verifying timed automata, now widely used in both academia and industry. Over the years he expanded his research to include scheduling theories, and he developed the TIMES and TIMES-Pro tools, which enhanced the analysis and implementation of real-time systems. His innovative work has significantly influenced the design and verification of complex, multicore real-time systems. Among many awards, honours, and responsibilities, Wang received a grant from the Knut and Alice Wallenberg Foundation, an ERC Advanced Grant from the European Research Council in 2019, Uppsala University's Rudbeck Medal, the IEEE TCRTS Award for technical achievement and leadership in real-time computing, and the CAV Award; he is a Fellow of the ACM and the IEEE, and a member of the Royal Society of Sciences in Uppsala and the Academia Europaea; and he has chaired major software engineering and embedded system conferences and served on ACM SIGBED and IEEE TCRTS executive committees. His guidance and mentorship have shaped the careers of many researchers and professionals in the field, and the contributions in this volume celebrate his enduring impact.

This book constitutes the proceedings of the 18th International Conference on Reachability Problems, RP 2024, which took place in Vienna, Austria, during September 25–27, 2024. The 13 full papers included in these proceedings were carefully reviewed and selected from 37 submissions. The book also contains two invited talks in full paper length. The contributions in these proceedings cover topics from computability and reachability; automata and complexity; linear systems and recurrences; and games and abstractions.

This Festschrift, dedicated to Jim Woodcock, contains papers written by many of his closest collaborators. After a PhD on software verification at the University of Liverpool, Jim has combined a successful career in academia with outstanding industry research, in particular he has been a pioneer in applying mathematical modelling approaches in critical industries. At GEC's Hirst Research Centre he worked on a novel distributed telephone exchange and a service specification of a PABX exchange. In Oxford he collaborated with IBM Hursley Laboratories on modelling of the CICS transaction processing system, one of the most significant software systems ever. As part of the UK government's cybersecurity strategy, he used Z techniques to develop secure office automation systems and a secure version of UNIX. He worked with the Smith Institute and BR Research to verify the safety of railway signalling systems, approaches developed further in safety-critical control systems for the UK Nuclear Installation Inspectorate and British Energy. He provided a technically complete theory of correctness for Z, verifying its soundness from first principles, and completed the verification of Mondex, a smartcard-based electronic cash system, the first application of a general theory of program correctness to an industrial product. He coordinated the experimental work of the Verified Software Initiative, an international grand challenge. More recently he extended the collection of standard Unifying Theories of Programming (UTP) with work on object orientation and hybrid systems. Currently he is working on a UTP theory of probabilistic programs with application to robotics. Jim has been a lecturer, research fellow, reader and professor at the University of Surrey, the University of Oxford, the University of Kent, and since 2004 the University of York, and he is a visiting professor at the Federal University of Pernambuco and Trinity College Dublin. He is a Fellow of the Royal Academy of Engineering, the British Computer Society, and the Formal Methods Europe association, and he was part of the team that won the Queen's Award for Technological Achievement in 1992. He is the Editor-in-Chief of the ACM journal Formal Aspects of Computing, he has chaired major related academic conferences, and he has contributed to CCITT and Z ISO international standards. Throughout all these activities, Jim has been a guide and inspiration to colleagues and students, and collaborated successfully with researchers in the UK, Brazil, China, France, USA, Ireland, and Singapore. Many of these researchers show in their contributions to this volume the ongoing impact of his work.

This book constitutes the refereed proceedings of the 10th International Conference on Rigorous State-Based Methods, ABZ 2024, held in Bergamo, Italy, during June 25–28, 2024. The 29 papers included in this volume were carefully reviewed and selected from 47 submissions. They were organized in topical sections as follows: research papers; short research papers; case study; doctoral symposium.

This Festschrift, dedicated to Cliff Jones, contains papers written by many of his closest collaborators. Cliff has an exceptional international standing for his groundbreaking research and leadership within the practice of formal methods, his career encompasses significant contributions to academia, industry, policy, and service. Cliff is a Fellow of the Royal Academy of Engineering, ACM, BCS, and IET, and in 2015 he was the inaugural Fellow of the Formal Methods Europe association. His career has included industry research in the UK, Austria and Belgium, a PhD at the University of Oxford, and academic and research roles at the University of Cambridge and the University of Manchester, and since 1999 at Newcastle University. Throughout his career, he has championed the essential role of formalism in design processes. His collaboration at IBM in the 1970s led to the creation of the Vienna Development Method (VDM), a seminal contribution that has influenced both practical industry applications and theoretical advancements. Cliff was the founding editor of the ACM journal Formal Aspects of Computing, a founder of the Formal Methods symposium, and he played a pivotal role in the IFIP Working Groups on Programming Methodology and Verified Software. His policy advocacy has been instrumental in fostering public discourse on the reliability of computing systems. The 30 contributions in this volume are a snapshot of the many current scientific developments inspired by or built upon Cliff's contributions.

This Festschrift, dedicated to Cliff Jones, contains papers written by many of his closest collaborators. Cliff has an exceptional international standing for his groundbreaking research and leadership within the practice of formal methods, his career encompasses significant contributions to academia, industry, policy, and service. Cliff is a Fellow of the Royal Academy of Engineering, ACM, BCS, and IET, and in 2015 he was the inaugural Fellow of the Formal Methods Europe association. His career has included industry research in the UK, Austria and Belgium, a PhD at the University of Oxford, and academic and research roles at the University of Cambridge and the University of Manchester, and since 1999 at Newcastle University. Throughout his career, he has championed the essential role of formalism in design processes. His collaboration at IBM in the 1970s led to the creation of the Vienna Development Method (VDM), a seminal contribution that has influenced both practical industry applications and theoretical advancements. Cliff was the founding editor of the ACM journal Formal Aspects of Computing, a founder of the Formal Methods symposium, and he played a pivotal role in the IFIP Working Groups on Programming Methodology and Verified Software. His policy advocacy has been instrumental in fostering public discourse on the reliability of computing systems. The 30 contributions in this volume are a snapshot of the many current scientific developments inspired by or built upon Cliff's contributions.

This book constitutes the refereed proceedings of the 24th International Conference on Knowledge Engineering and Knowledge Management, EKAW 2024, held in Amsterdam, The Netherlands, during November 26–28, 2024. The 28 full papers presented together were carefully reviewed and selected from 115 submissions. They focus on all aspects of knowledge in constructing systems and services for the semantic web, knowledge management, knowledge discovery, information integration, natural language processing, intelligent systems, e-business, e-health, humanities, cultural heritage, and beyond.

The ISoLA 2024 proceedings constitutes contributions of the associated events held at the 12th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2024, which took place in Crete, Greece, in October 2024. ISoLA 2024 provides a forum for developers, users, and researchers to discuss issues related to the adoption and use of rigorous tools and methods for the specification, analysis, verification, certification, construction, test, and maintenance of systems from the point of view of their different application domains.

This LNCS conference volume constitutes the proceedings of the 13th International Symposium, FoIKS 2024, in Sheffield, UK, in April 2024. The 18 full papers together with 3 short papers included in this volume were carefully reviewed and selected from 42 submissions.The Symposium focuses on fundamental aspect of information and knowledge systems, including submissions that apply ideas, theories, or methods from specific disciplines to information and knowledge systems. Examples of such disciplines are discrete mathematics, logic and algebra, model theory, databases, information theory, complexity theory, algorithmics and computation, statistics, and optimization.

This book constitutes the refereed proceedings of the 19th International Conference on Formal Aspects of Component Software, FACS 2023, which took place virtually during October 19-20, 2023.The 11 full papers included in this book were carefully reviewed and selected from 23 submissions. They were organized in topical sections as follows: cloud computing, cyber-physical and critical systems, and the Internet of Things.

This book provides an in-depth analysis of classical automata theory, including finite automata, pushdown automata, and Turing machines. It also covers current trends in automata theory, such as jumping, deep pushdown, and regulated automata. The book strikes a balance between a theoretical and practical approach to its subject by presenting many real world applications of automata in a variety of scientific areas, ranging from programming language processing through natural language syntax analysis up to computational musicology.In Automata: Theories, Trends and Applications all formalisms concerning automata are rigorously introduced, and every complicated mathematical passage is preceded by its intuitive explanation so that even complex parts of the book are easy to grasp. The book also demonstrates how automata underlie several computer-science engineering techniques.This monograph is a useful reference for scientists working in the areas of theoretical computer science, computational mathematics, computational linguistics, and compiler writing. It may also be used as a required text in classes dealing with the theory and applications of automata, and theory of computation at the graduate level. This book comes with access to a website which supplies supplementary material such as exercises with solutions, additional case studies, lectures to download, teaching tips for instructors, and more.

The ISoLA 2024 proceedings constitutes contributions of the associated events held at the 12th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2024, which took place in Crete, Greece, in October 2024. ISoLA 2024 provides a forum for developers, users, and researchers to discuss issues related to the adoption and use of rigorous tools and methods for the specification, analysis, verification, certification, construction, test, and maintenance of systems from the point of view of their different application domains.

The subject of this monograph are restarting automata. The definition of these automata is motivated by the linguistic technique of analysis by reduction. This technique, which can be used to analyze sentences in natural languages with a rather free word-order like Czech (or Latin or German), consists of a sequence of step-by-step simplifications of a given sentence. Each of these simplifications is realized by a single reduction operation, which consists of either the deletion of one or several words from that sentence or the replacement of a (possibly discontinuous) substring of that sentence by a shorter substring. It is required that each application of such a reduction operation must preserve the syntactical correctness of the sentence. Accordingly, a restarting automaton consists of a finite-state control, a flexible tape that initially contains the input, and a read-write window of a fixed finite size that works on that tape. The first type of restarting automaton was presented at the international conference FCT in 1995. This type was required to restart as soon as it executes a rewrite operation, that is, the window jumps back to the left end of the tape and the finite-state control is reset to the initial state. Moreover, each rewrite operation simply deletes one or more letters from the contents of the read-write window. Subsequently, many different variants of the restarting automaton have been defined and studied. In particular, proper length-reducing rewrite operations have replaced the original delete steps, additional non-input letters, called auxiliary letters, have been added to the alphabet, and the original combined rewrite/restart operation has been split into a rewrite operation and a separate restart operation. Thus, the restarting automaton is no longer just a particular type of automaton, but it has evolved into a whole family of various types of automata that are specified through several parameters. The objective of the current monograph is to collect the many results that have been obtained on the various types of restarting automata in one place and to present them in a uniform and systematic way. In particular, the influence of the various parameters on the expressive capacity of the resulting types of restarting automata is studied in detail. Other topics include the descriptional complexity and inductive inference of certain types of restarting automata, cooperating distributed and parallel communicating systems of restarting automata, restarting automata with output, weighted restarting automata, and restarting automata for picture languages and tree languages. This monograph may serve as a book of reference for researchers working in formal language and automata theory, as a guide to the literature on restarting automata, and as a text book for an advanced undergraduate or graduate course in formal language and automata theory.

The ISoLA 2024 proceedings constitutes contributions of the associated events held at the 12th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2024, which took place in Crete, Greece, in October 2024. ISoLA 2024 provides a forum for developers, users, and researchers to discuss issues related to the adoption and use of rigorous tools and methods for the specification, analysis, verification, certification, construction, test, and maintenance of systems from the point of view of their different application domains. This volume, Part I, contains the proceedings of the Colloquium in honor of Rocco De Nicola's 70th birthday, held jointly with the ISOLA 2024's track on REoCAS (Rigorous Engineering of Collective Adaptive Systems). Rocco De Nicola has significantly contributed to collective adaptive systems through novel approaches for their formal specification, analysis, and verification. The Colloquium features one homage paper and 23 contributions from invited authors who reflected upon these developments within the context of Rocco's much broader legacy in concurrency theory, distributed systems, domain-specific languages, service-oriented computing, and formal methods, exploring his recent contributions to cybersecurity.

This book constitutes the refereed post proceedings of the 17th Research Conference on Metadata and Semantic Research, MTSR 2023, held in Milan, Italy, during October 25–27, 2023. The 27 papers included in this book were carefully reviewed and selected from 75 submissions. These papers are compiled from the following eight tracks of the conference: Digital Libraries, Information Retrieval, Big, Linked, Social, and Open Data; Agriculture, Food, and Environment; Open Repositories, Research Information Systems, and Data Infrastructures; Digital Humanities and Digital Curation; Cultural Collections and Applications; European and National Projects; Knowledge IT Artifacts in Professional Communities and Aggregations; and Metadata, Identifiers, and Semantics in Decentralized Applications, Blockchains, and P2P Systems.

This book constitutes the refereed proceedings of the 31st International Conference on Inductive Logic Programming, ILP 2022, held during September 28-30, 2022.The 11 regular papers presented in this book were carefully reviewed and selected from 26 submissions The papers in these proceedings represent the diversity and vitality in present ILP research, including statistical relational learning, transfer learning, scientific reasoning, learning temporal models, synthesis and planning, and argumentation and language.

This book constitutes the post-conference proceedings of the satellite events held at the 20th Extended Semantic Web Conference, ESWC 2023, held in Hersonissos, Greece, during May 28—June 1, 2023.The 50 full papers included in this book were carefully reviewed and selected from 109 submissions. They were organized in sections as follows: Posters and Demos, Industry, and PhD Symposium.

This book constitutes the refereed proceedings of the 14th International Conference on Combinatorics on Words, WORDS 2023, held in Umeå, Sweden, during June 12–16, 2023.The 19 contributed papers presented in this book were carefully reviewed and selected from 28 submissions. In addition, the volume also contains 3 invited papers. WORDS is the main conference series devoted to combinatorics on words. This area is connected to several topics from computer science and mathematics, including string algorithms, automated proofs, discrete dynamics, number theory and, of course, classical combinatorics

Automata Theory and Formal Languages presents the difficult concepts of automata theory in a straightforward manner, including discussions on diverse concepts and tools that play major roles in developing computing machines, algorithms and code. Automata theory includes numerous concepts such as finite automata, regular grammar, formal languages, context free and context sensitive grammar, push down automata, Turing machine, and decidability, which constitute the backbone of computing machines. This book enables readers to gain sufficient knowledge and experience to construct and solve complex machines. Each chapter begins with key concepts followed by a number of important examples that demonstrate the solution. The book explains concepts and simultaneously helps readers develop an understanding of their application with real-world examples, including application of Context Free Grammars in programming languages and Artificial Intelligence, and cellular automata in biomedical problems. - Presents the concepts of Automata Theory and Formal Languages in an easy-to-understand approach - Helps the readers understand key concepts by solving real-world examples. - Provides the readers with a simple approach to connect the theory with the latest trend like software testing, cybersecurity, artificial intelligence, and machine learning. - Includes a wide coverage of applications of automata theory and formal languages.

Comprehensive guide on learning automata, introducing two variants to accelerate convergence and computational update speed Learning Automata and Their Applications to Intelligent Systems provides a comprehensive guide on learning automata from the perspective of principles, algorithms, improvement directions, and applications. The text introduces two variants to accelerate the convergence speed and computational update speed, respectively; these two examples demonstrate how to design new learning automata for a specific field from the aspect of algorithm design to give full play to the advantage of learning automata. As noisy optimization problems exist widely in various intelligent systems, this book elaborates on how to employ learning automata to solve noisy optimization problems from the perspective of algorithm design and application. The existing and most representative applications of learning automata include classification, clustering, game, knapsack, network, optimization, ranking, and scheduling. They are well-discussed. Future research directions to promote an intelligent system are suggested. Written by two highly qualified academics with significant experience in the field, Learning Automata and Their Applications to Intelligent Systems covers such topics as: Mathematical analysis of the behavior of learning automata, along with suitable learning algorithms Two application-oriented learning automata: one to discover and track spatiotemporal event patterns, and the other to solve stochastic searching on a line Demonstrations of two pioneering variants of Optimal Computing Budge Allocation (OCBA) methods and how to combine learning automata with ordinal optimization How to achieve significantly faster convergence and higher accuracy than classical pursuit schemes via lower computational complexity of updating the state probabilityA timely text in a rapidly developing field, Learning Automata and Their Applications to Intelligent Systems is an essential resource for researchers in machine learning, engineering, operation, and management. The book is also highly suitable for graduate level courses on machine learning, soft computing, reinforcement learning and stochastic optimization.

This book constitutes proceedings of the 18th European Conference on Logics in Artificial Intelligence, JELIA 2023, held in Dresden, Germany, in September 2023.The 41 full papers and 11 short papers included in this volume were carefully reviewed and selected from 111 submissions. The accepted papers span a number of areas within Logics in AI, including: argumentation; belief revision; reasoning about actions, causality, and change; constraint satisfaction; description logics and ontological reasoning; non-classical logics; and logic programming (answer set programming).

Edited in collaboration with FoLLI, this book constitutes the refereed proceedings of the 10th Indian Conference on Logic and Its Applications, ICLA 2023, which was held in Indore, India, in March 2023.Besides 6 invited papers presented in this volume, there are 9 contributed full papers which were carefully reviewed and selected from 18 submissions. The volume covers a wide range of topics. These topics are related to modal and temporal logics, intuitionistic connexive and imperative logics, systems for reasoning with vagueness and rough concepts, topological quasi-Boolean logic and quasi-Boolean based rough set models, and first-order definability of path functions of graphs.

This book constitutes the refereed proceedings of the 30th International Symposium on Static Analysis, SAS 2023, held in Lisbon, Portugal, in October 2023. The 20 full papers included in this book were carefully reviewed and selected from 40 submissions. Static analysis is widely recognized as a fundamental tool for program verification, bug detection, compiler optimization, program understanding, and software maintenance. The papers deal with theoretical, practical and application advances in the area.Chapter 21 is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

A comprehensive introduction to automata theory that uses the novel approach of viewing automata as data structures.This textbook presents automata theory from a fresh viewpoint inspired by its main modern application, program verification, where automata are viewed as data structures for the algorithmic manipulation of sets and relations. This novel “automata as data structures” paradigm makes holistic connections between automata theory and other areas of computer science not covered in traditional texts, linking the study of algorithms and data structures with that of the theory of formal languages and computability. Esparza and Blondin provide incisive overviews of core concepts along with illustrated examples and exercises that facilitate quick comprehension of rigorous material. Uses novel “automata as data structures” approachAlgorithm approach ideal for programmers looking to broaden their skill set and researchers in automata theory and formal verificationThe first introduction to automata on infinite words that does not assume prior knowledge of finite automata Suitable for both undergraduate and graduate studentsThorough, engaging presentation of concepts balances description, examples, and theoretical results Extensive illustrations, exercises, and solutions deepen comprehension

The LNCS journal Transactions on Rough Sets is devoted to the entire spectrum of rough sets related issues, from logical and mathematical foundations, through all aspects of rough set theory and its applications, such as data mining, knowledge discovery, and intelligent information processing, to relations between rough sets and other approaches to uncertainty, vagueness, and incompleteness, such as fuzzy sets and theory of evidence. Volume XXIII in the series is a continuation of a number of research streams that have grown out of the seminal work of Zdzislaw Pawlak during the first decade of the 21st century.

This book constitutes the proceedings of the First International Symposium, ToM for Teams 2021, held in Washington, DC, USA, during November 4–6, 2021, Each chapter in this section tackles a different aspect of AI representing the thoughts and beliefs of human agents. The work presented herein represents our collective efforts to better understand ToM, develop AI with ToM capabilities (ASI), and study how to integrate such systems into human teams.

This book constitutes the refereed proceedings of the 23rd International Conference on Runtime Verification, RV 2023, held in Thessaloniki, Greece, during October 3–6, 2023. The 13 full papers and 7 short papers presented in this book together with 4 tutorial papers and 2 invited papers were carefully reviewed and selected from 39 submissions. The RV conference is concerned with all aspects of novel lightweight formal methods to monitor, analyze, and guide the runtime behavior of software and hardware systems. Runtime verification techniques are crucial for system correctness, reliability, and robustness; they provide an additional level of rigor and effectiveness compared to conventional testing and are generally more practical than exhaustive formal verification.

This volume LNCS-IFIP constitutes the refereed proceedings of the 7th IFIP TC 5, TC 12, WG 8.4, WG 8.9, WG 12.9 International Cross-Domain Conference, CD-MAKE 2023 in Benevento, Italy, during August 28 – September 1, 2023. The 18 full papers presented together were carefully reviewed and selected from 30 submissions. The conference focuses on integrative machine learning approach, considering the importance of data science and visualization for the algorithmic pipeline with a strong emphasis on privacy, data protection, safety and security.

This book is the first to present a comprehensive investigation of the technical features of the metainferential logics developed in the last years, with their most relevant results and applications. It provides some new paths to define and investigate metainferential logics and offers a thorough study of the semantics and the proof-theories of this new and exciting variety of families of logics.This volume examines the hierarchies of metainferential logics and gives a general and systematic theory of them, and of the truth theories based on these logics. This book puts forward the prospects for truth-theories based on the metainferential logics of the TS/ST hierarchy and argues for its promise noting that each of these logics can be safely expanded with a transparent truth predicate. It also goes onto to explore new developments in three fields related to logics – namely metainferential logics built by means of the Weak Kleene schema and combining them with logics defined through the Strong Kleene schema, proof-theoretic presentations, and those with a with a global or an absolutely global validity standard, instead of a local one. This book is of interest to scholars in formal logic.

This book constitutes the refereed proceedings of the 15th International Conference on Flexible Query Answering Systems, FQAS 2023, held in September 2023 in Palma de Mallorca, Spain. The 24 full papers presented were carefully reviewed and selected from numerous submissions. They are organized in the following topical sections: Flexible Queries over Semantic Systems; Advanced Methods and Applications in Natural Language; Processing (NLP); New Advances in Disinformation Detection; Data and Text Mining; Applying AI to Social Science and Social Science to AI; Artificial Intelligence Law and Regulation.

This book constitutes the refereed proceedings of the 16th International Conference on Intelligent Computer Mathematics, CICM 2023, held in Cambridge, UK, in September 2023.The 14 full papers, 2 project/survey papers, 6 short papers, and 1 tool paper presented were carefully reviewed and selected from a total of 37 submissions. The papers focus on advances in formalization, automatic theorem proving and learning, search and classification, teaching and geometric reasoning, and logic and systems, among other topics.

This book constitutes the refereed proceedings of the 5th International Conference on Logic and Argumentation, CLAR 2023, held in Hangzhou, China, during September 10-12, 2023. The 11 full papers, one short paper and one invited paper presented in this book were carefully reviewed and selected from 20 submissions. The papers focus on topics such as: ​logic and automated deduction; abstract and structured argumentation; dialogues, games and practical reasoning; and quantitative argumentation.

This book constitutes the refereed proceedings of the 9th International Conference on Rigorous State-Based Methods, ABZ 2023, held in Nancy, France, in May 2023. The 12 full and 7 short papers included in this volume were carefully reviewed and selected from 47 submissions. The proceedings also include 4 PhD symposium contributions. They deal with state-based and machine-based formal methods, mainly Abstract State Machines (ASM), Alloy, B, TLA+, VDM, and Z.

This textbook introduces formal languages and automata theory for upper-level undergraduate or beginning graduate students. While it contains the traditional mathematical development usually employed in computational theory courses, it is also quite different from many of them. Machines, grammars, and algorithms developed as part of a constructive proof are intended to be rendered as programs. The book is divided into four parts that build on each other. Part I reviews fundamental concepts. It introduces programming in FSM and reviews program design. In addition, it reviews essential mathematical background on sets, relations, and reasoning about infinite sets. Part II starts the study of formal languages and automata theory in earnest with regular languages. It first introduces regular expressions and shows how they are used to write programs that generate words in a regular language. Given that regular expressions generate words, it is only natural to ask how a machine can recognize words in a regular language. This leads to the study of deterministic and nondeterministic finite-state machines. Part III starts the exploration of languages that are not regular with context-free languages. It begins with context-free grammars and pushdown automata to generate and recognize context-free languages, and it ends with a discussion of deterministic pushdown automata and illustrates why these automatons are fundamentally different from nondeterministic pushdown automata. Part IV eventually explores languages that are not context-free, known as context-sensitive languages. It starts by discussing the most powerful automaton known to mankind: the Turing machine. It then moves to grammars for context-sensitive languages, and their equivalence with Turing machines is explored. The book ends with a brief chapter introducing complexity theory and explores the question of determining if a solution to a problem is practical.

This book constitutes the thoroughly refereed post-conference proceedings of the 26th International Workshop on Algebraic Development Techniques, WADT 2022, held in Aveiro, Portugal, in June 2022.The 6 revised papers presented together with 2 invited papers were carefully reviewed and selected from 25 submissions. The contributed presentations covered a range of topics about the algebraic approach to system specification, which encompasses many aspects of the formal design of software systems. Originally born as formal method for reasoning about abstract data types, the algebraic approach now covers new specification frameworks and programming paradigms (such as object-oriented, aspect-oriented, agent-oriented, logic, and higher-order functional programming) as well as a wide range of application areas (including information systems, concurrent, distributed, and mobile systems).

As we know, multiplicative preference relations (or called pairwise comparisons in AHP) were proposed by Dr. Thomas L Saaty. One important work is to derive its priority from pairwise comparisons. It has been proposed many methods to derive priority for multiplicative preference relation. On the basis of fuzzy sets, the fuzzy reciprocal preference relation is proposed and is extended to the incomplete contexts. However, how to derive the priorities from incomplete fuzzy reciprocal preference relations is an interesting and challenging work. This book systematically presents the theories and methodologies for deriving priorities from incomplete fuzzy reciprocal preference relations. This book can be divided into three parts. In the first part, this book introduces the basic concepts of fuzzy reciprocal preference relations and incomplete fuzzy reciprocal preference relations. Then, two consistencies of complete fuzzy reciprocal preference relations are introduced: additive consistency and multiplicative consistency. Then, the relationships between the fuzzy reciprocal elements and the weights are showed. Afterward, in the second part, different priority methods are presented. The inconsistency repairing procedures are also proposed. Last, the priority method for incomplete hesitant fuzzy reciprocal preference relations is presented. This book can be used as a reference for researchers in the areas of management science, information science, systems engineering, operations research, and other relevant fields. It can also be employed as a textbook for upper-level undergraduate students and graduate students.

This fourth volume of the book series combines propositional logic and R-calculus for a new point of view to consider belief revision. It gives the R-calculi for propositional logic, description logics, propositional modal logic, logic programming, ⇝-propositional logic, semantic networks, and three-valued logic, etc.. Applications of R-calculus in logic of supersequents are also given. This book offers a rich blend of theory and practice. It is suitable for students, researchers and practitioners in the field of logic.