Information Flow Analysis Research Articles

Integration of passive driver-assistance systems with on-board vehicle systems

Implementation in OIAS such functions as driver’s state monitoring and high-precision calculation of the current navigation coordinates of the vehicle, modularity of the OIAS construction and the possible increase in the functionality through integration with other onboard systems has a promising development future. The development of intelligent transport systems and their components allows setting and solving fundamentally new tasks for the safety of human-to-machine transport systems, and the automatic analysis of heterogeneous information flows provides a synergistic effect. The analysis of cross-modal information exchange in human-machine transport systems, from uniform methodological points of view, will allow us, with an accuracy acceptable for solving applied problems, to form in real time an integrated assessment of the state of the basic components of the human-to-machine system and the dynamics in changing situation-centered environment, including the external environment, in their interrelations.

Materials and Information Flow Analysis and Optimization of Manufacturing Processes in MSMEs by the Application of Value Stream Mapping (VSM) Technique

Value stream is a set of all the specified actions of process (s) for product (s) which are required to convert the raw material into finished product and all the steps through which material has to travel from stage of raw material to become finished goods. After initial research, the group of small enterprises was selected and work was started on them. It is out of which two of them are of same product family and another two produce different types of product. An E-draw software version 6.5.3 consulted by EdrawSoft consultancy, Sheung Wan, HongKong is used for constructing the current and future state maps. After applying VSM on these industries, it is resulted out that abrupt changes are expected in terms of productivity improvement if proposed future state are implemented. There will be the increase in production as 42% in Swan Mechanical Works, 36.46% for Kotla Auto Parts, and 35.37% increase is expected in B.S. Spray Painting Works. Another remarkable change as productivity improvement have been found in unnecessary movements in terms of distance travelled by material for Swan Mechanical Works is reduced by 80.97%, 63.73% decrease is estimated in Kotla Carton Box, and for B.S. Spray Painting Works and Kotla Auto Parts, it is 44.18% and 50% respectively. In this regard, research work concludes that value stream mapping can be saviour of Indian MSMEs.

P/Taint: unified points-to and taint analysis

Static information-flow analysis (especially taint-analysis) is a key technique in software security, computing where sensitive or untrusted data can propagate in a program. Points-to analysis is a fundamental static program analysis, computing what abstract objects a program expression may point to. In this work, we propose a deep unification of information-flow and points-to analysis. We observe that information-flow analysis is not a mere high-level client of points-to information, but it is indeed identical to points-to analysis on artificial abstract objects that represent different information sources. The very same algorithm can compute, simultaneously, two interlinked but separate results (points-to and information-flow values) with changes only to its initial conditions. The benefits of such a unification are manifold. We can use existing points-to analysis implementations, with virtually no modification (only minor additions of extra logic for sanitization) to compute information flow concepts, such as value tainting. The algorithmic enhancements of points-to analysis (e.g., different flavors of context sensitivity) can be applied transparently to information-flow analysis. Heavy engineering work on points-to analysis (e.g., handling of the reflection API for Java) applies to information-flow analysis without extra effort. We demonstrate the benefits in a realistic implementation that leverages the Doop points-to analysis framework (including its context-sensitivity and reflection analysis features) to provide an information-flow analysis with excellent precision (over 91%) and recall (over 99%) for standard Java information-flow benchmarks. The analysis comfortably scales to large, real-world Android applications, analyzing the Facebook Messenger app with more than 55 K classes in under 7 hours.

Problems of systems dataware using optoelectronic measuring means of linear displacement

Problems of the dataware of the systems with the use of optoelectronic means of the linear displacement are considered in the article. The classification of the known physical effects, realized by the means of information-measuring systems, is given. The organized analysis of information flows in technical systems from the standpoint of determination of inaccuracies of measurement and management was conducted. In spite of achieved successes in automation of machine-building and instruments-building equipment in the field of dataware of the technical systems, there are unresolved problems, concerning the qualitative aspect of the production process. It was shown that the given problem can be solved using optoelectronic lazer information-measuring systems. Such information-measuring systems are capable of not only executing the measuring functions, but also solving the problems of management and control during processing, thereby guaranteeing the quality of final products.

System Programming in Rust

Rust is a new system programming language that offers a practical and safe alternative to C. Rust is unique in that it enforces safety without runtime overhead, most importantly, without the overhead of garbage collection. While zero-cost safety is remarkable on its own, we argue that the superpowers of Rust go beyond safety. In particular, Rust's linear type system enables capabilities that cannot be implemented efficiently in traditional languages, both safe and unsafe, and that dramatically improve security and reliability of system software. We show three examples of such capabilities: zero-copy software fault isolation, efficient static information flow analysis, and automatic checkpointing. While these capabilities have been in the spotlight of systems research for a long time, their practical use is hindered by high cost and complexity. We argue that with the adoption of Rust these mechanisms will become commoditized.

