检索结果-内蒙古大学图书馆

arXiv 2021年

作者： Nurmukhametov, Alexey Vishnyakov, Alexey Logunova, Vlada Kurmangaleev, Shamil Ivannikov Institute for System Programming of the RAS Russia Moscow Institute of Physics and Technology Moscow Russia

Nowadays, exploits often rely on a code-reuse approach. Short pieces of code called gadgets are chained together to execute some payload. Code-reuse attacks can exploit vulnerabilities in the presence of operating system protection that prohibits data memory execution. The ROP chain construction task is the code generation for the virtual machine defined by an exploited executable. It is crucial to understand how powerful ROP attacks can be. Such knowledge can be used to improve software security. We implement MAJORCA that generates ROP and JOP payloads in an architecture agnostic manner and thoroughly consider restricted symbols such as null bytes that terminate data copying via strcpy. The paper covers the whole code-reuse payloads construction pipeline: cataloging gadgets, chaining them in DAG, scheduling, linearizing to the ready-to-run payload. MAJORCA automatically generates both ROP and JOP payloads for x86 and MIPS. MAJORCA constructs payloads respecting restricted symbols both in gadget addresses and data. We evaluate MAJORCA performance and accuracy with rop-benchmark and compare it with open-source compilers. We show that MAJORCA outperforms open-source tools. We propose a ROP chaining metric and use it to estimate the probabilities of successful ROP chaining for different operating systems with MAJORCA as well as other ROP compilers to show that ROP chaining is still feasible. This metric can estimate the efficiency of OS defences. © 2021, CC BY-NC-ND.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

Devirtualization for static analysis with low level intermediate representation

Devirtualization for static analysis with low level intermed...

引用

Ivannikov ISPras Open Conference (ISPras)

作者： Artemiy Galustov Alexey Borodin Andrey Belevantsev Ivannikov Institute for System Programming of the RAS Lomonosov Moscow State University Moscow Russia

We propose a points-to analysis that can recover targets for function pointer calls, virtual calls and method calls for using in a static analysis. We use a flow-insensitive analysis, and the analysis results are intended for flow- and path-sensitive analysis which can improve the initial analysis precision within a single function. We implemented the proposed approach in a static analyzer for finding errors in C, C++, Go, Java and Kotlin programs. The devirtualization algorithm is fast enough and spends less than 6% of the total analysis time. It can work for projects like Tizen 7 with 27.5 MLoc of source code.

关键词： Java Source coding Static analysis C++ languages Virtual machining

来源：评论

学校读者我要写书评

暂无评论

Python Fuzzing for Trustworthy Machine Learning Frameworks

arXiv

引用

arXiv 2024年

作者： Yegorov, Ilya Kobrin, Eli Parygina, Darya Vishnyakov, Alexey Fedotov, Andrey Ivannikov Institute for System Programming of the RAS Russia Lomonosov Moscow State University Russia

Ensuring the security and reliability of machine learning frameworks is crucial for building trustworthy AI-based systems. Fuzzing, a popular technique in secure software development lifecycle (SSDLC), can be used to develop secure and robust software. Popular machine learning frameworks such as PyTorch and TensorFlow are complex and written in multiple programming languages including C/C++ and Python. We propose a dynamic analysis pipeline for Python projects using the Sydr-Fuzz toolset. Our pipeline includes fuzzing, corpus minimization, crash triaging, and coverage collection. Crash triaging and severity estimation are important steps to ensure that the most critical vulnerabilities are addressed promptly. Furthermore, the proposed pipeline is integrated in GitLab CI. To identify the most vulnerable parts of the machine learning frameworks, we analyze their potential attack surfaces and develop fuzz targets for PyTorch, TensorFlow, and related projects such as h5py. Applying our dynamic analysis pipeline to these targets, we were able to discover 3 new bugs and propose fixes for them. © 2024, CC BY-NC-ND.

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

SMT Solvers in Application to Static and Dynamic Symbolic Execution: A Case Study

SMT Solvers in Application to Static and Dynamic Symbolic Ex...

引用

Ivannikov ISPras Open Conference (ISPras)

作者： Nikita Malyshev Irina Dudina Daniil Kutz Alexander Novikov Sergey Vartanov Ivannikov Institute for System Programming of the RAS Lomonosov Moscow State University Moscow Russia

