More Like this

1. Variational principles for Hamiltonian systems

   https://doi.org/10.1142/S2972458925500042  

   Tran, Brian K; Leok, Melvin (March 2025, Geometric Mechanics)

   Motivated by recent developments in Hamiltonian variational principles, Hamiltonian variational integrators, and their applications such as to optimization and control, we present a new Type II variational approach for Hamiltonian systems, based on a virtual work principle that enforces the Type II boundary conditions through a combination of essential and natural boundary conditions; particularly, this approach allows us to define this variational principle intrinsically on manifolds. We first develop this variational principle on vector spaces and subsequently extend it to parallelizable manifolds, general manifolds, as well as to the infinite-dimensional setting. Furthermore, we provide a review of variational principles for Hamiltonian systems in various settings as well as their applications. 

   more » « less
2. Formal Verification of a Multiprocessor Hypervisor on Arm Relaxed Memory Hardware

   https://doi.org/10.1145/3477132.3483560  

   Tao, Runzhou; Yao, Jianan; Li, Xupeng; Li, Shih-Wei; Nieh, Jason; Gu, Ronghui (October 2021, Proceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles)

   Concurrent systems software is widely-used, complex, and error-prone, posing a significant security risk. We introduce VRM, a new framework that makes it possible for the first time to verify concurrent systems software, such as operating systems and hypervisors, on Arm relaxed memory hardware. VRM defines a set of synchronization and memory access conditions such that a program that satisfies these conditions can be mostly verified on a sequentially consistent hardware model and the proofs will automatically hold on relaxed memory hardware. VRM can be used to verify concurrent kernel code that is not data race free, including code responsible for managing shared page tables in the presence of relaxed MMU hardware. Using VRM, we verify the security guarantees of a retrofitted implementation of the Linux KVM hypervisor on Arm. For multiple versions of KVM, we prove KVM's security properties on a sequentially consistent model, then prove that KVM satisfies VRM's required program conditions such that its security proofs hold on Arm relaxed memory hardware. Our experimental results show that the retrofit and VRM conditions do not adversely affect the scalability of verified KVM, as it performs similar to unmodified KVM when concurrently running many multiprocessor virtual machines with real application workloads on Arm multiprocessor server hardware. Our work is the first machine-checked proof for concurrent systems software on Arm relaxed memory hardware. 

   more » « less
3. Interventional Fairness: Causal Database Repair for Algorithmic Fairness

   Salimi, Babak; Rodriguez, Luke; Howe, Bill; Suciu, Dan (April 2019, SIGMOD)

   Fairness is increasingly recognized as a critical component of machine learning systems. However, it is the underlying data on which these systems are trained that often reflect discrimination, suggesting a database repair problem. Existing treatments of fairness rely on statistical correlations that can be fooled by statistical anomalies, such as Simpson's paradox. Proposals for causality-based definitions of fairness can correctly model some of these situations, but they require specification of the underlying causal models. In this paper, we formalize the situation as a database repair problem, proving sufficient conditions for fair classifiers in terms of admissible variables as opposed to a complete causal model. We show that these conditions correctly capture subtle fairness violations. We then use these conditions as the basis for database repair algorithms that provide provable fairness guarantees about classifiers trained on their training labels. We evaluate our algorithms on real data, demonstrating improvement over the state of the art on multiple fairness metrics proposed in the literature while retaining high utility. 

   more » « less
4. The vision of self-evolving computing systems

   https://doi.org/10.3233/jid-220003  

   Weyns, Danny; Bäck, Thomas; Vidal, Rene; Yao, Xin; Belbachir, Ahmed Nabil (May 2022, Journal of Integrated Design and Process Science)

   Computing systems are omnipresent; their sustainability has become crucial for our society. A key aspect of this sustainability is the ability of computing systems to cope with the continuous change they face, ranging from dynamic operating conditions, to changing goals, and technological progress. While we are able to engineer smart computing systems that autonomously deal with various types of changes, handling unanticipated changes requires system evolution, which remains in essence a human-centered process. This will eventually become unmanageable. To break through the status quo, we put forward an arguable opinion for the vision of self-evolving computing systems that are equipped with an evolutionary engine enabling them to evolve autonomously. Specifically, when a self-evolving computing systems detects conditions outside its operational domain, such as an anomaly or a new goal, it activates an evolutionary engine that runs online experiments to determine how the system needs to evolve to deal with the changes, thereby evolving its architecture. During this process the engine can integrate new computing elements that are provided by computing warehouses. These computing elements provide specifications and procedures enabling their automatic integration. We motivate the need for self-evolving computing systems in light of the state of the art, outline a conceptual architecture of self-evolving computing systems, and illustrate the architecture for a future smart city mobility system that needs to evolve continuously with changing conditions. To conclude, we highlight key research challenges to realize the vision of self-evolving computing systems. 

   more » « less
5. Control Barrier Functions for Complete and Incomplete Information Stochastic Systems

   https://doi.org/https://doi.org/10.23919/ACC.2019.8814901  

   Clark, A. (January 2019, American Control Conference (ACC))

   Real-time controllers must satisfy strict safety requirements. Recently, Control Barrier Functions (CBFs) have been proposed that guarantee safety by ensuring that a suitablydefined barrier function remains bounded for all time. The CBF method, however, has only been developed for deterministic systems and systems with worst-case disturbances and uncertainties. In this paper, we develop a CBF framework for safety of stochastic systems. We consider complete information systems, in which the controller has access to the exact system state, as well as incomplete information systems where the state must be reconstructed from noisy measurements. In the complete information case, we formulate a notion of barrier functions that leads to sufficient conditions for safety with probability 1. In the incomplete information case, we formulate barrier functions that take an estimate from an extended Kalman filter as input, and derive bounds on the probability of safety as a function of the asymptotic error in the filter. We show that, in both cases, the sufficient conditions for safety can be mapped to linear constraints on the control input at each time, enabling the development of tractable optimization-based controllers that guarantee safety, performance, and stability. Our approach is evaluated via simulation study on an adaptive cruise control case study. 

   more » « less