Probabilistic Analysis Based On Symbolic Game Semantics and Model Counting

Probabilistic program analysis aims to quantify the probability that a given program satisfies a required property. It has many potential applications, from program understanding and debugging to computing program reliability, compiler optimizations and quantitative information flow analysis for security. In these situations, it is usually more relevant to quantify the probability of satisfying/violating a given property than to just assess the possibility of such events to occur. In this work, we introduce an approach for probabilistic analysis of open programs (i.e. programs with undefined identifiers) based on game semantics and model counting. We use a symbolic representation of algorithmic game semantics to collect the symbolic constraints on the input data (context) that lead to the occurrence of the target events (e.g. satisfaction/violation of a given property). The constraints are then analyzed to quantify how likely is an input to satisfy them. We use model counting techniques to count the number of solutions (from a bounded integer domain) that satisfy given constraints. These counts are then used to assign probabilities to program executions and to assess the probability for the target event to occur at the desired level of confidence. Finally, we present the results of applying our approach to several interesting examples and illustrate the benefits they may offer.

Cyber-Physical Security and Privacy in the Electric Smart Grid

Abstract This book focuses on the combined cyber and physical security issues in advanced electric smart grids. Existing standards are compared with classical results and the security and privacy principles of current practice are illustrated. The book paints a way for future development of advanced smart grids that operated in a peer-to-peer fashion, thus requiring a different security model. Future defenses are proposed that include information flow analysis and attestation systems that rely on fundamental physical properties of the smart grid system. Table of Contents: Preface / The Smart Grid as a Cyber-Physical System / The Basics of Cyber-Physical Security / Defenses / Attack Motivation / Privacy / Standards / Summary / References / Authors' Biographies

SHErrLoc

We introduce a general way to locate programmer mistakes that are detected by static analyses. The program analysis is expressed in a general constraint language that is powerful enough to model type checking, information flow analysis, dataflow analysis, and points-to analysis. Mistakes in program analysis result in unsatisfiable constraints. Given an unsatisfiable system of constraints, both satisfiable and unsatisfiable constraints are analyzed to identify the program expressions most likely to be the cause of unsatisfiability. The likelihood of different error explanations is evaluated under the assumption that the programmer’s code is mostly correct, so the simplest explanations are chosen, following Bayesian principles. For analyses that rely on programmer-stated assumptions, the diagnosis also identifies assumptions likely to have been omitted. The new error diagnosis approach has been implemented as a tool called SHErrLoc, which is applied to three very different program analyses, such as type inference for a highly expressive type system implemented by the Glasgow Haskell Compiler—including type classes, Generalized Algebraic Data Types (GADTs), and type families. The effectiveness of the approach is evaluated using previously collected programs containing errors. The results show that when compared to existing compilers and other tools, SHErrLoc consistently identifies the location of programmer errors significantly more accurately, without any language-specific heuristics.

Investigating the mechanisms responsible for the lack of surface energy balance closure in a central Amazonian tropical rainforest

This work investigates the diurnal and seasonal behavior of the energy balance residual (E) that results from the observed difference between available energy and the turbulent fluxes of sensible heat (H) and latent heat (LE) at the FLUXNET BR-Ma2 site located in the Brazilian central Amazon rainforest. The behavior of E is analyzed by extending the eddy covariance averaging length from 30min to 4h and by applying an Information Flow Dynamical Process Network to diagnose processes and conditions affecting E across different seasons. Results show that the seasonal turbulent flux dynamics and the Bowen ratio are primarily driven by net radiation (Rn), with substantial sub-seasonal variability. The Bowen ratio increased from 0.25 in April to 0.4 at the end of September. Extension of the averaging length from 0.5 (94.6% closure) to 4h and thus inclusion of longer timescale eddies and mesoscale processes closes the energy balance and lead to an increase in the Bowen ratio, thus highlighting the importance of additional H to E. Information flow analysis reveals that the components of the energy balance explain between 25 and 40% of the total Shannon entropy with higher values during the wet season than the dry season. Dry season information flow from the buoyancy flux to E are 30–50% larger than that from H, indicating the potential importance of buoyancy fluxes to closing E. While the low closure highlights additional sources not captured in the flux data and random measurement errors contributing to E, the findings of the information flow and averaging length analysis are consistent with the impact of mesoscale circulations, which tend to transport more H than LE, on the lack of closure.

