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

2022 Ivannikov Memorial Workshop, IVMEM 2022

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

ISBN: (数字)9781665492973

ISBN: (纸本)9781665492973

Dynamic symbolic execution (DSE) is an effective method for automated program testing and bug detection. It is increasing the code coverage by the complex branches exploration during hybrid fuzzing. DSE tools invert the branches along some execution path and help fuzzer examine previously unavailable program parts. DSE often faces over-and underconstraint problems. The first one leads to significant analysis complication while the second one causes inaccurate symbolic *** propose strong optimistic solving method that eliminates irrelevant path predicate constraints for target branch inversion. We eliminate such symbolic constraints that the target branch is not control dependent on. Moreover, we separately handle symbolic branches that have nested control transfer instructions that pass control beyond the parent branch scope, e.g. return, goto, break, etc. We implement the proposed method in our dynamic symbolic execution tool *** evaluate the strong optimistic strategy, the optimistic strategy that contains only the last constraint negation, and their combination. The results show that the strategies combination helps increase either the code coverage or the average number of correctly inverted branches per one minute. It is optimal to apply both strategies together in contrast with other configurations. © 2022 IEEE.

关键词： Security of data

来源：评论

学校读者我要写书评

暂无评论

Devirtualization for static analysis with low level intermediate representation

Devirtualization for static analysis with low level intermed...

引用

2022 Ivannikov Open Conference, ISPRAS 2022

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

ISBN: (纸本)9798350398533

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. © 2022 IEEE.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

A TLM-based approach to functional verification of hardware components at different abstraction levels

A TLM-based approach to functional verification of hardware ...

引用

Latin American Test Workshop

作者： Chupilko, Mikhail Kamkin, Alexander Institute for System Programming of RAS A. Solzhenitsyn st. 25 109004 Moscow Russia

ISBN: (纸本)9781457714900

Verification has long been recognized as an integral part of the hardware design process. When designing a system, engineers usually use various design representations and concretize them step by step up to a physical layout. At the beginning of the process, when there is much of indeterminacy, only abstract reference models are applicable to verification;when the process is close to the end, more concrete ones can be utilized. The article concerns problems of developing reusable verification systems (testbenches), which can be used to analyze different versions of the same component at different abstraction levels. We suggest an approach to construct reusable reaction checkers basing on a concept of Transaction Level Modeling (TLM). The paper includes general description of the approach, considers several particular cases, and outlines our experience. © 2011 IEEE.

关键词： Abstracting

来源：评论

学校读者我要写书评

暂无评论

Interprocedural static analysis for Go with closure support

Interprocedural static analysis for Go with closure support

引用

2022 Ivannikov Open Conference, ISPRAS 2022

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

ISBN: (纸本)9798350398533

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. © 2022 IEEE.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

The UniTESK approach to specification-based validation of hardware designs

The UniTESK approach to specification-based validation of ha...

引用

2nd International Symposium on Leveraging Applications of Formal Methods, Verification and Validation, ISoLA 2006

作者： Kamkin, Alexander Institute for System Programming of Russian Academy of Sciences B. Communisticheskaya 25 Moscow Russia

ISBN: (纸本)0769530710

Functional validation is a major bottleneck in hardware design. Two main approaches to ensure functional correctness of hardware systems are based on formal verification and simulation techniques. It is widely recognized that formal verification techniques are exhaustive but do not scale well;simulation-based techniques are scalable but are not exhaustive. Possible compromise is provided by semi-formal approaches combining formal specifications, functional coverage definition, and simulation. This paper describes the UniTESK approach to specification-based validation of hardware designs in which a good balance of exhaustiveness and scalability is found. UniTESK is originally intended for the development of high-quality functional tests for software systems. The paper shows how to adapt it for functional validation of Verilog HDL and systemC designs. © 2007 IEEE.

关键词： Formal verification

来源：评论

学校读者我要写书评

暂无评论

Crash Report Accumulation During Continuous Fuzzing

Crash Report Accumulation During Continuous Fuzzing

引用

2024 Ivannikov Memorial Workshop, IVMEM 2024

作者： Yegorov, Ilya Savidov, Georgy Ivannikov Institute for System Programming of the RAS Russia Lomonosov Moscow State University Moscow Russia

ISBN: (纸本)9798331504663

Crash report accumulation is a necessary step during continuous fuzzing. Dynamic software analysis techniques like fuzzing and dynamic symbolic execution generate a large number of crashes for analysis. However, the time and resource constraints often lead to the postponement of fixing some less critical issues, potentially introducing new errors in future releases. Thus, there is a need to distinguish new errors from old ones. We propose a crash accumulation method and implemented it as part of the CASR toolset. We evaluated our approach on crash reports collected from fuzzing results. © 2024 IEEE.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

3D hydrodynamical simulation of accretion disk in binary star system using RKDG CFD solver

3D hydrodynamical simulation of accretion disk in binary sta...

引用

