9 Hits in 0.81 sec

Towards String Support in JayHorn (Competition Contribution) [chapter]

Ali Shamakhi, Hossein Hojjat, Philipp Rümmer
2021 Lecture Notes in Computer Science  
Abstractis a Horn clause-based model checker for Java programs that has been competing at SV-COMP since 2019. An ongoing research and implementation effort is to add support for data-type to .  ...  Since current Horn solvers do not support strings natively, we consider a representation of (unbounded) strings using algebraic data-types, more precisely as lists.  ...  JayHorn competes in the Java category.  ... 
doi:10.1007/978-3-030-72013-1_29 fatcat:zbccjbo6mjayli2v4dobkcnery

JayHorn: A Framework for Verifying Java programs [chapter]

Temesghen Kahsai, Philipp Rümmer, Huascar Sanchez, Martin Schäf
2016 Lecture Notes in Computer Science  
Building a competitive program verifiers is becoming cheaper.  ...  In this spirit, we developed JayHorn, a verification framework for Java with the goal of having as few moving parts as possible.  ...  We will make JayHorn and our test cases and benchmarks publicly available to contribute to this development with the hope of having a verification competition for Java in the near future.  ... 
doi:10.1007/978-3-319-41528-4_19 fatcat:ivhnjuevmjdmdaejybw6xumgqq

Benchmarking of Java Verification Tools at the Software Verification Competition (SV-COMP) [article]

Lucas Cordeiro, Daniel Kroening, Peter Schrammel
2019 arXiv   pre-print
run on state-of-the-art Java verification tools, JPF, SPF, JayHorn and JBMC.  ...  We provide a detailed description of the rules for benchmark verification tasks, the integration of new tools into SV-COMP's benchmarking framework and also give experimental results of a benchmarking  ...  Symbolic PathFinder (SPF) 2 is a symbolic [9, 13] software model checking extension of Java PathFinder (JPF) 3 , an explicit-state model checker for Java bytecode [8] .  ... 
arXiv:1809.03739v2 fatcat:bwswtdx7pzgsnmupwuibjb2odq

Competition Report: CHC-COMP-20

Philipp Rümmer
2020 Electronic Proceedings in Theoretical Computer Science  
This report gives an overview of the competition design, explains the organisation of the competition, and presents the competition results.  ...  CHC-COMP-20 is the third competition of solvers for Constrained Horn Clauses.  ...  The approach wraps a standard model checker. The underlying model checker must support all the theories used in the input problem, except the theory of arrays. Architecture and Implementation.  ... 
doi:10.4204/eptcs.320.15 fatcat:iirqvwhg4fdbrkle3y3wa5upla

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

Dirk Beyer
2021 International Conference on Tools and Algorithms for Construction and Analysis of Systems  
In the following we list a brief summary of new items in SV-COMP 2021: • SPDX identification of licenses in SV-Benchmarks collection • WitnessLint: New checker for syntactical validity of verification  ...  The values for time and Table 6 : 6 Algorithms and techniques that the competition candidates used Participant CEGAR Predicate Abstraction Symbolic Execution Bounded Model Checking k-Induction  ... 
doi:10.1007/978-3-030-72013-1_24 dblp:conf/tacas/000121 fatcat:3nmb6p5ggje5dngqdrs2ncqcau

Competition Report: CHC-COMP-21

Grigory Fedyukovich, Philipp Rümmer
2021 Electronic Proceedings in Theoretical Computer Science  
This report gives an overview of the competition design, explains the organisation of the competition, and presents the competition results.  ...  CHC-COMP-21 is the fourth competition of solvers for Constrained Horn Clauses.  ...  After that, an off-the-shelf finite model finder is applied to build a finite model of the reduced verification conditions.  ... 
doi:10.4204/eptcs.344.7 fatcat:k2xxu6scfza2hc4fw6qi6nadq4

A Theory of Heap for Constrained Horn Clauses (Extended Technical Report) [article]

Zafer Esen, Philipp Rümmer
2021 arXiv   pre-print
This paper presents an SMT-LIB theory of heap tailored to CHCs, with the goal of enabling a standard interchange format for programs with heap data-structures.  ...  Constrained Horn Clauses (CHCs) are an intermediate program representation that can be generated by several verification tools, and that can be processed and solved by a number of Horn solvers.  ...  Heap in C++ can be modelled essentially by combining the techniques discussed for Java and C.  ... 
arXiv:2104.04224v1 fatcat:m5zornnqzbfynj5ux3ab64e6wm

Improving the Usability of Static Analysis Tools Using Machine Learning [article]

Ugur Koc
machine learning techniques; and (2) using the sophisticated machine learning techniques to discover code structures that cause false positive error reports and to learn false positive classification models  ...  To address this issue, we developed a novel machine learning approach for learning directly from program code to classify the analysis results as true or false positives.  ...  CBMC and JBMC implement bounded model-checking technique for C and Java programs, respectively. JayHorn also implements a modelchecking technique using Horn clauses for Java programs.  ... 
doi:10.13016/bqo5-xlnp fatcat:jqohyazbejbmzdfm5sgrhdflhy

Analysis and Transformation of Constrained Horn Clauses for Program Verification [article]

Emanuele De Angelis
2021 arXiv   pre-print
specialisation-based techniques for translating verification problems for different programming languages, and in general software systems, into satisfiability problems for constrained Horn clauses (CHCs), a  ...  JayHorn, a translator for Java, follows a similar approach (Kahsai et al. 2016); the description of the translation to CHCs states that “most steps of the translation from Java into logic are implemented  ...  JayHorn: A framework for verifying Java programs. In CAV ’16, Part I. LNCS 9779. Springer, 352–358. Kalra, S., Goel, S., Dhawan, M., and Sharma, S. 2018.  ... 
arXiv:2108.00739v1 fatcat:gevl2xlor5hrzentqc77irt6gu