Results 11 to 20 of about 6,656 (189)

Compositional model checking of concurrent systems, with Petri nets [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2016
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

A polynomial algorithm for checking the equivalence in models of programs with commutation and vast operators

open access: yesТруды Института системного программирования РАН, 2018
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

Fast equivalence-checking for quantum circuits [PDF]

open access: yes2010 IEEE/ACM International Symposium on Nanoscale Architectures, 2010
We perform formal verification of quantum circuits by integrating several techniques specialized to particular classes of circuits. Our verification methodology is based on the new notion of a reversible miter that allows one to leverage existing techniques for simplification of quantum circuits.
Yamashita, Shigeru, Markov, Igor L.
openaire   +2 more sources

Client-specific equivalence checking [PDF]

open access: yesProceedings of the 33rd ACM/IEEE International Conference on Automated Software Engineering, 2018
Software is often built by integrating components created by different teams or even different organizations. With little understanding of changes in dependent components, it is challenging to maintain correctness and robustness of the entire system. In this paper, we investigate the effect of component changes on the behavior of their clients.
Federico Mora   +3 more
openaire   +1 more source

Beyond Language Equivalence on Visibly Pushdown Automata [PDF]

open access: yesLogical Methods in Computer Science, 2009
We study (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basic Process Algebra) and visibly one-counter automata. We describe generic methods for proving complexity upper
Jiří Srba
doaj   +1 more source

Towards Symbolic Model-Based Mutation Testing: Combining Reachability and Refinement Checking [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2012
Model-based mutation testing uses altered test models to derive test cases that are able to reveal whether a modelled fault has been implemented. This requires conformance checking between the original and the mutated model.
Bernhard K. Aichernig, Elisabeth Jöbstl
doaj   +1 more source

Geometric Model Checking of Continuous Space [PDF]

open access: yesLogical Methods in Computer Science, 2022
Topological Spatial Model Checking is a recent paradigm where model checking techniques are developed for the topological interpretation of Modal Logic. The Spatial Logic of Closure Spaces, SLCS, extends Modal Logic with reachability connectives that, in
Nick Bezhanishvili   +5 more
doaj   +1 more source

Equivalence Checking of Scheduling in High-Level Synthesis Using Deep State Sequences

open access: yesIEEE Access, 2019
By using high-level synthesis tools, electronic system level design provides a promising solution to fill the growing design productivity gap of high quality hardware systems.
Jian Hu   +3 more
doaj   +1 more source

NP-Logic Systems and Model-Equivalence Reductions [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2010
In this paper we investigate the existence of model-equivalence reduction between NP-logic systems which are logic systems with model existence problem in NP.
Yuping Shen, Xishun Zhao
doaj   +1 more source

Efficient Symmetry Reduction and the Use of State Symmetries for Symbolic Model Checking [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2010
One technique to reduce the state-space explosion problem in temporal logic model checking is symmetry reduction. The combination of symmetry reduction and symbolic model checking by using BDDs suffered a long time from the prohibitively large BDD for ...
Christian Appold
doaj   +1 more source

Home - About - Disclaimer - Privacy