In: Journal of systems and software, 2021, vol. 182, p. 14
Code comments are the primary means to document implementation and facilitate program comprehension. Thus, their quality should be a primary concern to improve program maintenance. While much effort has been dedicated to detecting bad smells, such as clones in code, little work has focused on comments. In this paper we present our solution to detect clones in comments that developers should...
|
In: Algorithms, 2021, vol. 14, no. 9, p. 25
Recent systems applying Machine Learning (ML) to solve the Traveling Salesman Problem (TSP) exhibit issues when they try to scale up to real case scenarios with several hundred vertices. The use of Candidate Lists (CLs) has been brought up to cope with the issues. A CL is defined as a subset of all the edges linked to a given vertex such that it contains mainly edges that are believed to be...
|
In: Future internet, 2021, vol. 13, no. 9, p. 12
As part of studies that employ health electronic records databases, this paper advocates the employment of graph theory for investigating drug-switching behaviors. Unlike the shared approach in this field (comparing groups that have switched with control groups), network theory can provide information about actual switching behavior patterns. After a brief and simple introduction to...
|
In: CCF transactions on high performance computing, 2021, no. 3, p. 407–426
Non-linear phase field models are increasingly used for the simulation of fracture propagation problems. The numerical simulation of fracture networks of realistic size requires the efficient parallel solution of large coupled non-linear systems. Although in principle efficient iterative multi-level methods for these types of problems are available, they are not widely used in practice due to...
|
In: Journal of computational science, 2021, vol. 53, p. 13
The ℓ1-regularized Gaussian maximum likelihood method is a common approach for sparse precision matrix estimation, but one that poses a computational challenge for high-dimensional datasets. We present a novel ℓ1- regularized maximum likelihood method for performant large-scale sparse precision matrix estimation utilizing the block structures in the underlying computations. We identify the...
|
In: International journal on software tools for technology transfer, 2021, p. 15
The use of propositional logic and systems of linear inequalities over reals is a common means to model software for formal verification. Craig interpolants constitute a central building block in this setting for over-approximating reachable states, e.g. as candidates for inductive loop invariants. Interpolants for a linear system can be efficiently computed from a Simplex refutation by ...
|
In: Journal of systems and software, 2021, vol. 181, p. 13
Software testing depends on effective oracles. Implicit oracles, such as checks for program crashes, are widely applicable but narrow in scope. Oracles based on formal specifications can reveal applicationspecific failures, but specifications are expensive to obtain and maintain. Metamorphic oracles are somewhere in-between. They test equivalence among different procedures to detect semantic...
|
In: Computers and mathematics with applications, 2021, vol. 99, p. 162-170
We consider two parallel-in-time approaches applied to a (reaction) diffusion problem, possibly non-linear. In particular, we consider PFASST (Parallel Full Approximation Scheme in Space and Time) and space-time multigrid strategies. For both approaches, we start from an integral formulation of the continuous time dependent problem. Then, a collocation form for PFASST and a discontinuous ...
|
In: International Journal on Software Tools for Technology Transfer, 2021, vol. 23, p. 883–893
VerifyThis is a series of program verification competitions that emphasize the human aspect: participants tackle the verification of detailed behavioral properties—something that lies beyond the capabilities of fully automatic verification and requires instead human expertise to suitably encode programs, specifications, and invariants. This paper describes the 8th edition of VerifyThis, ...
|
In: Quantum reports, 2021, vol. 3, no. 2, p. 272-285
It has been more than 20 years since Deutsch and Hayden proved the locality of quantum theory, using the Heisenberg picture of quantum computational networks. Of course, locality holds even in the face of entanglement and Bell’s theorem. Today, most researchers in quantum foundations are still convinced not only that a local description of quantum systems has not yet been provided, but that...
|