This paper studies the performance and working aspects of SMT solvers on processing formulas acquired during path-sensitive static analysis and dynamic symbolic execution. We review some general patterns of building SMT formulas in the QF_BV logic during analysis and related technical specifics. We also provide the results of comparing different solvers on two sets of requests obtained by Svace static analyzer and Anxiety dynamic symbolic execution tool. It turns out that Yices2 solver performs the best, although, for Svace, notable part of requests can be done better by other solvers. In return, Yices2 misses some features crucial to top-tier analyzers such as deterministic time limit. A brief attempt at making machine learning based solver portfolio shows that solving time can be enhanced, but requires some serious work on feature selection, while technical difficulties may render it unpractical. For Anxiety we found out that with Yices2 incremental solving is almost always faster (sometimes dozens of times faster) than non-incremental. Moreover, the more queries we solve incrementally, the higher acceleration we get.

关键词： Tools Static analysis Computer crashes Performance analysis Portfolios Dynamic programming Buildings

来源：评论

学校读者我要写书评

暂无评论

OpenFOAM High Performance Computing Solver for Simulation of Internal Wave Attractors in Stratified Flows Using Regularized Hydrodynamic Equations

OpenFOAM High Performance Computing Solver for Simulation of...

引用

Ivannikov ISPras Open Conference (ISPras)

作者： Matvey Kraposhin Daniil Ryazanov Tatiana Elizarova Ilias Sibgatullin Michael Kalugin Vasily Velikhov Eygene Ryabinkin Lomonosov Moscow State University Ivannikov Institute for System Programming of the RAS Keldysh Institute of Applied Mathematics of the RAS NRC Kurchatov institute

ISBN: (纸本)9781728112763;9781728112756

Paper presents some results of the implementation of a quasi-hydrodynamic (QHD) approach as finite volume method (FVM) solver mulesQHDFoam on the basis of OpenFOAM. Application of the QHD numerical algorithm to the simulation of the attractor of internal gravity waves is considered. A comparison of FVM with spectral element method (SEM) implemented in Nek5000 is given. Convergence of the QHD FVM solver model to the SEM Nek5000 model is shown. The Big Data analysis method (Proper Orthogonal Decomposition) is used as a tool for comparing the calculation results between QHDFoam and Nek5000.

关键词： Mathematical model Numerical models Cavity resonators Salinity (geophysical) Hydrodynamics Gravity Numerical analysis

来源：评论

学校读者我要写书评

暂无评论

Interprocedural static analysis for Go with closure support

Interprocedural static analysis for Go with closure support

引用

Ivannikov ISPras Open Conference (ISPras)

作者： Alexey Borodin Varvara Dvortsova Alexander Volkov Ivannikov Institute for System Programming of the RAS Lomonosov Moscow State University Moscow Russia

We present an interprocedural static analysis to detect errors in the Go source code. The analysis supports most of the language features, while the main focus of the paper is closures and defer statements. The analysis we have developed demonstrates good scalability and performance. It is able to analyze a project of 1.1 million lines in 12 minutes.

关键词： Source coding Scalability Static analysis

来源：评论

学校读者我要写书评

暂无评论

Deriving complete finite tests based on state machines

Deriving complete finite tests based on state machines

引用

East-West Design & Test Symposium (EWDTS)

作者： Igor Burdonov Alexander Kossatchev Nina Yevtushenko Institute for System Programming of the RAS Moscow Russia Tomsk State University Tomsk Russia

Many state machine based strategies return complete but infinite test suites. A usual approach to guarantee the fault coverage with respect to some kind of faults is to limit the number of faults, i.e., to consider a finite fault domain. In this paper, we summarize some results on deriving complete test suites w.r.t. infinite faults domains but w.r.t. special types of the specification machine.

关键词： Automata Testing Semantics Safety programming Software Chaos

来源：评论

学校读者我要写书评

暂无评论

Specification-Based Test Program Generation for ARM VMSAv8-64 Memory Management Units

Specification-Based Test Program Generation for ARM VMSAv8-6...

引用

International Workshop on Microprocessor Test and Verification (MTV)

