SGER: Symbolic Computation of Bounds on Timing and Probabilistic Properties of Computing Systems

SGER：计算系统的时序和概率属性界限的符号计算

• 批准号: 0848463
• 负责人: Gianfranco Ciardo
• 金额: --
• 依托单位: University of California-Riverside
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2008
• 资助国家: 美国
• 起止时间: 2008-09-01 至 2010-02-28
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0848463&HistoricalAwards=false
• 关键词: SGER; Symbolic; Computation; Bounds; Timing

This Small Grant for Exploratory Research (SGER) award is to explore foundational research to study logical, timing, and probabilistic properties of a discrete state model, which is quite challenging because it is a strictly symbolic approach that combines algorithms from diverse areas, ranging from logical verification to numerical analysis and statistics. The work could lead to radically new approaches for modeling and analyzing today?s increasingly complex computer-based systems, with broader impacts from efficient techniques for achieving higher software reliability.

这项探索性研究（SGER）小额赠款旨在探索基础研究，以研究离散状态模型的逻辑、时序和概率特性，这是相当具有挑战性的，因为它是一种严格的符号方法，结合了从逻辑验证到数值分析和统计等不同领域的算法。这项工作可能会为今天的建模和分析带来全新的方法。S日益复杂的以计算机为基础的系统，具有实现更高软件可靠性的有效技术的广泛影响。