发布求助
文献互助 智能选刊 最新文献

2018 Ivannikov Memorial Workshop (IVMEM)最新文献

筛选
英文 中文
Analysis of the Effectiveness of the DVM / DVMH Technology for the Parallel Solution of the Burgers Parametric Equation DVM / DVMH技术并行求解Burgers参数方程的有效性分析
2018 Ivannikov Memorial Workshop (IVMEM) Pub Date : 2018-05-03 DOI: 10.1109/IVMEM.2018.00017
A. Bondarev, V. Galaktionov, A. Kuvshinnikov
{"title":"Analysis of the Effectiveness of the DVM / DVMH Technology for the Parallel Solution of the Burgers Parametric Equation","authors":"A. Bondarev, V. Galaktionov, A. Kuvshinnikov","doi":"10.1109/IVMEM.2018.00017","DOIUrl":"https://doi.org/10.1109/IVMEM.2018.00017","url":null,"abstract":"The work presents a study of the effectiveness of DVM / DVMH technology for parallel solution of one-dimensional parametric problems of gas dynamics. A description is given of the numerical experiments carried out to investigate the problem of finding the optimal ratio between the given number of computational nodes given by the parameters of these nodes and the allocated graphic coprocessors for various problems on specific program codes representing one-dimensional parametric problems of gas dynamics. The results of calculations and the characteristics of efficiency and acceleration are presented.","PeriodicalId":442889,"journal":{"name":"2018 Ivannikov Memorial Workshop (IVMEM)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116147285","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
Static Analysis of Dlsym-Like Function Calls 类dlsymm函数调用的静态分析
2018 Ivannikov Memorial Workshop (IVMEM) Pub Date : 2018-05-03 DOI: 10.1109/IVMEM.2018.00010
E. Kudryashov
{"title":"Static Analysis of Dlsym-Like Function Calls","authors":"E. Kudryashov","doi":"10.1109/IVMEM.2018.00010","DOIUrl":"https://doi.org/10.1109/IVMEM.2018.00010","url":null,"abstract":"The problem of constructing full call graph of a program can be complicated by absence of indirect calls in the graph. It may happen when a developer decides to invoke a function by pointer. The appearance of functions like dlsym makes it possible. Such functions allows to obtain an address of a function from a library at runtime. The paper suggests two step static analysis for revealing symbols loaded at runtime. The first step collects auxiliary information about a program between translation units, the second applies collected information to analyze individual translation units.","PeriodicalId":442889,"journal":{"name":"2018 Ivannikov Memorial Workshop (IVMEM)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114193072","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
Comparison of the Performance of Open-Source and Commercial CFD Packages for Simulating Supersonic Compressible Jet Flows 模拟超音速可压缩射流的开源和商用CFD软件包的性能比较
2018 Ivannikov Memorial Workshop (IVMEM) Pub Date : 2018-05-03 DOI: 10.1109/IVMEM.2018.00019
A. Al-Zoubi, Jörn Beilke, V. Korchagova, S. V. Strizhak, M. Kraposhin
{"title":"Comparison of the Performance of Open-Source and Commercial CFD Packages for Simulating Supersonic Compressible Jet Flows","authors":"A. Al-Zoubi, Jörn Beilke, V. Korchagova, S. V. Strizhak, M. Kraposhin","doi":"10.1109/IVMEM.2018.00019","DOIUrl":"https://doi.org/10.1109/IVMEM.2018.00019","url":null,"abstract":"The objective of this work is to compare the performance efficiency and accuracy of commercial STAR-CCM+ and open-source OpenFOAM computational fluid dynamics codes in simulating compressible supersonic jet flows. For this purpose two cases were considered. The first case is the well-known Ladenburg supersonic jet with Mach reflection and the second case represents gas flow in an automotive airbag. The results showed that computational cost per one iteration for OpenFOAM is comparable or even less than for STAR-CCM+. The accuracy of both codes is also at a comparable level. However, STAR-CCM+ allows making calculation with a larger time step (Co >1), highlighting ways for future OpenFOAM development.","PeriodicalId":442889,"journal":{"name":"2018 Ivannikov Memorial Workshop (IVMEM)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124511536","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
Deterministic Static Analysis 确定性静态分析
2018 Ivannikov Memorial Workshop (IVMEM) Pub Date : 2018-05-01 DOI: 10.1109/IVMEM.2018.00009
A. Borodin, A. Belevantsev, D. Zhurikhin, A. Izbyshev
{"title":"Deterministic Static Analysis","authors":"A. Borodin, A. Belevantsev, D. Zhurikhin, A. Izbyshev","doi":"10.1109/IVMEM.2018.00009","DOIUrl":"https://doi.org/10.1109/IVMEM.2018.00009","url":null,"abstract":"The paper describes the issues that were found during fixing the nondeterministic behaviour of the Svace static analyzer and the approaches we have used to fix those issues. To ensure determinism, a lot of analysis phases and the build process were reworked. In addition, the stability of the analyzer results for small changes in input data is increased.","PeriodicalId":442889,"journal":{"name":"2018 Ivannikov Memorial Workshop (IVMEM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126042305","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
Data Quality Impact in Business Inteligence 商业智能中的数据质量影响
2018 Ivannikov Memorial Workshop (IVMEM) Pub Date : 2018-05-01 DOI: 10.1109/IVMEM.2018.00016
Eliza Gyulgyulyan, F. Ravat, H. Astsatryan, Julien Aligon
{"title":"Data Quality Impact in Business Inteligence","authors":"Eliza Gyulgyulyan, F. Ravat, H. Astsatryan, Julien Aligon","doi":"10.1109/IVMEM.2018.00016","DOIUrl":"https://doi.org/10.1109/IVMEM.2018.00016","url":null,"abstract":"In today's digital world enormous amount of data is collected, categorized, stored for further analysis. The high volume of data is challenging for companies to deal with when the quality of data is in a low level of adequacy. Besides, Data Quality (DQ) solutions getting more time-consuming which is a challenge in the case of high volume of data and can cost losses within a company. The DQ has a massive impact on Data Exploration Quality (DEQ) in decisional process. The article aims to describe a model allowing users to deal with data quality and make decisions considering the quality of the data. Depending on the operational context a user can choose to improve the particular aspect of DQ or not, thus by eliminating the need to fully integrate poor data so that not to frustrate the decisions that are made based on that data.","PeriodicalId":442889,"journal":{"name":"2018 Ivannikov Memorial Workshop (IVMEM)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114074293","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
Recursive Matrix Algorithms in Commutative Domain for Cluster with Distributed Memory 分布式内存集群交换域的递归矩阵算法
2018 Ivannikov Memorial Workshop (IVMEM) Pub Date : 2018-05-01 DOI: 10.1109/IVMEM.2018.00015
G. Malaschonok, E. Ilchenko
{"title":"Recursive Matrix Algorithms in Commutative Domain for Cluster with Distributed Memory","authors":"G. Malaschonok, E. Ilchenko","doi":"10.1109/IVMEM.2018.00015","DOIUrl":"https://doi.org/10.1109/IVMEM.2018.00015","url":null,"abstract":"We give an overview of the theoretical results for matrix block-recursive algorithms in commutative domains and present the results of experiments that we conducted with new parallel programs based on these algorithms on a supercomputer MVS-10P at the Joint Supercomputer Center of the Russian Academy of Science. To demonstrate a scalability of these programs we measure the running time of the program for a different number of processors and plot the graphs of efficiency factor. Also we present the main application areas in which such parallel algorithms are used. It is concluded that this class of algorithms allows to obtain efficient parallel programs on clusters with distributed memory.","PeriodicalId":442889,"journal":{"name":"2018 Ivannikov Memorial Workshop (IVMEM)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117138427","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
Peripheral Device Register Support for Source Code Boilerplate Generator of QEMU Development Toolkit 外围设备寄存器支持源代码样板生成器的QEMU开发工具包
2018 Ivannikov Memorial Workshop (IVMEM) Pub Date : 2018-05-01 DOI: 10.1109/IVMEM.2018.00014
V. Efimov, V. Padaryan
{"title":"Peripheral Device Register Support for Source Code Boilerplate Generator of QEMU Development Toolkit","authors":"V. Efimov, V. Padaryan","doi":"10.1109/IVMEM.2018.00014","DOIUrl":"https://doi.org/10.1109/IVMEM.2018.00014","url":null,"abstract":"QEMU emulator is used together with different security tools to solve problems where maximum control over virtual machine is required. Absence of a proper VM with specific devices is a widespread issue. Also, development of a new virtual device (device model) is a error prone and time consuming process. The QEMU Development Toolkit (QDT) can be used to simplify the first stage of this process by generating boilerplate code for models. Currently QDT can generate the bulk of device model code. The paper discusses some extensions of QDT capabilities. A device register model was added. The register model allows to generate extra code for frequently met device register behavior patterns. The model is implemented as an extension to QDT device description API in Python. Evaluation showed that size of device register description is half of C-code boilerplate generated from it. The register description is gathered in one place, that's more convenient for developer whereas generated code is spread across the boilerplate.","PeriodicalId":442889,"journal":{"name":"2018 Ivannikov Memorial Workshop (IVMEM)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116034226","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
Design and Development of Svace Static Analyzers 空间静态分析仪的设计与开发
2018 Ivannikov Memorial Workshop (IVMEM) Pub Date : 2018-05-01 DOI: 10.1109/IVMEM.2018.00008
A. Belevantsev, A. Borodin, I. Dudina, V. Ignatiev, A. Izbyshev, S. Polyakov, Evgeny Velesevich, D. Zhurikhin
{"title":"Design and Development of Svace Static Analyzers","authors":"A. Belevantsev, A. Borodin, I. Dudina, V. Ignatiev, A. Izbyshev, S. Polyakov, Evgeny Velesevich, D. Zhurikhin","doi":"10.1109/IVMEM.2018.00008","DOIUrl":"https://doi.org/10.1109/IVMEM.2018.00008","url":null,"abstract":"Static analysis became the mainstream technology that is widely used in secure development lifecycles. As such it is covered by a lot of research works highlighting many diverse aspects. We would like to make this paper a single place that focuses on two important questions. First, it is a very long road to travel for a tool to be deployed in production, and the technology and design that actually worked is of interest. Second, once the tool has been made, it needs to be pushed further both with the evolutional approach of gradually improving analysis algorithms and with exploring completely new ideas, yet this task is not easy as inviting directions are many. This paper presents our view for the above problems in the context of a static analysis that strives to be fully automatic, scalable to modern computing systems, and generating good quality warnings. We derive the discussion from our experience put into the Svace static analyzers that have been made at ISP RAS and deployed to various production development environments.","PeriodicalId":442889,"journal":{"name":"2018 Ivannikov Memorial Workshop (IVMEM)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129190267","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
LLVM Based Approach to Static Analysis of C Programs in SAPFOR 基于LLVM的SAPFOR C程序静态分析方法
2018 Ivannikov Memorial Workshop (IVMEM) Pub Date : 2018-05-01 DOI: 10.1109/IVMEM.2018.00011
N. Kataev
{"title":"LLVM Based Approach to Static Analysis of C Programs in SAPFOR","authors":"N. Kataev","doi":"10.1109/IVMEM.2018.00011","DOIUrl":"https://doi.org/10.1109/IVMEM.2018.00011","url":null,"abstract":"Heterogeneous computational systems are becoming very popular nowadays. However, developing efficient parallel programs, that can exploit the potential parallelism of these systems, still remains difficult for most of application programmers. Program parallelization may require significant transformation of the original program. SAPFOR (System FOR Automated Parallelization) aims to simplify the development of parallel programs of scientific-technical calculations. It was designed to perform source-to-source transformation of a sequential program for execution on heterogeneous computational systems. This paper discusses the implementation of program analysis in SAPFOR. The presented approach relies on LLVM (Low Level Virtual Machine) capabilities to examine a program. SAPFOR explores the properties of low-level program representation to recognize related properties of the program in programming language. Some kind of IR-level transformations may be applied without any loss of analysis accuracy. Furthermore, these transformations allow us to increase the quality of program analysis.","PeriodicalId":442889,"journal":{"name":"2018 Ivannikov Memorial Workshop (IVMEM)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123525470","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
Grammar-Based Fuzzing 基于语法的起毛
2018 Ivannikov Memorial Workshop (IVMEM) Pub Date : 2018-05-01 DOI: 10.1109/IVMEM.2018.00013
Sevak Sargsyan, S.Sh. Kurmangaleev, M. Mehrabyan, Maksim Mishechkin, Tsolak Ghukasyan, Sergey A. Asryan
{"title":"Grammar-Based Fuzzing","authors":"Sevak Sargsyan, S.Sh. Kurmangaleev, M. Mehrabyan, Maksim Mishechkin, Tsolak Ghukasyan, Sergey A. Asryan","doi":"10.1109/IVMEM.2018.00013","DOIUrl":"https://doi.org/10.1109/IVMEM.2018.00013","url":null,"abstract":"This article presents new method for fuzzing programs accepting complex structured data based on BNF grammars. The majority of existing fuzzing methods do not take into account the structure of inputs for target program. Existing BNF structured data generating tools have various restrictions: BNF rules must be specified for target program, they are not scalable, generated data is not fully compatible with BNF rules, etc. We propose new algorithm for BNF structured data generation which uses ANTLR platform's descriptions of BNF rules for more than 120 languages and data formats. Every rule of grammar designed as universal pushdown automata, which allows as automatically generate BNF compatible data. Then we embed it as mutation plugin in fuzzing tool. According to experimental results in some cases we were able significantly increased code coverage.","PeriodicalId":442889,"journal":{"name":"2018 Ivannikov Memorial Workshop (IVMEM)","volume":"272 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133035008","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}
引用次数: 11
下一页 尾页
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学术官方微信
小红书