RUI: Testing Embedded Systems

RUI：测试嵌入式系统

• 批准号: 9407110
• 负责人: Edward Epp
• 金额: $ 2.94万
• 依托单位: University of Portland
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1994
• 资助国家: 美国
• 起止时间: 1994-12-15 至 1995-11-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9407110&HistoricalAwards=false
• 关键词: RUI; Testing; Embedded; Systems

Current available testing methodologies have not been widely or productively utilized in industry for several reasons, including such factors as deadline pressures, necessity of a large initial investment in software and hardware, impracticality of methodologies, or inability to work with embedded systems. This project addresses one testing issue which has been problematic for industry: embedded systems. The inherent multiprocessing in embedded systems makes them particularly difficult to test. For example, each instrument control and display may be implemented as its own thread of execution. Testing all possible interleavings quickly results in a combinatorial explosion. Code complexity directly contributes to these combinatorics. One approach for handling complexity is through abstraction. This research seeks to develop a testing strategy based on state pools and constraints. Contraints represent relationships that must be maintained between objects. By treating these relationships as atomic units, execution granularity can be increased, reducing the number of interleaved execution paths. With the cooperation of an industry partner, application to production systems is being explored.

目前可用的测试方法没有被广泛或有效地利用在工业中的几个原因，包括这样的因素，如最后期限的压力，在软件和硬件的大量初始投资的必要性，不切实际的方法，或无法与嵌入式系统。 这个项目解决了一个测试问题，这一直是一个问题的行业：嵌入式系统。 嵌入式系统中固有的多处理使得它们特别难以测试。 例如，每个仪器控制和显示可以被实现为其自己的执行线程。 测试所有可能的交织快速导致组合爆炸。 代码的复杂性直接导致了这些组合。 处理复杂性的一种方法是通过抽象。 本研究旨在开发一种基于状态池和约束的测试策略。 约束表示对象之间必须保持的关系。 通过将这些关系视为原子单元，可以增加执行粒度，从而减少交错执行路径的数量。 在一个工业伙伴的合作下，正在探索在生产系统中的应用。