Verification Infrastructure Research Articles

Analyzing the Role of Blockchain in Identity and Access Management Systems

In today's digital world, protecting identities and securing access to sensitive data are crucial tasks. Traditional centralized Identity and Access Management (IAM) systems are vulnerable to data breaches and unauthorized intrusions. Blockchain technology has emerged as a promising solution to bolster IAM systems by decentralizing control and enhancing security measures. This paper explores the integration of blockchain technology into IAM frameworks to address the shortcomings of centralized systems. It examines the fundamental principles of blockchain, highlighting its immutability, decentralization, and cryptographic security features. By leveraging these attributes, blockchain-based IAM systems offer a robust infrastructure for identity verification, authentication, and authorization processes. Various use cases of blockchain in IAM are discussed, including self-sovereign identity, decentralized authentication protocols, and secure data sharing mechanisms. The paper elucidates how blockchain enhances trust and transparency in identity management, granting individuals greater control over their personal data while ensuring privacy and security. It also scrutinizes the challenges and considerations associated with implementing blockchain-based IAM solutions, such as scalability, interoperability, and regulatory compliance. Additionally, the paper explores potential future developments and trends in this evolving field, emphasizing the importance of collaboration between industry stakeholders and regulatory bodies to foster innovation while addressing security and privacy concerns. In summary, this paper underscores the transformative potential of blockchain technology in fortifying IAM systems, leading to a more secure and resilient digital ecosystem.

Blockchain based Product Verification System

In an era marked by increasing consumer awareness and a growing demand for transparent supply chains, the need for robust product verification systems has become paramount. This research paper delves into the development and implementation of a Blockchain-Based Product Verification System (BPVS), aiming to enhance trust and traceability in product supply chains. The paper explores the underlying principles of blockchain technology and its applicability to establish a secure, decentralized, and tamper-resistant infrastructure for product verification. The research investigates various blockchain-based projects and protocols designed specifically for supply chain management and product authentication. Through a meticulous comparative analysis, the strengths and limitations of existing solutions are examined, paving the way for the identification of best practices in implementing a BPVS. Additionally, case studies and real-world applications illustrate successful instances of blockchain technology in enhancing product verification processes across diverse industries. Challenges inherent to the integration of blockchain technology into product verification systems, including scalability, interoperability, and regulatory compliance, are thoroughly explored. The paper provides insights into potential solutions and ongoing research initiatives addressing these challenges, contributing to the evolution of a more mature and adaptable BPVS. Looking towards the future, the research paper outlines prospects for the widespread adoption of blockchain-based product verification systems. It discusses potential trends, emerging technologies, and regulatory developments that may influence the trajectory of BPVS, emphasizing the role of such systems in fostering transparency, accountability, and consumer confidence. Keywords— Blockchain-Based, Product Verification System (BPVS),Transparent Supply Chains,Decentralized Technology,Tamper-Resistant ,Infrastructure,Comparative Analysis,Case Studies,Challenges and ,Solutions,Regulatory Compliance,Interoperability,Emerging Technologies,Trust and Traceability,Real-world Applications,Scalability,Future Prospects

A Deductive Verification Infrastructure for Probabilistic Programs

This paper presents a quantitative program verification infrastructure for discrete probabilistic programs. Our infrastructure can be viewed as the probabilistic analogue of Boogie: its central components are an intermediate verification language (IVL) together with a real-valued logic. Our IVL provides a programming-language-style for expressing verification conditions whose validity implies the correctness of a program under investigation. As our focus is on verifying quantitative properties such as bounds on expected outcomes, expected run-times, or termination probabilities, off-the-shelf IVLs based on Boolean first-order logic do not suffice. Instead, a paradigm shift from the standard Boolean to a real-valued domain is required. Our IVL features quantitative generalizations of standard verification constructs such as assume- and assert-statements. Verification conditions are generated by a weakest-precondition-style semantics, based on our real-valued logic. We show that our verification infrastructure supports natural encodings of numerous verification techniques from the literature. With our SMT-based implementation, we automatically verify a variety of benchmarks. To the best of our knowledge, this establishes the first deductive verification infrastructure for expectation-based reasoning about probabilistic programs.

CommCSL: Proving Information Flow Security for Concurrent Programs using Abstract Commutativity

