Results 21 to 30 of about 21,783,491 (356)
Modular Checking with Model Checking
AbstractAutomatic static checkers based on model checking, particularly SAT-based bounded model checkers, are used in industry, but they sometimes suffer from the scalability problem. Scalability can be achieved with the notions of Design by Contract(DbC) and modular checking. However, modular checking with DbC still have some problems.
Shin Nakajima, Yuusuke Hashimoto
openaire +2 more sources
Autotuning Parallel Programs by Model Checking
The paper presents a new approach to autotuning data-parallel programs. Autotuning is a search for optimal program settings which maximize its performance.
Natalia Olegovna Garanina +1 more
doaj +1 more source
Probabilistic Model Checking and Autonomy [PDF]
The design and control of autonomous systems that operate in uncertain or adversarial environments can be facilitated by formal modeling and analysis. Probabilistic model checking is a technique to automatically verify, for a given temporal logic specification, that a system model satisfies the specification, as well as to synthesize an optimal ...
Kwiatkowska, Marta +2 more
openaire +3 more sources
Intuitionistic implication makes model checking hard [PDF]
We investigate the complexity of the model checking problem for intuitionistic and modal propositional logics over transitive Kripke models. More specific, we consider intuitionistic logic IPC, basic propositional logic BPL, formal propositional logic ...
Martin Mundhenk, Felix Weiss
doaj +1 more source
FO Model Checking of Interval Graphs [PDF]
We study the computational complexity of the FO model checking problem on interval graphs, i.e., intersection graphs of intervals on the real line. The main positive result is that FO model checking and successor-invariant FO model checking can be solved
Robert Ganian +5 more
doaj +1 more source
An Introduction to Quantum Model Checking
Model checking is a well-established and widely adopted framework used to verify whether a given system satisfies the desired properties. Properties are usually given by means of formulas from a specific logic; there are several logics that can be used ...
Andrea Turrini
doaj +1 more source
Deductive Model Checking [PDF]
We present an extension of classical tableau-based model checking procedures to the case of infinite-state systems, using deductive methods in an incremental construction of the behavior graph. Logical formulas are used to represent infinite sets of states in an abstraction of this graph, which is repeatedly refined in the search for a counterexample ...
Zohar Manna +2 more
openaire +3 more sources
Distributed Parametric and Statistical Model Checking [PDF]
Statistical Model Checking (SMC) is a trade-off between testing and formal verification. The core idea of the approach is to conduct some simulations of the system and verify if they satisfy some given property.
Peter Bulychev +4 more
doaj +1 more source
Symbolic Model Checking without BDDs
Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system.
Armin Biere +3 more
semanticscholar +1 more source
Fact-Checking Complex Claims with Program-Guided Reasoning [PDF]
Fact-checking real-world claims often requires collecting multiple pieces of evidence and applying complex multi-step reasoning. In this paper, we present Program-Guided Fact-Checking (ProgramFC), a novel fact-checking model that decomposes complex ...
Liangming Pan +6 more
semanticscholar +1 more source

