Filters








28,392 Hits in 1.7 sec

Model Checking in Bits and Pieces

Kedar S. Namjoshi
2013 Electronic Proceedings in Theoretical Computer Science  
We show how the division of an invariant into a number of pieces with limited scope makes it possible to apply new, localized forms of symmetry and abstraction to drastically simplify its computation.  ...  Split invariance also has interesting connections to parametric verification. A quantified invariant for a parametric system is a split invariant for every instance.  ...  Local symmetries have group-like properties: • The composition of local symmetries is a symmetry: if (m, β , n) and (n, δ , k) are symmetries, so is (m, δ β , k) • The symmetry (m, id, m) is the identity  ... 
doi:10.4204/eptcs.129.25 fatcat:f4ovjt4xcragrbevfzz6g2y44a

High-speed formal verification of heterogeneous coherence hierarchies

J. G. Beu, J. A. Poovey, E. R. Hein, T. M. Conte
2013 2013 IEEE 19th International Symposium on High Performance Computer Architecture (HPCA)  
symmetry.  ...  When combined with an inductive proof, this ensures the validation properties of proper permission distribution and livelock/deadlock freedom are enforced by any hierarchical composition of MCP compliant  ...  encapsulation symmetry and thus can be leveraged as a verification composition framework for heterogeneous hierarchies when the hierarchy is composed of formally verified MCP compliant protocols. • Present  ... 
doi:10.1109/hpca.2013.6522350 dblp:conf/hpca/BeuPHC13 fatcat:oca3mxzwdjds5neeywfwibkarq

Parameterized Compositional Model Checking [chapter]

Kedar S. Namjoshi, Richard J. Trefler
2016 Lecture Notes in Computer Science  
For the verification of safety properties, the PCMCP is shown to be much more tractable than the more general Parameterized Model Checking Problem (PMCP).  ...  This result generalizes to toroidal mesh networks and related networks for describing parallel architectures. Decidable models of the PCMCP are also shown for networks of control and user processes.  ...  Rings, Tori and other Regular Networks We recall results connecting compositional verification to local symmetry given in [22] and use those to show that the PCMCP is decidable in polynomial time for  ... 
doi:10.1007/978-3-662-49674-9_39 fatcat:t2tj5wifivhw3kkq4ihzuyopky

Symmetry Reduction for the Local Mu-Calculus [article]

Kedar S. Namjoshi, Richard J. Trefler
2019 arXiv   pre-print
Moreover, it is shown that for network families generated from building-block patterns, neighborhood symmetries are easily determined, and verification over the entire family reduces to verification over  ...  Considerably generalizing earlier results on invariance, it is shown that all local mu-calculus properties, including safety and liveness properties, are preserved by neighborhood symmetries.  ...  Richard Trefler was supported, in part, by an Individual Discovery Grant from the Natural Sciences and Engineering Research Council of Canada. Both authors thank E.  ... 
arXiv:1903.10405v1 fatcat:wrwngfzwvrem3lcuiiiqgsttty

Symmetry Reduction for the Local Mu-Calculus [chapter]

Kedar S. Namjoshi, Richard J. Trefler
2018 Lecture Notes in Computer Science  
Moreover, it is shown that for network families generated from building-block patterns, neighborhood symmetries are easily determined, and verification over the entire family reduces to verification over  ...  Considerably generalizing earlier results on invariance, it is shown that all local mu-calculus properties, including safety and liveness properties, are preserved by neighborhood symmetries.  ...  Richard Trefler was supported, in part, by an Individual Discovery Grant from the Natural Sciences and Engineering Research Council of Canada. Both authors thank E.  ... 
doi:10.1007/978-3-319-89963-3_22 fatcat:xhuau3tcpjayxnvq273r7jngxi

Brief Announcement: Efficient Model Checking of Fault-Tolerant Distributed Protocols Using Symmetry Reduction [chapter]

Péter Bokor, Marco Serafini, Neeraj Suri, Helmut Veith
2009 Lecture Notes in Computer Science  
The application of model checking (MC) [2] for protocol verification is attractive with its full automation and rich property language.  ...  Therefore, we propose to leverage the framework of symmetry reduction [6] and improve on existing applications of it.  ...  Every node is a parallel composition of role instances with at most one role instance per node.  ... 
doi:10.1007/978-3-642-04355-0_29 fatcat:n35zmsz3czefhmmt2az6ybfzsq

Analysis of Dynamic Process Networks [chapter]

Kedar S. Namjoshi, Richard J. Trefler
2015 Lecture Notes in Computer Science  
Dynamic networks serve as models for ad-hoc and sensor-network protocols. The analysis combines elements of compositional reasoning, symmetry reduction, and abstraction.  ...  A compositional invariant computed on the small network generalizes to a parametric invariant of the shape "for all networks and all processes: property p holds of each process and its local neighborhood  ...  In this work, we propose a new approach to this challenging verification question. Our analysis method combines elements of compositional reasoning, symmetry reduction and abstraction.  ... 
doi:10.1007/978-3-662-46681-0_11 fatcat:ft462g4ycjabjn7agqjulxqog4

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

