登录 注册 会员服务 联系我们

On the completeness of bounded model checking for threshold-based distributed algorithms: Reachability

  • Published:2017-02 Issue: Volume:252 Page:95-109
  • ISSN:0890-5401
  • Container-title:Information and Computation
  • language:en
  • Short-container-title:Information and Computation

Author:

Konnov Igor,Veith Helmut,Widder Josef

Funder

FWF

WWTF

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference33 articles.

1. FAST: acceleration from theory to practice;Bardin;Int. J. Softw. Tools Technol. Transf.,2008

2. Fast extended release;Bardin,2006

3. Symbolic counter abstraction for concurrent software;Basler,2009

4. Lingeling, Plingeling and Treengeling Entering the SAT Competition 2013;Biere,2013

5. Symbolic model checking without BDDs;Biere,1999

Cited by 40 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parameterized Verification of Round-Based Distributed Algorithms via Extended Threshold Automata;Lecture Notes in Computer Science;2024-09-11

2. Narrowing and heuristic search for symbolic reachability analysis of concurrent object-oriented systems;Science of Computer Programming;2024-07

3. Verifying Randomized Consensus Protocols with Common Coins;2024 54th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN);2024-06-24

4. Formally Verifying a Rollback-Prevention Protocol for TEEs;Lecture Notes in Computer Science;2024

5. An Approach to the State Explosion Problem: SOPC Case Study;Electronics;2023-12-13
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3