Information flow security ensures that the secret data manipulated by a program does not influence its observable output. Proving information flow security is especially challenging for concurrent programs, where operations on secret data may influence the execution time of a thread and, thereby, the interleaving between different threads. Such internal timing channels may affect the observable outcome of a program even if an attacker does not observe execution times. Existing verification techniques for information flow security in concurrent programs attempt to prove that secret data does not influence the relative timing of threads. However, these techniques are often restrictive (for instance because they disallow branching on secret data) and make strong assumptions about the execution platform (ignoring caching, processor instructions with data-dependent runtime, and other common features that affect execution time). In this paper, we present a novel verification technique for secure information flow in concurrent programs that lifts these restrictions and does not make any assumptions about timing behavior. The key idea is to prove that all mutating operations performed on shared data commute, such that different thread interleavings do not influence its final value. Crucially, commutativity is required only for an abstraction of the shared data that contains the information that will be leaked to a public output. Abstract commutativity is satisfied by many more operations than standard commutativity, which makes our technique widely applicable. We formalize our technique in CommCSL, a relational concurrent separation logic with support for commutativity-based reasoning, and prove its soundness in Isabelle/HOL. We implemented CommCSL in HyperViper, an automated verifier based on the Viper verification infrastructure, and demonstrate its ability to verify challenging examples.

Automating deductive verification for weak-memory programs (extended version)

Writing correct programs for weak-memory models such as the C11 memory model is challenging because of the weak consistency guarantees these models provide. The first program logics for the verification of such programs have recently been proposed, but their usage has been limited thus far to manual proofs. Automating proofs in these logics via first-order solvers is non-trivial, due to features such as higher-order assertions, modalities and rich permission resources. In this paper, we provide the first encoding of a weak-memory program logic using existing deductive verification tools. Our work enables, for the first time, the (unbounded) verification of C11 programs at the level of abstraction provided by the program logics; the only necessary user interaction is in the form of specifications written in the program logic and, in rare cases, ghost operations. We tackle three recent program logics: Relaxed Separation Logic and two forms of Fenced Separation Logic, and show how these can be encoded using the Viper verification infrastructure. In doing so, we illustrate several novel encoding techniques which could be employed for other logics. Our work is implemented, and has been evaluated on examples from existing papers as well as the Facebook open-source Folly library.

Modular Product Programs

Many interesting program properties like determinism or information flow security are hyperproperties, that is, they relate multiple executions of the same program. Hyperproperties can be verified using relational logics, but these logics require dedicated tool support and are difficult to automate. Alternatively, constructions such as self-composition represent multiple executions of a program by one product program, thereby reducing hyperproperties of the original program to trace properties of the product. However, existing constructions do not fully support procedure specifications, for instance, to derive the determinism of a caller from the determinism of a callee, making verification non-modular. We present modular product programs, a novel kind of product program that permits hyperproperties in procedure specifications and, thus, can reason about calls modularly. We provide a general formalization of our product construction and prove it sound and complete. We demonstrate its expressiveness by applying it to information flow security with advanced features such as declassification and termination-sensitivity. Modular product programs can be verified using off-the-shelf verifiers; we have implemented our approach for both secure information flow and general hyperproperties using the Viper verification infrastructure. Our evaluation demonstrates that modular product programs can be used to prove hyperproperties for challenging examples in reasonable time.

‘MARKING THEIR OWN HOMEWORK’: TRUST AND AUDIENCE MEASUREMENT IN THE AUSTRALIAN DIGITAL ADVERTISING INDUSTRY

This paper examines how the Australian advertising industry debates trust in the infrastructures of digital advertising. The advertising industry is undergoing a major change as digital advertising is increasingly dominated by new advertising technology (adtech) players and major tech companies such as Facebook and Google. These new companies which rely on automated systems of ad targeting, pricing and placement to control large amounts of digital advertising inventory and offer new more ‘efficient’ ways to micro-target advertising.
 Yet these companies have garnered reputations for misrepresenting their numbers; a problem compounded by Google and Facebook’s reticence to provide independent audience verification. This has led to a high degree of mistrust from Australian advertisers. Neither Google or Facebook offers serious third-party auditing, leading many in the advertising industry to say that they are ‘marking their own homework’.
 In this paper I ask, how is trust of measurement and verification infrastructures debated within the digital advertising industry? Is it fair to compare businesses that distribute advertising in very different ways? I answer these questions through qualitative analysis of submissions made to the Australian Competition and Consumer Commission (ACCC) as part of its current Digital Platforms Inquiry (DPI) in 2018 and 2019. I also draw on summaries of four public forums the ACCC held in 2018 as well as wide reading in the advertising industry trade press. This paper aims to contribute to a better understanding of the role standards and measures play within industry and how they relate to trust during industry transformation.

