Results 11 to 20 of about 230,174 (255)
Reduction Model Checking for Multi-Agent Systems of Group Social Commitments
Innumerable industries now use multi-agent systems (MASs) in various contexts, including healthcare, security, and commercial deployments. It is challenging to select reliable business protocols for critically important safety-related systems (e.g., in ...
Bader M. AlFawwaz +2 more
doaj +1 more source
Handling State Space Explosion in Component-Based Software Verification: A Review
Component-based software development (CBSD) is an alternative approach to constructing software systems that offers numerous benefits, particularly in decreasing the complexity of system design.
Faranak Nejati +3 more
doaj +1 more source
Turing Lecture from the winners of the 2007 ACM A.M. Turing Award. In 1981, Edmund M. Clarke and E. Allen Emerson, working in the USA, and Joseph Sifakis working independently in France, authored seminal papers that founded what has become the highly successful field of model checking.
DORON PELED +2 more
+5 more sources
A Security Analysis of Circuit Clock Obfuscation
Key-based circuit obfuscation or logic-locking is a technique that can be used to hide the full design of an integrated circuit from an untrusted foundry or end-user. The technique is based on creating ambiguity in the original circuit by inserting “key”
Rajesh Datta +3 more
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 ...
Henny B. Sipma +2 more
openaire +1 more source
Causality-based Model Checking [PDF]
Model checking is usually based on a comprehensive traversal of the state space. Causality-based model checking is a radically different approach that instead analyzes the cause-effect relationships in a program.
Bernd Finkbeiner, Andrey Kupriyanov
doaj +1 more source
Prior‐based model checking [PDF]
AbstractModel checking procedures are considered based on the use of the Dirichlet process and relative belief. This combination is seen to lead to some unique advantages for this problem. Of considerable importance is the selection of the hyperparameters for the Dirichlet process.
Luai Al‐Labadi, Michael Evans
openaire +3 more sources
On-the-fly Probabilistic Model Checking [PDF]
Model checking approaches can be divided into two broad categories: global approaches that determine the set of all states in a model M that satisfy a temporal logic formula f, and local approaches in which, given a state s in M, the procedure determines
Diego Latella +2 more
doaj +1 more source
Model Checking Probabilistic Pushdown Automata [PDF]
We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various probabilistic logics. We start with properties that can be formulated as instances of a generalized random walk problem. We prove that
Javier Esparza +2 more
doaj +1 more source
A Divide and Conquer Approach to Eventual Model Checking
The paper proposes a new technique to mitigate the state of explosion in model checking. The technique is called a divide and conquer approach to eventual model checking. As indicated by the name, the technique is dedicated to eventual properties.
Moe Nandi Aung +3 more
doaj +1 more source