Verification of a Practical Hardware Security Architecture Through Static Information Flow Analysis

Hardware-based mechanisms for software isolation are becoming increasingly popular, but implementing these mechanisms correctly has proved difficult, undermining the root of security. This work introduces an effective way to formally verify important properties of such hardware security mechanisms. In our approach, hardware is developed using a lightweight security-typed hardware description language (HDL) that performs static information flow analysis. We show the practicality of our approach by implementing and verifying a simplified but realistic multi-core prototype of the ARM TrustZone architecture. To make the security-typed HDL expressive enough to verify a realistic processor, we develop new type system features. Our experiments suggest that information flow analysis is efficient, and programmer effort is modest. We also show that information flow constraints are an effective way to detect hardware vulnerabilities, including several found in commercial processors.

Verification of a Practical Hardware Security Architecture Through Static Information Flow Analysis

Hardware-based mechanisms for software isolation are becoming increasingly popular, but implementing these mechanisms correctly has proved difficult, undermining the root of security. This work introduces an effective way to formally verify important properties of such hardware security mechanisms. In our approach, hardware is developed using a lightweight security-typed hardware description language (HDL) that performs static information flow analysis. We show the practicality of our approach by implementing and verifying a simplified but realistic multi-core prototype of the ARM TrustZone architecture. To make the security-typed HDL expressive enough to verify a realistic processor, we develop new type system features. Our experiments suggest that information flow analysis is efficient, and programmer effort is modest. We also show that information flow constraints are an effective way to detect hardware vulnerabilities, including several found in commercial processors.

Аналіз інформаційних потоків у глобальних комп’ютерних мережах

Аналіз інформаційних потоків у глобальних комп’ютерних мережах

Maximum Model Counting

We introduce the problem Max#SAT, an extension of model counting (#SAT). Given a formula over sets of variables X, Y, and Z, the Max#SAT problem is to maximize over the variables X the number of assignments to Y that can be extended to a solution with some assignment to Z. We demonstrate that Max#SAT has applications in many areas, showing how it can be used to solve problems in probabilistic inference (marginal MAP), planning, program synthesis, and quantitative information flow analysis. We also give an algorithm which by making only polynomially many calls to an NP oracle can approximate the maximum count to within any desired multiplicative error. The NP queries needed are relatively simple, arising from recent practical approximate model counting and sampling algorithms, which allows our technique to be effectively implemented with a SAT solver. Through several experiments we show that our approach can be successfully applied to interesting problems.

Complexity and information flow analysis for multi-threaded programs

This paper studies the security of multi-threaded programs. We combine two methods, i.e., qualitative and quantitative security analysis, to check whether a multi-threaded program is secure or not. In this paper, besides reviewing classical analysis models, we present a novel model of quantitative analysis where the attacker is able to select the scheduling policy. This model does not follow the traditional information-theoretic channel setting. Our analysis first studies what extra information an attacker can get if he knows the scheduler’s choices, and then integrates this information into the transition system modeling the program execution. Via a case study, we compare this approach with the traditional information-theoretic models, and show that this approach gives more intuitive-matching results.

Hypercollecting semantics and its application to static analysis of information flow

We show how static analysis for secure information flow can be expressed and proved correct entirely within the framework of abstract interpretation. The key idea is to define a Galois connection that directly approximates the hyperproperty of interest. To enable use of such Galois connections, we introduce a fixpoint characterisation of hypercollecting semantics, i.e. a "set of sets" transformer. This makes it possible to systematically derive static analyses for hyperproperties entirely within the calculational framework of abstract interpretation. We evaluate this technique by deriving example static analyses. For qualitative information flow, we derive a dependence analysis similar to the logic of Amtoft and Banerjee (SAS '04) and the type system of Hunt and Sands (POPL '06). For quantitative information flow, we derive a novel cardinality analysis that bounds the leakage conveyed by a program instead of simply deciding whether it exists. This encompasses problems that are hypersafety but not k -safety. We put the framework to use and introduce variations that achieve precision rivalling the most recent and precise static analyses for information flow.

Adaptation of functional systems theory for the operative analysis of information flow