Modular verification of heap reachability properties in separation logic

The correctness of many algorithms and data structures depends on reachability properties, that is, on the existence of chains of references between objects in the heap. Reasoning about reachability is difficult for two main reasons. First, any heap modification may affect an unbounded number of reference chains, which complicates modular verification, in particular, framing. Second, general graph reachability is not supported by first-order SMT solvers, which impedes automatic verification. In this paper, we present a modular specification and verification technique for reachability properties in separation logic. For each method, we specify reachability only locally within the fragment of the heap on which the method operates. We identify relative convexity, a novel relation between the heap fragments of a client and a callee, which enables (first-order) reachability framing, that is, extending reachability properties from the heap fragment of a callee to the larger fragment of its client, enabling precise procedure-modular reasoning. Our technique supports practically important heap structures, namely acyclic graphs with a bounded outdegree as well as (potentially cyclic) graphs with at most one path (modulo cycles) between each pair of nodes. The integration into separation logic allows us to reason about reachability and other properties in a uniform way, to verify concurrent programs, and to automate our technique via existing separation logic verifiers. We demonstrate that our verification technique is amenable to SMT-based verification by encoding a number of benchmark examples into the Viper verification infrastructure.

Automated verification for collaborative workflows in a Digital Plan of Work

This paper presents the rationale, strategy and development behind the Verification components of the UK Digital Plan of Work (DPoW), a large-scale interdisciplinary collaboration platform implemented to enhance collaborative Building Information Modelling (BIM) workflows. Construction enterprises currently organise their information exchanges through documents that are not suitable for the automation of quality assurance processes. The DPoW addresses this issue with the introduction of a documented collaboration format and a suite of associated verification libraries, available at no cost as open source packages. The resulting infrastructure has the potential to automate the management of information exchanges in multi-disciplinary construction projects, but its uptake may be impeded by known issues that affect the dynamics of technology adoption. The verification infrastructure has been designed to reduce the impact of these issues by providing immediate paths to adoption and enabling three levels of process feedback for sustainable incremental improvements, starting from the current maturity level. The research followed the Design Science Methodology and is presented in this paper progressing from the definition of goals and objectives to the presentation of the developed solution, ending with a summary of known limitations and areas of further development.

Testing framework for on-board verification of HLS modules using grey-box technique and FPGA overlays

High-Level Synthesis (HLS) provides a simple way to implement complex applications using Field Programmable Gate Array (FPGA) devices. Unfortunately, this technology introduces non-negligible problems related to verification: speed, accuracy and behavior mismatch between co-simulation and implementation. This paper presents RC-Unity, a heterogeneous unit testing framework that integrates FPGA-in-the-loop devices in order to extend the scope and capabilities of current HLS tools. Verification engineers can focus on the design of the tests while the framework automates the generation of the underlying verification infrastructure, making the testbed reusable across different stages of the design flow as the experiments show.

An eye for an I: recording biometrics and reconsidering identity in postcolonial India

In 2009, the Government of India embarked on a mission to issue each of India’s over one billion residents a unique biometric identification number, Aadhaar (literally, ‘foundation’). An Aadhaar database would link the demographic and biometric information (iris scans, fingerprints, facial photograph) of residents to a 12-digit number. India currently commands the world’s largest biometric database. While Aadhaar does not guarantee citizenship, benefits, or services, its architects submit that its reliable, real-time identity verification infrastructure potentially allows for the targeted delivery of any good to its intended recipient. Aadhaar is fashioned as an ID concerned with a pristine bodily uniqueness untarnished by the social, political, or economic. Aadhaar frequently provokes the questions: Who is the recipient of Aadhaar and to what community does Aadhaar afford membership? Based on ethnographic fieldwork in India’s capital, New Delhi, this article examines how Aadhaar comes to inform ideas of identity and belonging held by its implementers, as well as the population it targets.

Server Location Verification (SLV) and Server Location Pinning

We introduce the first known mechanism providing realtime server location verification. Its uses include enhancing server authentication by enabling browsers to automatically interpret server location information. We describe the design of this new measurement-based technique, Server Location Verification (SLV), and evaluate it using PlanetLab. We explain how SLV is compatible with the increasing trends of geographically distributed content dissemination over the Internet, without causing any new interoperability conflicts. Additionally, we introduce the notion of (verifiable) server location pinning (conceptually similar to certificate pinning) to support SLV, and evaluate their combined impact using a server-authentication evaluation framework. The results affirm the addition of new security benefits to the existing TLS-based authentication mechanisms. We implement SLV through a location verification service, the simplest version of which requires no server-side changes. We also implement a simple browser extension that interacts seamlessly with the verification infrastructure to obtain realtime server location-verification results.

