Search

We introduce a formal model of transportation in an open-pit mine for the purpose of optimising the mine's operations. The model is a network of Markov automata (MA); the optimisation goal corresponds to maximising a time-bounded expected reward property. Today's model checking algorithms exacerbate the state space explosion problem by applying a discretisation approach to such properties on MA. We show that model checking is infeasible even for small mine instances. Instead, we propose statistical model checking with lightweight strategy sampling or table-based Q-learning over untimed strategies as an alternative to approach the optimisation task, using the Modest Toolset's modes tool. We add support for partial observability to modes so that strategies can be based on carefully selected model features, and we implement a connection from modes to the dtControl tool to convert sampled or learned strategies into decision trees. We experimentally evaluate the adequacy of our new tooling on the open-pit mine case study. Our experiments demonstrate the limitations of Q-learning, the impact of feature selection, and the usefulness of decision trees as an explainable representation.

Software security mainly studies vulnerability detection: is my code vulnerable today? This hinders risk estimation, so new approaches are emerging to forecast the occurrence of future vulnerabilities. While useful, these approaches are coarse-grained and hard to employ for project-specific technical decisions. We introduce a model capable of vulnerability forecasting at library level. Formalising source-code evolution in time together with library dependency, our model can estimate the probability that a software project faces a CVE disclosure in a future time window. Our approach is white-box and lightweight, which we demonstrate via experiments involving 1255 CVEs and 768 Java libraries, made public as an open-source artifact. Besides probabilities estimation, e.g. to plan software updates, this formal model can be used to detect security-sensitive points in a project, or measure the health of a development ecosystem.

Statistical model checking estimates probabilities and expectations of interest in probabilistic system models by using random simulations. Its results come with statistical guarantees. However, many tools use unsound statistical methods that produce incorrect results more often than they claim. In this paper, we provide a comprehensive overview of tools and their correctness, as well as of sound methods available for estimating probabilities from the literature. For expected rewards, we investigate how to bound the path reward distribution to apply sound statistical methods for bounded distributions, of which we recommend the Dvoretzky-Kiefer-Wolfowitz inequality that has not been used in SMC so far. We prove that even reachability rewards can be bounded in theory, and formalise the concept of limit-PAC procedures for a practical solution. The 'modes' SMC tool implements our methods and recommendations, which we use to experimentally confirm our results.

Preclinical diffusion MRI (dMRI) has proven value in methods development and validation, characterizing the biological basis of diffusion phenomena, and comparative anatomy. While dMRI enables in vivo non-invasive characterization of tissue, ex vivo dMRI is increasingly being used to probe tissue microstructure and brain connectivity. Ex vivo dMRI has several experimental advantages that facilitate high spatial resolution and high signal-to-noise ratio (SNR) images, cutting-edge diffusion contrasts, and direct comparison with histological data as a methodological validation. However, there are a number of considerations that must be made when performing ex vivo experiments. The steps from tissue preparation, image acquisition and processing, and interpretation of results are complex, with many decisions that not only differ dramatically from in vivo imaging of small animals, but ultimately affect what questions can be answered using the data. This work concludes a 3-part series of recommendations and considerations for preclinical dMRI. Herein, we describe best practices for dMRI of ex vivo tissue, with a focus on image pre-processing, data processing and model fitting, and tractography. In each section, we attempt to provide guidelines and recommendations, but also highlight areas for which no guidelines exist (and why), and where future work should lie. We end by providing guidelines on code sharing and data sharing, and point towards open-source software and databases specific to small animal and ex vivo imaging., Comment: Part 3 of 3 in "Considerations and recommendations for preclinical diffusion MRI"