Christian Appold
2010 Electronic Proceedings in Theoretical Computer Science  
Our experiments show that the algorithm is very fast and allows the verification of larger systems. We additionally implemented the use of state symmetries for symbolic symmetry reduction.  ...  The combination of symmetry reduction and symbolic model checking by using BDDs suffered a long time from the prohibitively large BDD for the orbit relation.  ...  In the testcase every reader has only the three local states idle, trying and reading, while every writer has the local states idle, trying and writing.  ... 
doi:10.4204/eptcs.25.17 fatcat:tqagvrdbyzephaqcassjfxdb3a

Exploiting Synchrony and Symmetry in Relational Verification [chapter]

Lauren Pick, Grigory Fedyukovich, Aarti Gupta
2018 Lecture Notes in Computer Science  
Approaches to automatic relational verification often compose the programs and analyze the result for safety, but a naively composed program can lead to difficult verification problems.  ...  Second, we compute symmetries in the specifications to reveal and avoid redundant subtasks. We have implemented these enhancements in a prototype for verifying k-safety properties on Java programs.  ...  We gratefully acknowledge the help from Marcelo Sousa and Işil Dillig on their Descartes tool, which provides the base for our prototype development and experimental comparison.  ... 
doi:10.1007/978-3-319-96145-3_9 fatcat:2xzpnx52s5fqfo7zc72ogauzvq

Role-Based Symmetry Reduction of Fault-Tolerant Distributed Protocols with Language Support [chapter]

Péter Bokor, Marco Serafini, Neeraj Suri, Helmut Veith
2009 Lecture Notes in Computer Science  
The application of model checking (MC) for protocol verification is attractive with its full automation and rich property language.  ...  Not only does one desire rigor in the protocol design but especially in its verification given the complexity and fallibility of manual proofs.  ...  Our work is related to symmetry detection and to approaches that are specific to automated formal verification of FT distributed protocols.  ... 
doi:10.1007/978-3-642-10373-5_8 fatcat:h4rmlrkpcnhgvb64chkosvf2yi

Efficient and user-friendly verification

Farn Wang, Pao-Ann Hsiung
2002 IEEE transactions on computers  
AbstractÐA compositional verification method from a high-level resource-management standpoint is presented for dense-time concurrent systems and implemented in the tool of SGM (State-Graph Manipulators  ...  Reduction techniques specially designed for the context of state-graph iteration composition and shared variable manipulations are developed and used in SGM.  ...  Their comments and criticism have made this paper much better. This work is partially supported by the National Science Council of Taiwan [25] .  ... 
doi:10.1109/12.980017 fatcat:hqjf6ec3vfc4jnlk3frqnazfru

Replication and Abstraction: Symmetry in Automated Formal Verification

Thomas Wahl, Alastair Donaldson
2010 Symmetry  
This article surveys fundamental and applied aspects of symmetry in system models, and of symmetry reduction methods used to counter state explosion in model checking, an automated formal verification  ...  The article targets researchers and engineers interested in formal verification of concurrent systems. Theorem 5 ([19]) Let M be a Kripke structure symmetric with respect to a group G.  ...  Acknowledgements This work was supported by EPSRC grants EP/G026254/1 and EP/G051100/1. The authors would like to thank David Parker for his comments on symmetry reduction in PRISM.  ... 
doi:10.3390/sym2020799 fatcat:q4mcwtywq5bgla4e5u4dfu6iii

Multi-exponential error extrapolation and combining error mitigation techniques for NISQ applications

Zhenyu Cai
2021 npj Quantum Information  
Moreover, we develop methods to combine error extrapolation with two other error mitigation techniques: quasi-probability and symmetry verification, through exploiting features of these individual techniques  ...  In this Article, we extend this to multi-exponential error extrapolation and provide more rigorous proof for its effectiveness under Pauli noise.  ...  ACKNOWLEDGEMENTS The author would like to thank Ying Li and Simon Benjamin for reading through the manuscript and providing valuable insights.  ... 
doi:10.1038/s41534-021-00404-3 fatcat:6cpv2vx7efh3ddoirovdasx42q

Verification of an implementation of Tomasulo's algorithm by compositional model checking [chapter]

K. L. McMillan
1998 Lecture Notes in Computer Science  
A proof of Tomasulo's algorithm is outlined, based on refinement maps, and relying on the novel features of the compositional system.  ...  The paper introduces a novel compositional system that supports cyclic environment reasoning and multiple environment abstractions per signal.  ...  This allows us to localize the effect of symmetry breaking.  ... 
doi:10.1007/bfb0028738 fatcat:vs6dw5da6fcwxlzl3qfe7j4sje

The Origin of CP Violation [article]

J.C. Yoon
2004 arXiv   pre-print
In conclusion, fundamental symmetry violation is still inconclusive due to the limited theoretical assumptions and physical observations.  ...  After alternative interpretation of quark mixing and problems of CP violation are addressed, the composite properties of neural meson will be suggested as origin of CP violation with possible experimental  ...  Since the local gauge symmetry is unnecessary in theory and unfeasible in experiments, fundamental interactions should be investigated rather empirically than by local gauge theories.  ... 
arXiv:hep-ph/0211005v4 fatcat:ojjuxgighzdtvcd4smryqq2v5e
« Previous Showing results 1 — 15 out of 28,392 results