Concurrent systems work nondeterministically. For concurrent systems, UniTESK-based test suite executes methods with different parameters in different states, but it does not guarantee that all possible execution path...
详细信息
Concurrent systems work nondeterministically. For concurrent systems, UniTESK-based test suite executes methods with different parameters in different states, but it does not guarantee that all possible execution paths of a method will be tested because of its concurrent nature. This paper presents an integration method that combines the testing techniques with model checking techniques of Java PathFinder (JPF). The method guarantees that all possible execution paths needed for checking the correctness of the system are explored. The method is based on localization of the search performed by JPF. It reduces the state space while preserving the advantages of UniTESK like state abstraction and automatic checking of correctness. Moreover, it allows to use the same test suite without modification with JPF.
This paper proposes a decomposition of generic software security problems, mapping them to smaller problems of static and dynamic binary code analysis.
ISBN:
(纸本)9781479924622
This paper proposes a decomposition of generic software security problems, mapping them to smaller problems of static and dynamic binary code analysis.
We address the problem of efficient support for active rules in XML database systems. We describe a general form of active rules for XML based on XQuery and a previously defined update language and present our method ...
详细信息
We address the problem of efficient support for active rules in XML database systems. We describe a general form of active rules for XML based on XQuery and a previously defined update language and present our method to support these rules. The method consists in active rules processing along with the execution of an update statement. The method efficiency is attained due to the identification of rules triggered by the update statement during the execution of this statement that allows avoiding the redundant processing of not triggered rules.
Summary form only given. The article is devoted to the concept of the stepping commands in parallel debuggers. It reviews the main existing schemes (synchronous and asynchronous step implementations) and introduces a ...
详细信息
Summary form only given. The article is devoted to the concept of the stepping commands in parallel debuggers. It reviews the main existing schemes (synchronous and asynchronous step implementations) and introduces a new kind of synchronous scheme that has several advantages over existing ones. In this scheme the debugger performs the dynamic analysis of the program state thus simplifying the program state presentation and control. The possible implementation of suggested scheme in MPI debuggers is discussed and the existing implementation in mpC Workshop parallel debugger is presented.
The mpC (message-passing C) language was developed to write efficient and portable programs for wide range of distributed memory machines. It supports both task and data parallelism, allows both static and dynamic pro...
详细信息
The mpC (message-passing C) language was developed to write efficient and portable programs for wide range of distributed memory machines. It supports both task and data parallelism, allows both static and dynamic process and communication structures, enables optimizations aimed at both communication and computation, and supports modular parallel programming and the development of a library of parallel programs. The language is an ANSI C superset based on the notion of a network comprising processor nodes of different types and performances, connected with links of different bandwidths. The user can describe a network topology, create and discard networks, and distribute data and computations over networks. The mpC programming environment uses the topological information at run-time to ensure the efficient execution of the application. This paper describes the implementation of network management in the mpC programming environment.
This book constitutes the refereed proceedings of the 51st International Conference on Software Technology: Methods and Tools, TOOLS 2019, held in Innopolis, Russia, in October 2019.;The 19 revised full papers and 13...
详细信息
ISBN:
(数字)9783030298524
ISBN:
(纸本)9783030298517
This book constitutes the refereed proceedings of the 51st International Conference on Software Technology: Methods and Tools, TOOLS 2019, held in Innopolis, Russia, in October 2019.;The 19 revised full papers and 13 short papers presented in this book were carefully reviewed and selected from 62 submissions.;The papers discuss all aspects of software engineering and programming languages; machine learning; internet of things; security computer architectures and robotics; and projects.
Modern JavaScript engines use just-in-time (JIT) compilation to produce a binary code. JIT compilers are limited in a complexity of optimizations they can perform at a runtime without delaying an execution. On the con...
详细信息
Modern JavaScript engines use just-in-time (JIT) compilation to produce a binary code. JIT compilers are limited in a complexity of optimizations they can perform at a runtime without delaying an execution. On the contrary, ahead-of-time (AOT) compilers don't have such limitations, but they are not well suited for compiling dynamic languages such as JavaScript. In the paper we discuss methods for augmenting multi-tiered JavaScript JIT with a capability for AOT compilation, so to reduce program startup time and to move complex optimizations to AOT phase. We have implemented saving of JavaScript programs as a binary package containing bytecode and native code in open-source WebKit library. Our implementation allows shipping of JavaScript programs not only as a source code, but also as application binary packages with a precompiled code. In addition, our approach does not require any language feature restrictions. This has resulted in performance gain for popular JavaScript benchmarks such as SunSpider and Kraken on ARM platform, however, at a cost of increased package size.
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 ...
详细信息
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.
This paper describes the design and implementation of full-system logging and deterministic replay mechanisms in QEMU simulator for several target platforms.
This paper describes the design and implementation of full-system logging and deterministic replay mechanisms in QEMU simulator for several target platforms.
The mpC parallel programming language is an ANSI C superset based on the notion of a network comprising processor nodes of different types connected with links of different lengths. It allows the user to describe a ne...
详细信息
The mpC parallel programming language is an ANSI C superset based on the notion of a network comprising processor nodes of different types connected with links of different lengths. It allows the user to describe a network topology, create and discard networks, distribute data and computations over networks. The paper describes the implementation of managing networks in the mpC programming environment.
暂无评论