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

Efficient implementation of continuous skyline computation on a multi-core processor 在多核处理器上高效地实现连续天际线计算

2015 ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE) Pub Date : 2015-12-03 DOI: 10.1109/MEMCOD.2015.7340468

Kenichi Koizumi, M. Inaba, K. Hiraki

引用次数: 7

Efficient continuous skyline computation on multi-core processors based on Manhattan distance 基于曼哈顿距离的多核处理器高效连续天际线计算

2015 ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE) Pub Date : 2015-12-03 DOI: 10.1109/MEMCOD.2015.7340469

Ehsan Montahaei, M. Ghafouri, Saied Rahmani, Hanie Ghasemi, Farzad Sharif Bakhtiar, Rashid Zamanshoar, Kianoush Jafari, Mohsen Gavahi, Reza Mirzaei, Armin Ahmadzadeh, S. Gorgin

{"title":"Efficient continuous skyline computation on multi-core processors based on Manhattan distance","authors":"Ehsan Montahaei, M. Ghafouri, Saied Rahmani, Hanie Ghasemi, Farzad Sharif Bakhtiar, Rashid Zamanshoar, Kianoush Jafari, Mohsen Gavahi, Reza Mirzaei, Armin Ahmadzadeh, S. Gorgin","doi":"10.1109/MEMCOD.2015.7340469","DOIUrl":"https://doi.org/10.1109/MEMCOD.2015.7340469","url":null,"abstract":"The continuous Skyline query has recently become the subject of the several researches due to its wide spectrum of applications such as multi-criteria decision making, graph analysis network, wireless sensor network and data exploration. In these applications, the datasets are huge and have various dimensions. Moreover, they constantly change as time passes. Therefore, this query is considered as a computation intensive operation that finding the result in a reasonable time is a challenge. In this paper, we present an efficient parallel continuous Skyline approach. In our suggested method, the dataset points are sorted and pruned based on Manhattan distance. Moreover, we use several optimization methods to optimize memory usage in comparison with naïve implementation. In addition, besides the applied conventional parallelization methods, we partition the time steps based on the number of available cores. The experimental results for a dataset that contains 800k points with 7 dimensions show considerable speedup.","PeriodicalId":106851,"journal":{"name":"2015 ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126124313","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}

引用次数: 3

Layering RTL, SAFL, Handel-C and Bluespec constructs on Chisel HCL 在Chisel HCL上分层RTL, SAFL, Handel-C和Bluespec结构

2015 ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE) Pub Date : 2015-12-03 DOI: 10.1109/MEMCOD.2015.7340477

D. Greaves

引用次数: 3

Passive testing of production systems based on model inference 基于模型推理的生产系统被动测试

2015 ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE) Pub Date : 2015-12-03 DOI: 10.1109/MEMCOD.2015.7340480

William Durand, S. Salva

