Perspectives of System Informatics 11th International Andrei P. Ershov Informatics Conference, PSI 2017, Moscow, Russia, June 27-29, 2017, Revised Selected Papers

• Main Authors: Petrenko, Alexander K, Voronkov, Andrei
• Format: eBook
• Language: English
• Published: Netherlands Springer Nature 2018; Springer International Publishing AG; Springer
• Edition: 1
• Series: Lecture Notes in Computer Science
• Subjects: Computer programming, programs, data; Computer science-Congresses

This book constitutes the refereed proceedings of the 11th International Andrei P. Ershov Informatics Conference, PSI 2017, held in Moscow, Russia, in June 2017.   The 31 full papers presented in this volume were carefully reviewed and selected from 57 submissions. The papers cover various topics re...

Table of Contents:

• Intro -- Preface -- Organization -- Contents -- An Architecture for Non-invasive Software Measurement -- 1 Introduction -- 2 An Architecture for Non-invasive Metrics Collection -- 3 Discussion of Architectural Decisions -- 4 Use Case: A MacOS Agent Prototype -- 5 Related Works on Architectures for Non-invasive Measurement Systems -- 5.1 PRO Metrics -- 5.2 ElectroCodeoGram -- 5.3 Empirical Project Monitor -- 5.4 Hackystat -- 6 Conclusion and Future Work -- References -- A Human-in-the-Loop Perspective for Safety Assessment in Robotic Applications -- 1 Introduction -- 1.1 Related Work -- 2 Semantic Model -- 2.1 ORL-Module Formalizing Operator, Robot and Layout -- 2.2 Formalization of Tasks -- 2.3 Hazard Definition Module -- 2.4 Risk Estimator Module -- 2.5 RRMs Module -- 3 Overview of Iterative Risk Assessment -- 4 SAFER-HRC for a Case-Study -- 5 Conclusion -- References -- Multi-level Static Analysis for Finding Error Patterns and Defects in Source Code -- Abstract -- 1 Introduction -- 2 Lightweight Analysis Level -- 3 Interprocedural Analysis Level -- 3.1 Intraprocedural Analysis -- 3.2 Creating and Applying Function Summaries -- 4 Path-Sensitive Analysis Level -- 5 Svace Analyzer Collection -- 6 Conclusions -- Pipelined Bottom-Up Evaluation of Datalog Programs: The Push Method -- 1 Introduction -- 2 Query Language -- 3 Goal-Directed Query Evaluation with SLDMagic -- 4 The Push Method with Procedure Calls -- 4.1 Basic Code Structure, Requirements -- 4.2 Example, Data Structures for Query Evaluation -- 4.3 Duplicate Elimination, Termination -- 4.4 Temporary Relations for Complex Rules -- 4.5 Code Block for a Rule Activation -- 4.6 An Optimization for Complex Rules -- 4.7 Remarks About Inlining -- 5 Benchmark Results -- 6 Related Work -- 7 Conclusion -- References -- A Platform for Security Monitoring of Multi-cloud Applications -- 1 Introduction
• 4.2 Exploiting the Memory Hierarchy Using Low-Level Patterns -- 4.3 Using Low-Level Patterns to Implement High-Level Reduction -- 4.4 Code Generation -- 5 Evaluation -- 6 Conclusion -- A Additional Rewrite Rules -- B Proof of a Rewrite Rule -- C Derived Low-Level Reduction Programs -- References -- Domain Engineering the Magnolia Way -- 1 Introduction -- 2 Domain Expertise -- 3 Running Example: 101 Companies -- 4 Steps in a Domain Engineering Process -- 4.1 Step 1: Finding the Signature -- 4.2 Step 2: Formalising the Specification -- 4.3 Step 3: Refining the Domain Concepts -- 4.4 Step 4: Library Development and Architecture Design -- 4.5 Step 5: Application Development -- 5 Conclusion -- References -- Approximating Event System Abstractions by Covering Their States and Transitions -- 1 Introduction -- 2 Background -- 2.1 Model Syntax and Semantics -- 2.2 Predicate Abstraction -- 2.3 May Transition Systems -- 3 Illustrative Example: An Electrical System -- 4 Abstraction and Approximated Transition System Computation -- 5 Heuristics for Better Abstraction Coverage -- 5.1 Events and States Ordering -- 5.2 Concrete States Coloration -- 6 Implementation and Experimentation -- 6.1 About the Tool -- 6.2 Experimental Results -- 6.3 Analysis of the Obtained Results -- 7 Related Work -- 8 Conclusion and Further Work -- References -- Implementing the Symbolic Method of Verification in the C-Light Project -- 1 Introduction -- 2 Theoretical Background -- 2.1 Deductive Program Verification -- 2.2 The Extensions of the VCG -- 3 The Essence of Symbolic Method -- 4 Towards Verification of Linear Algebra Programs -- 5 The Experiment -- 6 Conclusion -- References -- Highlights of the Rice-Shapiro Theorem in Computable Topology -- 1 Introduction -- 2 Preliminaries -- 2.1 Recursion Theory -- 2.2 Weakly Effective -continuous Domains
• 2 The MUSA Security Assurance Platform SaaS -- 2.1 The MUSA Framework -- 2.2 The MSAP Inputs -- 2.3 Monitoring Agents -- 2.4 Preprocessing Module -- 2.5 Metrics and Threat Analyzer -- 2.6 Service Level Objectives (SLO) Manager -- 2.7 Alert Manager and Countermeasures Manager -- 3 Case Study: Service Availability in Smart-City Application -- 4 Related Work -- 5 Conclusion and Future Work -- References -- The Hybrid Multidimensional-Ontological Data Model Based on Metagraph Approach -- Abstract -- 1 Introduction -- 2 Ontological Approach -- 3 Multidimensional Approach -- 4 The Idea of Multidimensional and Ontological Approaches Hybridization -- 5 The Metagraph Model Definition -- 6 The Metagraph Agent Definition -- 7 The Representation of Object-Oriented Data Structures in Form of Metagraph -- 8 The Hybrid Multidimensional-Ontological Data Model -- 9 Predicate Representation of Metagraph Model -- 10 Conclusions -- References -- PosDB: A Distributed Column-Store Engine -- 1 Introduction -- 2 Column-Store Basics -- 3 Motivation and Aims -- 4 Existing Column-Store Systems -- 5 Architecture -- 6 Implementation Details -- 7 Current State: Present and Missing Features -- 8 Conclusion -- References -- Microservices: How To Make Your Application Scale -- 1 Introduction -- 2 Scalability -- 3 The Language Choice -- 4 Applications -- 5 Microservices and Beyond -- References -- Static Binary Code Instrumentation for ARM Architecture -- 1 Introduction -- 2 Instrumentation Framework Overview -- 2.1 Input Specifications -- 2.2 Instrumentation Code Generation -- 3 Working with ELF Files -- 4 Inserting Instrumentation Code -- 4.1 Code Linkage -- 5 Practical Evaluation -- 6 Conclusion -- References -- A Behavioural Theory for Reflective Sequential Algorithms -- 1 Introduction -- 2 Reflective Algorithms and Their Axiomatisation -- 2.1 Reflective Sequential Time Postulate
• 2.3 Effectively Enumerable T0-spaces -- 2.4 Computable Elements -- 3 The Rice-Shapiro Theorem for Modular T0-spaces -- 4 The Rice-Shapiro Theorem for CPS -- 4.1 A Weak version of the Rice-Shapiro theorem for CPS -- 4.2 Towards a Non-uniform Rice-Shapiro Theorem -- 5 Conclusion -- References -- A Memory Model for Deductively Verifying Linux Kernel Modules -- 1 Introduction -- 2 Overview -- 3 Region-Based Memory Modeling -- 3.1 Basic Idea -- 3.2 Soundness/Precision Trade-Off -- 3.3 User-Guided Separation Analysis -- 4 The Core Language -- 4.1 Translation of C -- 5 Soundness -- 6 Completeness -- 7 Annotation Overhead -- 8 Framing -- 9 Conclusion -- References -- Indexing of Hierarchically Organized Spatial-Temporal Data Using Dynamic Regular Octrees -- 1 Introduction -- 2 Scene Data Model -- 3 Scene Indexing Structures -- 4 Theoretical Study -- 5 Experimental Study -- 6 Conclusions -- References -- An Approach to the Validation of XML Documents Based on the Model Driven Architecture and the Object Constraint Language -- 1 Introduction -- 2 Overview of Analogues -- 3 Proposed Generalized Validator Generation Scheme -- 3.1 Transformation of PIM from Textual to Ecore Representation -- 3.2 Transformation of PIM to PSM -- 3.3 Transformation of PSM from an Ecore Representation to a Textual One -- 3.4 Summary -- 4 Features Distinguishing Our Approach from Its Analogues -- 4.1 Different Source PIMs -- 4.2 Different Target XPath Host Languages -- 4.3 External Data Sources -- 4.4 Determination of XML Elements Subject to Validation -- 4.5 Preconditions -- 4.6 Kinds of Validation Messages -- 5 Conclusion -- References -- Compositional Relational Programming with Name Projection and Compositional Synthesis -- 1 Introduction -- 2 Compositional Relational Argument Binding Problem -- 3 Combilog with Name Projection (CNP) -- 3.1 Name-Aware Tuples and Extensions
• 3.2 Elementary Predicates
• 2.2 Reflective Abstract Extended-State Postulate -- 2.3 Reflective Bounded Exploration Postulate -- 2.4 Reflective Sequential Algorithms and Behavioural Equivalence -- 3 Reflective Abstract State Machines -- 4 The Reflective Sequential ASM Thesis -- 5 Conclusion -- References -- Lightweight Non-intrusive Virtual Machine Introspection -- 1 Introduction -- 2 Reusing ABI for Virtual Machine Introspection -- 2.1 System Call Monitoring -- 2.2 Execution Context -- 3 Introspection Plugins for QEMU -- 3.1 Simulator Events for Plugins -- 3.2 Guest Code Instrumentation -- 3.3 File Monitoring -- 3.4 Mapping Files to the Memory -- 3.5 API Monitoring -- 3.6 Process Monitoring -- 4 Evaluation -- 5 Related Work -- 6 Conclusion -- References -- A Distributed Approach to Coreference Resolution in Multiagent Text Analysis for Ontology Population -- 1 Introduction -- 2 Problem Statement and Base Definitions -- 3 The Coreference Resolution in the Multiagent Information Extraction -- 4 Conclusion -- References -- A Framework for Dynamical Construction of Software Components -- Abstract -- 1 Introduction -- 2 Motivation -- 3 Component Interface and Implementation -- 4 Hardcoded Component Implementation -- 5 Prototype Construction -- 5.1 Prototype Interface Construction -- 5.2 Prototype Implementation Construction -- 5.3 Protoinstance Functionality -- 6 Composed Type Instance Implementation -- 7 Related Works -- 8 Conclusion -- References -- A Transformation-Based Approach to Developing High-Performance GPU Programs -- 1 Motivation and Related Work -- 2 Our Approach: Patterns and Transformations -- 3 Algorithmic Patterns and Rewriting -- 3.1 High-Level Algorithmic Patterns -- 3.2 Algorithmic Rewrite Rules -- 3.3 Transformation Using Algorithmic Rewrite Rules -- 4 OpenCL-Specific Patterns and Rewriting -- 4.1 Exploiting the Thread Hierarchy Using Low-Level Map Patterns