Results 21 to 30 of about 131,761 (282)
Heuristic search for equivalence checking
Equivalence checking plays a crucial role in formal verification since it is a natural relation for expressing the matching of a system implementation against its specification. In this paper, we present an efficient procedure, based on heuristic search, for checking well-known bisimulation equivalences for concurrent systems specified through process ...
DE FRANCESCO, NICOLETTA +3 more
openaire +3 more sources
Strong Equivalence for LPMLN Programs [PDF]
LPMLN is a probabilistic extension of answer set programs with the weight scheme adapted from Markov Logic. We study the concept of strong equivalence in LPMLN, which is a useful mathematical tool for simplifying a part of an LPMLN program without ...
Joohyung Lee, Man Luo
doaj +1 more source
Checking the equivalence of two Boolean functions, or combinational circuits modeled as Boolean functions, is often desired when reliable and correct hardware components are required.
Wilayat Khan +3 more
doaj +1 more source
Equivalence checking of quantum circuits by nonlocality
Suppose two quantum circuit chips are located at different places, for which we do not have any prior knowledge, and cannot see the internal structures either.
Weixiao Sun, Zhaohui Wei
doaj +1 more source
A Detailed Account of The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction [PDF]
One of the most popular state-space reduction techniques for model checking is partial-order reduction (POR). Of the many different POR implementations, stubborn sets are a very versatile variant and have thus seen many different applications over the ...
Thomas Neele +2 more
doaj +1 more source
Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
Finite transducers, two-tape automata, and biautomata are related computational models descended from the concept of Finite-State Automaton. In these models an automaton controls two heads that read or write symbols on the tapes in the one-way mode.
Vladimir A. Zakharov
doaj +1 more source
Improvements to combinational equivalence checking [PDF]
The paper explores several ways to improve the speed and capacity of combinational equivalence checking based on Boolean satisfiability (SAT). State-of-the-art methods use simulation and BDD/SAT sweeping on the input side (i.e. proving equivalence of some internal nodes in a topological order), interleaved with attempts to run SAT on the output (i.e ...
Alan Mishchenko +3 more
openaire +1 more source
Equivalence Checking Using Trace Partitioning [PDF]
One application of equivalence checking is to establish correspondence between a high-level, abstract design and a low-level implementation. We propose a new partitioning technique for the case in which the two designs are substantially different and traditional equivalence-point insertion fails.
Rajdeep Mukherjee +3 more
openaire +1 more source
Compositional model checking of concurrent systems, with Petri nets [PDF]
Compositionality and process equivalence are both standard concepts of process algebra. Compositionality means that the behaviour of a compound system relies only on the behaviour of its components, i.e. there is no emergent behaviour.
Paweł Sobociński
doaj +1 more source
In this paper we study the equivalence problem in the model of sequential programs which assumes that some instructions are commutative and absorbing. Two instructions are commutative if the result of their executions does not depend on an order of their
V. V. Podymov, V. A. Zakharov
doaj +1 more source