{"title":"Passive testing of production systems based on model inference","authors":"William Durand, S. Salva","doi":"10.1109/MEMCOD.2015.7340480","DOIUrl":"https://doi.org/10.1109/MEMCOD.2015.7340480","url":null,"abstract":"This paper tackles the problem of testing production systems, i.e. systems that run in industrial environments, and that are distributed over several devices and sensors. Usually, such systems lack of models, or are expressed with models that are not up to date. Without any model, the testing process is often done by hand, and tends to be an heavy and tedious task. This paper contributes to this issue by proposing a framework called Autofunk, which combines different fields such as model inference, expert systems, and machine learning. This framework, designed with the collaboration of our industrial partner Michelin, infers formal models that can be used as specifications to perform offline passive testing. Given a large set of production messages, it infers exact models that only capture the functional behaviours of a system under analysis. Thereafter, inferred models are used as input by a passive tester, which checks whether a system under test conforms to these models. Since inferred models do not express all the possible behaviours that should happen, we define conformance with two implementation relations. We evaluate our framework on real production systems and show that it can be used in practice.","PeriodicalId":106851,"journal":{"name":"2015 ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123173806","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}

引用次数: 5

Modeling resource sharing using FSM-SADF 使用FSM-SADF建模资源共享

2015 ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE) Pub Date : 2015-12-03 DOI: 10.1109/MEMCOD.2015.7340475

J. Bastos, S. Stuijk, J. Voeten, R. Schiffelers, Johan Jacobs, H. Corporaal

{"title":"Modeling resource sharing using FSM-SADF","authors":"J. Bastos, S. Stuijk, J. Voeten, R. Schiffelers, Johan Jacobs, H. Corporaal","doi":"10.1109/MEMCOD.2015.7340475","DOIUrl":"https://doi.org/10.1109/MEMCOD.2015.7340475","url":null,"abstract":"This paper proposes a modeling approach to capture the mapping of an application on a platform. The approach is based on Scenario-Aware Dataflow (SADF) models. In contrast to the related work, we express the complete design-space in a single formal SADF model. This allows us to have a compact and explorable state-space linked with an executable model capable of symbolically analyzing different mappings for their timing behavior. We can model different bindings for application tasks, different static-orders schedules for tasks bound in shared resources, as well as naturally capturing resource claiming/unclaiming using SADF semantics. Moreover, by using the inherent properties of dataflow graphs and the dynamic behavior of a Finite-State Machine, we can model different levels of pipelining, such as full application pipelining and interleaved pipelining of consecutive executions of the application. The size of the model is independent of the number of executions of the application. Since we are able to capture all this behavior in a single SADF model we can use available dataflow analysis, such as worst-case and best-case throughput and deadlock-freedom checking. Furthermore, since the model captures the design-space independently of the analysis technique, one can use different exploration approaches to analyze different sets of requirements.","PeriodicalId":106851,"journal":{"name":"2015 ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115084325","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

Keynote talk II: Accelerating data centers using reconfigurable logic 主题演讲II:使用可重构逻辑加速数据中心

2015 ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE) Pub Date : 2015-12-03 DOI: 10.1109/MEMCOD.2015.7340470

Derek Chiou

引用次数: 1

Automatic and configurable instrumentation of C programs with temporal assertion checkers 带有临时断言检查器的C程序的自动和可配置的工具

2015 ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE) Pub Date : 2015-12-03 DOI: 10.1109/MEMCOD.2015.7340488

Martial Chabot, Kévin Mazet, L. Pierre

引用次数: 6

Hierarchical multi-formalism proofs of cyber-physical systems 网络物理系统的分层多形式证明

2015 ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE) Pub Date : 2015-12-03 DOI: 10.1109/MEMCOD.2015.7340474

M. Whalen, Sanjai Rayadurgam, Elaheh Ghassabani, A. Murugesan, O. Sokolsky, M. Heimdahl, Insup Lee

引用次数: 3

Design and verification of multi-rate distributed systems 多速率分布式系统的设计与验证

2015 ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE) Pub Date : 2015-12-03 DOI: 10.1109/MEMCOD.2015.7340463

Wenchao Li, Léonard Gérard, N. Shankar

引用次数: 11

Keynote talk I: Syntax-guided synthesis 主题演讲一:语法引导合成

2015 ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE) Pub Date : 2015-12-03 DOI: 10.1109/MEMCOD.2015.7340460

R. Alur

{"title":"Keynote talk I: Syntax-guided synthesis","authors":"R. Alur","doi":"10.1109/MEMCOD.2015.7340460","DOIUrl":"https://doi.org/10.1109/MEMCOD.2015.7340460","url":null,"abstract":"The classical formulation of the program-synthesis problem is to find a program that meets a correctness specification given as a logical formula. Recent work on program synthesis and program optimization illustrates many potential benefits of allowing the user to supplement the logical specification with a syntactic template that constrains the space of allowed implementations. The formulation of the syntax-guided synthesis problem (SyGuS) is aimed at standardizing the core computational problem common to these proposals in a logical framework [1]. The input to the SyGuS problem consists of a background theory, a semantic correctness specification for the desired program given by a logical formula, and a syntactic set of candidate implementations given by a grammar. The computational problem then is to find an implementation from the set of candidate expressions so that it satisfies the specification in the given theory. In this talk, we first describe how a wide range of problems such as automatic synthesis of loop invariants, program optimization, learning programs from examples, and program sketching, can be formalized as SyGuS instances. We then describe three different instantiations of the counter-example-guided-inductive-synthesis (CEGIS) strategy for solving the SyGuS problem. Finally, we discuss our efforts over the past two years on defining the standardized interchange format built on top of SMT-LIB, repository of benchmarks from diverse applications, organization of the annual competition, SyGuS-COMP, of solvers, and experimental evaluation of solution strategies. More information about our project is available at www.sygus.org. This research is supported by the NSF Expeditions in Computing project ExCAPE (award CCF 1138996).","PeriodicalId":106851,"journal":{"name":"2015 ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114505122","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}

引用次数: 3