This comprehensive and highly readable textbook teaches how to formally reason about
computer programs using an incremental approach and the verification-aware programming …

Sorting is one of the fundamental operations in computer science, and many sequential and
parallel algorithms have been proposed in the literature. Swap-based sorting algorithms are …

Towards automating microservices orchestration through data-driven evolutionary
architectures | Service Oriented Computing and Applications Skip to main content …

We report on the results of experiments performed to investigate the Au+ Au 35
MeV/nucleon reaction. The reaction products generated in the disassembly of the unique …

Focusing on the impact different ways of formalization have on the according verifications of
sorting algorithm, this paper presents the formal specifications of insertion sort, and verifies …

We present our Isabelle/HOL formalization of GHC's sorting algorithm for lists, proving its
correctness and stability. This constitutes another example of applying a state-of-the-art …

Inspired by the seminal works on causal analysis by Halpern and Pearl, in this paper we
introduce a causal model based on counterfactuals, adapted to finite automata models and …

We present the formalization and the automated verification of the list sorting algorithms
Insert-Sort and Merge-Sort in the Coq system and we compare it with the formalization and …

This work investigates the question of modular specification of generic Java classes and
methods. We propose extensions to the Krakatoa Modeling Language, a part of the Why …

Algorithm certification or program verification have an increasing importance in the current
technological landscape, due to the sharp increase in the complexity of software and …