Workshop on Numerical Modeling in MHD and Plasma Physics: Methods, Tools, and Outcomes. Honor of academician Anatoly Alekseev's 90th Birthday

作者： Galanin, M.P. Lukin, V.V. Chechetkin, V.M. Keldysh Institute of Applied Mathematics of the RAS Moscow Russia Ivannikov Institute for System Programming of the RAS Moscow Russia

We present the results of 3D-hydrodynamical simulations of accretion disk in close binary star system. The model includes the optical star filling its Roche lobe, a gas stream emanating from the inner Lagrangian point of the binary system, and the accretion disc structure. A cold hydrogen gas stream is initially emitted towards a point-like gravitational centre. A stationary accretion disc is formed in about 5 orbital periods after the beginning of accretion. The model uses realistic cooling function for hydrogen. The simulation of accreting gas dynamics is performed using second order Runge-Kutta discontinuous Galerkin CFD solver for unstructured tetrahedral meshes. The monotonicity technique based on Hermite WENO solution reconstruction is implemented. Utilizing the hydrodynamical simulations the sinthetic light curves of the system are calculated as the volume emission of optically thin layers along the line of sight. The simulations results are in a good agreement with observations. © 2018 institute of Physics Publishing. All rights reserved.

关键词： Gas dynamics

来源：评论

学校读者我要写书评

暂无评论

MayAnd at SemEval-2016 task 5: Syntactic and word2vec-based approach to aspect-based polarity detection in Russian 10

MayAnd at SemEval-2016 task 5: Syntactic and word2vec-based ...

引用

10th International Workshop on Semantic Evaluation, SemEval 2016

作者： Mayorov, Vladimir Andrianov, Ivan Institute for System Programming Russian Academy of Sciences 25 Alexander Solzhenitsyn Street Moscow Russia

ISBN: (纸本)9781941643952

This paper describes aspect-based polarity detection system for Russian, used in aspectbased sentiment analysis task (ABSA) of SemEval-2016 (Task 5, subtask 1, slot 3). The system consists of two independent classifiers: for opinion target expressions and for implicit opinion target mentions. We introduce a set of standard unigram features together with more sophisticated ones: based on sentence syntactic structure and based on lemmas vector representation. Being applied to Russian restaurant reviews, our system achieved best quality among four participants. © 2016 Association for Computational Linguistics.

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

Constructing test sequences for hardware designs with parallel starting operations using implicit FSM models

Constructing test sequences for hardware designs with parall...

引用

East-West Design and Test Symposium

作者： Chupilko, Mikhail Institute for System Programming Russian Academy of Sciences 25 A. Solzhenitsyn Street Moscow 109004 Russia

ISBN: (纸本)9781424495566

The paper concerns functional testing of hardware models using finite state machines (FSM). Test construction is done by traversing FSM state graph. In this paper we propose a technique for irredundant description of FSM models of parallel-pipeline designs. The technique allows to implicitly specify complex compositional FSM models and to automate construction of test sequences by composing several parallel operations into multi-stimuli. © 2010 IEEE.

关键词： Automata computer hardware design functional testing hardware model Computer hardware Surgery

来源：评论

学校读者我要写书评

暂无评论

Using algebraic models of programs for detecting metamorphic malwares

引用

Journal of Mathematical Sciences 2011年第5期172卷 740-750页

作者： Podlovchenko, R.I. Kuzyurin, N.N. Shcherbina, V.S. Zakharov, V.A. Moscow State University Moscow Russian Federation Institute for System Programming Russian Academy of Sciences Moscow Russian Federation

Polymorphic and metamorphic viruses are the most sophisticated malicious programs that give a lot of trouble to virus scanners. Each time when these viruses infect new executables or replicate themselves, they completely modify (obfuscate) their signature to avoid being detected. This contrivance poses a serious threat to antivirus software that relies on classical virus-detection techniques: such viruses do not have any stable specific sequence of instructions that one looks for. In the ultimate case, the only characteristic that remains invariable for all generations of the same virus is their functionality (semantics). To all appearance, the only way to detect for sure a metamorphic malicious code is to look for a pattern that has the same semantics as (i.e., equivalent to) some representative sample of the virus. Thus, metamorphic virus detection is closely related to the equivalence-checking problem for programs. In this paper, we outline some new automata-theoretic framework for the designing of virus detectors. Our approach is based on the equivalence-checking techniques in algebraic models of sequential programs. An algebraic model of programs is an abstract model of computation, where programs are viewed as finite automata operating on Kripke structures. Models of this kind make it possible to focus on those properties of program instructions that are widely used in obfuscating transformations. We give a survey (including the latest results) on the complexity of equivalence-checking problem in various algebraic models of programs and estimate thus the resilience of some obfuscating transformation commonly employed by metamorphic viruses. © 2011 Springer Science+Business Media, Inc.

关键词： MALWARE (Computer software) COMPUTER software COMPUTER viruses MATHEMATICAL models ALGEBRA SCANNING systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：