2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE)最新文献

筛选
英文 中文
Refinement-based synthesis of correct contract model decompositions 基于精细化的正确契约模型分解的综合
2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE) Pub Date : 2014-11-20 DOI: 10.1109/MEMCOD.2014.6961851
Thi Thieu Hoa Le, R. Passerone
{"title":"Refinement-based synthesis of correct contract model decompositions","authors":"Thi Thieu Hoa Le, R. Passerone","doi":"10.1109/MEMCOD.2014.6961851","DOIUrl":"https://doi.org/10.1109/MEMCOD.2014.6961851","url":null,"abstract":"In distributed development of modern systems, contracts play a vital role in ensuring interoperability of components and adherence to specifications. It is therefore often desirable to verify the satisfaction of an overall property represented as a contract, given the satisfaction of smaller properties also represented as contracts. When the verification result is negative, designers must face the issue of refining the sub-properties and components. This is an instance of the classical synthesis problems: “can we construct a model that satisfies some given specification?”. In this work, we propose a strategy enabling designers to synthesize or refine a set of contracts so that their composition satisfies a given contract. We develop a generic algebraic method, and show how it can be applied in different contract models to support top-down component-based development of distributed systems.","PeriodicalId":195342,"journal":{"name":"2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123839457","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Cycle-accurate 8080 emulation using an ARM11 processor with dynamic binary translation 周期精确8080仿真使用一个ARM11处理器与动态二进制转换
2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE) Pub Date : 2014-11-20 DOI: 10.1109/MEMCOD.2014.6961858
D. Richie, J. Ross
{"title":"Cycle-accurate 8080 emulation using an ARM11 processor with dynamic binary translation","authors":"D. Richie, J. Ross","doi":"10.1109/MEMCOD.2014.6961858","DOIUrl":"https://doi.org/10.1109/MEMCOD.2014.6961858","url":null,"abstract":"We describe the investigation of methods for cycle-accurate emulation of an Intel 8080 CPU using a low-power ARM11 CPU. Source-level optimizations and several threaded dispatch designs are explored, as well as an extreme optimization technique using direct register mapping and dynamic binary translation between the two Instruction Set Architectures. The cycle efficiency of the fastest design is nearly as fast as the original 8080 processor.","PeriodicalId":195342,"journal":{"name":"2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131417397","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Probabilistic model checking based DAL analysis to optimize a combined TMR-blind-scrubbing mitigation technique for FPGA-based aerospace applications 基于概率模型检查的DAL分析优化基于fpga的航空航天应用的tmr -盲擦洗组合缓解技术
2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE) Pub Date : 2014-11-20 DOI: 10.1109/MEMCOD.2014.6961856
K. A. Hoque, O. Mohamed, Y. Savaria, C. Thibeault
{"title":"Probabilistic model checking based DAL analysis to optimize a combined TMR-blind-scrubbing mitigation technique for FPGA-based aerospace applications","authors":"K. A. Hoque, O. Mohamed, Y. Savaria, C. Thibeault","doi":"10.1109/MEMCOD.2014.6961856","DOIUrl":"https://doi.org/10.1109/MEMCOD.2014.6961856","url":null,"abstract":"SRAM-based FPGAs are increasingly popular in the aerospace industry for their field programmability and low cost. However, they suffer from cosmic radiation induced Single Event Upsets (SEUs), commonly known as soft errors. In safety-critical applications, the dependability of the design is a prime concern since failures may have catastrophic consequences. An early analysis of dependability of such safety-critical applications will enable designers to develop a design that meets the high availability and reliability requirements of the DO-254 standard. This paper introduces a novel methodology based on probabilistic model checking, to analyze the dependability properties of safety-critical systems and to suggest required mitigation techniques, such as Triple Modular Redundancy (TMR) or TMR with less frequent scrubs for early design decisions. Starting from a high-level description of a system, a Markov model is constructed from the Control Data Flow Graph (CDFG) expressing the functionality and from failure/mitigation parameters for the targeted FPGAs. Such an exhaustive model captures all the failures and repairs possible in the system within the radiation environment. We present a case study on a benchmark circuit to illustrate the applicability of the proposed approach to demonstrate that a wide range of useful dependability properties can be analyzed using our proposed methodology.","PeriodicalId":195342,"journal":{"name":"2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130618750","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 21
MEMOCODE 2014 software design contest: Space Invaders emulator MEMOCODE 2014软件设计大赛:太空入侵者模拟器
2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE) Pub Date : 2014-11-20 DOI: 10.1109/MEMCOD.2014.6961857
S. Edwards, Hiren D. Patel
{"title":"MEMOCODE 2014 software design contest: Space Invaders emulator","authors":"S. Edwards, Hiren D. Patel","doi":"10.1109/MEMCOD.2014.6961857","DOIUrl":"https://doi.org/10.1109/MEMCOD.2014.6961857","url":null,"abstract":"The MEMOCODE design contest for 2014 was centered around the emulation of the 1978 Taito video game Space Invaders. The challenge is to improve the speed of a cycle-accurate software emulator for the game. Contestants had a month toope improve the provided code, which already ran fairly well on the ARM-based Raspberry Pi platform. Entries were judged on how much faster their code ran and its quality. The winning groups used a variety of optimization techniques ranging from dynamic binary translation, data-structure restructuring, and improving instruction and data caching.","PeriodicalId":195342,"journal":{"name":"2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE)","volume":"194 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133651609","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Performance analysis of the Disrupted Static Priority scheduling for AFDX AFDX中断静态优先级调度的性能分析
2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE) Pub Date : 2014-11-20 DOI: 10.1109/MEMCOD.2014.6961847
Rubén Trillo Flores, M. Boyer
{"title":"Performance analysis of the Disrupted Static Priority scheduling for AFDX","authors":"Rubén Trillo Flores, M. Boyer","doi":"10.1109/MEMCOD.2014.6961847","DOIUrl":"https://doi.org/10.1109/MEMCOD.2014.6961847","url":null,"abstract":"The AFDX technology is used as backbone in several aircraft. It offers a high bandwidth (commonly 100Mb/s), and guaranteed per data flow a bound on the network traversal delay, while being a shared resource. To do so, it uses a segregation mechanism, the Virtual Link (VL), designed as a bus abstraction. Nevertheless, there may exist applications with such stringent latency requirements that a given AFDX topology can not ensure it. To provide low latency, the AFDX technology provides priority levels: but even in the highest priority level, the latency bound can still be too high with regard to applicative requirements. One cause of latency is the non-preemptive aspect of priority policy: when a high priority frame reaches an output port, it may have to wait the emission of a low priority frame. Then, a high priority frame might have to face a delay equal to the maximum packet emission time of the low priority flows per crossed switch. The scheduling policy called Disrupted Static Priority (DSP) aims to improve the latency guarantees, by interrupting low priority frames, and re-emitting them from the beginning. This policy is a trade-off between simplicity and efficiency. A quantitative comparison between the NP-SP and the DSP scheduling systems' performance on a realistic case-study is provided in this article.","PeriodicalId":195342,"journal":{"name":"2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130109433","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A multi-core version of FreeRTOS verified for datarace and deadlock freedom FreeRTOS的多核版本,验证了数据空间和死锁自由
2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE) Pub Date : 2014-11-20 DOI: 10.1109/MEMCOD.2014.6961844
P. Chandrasekaran, Kavum Muriyil Balachandran Shibu Kumar, Remish L. Minz, D. D'Souza, Lomesh Meshram
{"title":"A multi-core version of FreeRTOS verified for datarace and deadlock freedom","authors":"P. Chandrasekaran, Kavum Muriyil Balachandran Shibu Kumar, Remish L. Minz, D. D'Souza, Lomesh Meshram","doi":"10.1109/MEMCOD.2014.6961844","DOIUrl":"https://doi.org/10.1109/MEMCOD.2014.6961844","url":null,"abstract":"We present the design of a multicore version of FreeRTOS, a popular open source real-time operating system for embedded applications. We generalize the scheduling policy of FreeRTOS to schedule the n highest-priority longest-waiting tasks, for an n-core processsor. We use a locking mechanism that provides maximum decoupling between tasks, while ensuring mutually exclusive access to kernel data-structures. We provide an implementation of the portable part of FreeRTOS (written in C) and provide the device specific implementation of the locking mechanism for Intel and ARM Cortex multicore processors. We model the locking mechanism and the locking protocol used by the API's in the Spin model-checking tool and verify that the design is free from dataraces and deadlocks. Finally, we extend the existing FreeRTOS Windows simulator to simulate our multicore version of FreeRTOS, and evaluate its performance on some demo applications.","PeriodicalId":195342,"journal":{"name":"2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE)","volume":"518 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123109695","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Keynote talk IIP: Proving (and revisiting) what programs do not 主题演讲IIP:证明(并重新审视)哪些程序没有做到
2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE) Pub Date : 2014-11-20 DOI: 10.1109/MEMCOD.2014.6961852
B. Meyer
{"title":"Keynote talk IIP: Proving (and revisiting) what programs do not","authors":"B. Meyer","doi":"10.1109/MEMCOD.2014.6961852","DOIUrl":"https://doi.org/10.1109/MEMCOD.2014.6961852","url":null,"abstract":"Summary form only given. In 2007, I had the honor of an invited presentation at MEMOCODE, where I discussed the frame problem: how to establish that programs do not modify certain properties. The problem is particularly challenging in the case of object-oriented programs involving complex pointer (reference) data structures. Seven years later, it is still largely an open problem, although significant progress has occurred. After realizing that a satisfactory solution requires addressing another difficult problem, alias analysis, I have devoted much of my work to program analysis techniques that tackle both aliasing and framing. Taking advantage of the kind invitation to present again at MEMOCODE, I will describe the current state of this work and how its results are embodied in program analysis tools that provide automatic means - not requiring program annotations - to ascertain fundamental properties of programs.","PeriodicalId":195342,"journal":{"name":"2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE)","volume":"18 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113997363","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Tutorial I: Efficient symbolic execution for software testing 教程1:软件测试的有效符号执行
2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE) Pub Date : 2014-11-20 DOI: 10.1109/MEMCOD.2014.6961867
Johannes Kinder
{"title":"Tutorial I: Efficient symbolic execution for software testing","authors":"Johannes Kinder","doi":"10.1109/MEMCOD.2014.6961867","DOIUrl":"https://doi.org/10.1109/MEMCOD.2014.6961867","url":null,"abstract":"Summary form only given. Symbolic execution has proven to be a practical technique for building automated test case generation and bug finding tools. While the basic technique had been introduced already in the 70s, the advent of modern SAT and SMT solvers has lead to a surge of tools and techniques in the area over the last decade. This tutorial will introduce and compare the different approaches to using symbolic execution for testing and discuss the specific challenges and trade-offs. A main challenge in symbolic execution is path explosion, and various proposals have been made to either combat it. I will discuss how these techniques affect the number and type of solver queries that have to be made, and how this can lead to surprising effects on the efficiency of a symbolic execution engine. Going further, we will look at developments to increase the scope of symbolic execution to larger software systems. Specific topics covered include state merging, procedure summaries, abstraction, search strategies, and parallelization.","PeriodicalId":195342,"journal":{"name":"2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115192694","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Three-valued asynchronous distributed runtime verification 三值异步分布式运行时验证
2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE) Pub Date : 2014-11-20 DOI: 10.1109/MEMCOD.2014.6961843
Torben Scheffel, Malte Schmitz
{"title":"Three-valued asynchronous distributed runtime verification","authors":"Torben Scheffel, Malte Schmitz","doi":"10.1109/MEMCOD.2014.6961843","DOIUrl":"https://doi.org/10.1109/MEMCOD.2014.6961843","url":null,"abstract":"This paper studies runtime verification of distributed asynchronous systems and presents a monitor generation procedure for this purpose, which allows three-valued monitoring. The properties used in the monitors are specified in a logic that was newly created for this purpose and is called Distributed Temporal Logic (DTL). DTL combines the three-valued Linear Temporal Logic (LTL3) with the past-time Distributed Temporal Logic (ptDTL), which allows to mark subformulas for remote evaluation. The monitor generation presented in this paper is based on an adopted version of the LTL3 monitor generation, which integrates the ptDTL monitor construction. The aim of this new procedure is to increase the amount of monitorable properties compared to the properties monitorable with ptDTL. Runtime verification using this new monitoring has been implemented on LEGO Mindstorms NXT robots communicating via Bluetooth.","PeriodicalId":195342,"journal":{"name":"2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122882454","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 34
A fast emulator for ARM-based embedded systems 基于arm的嵌入式系统的快速仿真器
2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE) Pub Date : 2014-11-20 DOI: 10.1109/MEMCOD.2014.6961859
Nariman Eskandari, Hatef Madani, Armin Ahmadzadeh, M. Aznaveh, S. Gorgin
{"title":"A fast emulator for ARM-based embedded systems","authors":"Nariman Eskandari, Hatef Madani, Armin Ahmadzadeh, M. Aznaveh, S. Gorgin","doi":"10.1109/MEMCOD.2014.6961859","DOIUrl":"https://doi.org/10.1109/MEMCOD.2014.6961859","url":null,"abstract":"This paper presents a high-performance implementation for an Intel 8080 emulator on a Raspberry Pi device. The problem was defined as a software contest in MEMOCODE 2014 and this implementation took the second place in this contest. We deployed several optimization techniques and employed best programming practices to increase the performance of the naïve reference implementation. Improving data structure usage and modifying function calls are the techniques that resulted in higher performance of this implementation. Our implementation has about 2.5 times speedup over the reference code of the contest.","PeriodicalId":195342,"journal":{"name":"2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130720653","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书