作者： Mikhail Chupilko Alexander Kamkin Artem Kotsynyak Alexander Protsenko Sergey Smolov Andrei Tatarnikov Institute for System Programming of the Russian Academy of Sciences (ISP RAS) Moscow Russian Federation

ISBN: (纸本)9781509008865

In this paper, a tool for automatically generating test programs for ARM VMSAv8-64 memory management units is described. The solution is based on the MicroTESK framework being developed at ISP ras. The tool consists of two parts: an architecture-independent test program generation core and VMSAv8-64 specifications. Such separation is not a new principle in the area -- it is applied in a number of industrial test program generators, including IBM's Genesys-Pro. The main distinction is in how specifications are represented, what sort of information is extracted from them, and how that information is exploited. In the suggested approach, specifications comprise descriptions of the memory access instructions, loads and stores, and definition of the memory management mechanisms such as translation lookaside buffers, page tables, and cache units. The tool analyzes the specifications and extracts the execution paths and inter-path dependencies. The extracted information is used to systematically enumerate test programs for a given user-defined template. Test data for a particular program are generated by using symbolic execution and constraint solving techniques.

关键词： Registers Memory management Microprocessors Data mining Syntactics Micromechanical devices Testing

来源：评论

学校读者我要写书评

暂无评论

Casr-Cluster: Crash Clustering for Linux Applications

Casr-Cluster: Crash Clustering for Linux Applications

引用

Ivannikov ISPras Open Conference (ISPras)

作者： Georgy Savidov Andrey Fedotov Ivannikov Institute for System Programming of the RAS Lomonosov Moscow State University Moscow Russia

ISBN: (纸本)9781665423311

Crash report analysis is a necessary step before developers begin fixing errors. Fuzzing or hybrid (with dynamic symbolic execution) fuzzing is often used in the secure Development lifecycle. Modern fuzzers could produce many crashes and developers do not have enough time to fix them till release date. There are two approaches that could reduce developers' effort on crash analysis: crash clustering and crash severity estimation. Crash severity estimation could help developers to prioritize crashes and close security issues first. Crash clustering puts similar crash reports in one cluster what could speed up the analyzing time for all crash reports. In this paper, we focus on crash clustering. We propose an approach for clustering and deduplicating of crashes that occurred in Linux applications. We implement this approach as a tool that could cluster Casr [1] crash reports. We evaluated our tool on a set of crash reports that was collected from fuzzing results.

关键词： Linux Clustering methods Estimation Clustering algorithms Fuzzing Computer crashes Security

来源：评论

学校读者我要写书评

暂无评论

On partitioned and monolithic coupling strategies in lagrangian vortex methods for 2D FSI problems 6

On partitioned and monolithic coupling strategies in lagrang...

引用

6th ECCOMAS European Conference on Computational Mechanics: Solids, Structures and Coupled Problems, ECCM 2018 and 7th ECCOMAS European Conference on Computational Fluid Dynamics, ECFD 2018

作者： Kuzmina, Kseniia S. Marchevsky, Ilia K. Ryatina, Evgeniya P. Bauman Moscow State Technical University 2-nd Baumanskaya st. 5 Moscow105005 Russia Ivannikov Institute for System Programming of the RAS Alexander Solzhenitsyn st. 25 Moscow109004 Russia

ISBN: (纸本)9788494731167

Lagrangian vortex methods are powerful tool for numerical simulation in CFD and coupled fluid structure interaction (FSI) problems. The main feature of vortex methods is vorticity considering as a primary computed variable, while velocity and pressure distributions can be reconstructed by using the Biot - Savart law and the Cauchy - Lagrange integral analogue. Advantages of vortex methods include the possibility to "concentrate" computational resources in the domain with non-zero vorticity and to simulate arbitrary large displacements of the airfoils in the flow. Moreover, in contrast to mesh methods, computational cost of such simulation just a little higher than for flow simulation around immovable airfoil. In this research the problems of flow simulation around oscillating and immovable circular cylinders using vortex methods are considered. The wind resonance phenomenon is investigated, when eigenfrequency of the mechanical system is close to vortex shedding frequency. All numerical results are in good agreement with experimental data. copyright © Crown copyright (2018).All right reserved.

关键词： Vorticity

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：