Semantics-based program verifiers for all languages

We present a language-independent verification framework that can be instantiated with an operational semantics to automatically generate a program verifier. The framework treats both the operational semantics and the program correctness specifications as reachability rules between matching logic patterns, and uses the sound and relatively complete reachability logic proof system to prove the specifications using the semantics. We instantiate the framework with the semantics of one academic language, KernelC, as well as with three recent semantics of real-world languages, C, Java, and JavaScript, developed independently of our verification infrastructure. We evaluate our approach empirically and show that the generated program verifiers can check automatically the full functional correctness of challenging heap-manipulating programs implementing operations on list and tree data structures, like AVL trees. This is the first approach that can turn the operational semantics of real-world languages into correct-by-construction automatic verifiers.

OpenPiton

Industry is building larger, more complex, manycore processors on the back of strong institutional knowledge, but academic projects face difficulties in replicating that scale. To alleviate these difficulties and to develop and share knowledge, the community needs open architecture frameworks for simulation, synthesis, and software exploration which support extensibility, scalability, and configurability, alongside an established base of verification tools and supported software. In this paper we present OpenPiton, an open source framework for building scalable architecture research prototypes from 1 core to 500 million cores. OpenPiton is the world's first open source, general-purpose, multithreaded manycore processor and framework. OpenPiton leverages the industry hardened OpenSPARC T1 core with modifications and builds upon it with a scratch-built, scalable uncore creating a flexible, modern manycore design. In addition, OpenPiton provides synthesis and backend scripts for ASIC and FPGA to enable other researchers to bring their designs to implementation. OpenPiton provides a complete verification infrastructure of over 8000 tests, is supported by mature software tools, runs full-stack multiuser Debian Linux, and is written in industry standard Verilog. Multiple implementations of OpenPiton have been created including a taped-out 25-core implementation in IBM's 32nm process and multiple Xilinx FPGA prototypes.

OpenPiton

Industry is building larger, more complex, manycore processors on the back of strong institutional knowledge, but academic projects face difficulties in replicating that scale. To alleviate these difficulties and to develop and share knowledge, the community needs open architecture frameworks for simulation, synthesis, and software exploration which support extensibility, scalability, and configurability, alongside an established base of verification tools and supported software. In this paper we present OpenPiton, an open source framework for building scalable architecture research prototypes from 1 core to 500 million cores. OpenPiton is the world's first open source, general-purpose, multithreaded manycore processor and framework. OpenPiton leverages the industry hardened OpenSPARC T1 core with modifications and builds upon it with a scratch-built, scalable uncore creating a flexible, modern manycore design. In addition, OpenPiton provides synthesis and backend scripts for ASIC and FPGA to enable other researchers to bring their designs to implementation. OpenPiton provides a complete verification infrastructure of over 8000 tests, is supported by mature software tools, runs full-stack multiuser Debian Linux, and is written in industry standard Verilog. Multiple implementations of OpenPiton have been created including a taped-out 25-core implementation in IBM's 32nm process and multiple Xilinx FPGA prototypes.

Assessment of the Potential to Achieve very Low Energy Use in Public Buildings in China with Advanced Window and Shading Systems

As rapid growth in the construction industry continues to occur in China, the increased demand for a higher standard living is driving significant growth in energy use and demand across the country. Building codes and standards have been implemented to head off this trend, tightening prescriptive requirements for fenestration component measures using methods similar to the U.S. model energy code American Society of Heating, Refrigerating and Air-Conditioning Engineers (ASHRAE) 90.1. The objective of this study is to (a) provide an overview of applicable code requirements and current efforts within China to enable characterization and comparison of window and shading products, and (b) quantify the load reduction and energy savings potential of several key advanced window and shading systems, given the divergent views on how space conditioning requirements will be met in the future. System-level heating and cooling loads and energy use performance were evaluated for a code-compliant large office building using the EnergyPlus building energy simulation program. Commercially-available, highly-insulating, low-emittance windows were found to produce 24%–66% lower perimeter zone HVAC electricity use compared to the mandated energy-efficiency standard in force (GB 50189-2005) in cold climates like Beijing. Low-e windows with operable exterior shading produced up to 30%–80% reductions in perimeter zone HVAC electricity use in Beijing and 18%–38% reductions in Shanghai compared to the standard. The economic context of China is unique since the cost of labor and materials for the building industry is so low. Broad deployment of these commercially available technologies with the proper supporting infrastructure for design, specification, and verification in the field would enable significant reductions in energy use and greenhouse gas emissions in the near term.

