scholarly journals Software Verification: 10th Comparative Evaluation (SV-COMP 2021)

Author(s):  
Dirk Beyer

AbstractSV-COMP 2021 is the 10th edition of the Competition on Software Verification (SV-COMP), which is an annual comparative evaluation of fully automatic software verifiers for C and Java programs. The competition provides a snapshot of the current state of the art in the area, and has a strong focus on reproducibility of its results. The competition was based on 15 201 verification tasks for C programs and 473 verification tasks for Java programs. Each verification task consisted of a program and a property (reachability, memory safety, overflows, termination). SV-COMP 2021 had 30 participating verification systems from 27 teams from 11 countries.

Author(s):  
Dirk Beyer

Abstract This report describes the 2020 Competition on Software Verification (SV-COMP), the 9$$^{\text {th}}$$ edition of a series of comparative evaluations of fully automatic software verifiers for C and Java programs. The competition provides a snapshot of the current state of the art in the area, and has a strong focus on replicability of its results. The competition was based on 11 052 verification tasks for C programs and 416 verification tasks for Java programs. Each verification task consisted of a program and a property (reachability, memory safety, overflows, termination). SV-COMP 2020 had 28 participating verification systems from 11 countries.


Author(s):  
Dirk Beyer

AbstractThis report describes Test-Comp 2021, the 3rd edition of the Competition on Software Testing. The competition is a series of annual comparative evaluations of fully automatic software test generators for C programs. The competition has a strong focus on reproducibility of its results and its main goal is to provide an overview of the current state of the art in the area of automatic test-generation. The competition was based on 3 173 test-generation tasks for C programs. Each test-generation task consisted of a program and a test specification (error coverage, branch coverage). Test-Comp 2021 had 11 participating test generators from 6 countries.


DYNA ◽  
2020 ◽  
Vol 87 (213) ◽  
pp. 9-16
Author(s):  
Franklin Alexander Sepulveda Sepulveda ◽  
Dagoberto Porras-Plata ◽  
Milton Sarria-Paja

Current state-of-the-art speaker verification (SV) systems are known to be strongly affected by unexpected variability presented during testing, such as environmental noise or changes in vocal effort. In this work, we analyze and evaluate articulatory information of the tongue's movement as a means to improve the performance of speaker verification systems. We use a Spanish database, where besides the speech signals, we also include articulatory information that was acquired with an ultrasound system. Two groups of features are proposed to represent the articulatory information, and the obtained performance is compared to an SV system trained only with acoustic information. Our results show that the proposed features contain highly discriminative information, and they are related to speaker identity; furthermore, these features can be used to complement and improve existing systems by combining such information with cepstral coefficients at the feature level.


2008 ◽  
Vol 21 (4) ◽  
pp. 263-264 ◽  
Author(s):  
Jacopo Mantovani

Author(s):  
Ernesto Sanchez ◽  
Giovanni Squillero ◽  
Alberto Tonda

2017 ◽  
Vol 17 (3) ◽  
pp. 311-352 ◽  
Author(s):  
JAMES CHENEY ◽  
ALBERTO MOMIGLIANO

AbstractThe problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has received considerable attention recently. However, the dual problem of searching for errors in such formalizations has attracted comparatively little attention. In this article, we present αCheck, a bounded model checker for metatheoretic properties of formal systems specified using nominal logic. In contrast to the current state of the art for metatheory verification, our approach is fully automatic, does not require expertise in theorem proving on the part of the user, and produces counterexamples in the case that a flaw is detected. We present two implementations of this technique, one based onnegation-as-failureand one based onnegation elimination, along with experimental results showing that these techniques are fast enough to be used interactively to debug systems as they are developed.


2012 ◽  
Vol 12 (3) ◽  
pp. 464-473 ◽  
Author(s):  
Sergio Casciaro ◽  
Roberto Franchini ◽  
Laurent Massoptier ◽  
Ernesto Casciaro ◽  
Francesco Conversano ◽  
...  

2021 ◽  
Vol 54 (1) ◽  
pp. 333-337
Author(s):  
Adam Morawiec

The Laue method allows for fast pattern acquisition, but its use in structural studies is limited by the complexity of data processing. In particular, automatic ab initio indexing of Laue patterns is not trivial. This paper describes measures improving the effectiveness of indexing software. The first such measure is to adjust the positions of Laue spots on the basis of a mesh of lines fitted in a consistent way. Two other modifications enlarge the set of cells tested as potential primitive lattice cells. The last modification concerns eliminating solutions representing superlattices of the true reciprocal lattice. The impact of using these schemes on the chances of obtaining correct indexing solutions is illustrated. The described procedures can be implemented to create fully automatic software for ab initio indexing of Laue patterns.


2013 ◽  
Vol 54 (12) ◽  
pp. 7595 ◽  
Author(s):  
Joo Yong Lee ◽  
Stephanie J. Chiu ◽  
Pratul P. Srinivasan ◽  
Joseph A. Izatt ◽  
Cynthia A. Toth ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document