Results 31 to 40 of about 221,743 (312)

Modular Checking with Model Checking

open access: yesElectronic 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.
Yuusuke Hashimoto, Shin Nakajima 0001
openaire   +1 more source

Model Checking Algorithms for CTMDPs [PDF]

open access: yes, 2011
Continuous Stochastic Logic (CSL) can be interpreted over continuoustime Markov decision processes (CTMDPs) to specify quantitative properties of stochastic systems that allow some external control.
Hermanns, Holger   +13 more
core   +1 more source

FO Model Checking of Interval Graphs [PDF]

open access: yesLogical 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

Symmetry Reduced Model Checking for B [PDF]

open access: yes, 2007
Symmetry reduction is a technique that can help alleviate the problem of state space explosion in model checking. The idea is to verify only a subset of states from each class (orbit) of symmetric states.
Edd Turner   +7 more
core   +1 more source

Model Checking in Bits and Pieces [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2013
Fully automated verification of concurrent programs is a difficult problem, primarily because of state explosion: the exponential growth of a program state space with the number of its concurrently active components.
Kedar S. Namjoshi
doaj   +1 more source

A Layered and Parallelized Method of Eventual Model Checking

open access: yesInformation, 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 One-clock Priced Timed Automata [PDF]

open access: yesLogical Methods in Computer Science, 2008
We consider the model of priced (a.k.a. weighted) timed automata, an extension of timed automata with cost information on both locations and transitions, and we study various model-checking problems for that model based on extensions of classical ...
Patricia Bouyer   +2 more
doaj   +1 more source

Automated Rule Checking for MEP Systems Based on BIM and KBMS

open access: yesBuildings, 2022
Due to the growing complexity of mechanical, electrical, and plumbing (MEP) designs and the rules that govern them, performing rule checks manually has become expensive.
Xuanfeng Xie   +5 more
doaj   +1 more source

SMT-Based Bounded Model Checking for Embedded ANSI-C Software

open access: yes, 2009
Propositional bounded model checking has been applied successfully to verify embedded software but is limited by the increasing propositional formula size and the loss of structure during the translation. These limitations can be reduced by encoding word-
Cordeiro, Lucas   +5 more
core   +2 more sources

Towards Light-Weight Probabilistic Model Checking

open access: yesJournal of Applied Mathematics, 2014
Model checking has been extensively used to verify various systems. However, this usually has been done by experts who have a good understanding of model checking and who are familiar with the syntax of both modelling and property specification languages.
Savas Konur
doaj   +1 more source

Home - About - Disclaimer - Privacy