课题基金 / 基金详情

Formal Methods in Concurrent and Distributed Systems

Formal Methods in Concurrent and Distributed Systems
并发和分布式系统中的形式化方法
批准号:
9623229
负责人:
Aravinda Sistla
金额:
$10.71万
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
1996
资助国家:
美国
项目状态:
已结题
起止时间:
1996-09-15 至 2000-02-29

项目摘要

项目成果

Aravinda Sistla的其他基金

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
With the widespread use of distributed and concurrent systems and with the increase in the complexity of software for such systems, it becomes important to develop various methods for ensuring the quality of concurrent software systems. This project explores various methods for automated and semi-automated analysis and verification of concurrent and distributed systems. In particular, the research seeks methods based on temporal logic model checking for verification of concurrent systems. Although model checking has been applied fairly successfully for verification of quite a few real-life systems, its applicability to a wider class of practical systems has been hampered by the state explosion problem (i.e. the enormous increase in the size of the state space). In this research, symmetry based techniques are used to overcome the state explosion problem. In particular, symmetry is exploited for verification of liveness properties of real-life concurrent and distributed software systems. The effectiveness of symmetry-based methods for model checking requires efficient solutions to the orbit problem. A solution to the orbit requires checking if two given global states are equivalent under the symmetry. An efficient solution to this problem facilitates the construction of the quotient structure by collapsing each set of equivalent states into a single state. The project investigates various efficient algorithms for the orbit problem for many of the symmetries that occur in practical systems. It is implementing an on-line model checking system that exploits symmetry by simultaneously constructing reduced global state graph (i.e. the quotient structure) and exploring the partially generated quotient structure for existence of certain fair strongly connected components containing an incorrect computation. ***
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
SHF: Medium: Collaborative Research: Verification of Differential Privacy Mechanisms
  • 批准号:
    1901069
  • 项目类别:
    Standard Grant
  • 资助金额:
    $80.0万
  • 财政年份:
    2019
  • 负责人:
    Aravinda Sistla
  • 依托单位:
SHF: Small: Static and Dynamic Techniques for Correctness of Probabilistic Systems
  • 批准号:
    1319754
  • 项目类别:
    Standard Grant
  • 资助金额:
    $30.0万
  • 财政年份:
    2013
  • 负责人:
    Aravinda Sistla
  • 依托单位:
CPS: Small: Monitoring Techniques for Safety Critical Cyber-Physical Systems
  • 批准号:
    1035914
  • 项目类别:
    Continuing Grant
  • 资助金额:
    $36.0万
  • 财政年份:
    2010
  • 负责人:
    Aravinda Sistla
  • 依托单位:
Runtime and Static Verification of Concurrent Systems
  • 批准号:
    0916438
  • 项目类别:
    Standard Grant
  • 资助金额:
    $48.55万
  • 财政年份:
    2009
  • 负责人:
    Aravinda Sistla
  • 依托单位:
国内基金
海外基金
Computational Methods for Analyzing Toponome Data