Calibration and verification of areal surface texture measuring instruments

In this paper, the calibration and verification infrastructure to support areal surface texture measurement and characterisation will be reviewed. A short historical overview of the subject will be given, along with a discussion of the most common instruments and directions of current international standards. Traceability and uncertainty will be discussed, followed by a presentation of the latest developments in software and material measurement standards. The concept and current infrastructure for determining the metrological characteristics of instruments will be highlighted and future research requirements will be presented.

Natural proofs for data structure manipulation in C using separation logic

The natural proof technique for heap verification developed by Qiu et al. [32] provides a platform for powerful sound reasoning for specifications written in a dialect of separation logic called Dryad. Natural proofs are proof tactics that enable automated reasoning exploiting recursion, mimicking common patterns found in human proofs. However, these proofs are known to work only for a simple toy language [32]. In this work, we develop a framework called VCDryad that extends the Vcc framework [9] to provide an automated deductive framework against separation logic specifications for C programs based on natural proofs. We develop several new techniques to build this framework, including (a) a novel tool architecture that allows encoding natural proofs at a higher level in order to use the existing Vcc framework (including its intricate memory model, the underlying type-checker, and the SMT-based verification infrastructure), and (b) a synthesis of ghost-code annotations that captures natural proof tactics, in essence forcing Vcc to find natural proofs using primarily decidable theories. We evaluate our tool extensively, on more than 150 programs, ranging from code manipulating standard data structures, well-known open source library routines (Glib, OpenBSD), Linux kernel routines, customized OS data structures, etc. We show that all these C programs can be fully automatically verified using natural proofs (given pre/post conditions and loop invariants) without any user-provided proof tactics . VCDryad is perhaps the first deductive verification framework for heap-manipulating programs in a real language that can prove such a wide variety of programs automatically.

ITK: enabling reproducible research and open science

Reproducibility verification is essential to the practice of the scientific method. Researchers report their findings, which are strengthened as other independent groups in the scientific community share similar outcomes. In the many scientific fields where software has become a fundamental tool for capturing and analyzing data, this requirement of reproducibility implies that reliable and comprehensive software platforms and tools should be made available to the scientific community. The tools will empower them and the public to verify, through practice, the reproducibility of observations that are reported in the scientific literature. Medical image analysis is one of the fields in which the use of computational resources, both software and hardware, are an essential platform for performing experimental work. In this arena, the introduction of the Insight Toolkit (ITK) in 1999 has transformed the field and facilitates its progress by accelerating the rate at which algorithmic implementations are developed, tested, disseminated and improved. By building on the efficiency and quality of open source methodologies, ITK has provided the medical image community with an effective platform on which to build a daily workflow that incorporates the true scientific practices of reproducibility verification. This article describes the multiple tools, methodologies, and practices that the ITK community has adopted, refined, and followed during the past decade, in order to become one of the research communities with the most modern reproducibility verification infrastructure. For example, 207 contributors have created over 2400 unit tests that provide over 84% code line test coverage. The Insight Journal, an open publication journal associated with the toolkit, has seen over 360,000 publication downloads. The median normalized closeness centrality, a measure of knowledge flow, resulting from the distributed peer code review system was high, 0.46.

Early performance assessment in component‐based software systems

Most techniques used to assess the qualitative characteristics of software are done in testing phase of software development. Assessment of performance in the early software development process is particularly important to risk management. Software architecture, as the first product, plays an important role in the development of the complex software systems. Using software architecture, quality attributes (such as performance, reliability and security) can be evaluated at the early stages of the software development. In this study, the authors present a framework for taking the advantages of architectural description to evaluate software performance. To do so, the authors describe static structure and architectural behaviour of a software system as the sequence diagram and the component diagram of the Unified Modelling Language (UML), respectively; then, the described model is automatically converted into the ‘interface automata’, which provides the formal foundation for the evaluation. Finally, the evaluation of architectural performance is performed using ‘queuing theory’. The proposed framework can help the software architect to choose an appropriate architecture in terms of quality or remind him/her of making necessary changes in the selected architecture. The main difference among the proposed method and other methods is that the proposed method benefits the informal description methods, such as UML, to describe the architecture of software systems; it also enjoys a formal and lightweight language, called ‘interface automata’ to provide the infrastructure for verification and evaluation.