| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910983081803321 |
|
|
Autore |
Beyer Dirk |
|
|
Titolo |
TOOLympics Challenge 2023 : Updates, Results, Successes of the Formal-Methods Competitions / / edited by Dirk Beyer, Arnd Hartmanns, Fabrice Kordon |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2025 |
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
|
|
Edizione |
[1st ed. 2025.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (180 pages) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 1611-3349 ; ; 14550 |
|
|
|
|
|
|
Altri autori (Persone) |
|
HartmannsArnd |
KordonFabrice |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer science |
Software engineering |
Computer Science Logic and Foundations of Programming |
Software Engineering |
Theory of Computation |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Nota di contenuto |
|
Preface -- Organization -- Contents -- The ARCH-COMP Friendly Verification Competition for Continuous and Hybrid Systems -- 1 Introduction -- 2 Verification of Continuous, Hybrid, and Stochastic Systems -- 2.1 The Formal Verification Approach -- 2.2 Continuous, Hybrid, and Stochastic Systems -- 2.3 Verification Problems -- 2.4 Synthesis Problems -- 2.5 Problem Instances -- 2.6 Inherent Challenges in Evaluating Results -- 3 Competition Format and Organization -- 3.1 A Friendly Format -- 3.2 Organization and Schedule -- 3.3 Artifacts and Results -- 4 Thematic Groups of the Competition -- 4.1 Piecewise Constant Dynamics -- 4.2 Continuous and Hybrid Systems with Linear Dynamics -- 4.3 Nonlinear Dynamics -- 4.4 Artificial Intelligence and Neural Network Control Systems (AINNCS) -- 4.5 Stochastic Models -- 4.6 Falsification -- 4.7 Hybrid Systems Theorem Proving -- 5 Repeatability -- 6 Overall Achievements and Outlook -- References -- Competition of Solvers for Constrained Horn Clauses (CHC-COMP |
|
|
|
|
|
|
|
|
|
|
|
2023) -- 1 Introduction -- 2 Organization |
|
|
|
|
|
|
Sommario/riassunto |
|
TOOLympics 2023 was the third edition of a series of events to showcase competitions in the area of formal methods, colocated with the European Joint Conferences on Theory and Practice of Software (ETAPS 2023), held in April n Paris, France. The goal is to acknowledge the achievements of the various research competitions and comparative evaluations broadly related to the field of formal methods, to explain to the audience which tools from the field of formal methods they evaluate, and to understand their commonalities and differences. The developers of the participating tools typically participate in the competitions and evaluations, choosing the right parameters for the tools, or the best workflow for the approach. A total of ten competitions joined TOOLympics in 2023 and were presented at the event: CHC-COMP, MCC, QComp, ARCH-COMP, RERS, SL-COMP, SV-COMP, Test-Comp, VerifyThis, and the VT-Long-Term Challenge. Six of these are represented in this proceedings volume as papers: ARCH-COMP, CHC-COMP, MCC, QComp, VerifyThis, and the VerifyThis Long-Term Challenge. Each of these papers was peer-reviewed in single-blind mode. The papers will be of value to researchers and practitioners who employ formal methods approaches such as model checking, program analysis, probabilistic analysis, runtime verification, SAT solving, and SMT solving. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2. |
Record Nr. |
UNINA9911019966803321 |
|
|
Autore |
Mahmoud Hosam M (Hosam Mahmoud), <1954-> |
|
|
Titolo |
Sorting : a distribution theory / / Hosam M. Mahmoud |
|
|
|
|
|
Pubbl/distr/stampa |
|
|
New York, : John Wiley & Sons, 2000 |
|
|
|
|
|
|
|
ISBN |
|
9786613306227 |
9781283306225 |
1283306220 |
9781118032886 |
1118032888 |
9781118031131 |
111803113X |
|
|
|
|
|
|
|
|
Descrizione fisica |
|
1 online resource (414 p.) |
|
|
|
|
|
|
Collana |
|
Wiley-Interscience series in discrete mathematics and optimization |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Distribution (Probability theory) |
Probabilities |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Description based upon print version of record. |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references (p. 373-387) and index. |
|
|
|
|
|
|
Nota di contenuto |
|
Sorting: A Distribution Theory; Contents; Preface; Acknowledgments; 1 Sorting and Associated Concepts; 1.1 Sorting; 1.2 Selection; 1.3 Jargon; 1.4 Algorithmic Conventions; 1.5 Order; 1.6 Binary Trees; 1.7 Decision Trees; 1.8 Bounds on Sorting; 1.8.1 Lower Bounds on Sorting; 1.8.2 Upper Bounds on Sorting; 1.9 Bounds on Selection; 1.9.1 Lower Bounds on Selection; 1.9.2 Upper Bounds on Selection; 1.10 Random Permutations; 1.10.1 Records; 1.10.2 Inversions; 1.10.3 Cycles; 1.10.4 Runs; 1.11 An Analytic Toolkit; 1.11.1 The Saddle Point Method; 1.11.2 The Mellin Transform; 1.11.3 Poissonization |
1.11.4 The Dirichlet Transform1.11.5 Rice's Method; 2 Insertion Sort; 2.1 A General Framework; 2.2 A Sufficient Condition for Normality; 2.3 Linear Insertion Sort; 2.4 Binary Insertion Sort; 3 Shell Sort; 3.1 The Algorithm; 3.2 Streamlined Stochastic Analysis; 3.2.1 The Empirical Distribution Function; 3.2.2 The Brownian Bridge; 3.2.3 Using the Stochastic Tools; 3.3 Other Increment Sequences; 4 Bubble Sort; 4.1 The Algorithm; 4.2 A limit Law for Passes; 4.3 A Limit Law for Comparisons; 5 Selection Sort; 5.1 The Algorithm; 5.2 Analysis; 6 |
|
|
|
|
|
|
|
|
|
|
|
Sorting by Counting; 6.1 COUNT SORT |
6.2 Sorting by Counting Frequencies7 Quick Sort; 7.1 The Partitioning Stage; 7.2 Bookkeeping; 7.3 Quick Sort Tree; 7.4 Probabilistic Analysis of QUICK SORT; 7.5 Quick Selection; 7.5.1 Hoare's FIND; 7.5.2 MULTIPLE QUICK SELECT; 8 Sample Sort; 8.1 The Small Sample Algorithm; 8.2 The Large Sample Algorithm; 9 Heap Sort; 9.1 The Heap; 9.2 Sorting via a Heap; 10 Merge Sort; 10.1 Merging Sorted Lists; 10.1.1 LINEAR MERGE; 10.1.2 BINARY MERGE; 10.1.3 The HWANG-LIN Merging Algorithm; 10.2 The Merge Sort Algorithm; 10.3 Distributions; 10.4 Bottom-Up Merge Sort; 11 Bucket Sorts |
11.1 The Principle of Bucket Sorting11.1.1 Distributive Sorts; 11.1.2 Radix Sorting; 11.2 Bucket Selection; 11.2.1 Distributive Selection; 11.2.2 Radix Selection; 12 Sorting Nonrandom Data; 12.1 Measures of Presortedness; 12.2 Data Randomization; 12.3 Guaranteed Performance; 12.3.1 The FORD-JOHNSON Algorithm; 12.3.2 Linear-Time Selection; 12.4 Presorting; 13 Epilogue; Answers to Exercises; Appendix: Notation and Standard Results from Probability Theory; A.1 Logarithms; A.2 Asymptotics; A.3 Harmonic Numbers; A.4 Probability; Bibliography; Index |
|
|
|
|
|
|
Sommario/riassunto |
|
A cutting-edge look at the emerging distributional theory of sortingResearch on distributions associated with sorting algorithms has grown dramatically over the last few decades, spawning many exact and limiting distributions of complexity measures for many sorting algorithms. Yet much of this information has been scattered in disparate and highly specialized sources throughout the literature. In Sorting: A Distribution Theory, leading authority Hosam Mahmoud compiles, consolidates, and clarifies the large volume of available research, providing a much-needed, comprehensive treatment o |
|
|
|
|
|
|
|
| |