Turing completeness has made Ethereum smart contracts attractive to blockchain developers and attackers alike. To increase code security, many tools can now spot most known vulnerabilities$-$at the cost of production efficiency. Recent studies show false-positive ratios over 99% in state-of-the-art technologies: this makes them impractical for use in industry and have raised questions on the direction of academic research. In this work we show how integrating and extending current analyses is not only feasible, but also a next logical step in smart-contract security. We propose light-weight static checks on the morphology and dynamics of Solidity code, stemming from a developer-centric notion of vulnerability, that we use to verify the output of other tools, flag potential false alarms, and suggest verifications. Besides technical details we implemented an open-source prototype. For three top-10 vulnerabilities it flags 324 warnings of other tools as false-positives, in 60 verified de-duplicated smart contracts selected from the blockchain by the presence of true (and false) vulnerabilities. This amounts to a 92%- to 100%-reduction in the number of false-positives for these vulnerabilities.

The landscape of cyber threats grows more complex by the day. Advanced Persistent Threats carry out attack campaigns - e.g. operations Dream Job, Wocao, and WannaCry - against which cybersecurity practitioners must defend. To prioritise which of these to defend against, cybersecurity experts must be equipped with the right toolbox to evaluate the most threatening ones. In particular, they would strongly benefit from (a) an estimation of the likelihood values for each attack recorded in the wild, and (b) transparently operationalising these values to compare campaigns quantitatively. Security experts could then perform transparent and accountable quantitatively-informed decisions. Here we construct such a framework: (1) quantifying the likelihood of attack campaigns via data-driven procedures on the MITRE knowledge-base, (2) introducing a methodology for automatic modelling of MITRE intelligence data, that captures any attack campaign via template attack tree models, and (3) proposing an open-source tool to perform these comparisons based on the cATM logic. Finally, we quantify the likelihood of all MITRE Enterprise campaigns, and compare the likelihood of the Wocao and Dream Job MITRE campaigns - generated with our proposed approach - against manually-built attack tree models. We demonstrate how our methodology is substantially lighter in modelling effort, and capable of capturing all the quantitative relevant data.

Non-Markovian models have great expressive power, at the cost of complex analysis of the stochastic process. The method of Stochastic State Classes (SSCs) derives closed-form analytical expressions for the joint Probability Density Functions (PDFs) of the active timers with marginal expolynomial PDF, though being hindered by the number of concurrent non-exponential timers and of discrete events between regenerations. Simulation is an alternative capable of handling the large class of PDFs samplable via inverse transform, which however suffers from rare events. We combine these approaches to analyze time-bounded transient properties of non-Markovian models. We enumerate SSCs near the root of the state-space tree and then rely on simulation to reach the target, affording transient evaluation of models for which the method of SSCs is not viable while reducing computational time and variance of the estimator of transient probabilities with respect to simulation. Promising results are observed in the estimation of rare event probabilities.

The analysis of formal models that include quantitative aspects such as timing or probabilistic choices is performed by quantitative verification tools. Broad and mature tool support is available for computing basic properties such as expected rewards on basic models such as Markov chains. Previous editions of QComp, the comparison of tools for the analysis of quantitative formal models, focused on this setting. Many application scenarios, however, require more advanced property types such as LTL and parameter synthesis queries as well as advanced models like stochastic games and partially observable MDPs. For these, tool support is in its infancy today. This paper presents the outcomes of QComp 2023: a survey of the state of the art in quantitative verification tool support for advanced property types and models. With tools ranging from first research prototypes to well-supported integrations into established toolsets, this report highlights today's active areas and tomorrow's challenges in tool-focused research for quantitative verification.

The existence of Quantum Many-Body Scars, which prevents thermalization from certain initial states after a long time, has been established across different quantum many-body systems. These include gauge theories corresponding to spin-1/2 quantum link models. Establishing quantum scars in gauge theories with high spin is not accessible with existing numerical methods, which rely on exact diagonalization. We systematically identify scars for pure gauge theories with arbitrarily large integer spin $S$ in $2+1$D, where the electric field is restricted to $2S+1$ states per link. Through an explicit analytic construction, we show that the presence of scars is widespread in $2+1$D gauge theories for arbitrary integer spin. We confirm these findings numerically for small truncated spin and $S=1$ quantum link models. Our analytic construction establishes the presence of scars far beyond volumes and spins that can be probed with existing numerical methods and can guide quantum simulation experiments toward interesting non-equilibrium phenomena, inaccessible otherwise., Comment: "Version 3 with an extended main text; 11 pages, 9 figures (including supplementary material)"

