Results 31 to 40 of about 23,407,383 (367)
Model Checking Linear Logic Specifications [PDF]
, 2003 The overall goal of this paper is to investigate the theoretical foundations of algorithmic verification techniques for first order linear logic specifications.
Bozzano, M., Delzanno, G., Martelli, M.
core +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
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
Model-Checking Hierarchical Structures [PDF]
20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), 2006 Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph definitions also allow to specify graphs of exponential size using polynomial size descriptions.
openaire +3 more sources
Model checking for weakly consistent libraries
ACM-SIGPLAN Symposium on Programming Language Design and Implementation, 2019 We present GenMC, a model checking algorithm for concurrent programs that is parametric in the choice of memory model and can be used for verifying clients of concurrent libraries.
Michalis Kokologiannakis +2 more
semanticscholar +1 more source
Modular Checking with Model Checking
Electronic Notes in Theoretical Computer Science, 2009 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.
Hashimoto, Yuusuke, Nakajima, Shin
openaire +1 more source
Advancing verification of process mining models with quantitative model checking in stochastic environment [PDF]
ITM Web of ConferencesThe study of business process analysis and optimization has attracted significant scholarly interest in the recent past, due to its integral role in boosting organizational performance.
Mangi Fawad Ali, Su Guoxin, Zhang Minjie
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 Quantitative Hyperproperties [PDF]
International Conference on Computer Aided Verification, 2018 Hyperproperties are properties of sets of computation traces. In this paper, we study quantitative hyperproperties, which we define as hyperproperties that express a bound on the number of traces that may appear in a certain relation.
B. Finkbeiner +2 more
semanticscholar +1 more source