Genetic Algorithms for Redundancy in Interaction Testing

It is imperative for testing to determine if the components within large-scale software systems operate functionally. Interaction testing involves designing a suite of tests, which guarantees to detect a fault if one exists among a small number of components interacting together. The cost of this testing is typically modeled by the number of tests, and thus much effort has been taken in reducing this number. Here, we incorporate redundancy into the model, which allows for testing in non-deterministic environments. Existing algorithms for constructing these test suites usually involve one "fast" algorithm for generating most of the tests, and another "slower" algorithm to "complete" the test suite. We employ a genetic algorithm that generalizes these approaches that also incorporates redundancy by increasing the number of algorithms chosen, which we call "stages." By increasing the number of stages, we show that not only can the number of tests be reduced compared to existing techniques, but the computational time in generating them is also greatly reduced.Comment: Submitted to Genetic and Evolutionary Computation Conference 2020 (GECCO '20

New Fundamental Technologies in Data Mining

The progress of data mining technology and large public popularity establish a need for a comprehensive text on the subject. The series of books entitled by "Data Mining" address the need by presenting in-depth description of novel mining algorithms and many useful applications. In addition to understanding each section deeply, the two books present useful hints and strategies to solving problems in the following chapters. The contributing authors have highlighted many future research directions that will foster multi-disciplinary collaborations and hence will lead to significant development in the field of data mining

Computer Aided Verification

This open access two-volume set LNCS 11561 and 11562 constitutes the refereed proceedings of the 31st International Conference on Computer Aided Verification, CAV 2019, held in New York City, USA, in July 2019. The 52 full papers presented together with 13 tool papers and 2 case studies, were carefully reviewed and selected from 258 submissions. The papers were organized in the following topical sections: Part I: automata and timed systems; security and hyperproperties; synthesis; model checking; cyber-physical systems and machine learning; probabilistic systems, runtime techniques; dynamical, hybrid, and reactive systems; Part II: logics, decision procedures; and solvers; numerical programs; verification; distributed systems and networks; verification and invariants; and concurrency

Foundations of Software Science and Computation Structures

This open access book constitutes the proceedings of the 22nd International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2019, which took place in Prague, Czech Republic, in April 2019, held as part of the European Joint Conference on Theory and Practice of Software, ETAPS 2019. The 29 papers presented in this volume were carefully reviewed and selected from 85 submissions. They deal with foundational research with a clear significance for software science

Relational Logics and Diagrams: No-Scale Conditions

The paper investigates logics of relational thinking and connectivity, rendering particular correspondences between the elements of representation and the things represented in drawings, diagrams, maps, or notations, which either deny notions of scale, or work at all scales without belonging to any specific one of them. They include ratios and proportions (static and dynamic, geometric, arithmetic and harmonic progressions) expressing symmetry and self-similarity principles in spatial-metric terms, but also principles of nonlinearity and complexity by symmetry-breakings within non-metric systems. The first part explains geometric and numeric relational figures/sets as taken for “principles of beauty and primary aesthetic quality of all things” in classical philosophy, science, and architecture. These progressions are guided by certain rules or their combinations (codes and algorithms) based on principles of regularity, usually directly spatially reflected. Conversely, configurations representing the main subject of the following sections, could be spatially independent, transformable, and unpredictable, escaping regular extensive definitions. Their forms are presented through transitions from scalable to no-scale conditions showing initial symmetry breakings and abstractions, through complex forms of dynamic modulations and variations of matter, ending with some of the relational diagrammatic and topological ways of architectural data-processing outside of the spatial constraints and parameters – all through diagrams as ultimate tools of relational thinking and inference.Studija razmatra logike relacionog mišlјenja i konektivnosti, prikazujući odnose između predmeta reprezentacije i načina njegovog predstavlјanja u crtežima, dijagramima, mapama i notacijama, koje ili negiraju razmeru i metrička svojstva, ili funkcionišu u svim razmerama ne pripadajući isklјučivo ni jednoj od njih. Obuhvataju korelacije i proporcije (statičke i dinamičke, geometrijske, aritmetičke, harmonijske) ispolјavajući principe samosličnosti u prostorno-metričkim progresijama, ali i principe kompleksnosti ili nelinearnosti zasnovane na prekidima simetrije u okviru nemetričkih sistema. Prvi deo rada objašnjava geometrijske i numeričke relacione figure, ili nizove predstavlјajući „osnovne principe lepog i primarne esteske kvalitete svih stvari“ na način na koji ih definišu klasična filozofija, nauka i arhitektura. Ove progresije (njihovi kodovi i algoritmi) zasnovani su na principima regularnosti, najčešće i direktno prostorno reflektovane. Na drugoj strani, složenije relacije i transformacije kao primarni predmet sledećih tematskih jedinica, su transformabilne i nepredvidive, izmičući pravilnoj ekstenzivnoj definiciji. Nјihove forme predstavlјene su tranzicijama od skalarnih ka nemetričkim stanjima prikazujući prekide simetrija i apstrakcije, preko složenijih formi dinamičkih modulacija i varijacija materije, zaklјučno sa nekim od primera digitalne relacione dijagramatike i topologije arhitektonske problematike izvan prostornih ograničenja i prostorne parametarske definicije – sve do dijagrama kao primarnog instrumenta relacionog mišlјenja

Foundations of Software Science and Computation Structures

This open access book constitutes the proceedings of the 23rd International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2020, which took place in Dublin, Ireland, in April 2020, and was held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020. The 31 regular papers presented in this volume were carefully reviewed and selected from 98 submissions. The papers cover topics such as categorical models and logics; language theory, automata, and games; modal, spatial, and temporal logics; type theory and proof theory; concurrency theory and process calculi; rewriting theory; semantics of programming languages; program analysis, correctness, transformation, and verification; logics of programming; software specification and refinement; models of concurrent, reactive, stochastic, distributed, hybrid, and mobile systems; emerging models of computation; logical aspects of computational complexity; models of software security; and logical foundations of data bases.

Proceedings of the Workshop on Algorithmic Aspects of Advanced Programming Languages: WAAAPL'99: Paris, France, September 30, 1999

The first Workshop on Algorithmic Aspects of Advanced Programming Languages was held on September 30, 1999, in Paris, France, in conjunction with the PLI'99 conferences and workshops. The choice of programming languages has a huge effect on the algorithms and data structures that are to be implemented in that language. Traditionally, algorithms and data structures have been studied in the context of imperative languages. This workshop considers the algorithmic implications of choosing an advanced functional or logic programming language instead. A total of eight papers were selected for presentation at the workshop, together with an invited lecture by Robert Harper. We would like to thank Dider Remv, general chair of PLI'99, for his assistance in organizing this workshop

Computer Aided Verification

This open access two-volume set LNCS 11561 and 11562 constitutes the refereed proceedings of the 31st International Conference on Computer Aided Verification, CAV 2019, held in New York City, USA, in July 2019. The 52 full papers presented together with 13 tool papers and 2 case studies, were carefully reviewed and selected from 258 submissions. The papers were organized in the following topical sections: Part I: automata and timed systems; security and hyperproperties; synthesis; model checking; cyber-physical systems and machine learning; probabilistic systems, runtime techniques; dynamical, hybrid, and reactive systems; Part II: logics, decision procedures; and solvers; numerical programs; verification; distributed systems and networks; verification and invariants; and concurrency