Context: Software of different functional categories, such as text processing vs. networking, has different profiles in terms of metrics like security and updates. Using popularity to compare e.g. Java vs. Python libraries might give a skewed perspective, as the categories of the most popular software vary from one ecosystem to the next. How can one compare libraries datasets across software ecosystems, when not even the category names are uniform among them? Objective: We study how to generate a language-agnostic categorisation of software by functional purpose, that enables cross-ecosystem studies of libraries datasets. This provides the functional fingerprint information needed for software metrics comparisons. Method: We designed and implemented a human-guided protocol to categorise libraries from software ecosystems. Category names mirror PyPI Topic classifiers, but the protocol is generic and can be applied to any ecosystem. We demonstrate it by categorising 256 Java/Maven libraries with severe security vulnerabilities. Results: The protocol allows three or more people to categorise any number of libraries. The categorisation produced is functional-oriented and language-agnostic. The Java/Maven dataset demonstration resulted in a majority of Internet-oriented libraries, coherent with its selection by severe vulnerabilities. To allow replication and updates, we make the dataset and the protocol individual steps available as open data. Conclusions: Libraries categorisation by functional purpose is feasible with our protocol, which produced the fingerprint of a 256-libraries Java dataset. While this was labour intensive, humans excel in the required inference tasks, so full automation of the process is not envisioned. However, results can provide the ground truth needed for machine learning in large-scale cross-ecosystem empirical studies., Comment: Submitted to the journal "Information and Software Technology"

State-of-the-art algorithms for simulating fermions coupled to gauge fields often rely on integrating fermion degrees of freedom. While successful in simulating QCD at zero chemical potential, at finite density these approaches are hindered by the sign problem. We discuss the simulation of lattice gauge theories in the Hamiltonian formalism and present a generalized meron-cluster algorithm for the simulation of the $U\left(1\right)$ Quantum Link Model for spin $1/2$. This enables the study of models directly relevant to current quantum simulators and is a promising first step toward constructing new efficient algorithms for more complicated gauge theories., Comment: PoS Lattice 2023

The carbonaceous Bencubbin-like (CB), high-metal (CH), and Renazzo-like (CR) chondrites are metal-rich chondrites that have been suggested to be genetically linked and are sometimes grouped together as the CR chondrite clan. Of these, the CB and CH chondrites are thought to have formed in an impact-generated vapor-melt plume from material that may be isotopically akin to CR chondrites. We report Mo, Ti, Cr, and Hf-W isotopic data for CB and CH chondrites in order to determine their formation time, to assess whether these chondrites are genetically related, and to evaluate their potential link to CR chondrites. An internal Hf-W isochron for the CH chondrite Acfer 182 yields an age of 3.8 +- 1.2 Ma after the formation of Ca-Al-rich inclusions (CAIs), which is indistinguishable from the mean Hf-W model age for CB metal of 3.8 +- 1.3 Ma. The Mo isotopic data for CB and CH chondrites indicate that both contain some of the same metal and silicate components, which themselves are isotopically distinct. As such, the different Mo isotopic compositions of bulk CB and CH chondrites reflect their distinct metal-to-silicate ratios. CR metal exhibits the same Mo isotopic composition as CB and CH metal, but CR silicates have distinct Mo and Ti isotopic compositions compared to CB and CH silicates, indicating that CB/CH chondrites may be genetically related to CR metal, but not to CR silicates. Together, the new isotopic data are consistent with formation of CB and CH chondrites in different regions of a common impact-generated vapor- melt plume and suggest that the CB and CH metal may derive from a metal-rich precursor genetically linked to CR chondrites. The Hf-W systematics of CH and CB chondrites indicate that the impact occurred at 3.8 +- 0.8 Ma after the formation of Ca-Al-rich inclusions and, hence, up to ~1 Ma earlier than previously inferred based on Pb- Pb chronology., Comment: 54 pages, 8 figures, 5 tables