Zobrazeno 1 - 10
of 7 438
pro vyhledávání: '"bounded model checking"'
Autor:
Frohn, Florian, Giesl, Jürgen
Bounded Model Checking (BMC) is a powerful technique for proving unsafety. However, finding deep counterexamples that require a large bound is challenging for BMC. On the other hand, acceleration techniques compute "shortcuts" that "compress" many ex
Externí odkaz:
http://arxiv.org/abs/2401.09973
Autor:
de Sousa, Janislley Oliveira, de Farias, Bruno Carvalho, da Silva, Thales Araujo, Filho, Eddie Batista de Lima, Cordeiro, Lucas C.
Computer-based systems have solved several domain problems, including industrial, military, education, and wearable. Nevertheless, such arrangements need high-quality software to guarantee security and safety as both are mandatory for modern software
Externí odkaz:
http://arxiv.org/abs/2311.05281
Publikováno v:
IEEE Access, Vol 12, Pp 119341-119349 (2024)
Bounded Model Checking (BMC) is one of the most prominent approaches used as a falsification engine, capable of identifying counterexamples of bounded length, in a scalable and sustainable way. Nevertheless, in the context of a portfolio-based verifi
Externí odkaz:
https://doaj.org/article/d9d4a4c92ca04fbfaa5b0ee6a20cb684
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
Many types of attacks on confidentiality stem from the nondeterministic nature of the environment that computer programs operate in (e.g., schedulers and asynchronous communication channels). In this paper, we focus on verification of confidentiality
Externí odkaz:
http://arxiv.org/abs/2301.07208
Bounded model checking (BMC) is an effective technique for hunting bugs by incrementally exploring the state space of a system. To reason about infinite traces through a finite structure and to ultimately obtain completeness, BMC incorporates loop co
Externí odkaz:
http://arxiv.org/abs/2301.06209
Bounded model checking (BMC) is an efficient formal verification technique which allows for desired properties of a software system to be checked on bounded runs of an abstract model of the system. The properties are frequently described in some temp
Externí odkaz:
http://arxiv.org/abs/2209.05879
We describe and evaluate LF-checker, a metaverifier tool based on machine learning. It extracts multiple features of the program under test and predicts the optimal configuration (flags) of a bounded model checker with a decision tree. Our current wo
Externí odkaz:
http://arxiv.org/abs/2301.09142
Autor:
Yang, Yixiao
The control logic models built by Simulink or Ptolemy have been widely used in industry scenes. It is an urgent need to ensure the safety and security of the control logic models. Test case generation technologies are widely used to ensure the safety
Externí odkaz:
http://arxiv.org/abs/2211.04712
Publikováno v:
In Expert Systems With Applications 15 March 2024 238 Part F