Results 31 to 40 of about 230,174 (255)
Autotuning Parallel Programs by Model Checking
Моделирование и анализ информационных систем, 2021 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
Distributed Parametric and Statistical Model Checking [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 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
Intuitionistic implication makes model checking hard [PDF]
Logical Methods in Computer Science, 2012 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
An Introduction to Quantum Model Checking
Applied Sciences, 2022 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
Fluid Model Checking of Timed Properties [PDF]
, 2015 We address the problem of verifying timed properties of Markovian models of large populations of interacting agents, modelled as finite state automata.
Bortolussi, Luca, Lanciani, Roberta
core +2 more sources
FO Model Checking of Interval Graphs [PDF]
Logical Methods in Computer Science, 2015 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
A Layered and Parallelized Method of Eventual Model Checking
Information, 2023 Termination or halting is an important system requirement that many systems should satisfy and can be expressed in linear temporal logic as eventual properties.
Yati Phyo +3 more
doaj +1 more source
Model Checking CTL is Almost Always Inherently Sequential [PDF]
, 2009 The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the use of temporal modalities or the use of negations—restrictions already ...
Beyersdorff, Olaf +6 more
core +4 more sources
Model Checking CTL is Almost Always Inherently Sequential [PDF]
, 2011 The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the use of temporal modalities or the use of negations---restrictions already ...
A. L. Selman +20 more
core +5 more sources
Counterexample Generation in Probabilistic Model Checking [PDF]
, 2009 Providing evidence for the refutation of a property is an essential, if not the most important, feature of model checking. This paper considers algorithms for counterexample generation for probabilistic CTL formulae in discrete-time Markov chains ...
Damman, B., Han, T., Katoen, J.P.
core +5 more sources