The article is dedicated to the features of the development of the information economy, which relies on high technology to further the continuity of the information flow, and therefore the business continuity of individual economic entities. In particular, the authors suggest modifying and optimizing the process of transmission and processing of data within a single marketing system based on the theory of functional systems. The authors give a description of the functioning of the info graphics model for marketing information system, which allows to structure the external input information at two flows at the first stage, and at the second - to create a database of relative indicators to forecast the activity of the company as a whole. Author research was conducted in the marketing sector, a separate organization. Moreover, under the marketing researches is the systematic gathering, processing and analysis of data about issues relating to marketing products and services, competition, consumers, prices, opportunities of the company and others, oriented to specification of available data or to obtaining new information to make managerial decision. Also changes in political, legal, economical, scientific and technological, demographical and other conditions of operation of an enterprise are targets of market research.

Verifying Weak Probabilistic Noninterference

Weak probabilistic noninterference is a security property for enforcing confidentiality in multi-threaded programs. It aims to guarantee secure flow of information in the program and ensure that sensitive information does not leak to attackers. In this paper, the problem of verifying weak probabilistic noninterference by leveraging formal methods, in particular algorithmic verification, is discussed. Behavior of multi-threaded programs is modeled using probabilistic Kripke structures and formalize weak probabilistic noninterference in terms of these structures. Then, a verification algorithm is proposed to check weak probabilistic noninterference. The algorithm uses an abstraction technique to compute quotient space of the program with respect to an equivalence relation called weak probabilistic bisimulation and does a simple check to decide whether the security property is satisfied or not. The progress made is demonstrated by a real-world case study. It is expected that the proposed approach constitutes a significant step towards more widely applicable secure information flow analysis.

Daugiamačio α-stabiliojo dėsnio parametrų vertinimas didžiausio tikėtinumo metodu

Skirstinių, susijusių su α-stabiliaisiais, tyrimai šiuo metu yra ypač aktualūs, nes jie dažnai pasitaiko analizuojant verslo ir finansų duomenis ar informacinius srautus kompiuterių tinkluose. Nustatyta, kad finansiniai duomenys dažnai yra leptokurtotiniai ir pasižymi išskirtimis, tad daugelis autorių (Rachev ir Mittnik, 2000; Kabašinskas ir kt., 2012; Sakalauskas ir kt., 2013) parodė, jog dažnai taikomas normalusis skirstinys nėra pats geriausias variantas ekonominių rodiklių analizei atlikti, todėl siūloma jį keisti bendresniais, pavyzdžiui, stabiliaisiais, modeliais. Kadangi Rachevo ir Mittniko (2000), Kabašinsko ir kt. (2012) bei Sakalausko ir kt. (2013) darbuose α-stabiliojo dėsnio parametrų vertinimas yra ištirtas tik vienmačiu atveju, praktikoje iškilo problema, kaip vertinti daugiamačius duomenis. Nors problema tiriama ir nagrinėjama jau kelis dešimtmečius, tačiau iki galo ji dar neišsemta (Press, 1972; Davydov ir Paulauskas, 1999; Nolan, 1998; Kring ir kt., 2009; Ogata, 2013). Šiame darbe sudarytas didžiausio tikėtinumo metodas daugiamačio α-stabiliojo dėsnio parametrų įvertiniams gauti pritaikius EM algoritmą. Integralai, įeinantys į įvertinių išraiškas, apskaičiuojami pasinaudojus Gauso bei Gauso ir Lagero kvadratūrinėmis formulėmis. Sukonstruotas modelis gali būti taikomas akcijų rinkų duomenų analizei atlikti.

Information flow analysis for a dynamically typed language with staged metaprogramming

Information flow analysis for a dynamically typed language with staged metaprogramming

A type theory for incremental computational complexity with control flow changes

Incremental computation aims to speed up re-runs of a program after its inputs have been modified slightly. It works by recording a trace of the program's first run and propagating changes through the trace in incremental runs, trying to re-use as much of the original trace as possible. The recent work CostIt is a type and effect system to establish the time complexity of incremental runs of a program, as a function of input changes. However, CostIt is limited in two ways. First, it prohibits input changes that influence control flow. This makes it impossible to type programs that, for instance, branch on inputs that may change. Second, the soundness of CostIt is proved relative to an abstract cost semantics, but it is unclear how the semantics can be realized. In this paper, we address both these limitations. We present DuCostIt, a re-design of CostIt, that combines reasoning about costs of change propagation and costs of from-scratch evaluation. The latter lifts the restriction on control flow changes. To obtain the type system, we refine Flow Caml, a type system for information flow analysis, with cost effects. Additionally, we inherit from CostIt index refinements to track data structure sizes and a co-monadic type. Using a combination of binary and unary step-indexed logical relations, we prove DuCostIt's cost analysis sound relative to not only an abstract cost semantics, but also a concrete semantics, which is obtained by translation to an ML-like language.