Zobrazeno 1 - 10
of 81
pro vyhledávání: '"Schrammel, Peter"'
The C Bounded Model Checker (CBMC) demonstrates the violation of assertions in C programs, or proves safety of the assertions under a given bound. CBMC implements a bit-precise translation of an input C program, annotated with assertions and with loo
Externí odkaz:
http://arxiv.org/abs/2302.02384
JBMC is an open-source SAT- and SMT-based bounded model checking tool for verifying Java bytecode. JBMC relies on an operational model of the Java libraries, which conservatively approximates their semantics, to verify assertion violations, array out
Externí odkaz:
http://arxiv.org/abs/2302.02381
2LS ("tools") is a verification tool for C programs, built upon the CPROVER framework. It allows one to verify user-specified assertions, memory safety properties (e.g. buffer overflows), numerical overflows, division by zero, memory leaks, and termi
Externí odkaz:
http://arxiv.org/abs/2302.02380
Autor:
Güdemann, Matthias, Schrammel, Peter
Automated test case generation tools help businesses to write tests and increase the safety net provided by high regression test coverage when making code changes. Test generation needs to cover as much as possible of the uncovered code while avoidin
Externí odkaz:
http://arxiv.org/abs/2212.14779
Autor:
Schrammel, Peter
Most businesses rely on a significant stack of software to perform their daily operations. This software is business-critical as defects in this software have major impacts on revenue and customer satisfaction. The primary means for verification of t
Externí odkaz:
http://arxiv.org/abs/2011.00630
2LS is a framework for analysis of sequential C programs that can verify and refute program assertions and termination. The 2LS framework is built upon the CPROVER infrastructure and implements template-based synthesis techniques, e.g. to find invari
Externí odkaz:
http://arxiv.org/abs/1903.00712
Empirical evaluation of verification tools by benchmarking is a common method in software verification research. The Competition on Software Verification (SV-COMP) aims at standardization and reproducibility of benchmarking within the software verifi
Externí odkaz:
http://arxiv.org/abs/1809.03739
The success of Conflict Driven Clause Learning (CDCL) for Boolean satisfiability has inspired adoption in other domains. We present a novel lifting of CDCL to program analysis called Abstract Conflict Driven Learning for Programs (ACDLP). ACDLP alter
Externí odkaz:
http://arxiv.org/abs/1707.02011
We present a static deadlock analysis approach for C/pthreads. The design of our method has been guided by the requirement to analyse real-world code. Our approach is sound (i.e., misses no deadlocks) for programs that have defined behaviour accordin
Externí odkaz:
http://arxiv.org/abs/1607.06927
Autor:
Schrammel, Peter
Publikováno v:
EPTCS 219, 2016, pp. 29-32
Modern program verifiers use logic-based encodings of the verification problem that are discharged by a back end reasoning engine. However, instances of such encodings for large programs can quickly overwhelm these back end solvers. Hence, we need te
Externí odkaz:
http://arxiv.org/abs/1607.04458