Search
Search Results
-
Maximal Quantified Precondition Synthesis for Linear Array Loops
Precondition inference is an important problem with many applications in verification and testing. Finding preconditions can be tricky as programs...
-
Weakest Precondition Inference for Non-Deterministic Linear Array Programs
Precondition inference is an important problem with many applications. Existing precondition inference techniques for programs with arrays have...
-
Lifting the Reasoning Level in Generic Weak Memory Verification
Weak memory models specify the semantics of concurrent programs on multi-core architectures. Reasoning techniques for weak memory models are often...
-
A Fine-Grained Semantics for Arrays and Pointers Under Weak Memory Models
Developers of concurrent code for multicore architectures must navigate weak memory models (wmms) – either directly at the hardware/assembly level or...
-
Kleene Algebra of Weighted Programs with Domain
Weighted programs were recently introduced by Batz et al. (Proc. ACM Program. Lang. 2022) as a generalization of probabilistic programs which can...
-
Rely/Guarantee Reasoning for Multicopy Atomic Weak Memory Models
Rely/guarantee reasoning provides a compositional approach to reasoning about concurrent programs. However, such reasoning traditionally assumes a...
-
Moral Philosophy of Artificial General Intelligence: Agency and Responsibility
The European Parliament recently proposed to grant the personhood of autonomous AI, which raises fundamental questions concerning the ethical nature...
-
Lightweight precise automatic extraction of exception preconditions in java methods
When a method throws an exception— its exception precondition —is a crucial element of the method’s documentation that clients should know to properly...
-
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...
-
Specifying the Boundary Between Unverified and Verified Code
This paper introduces a specification construct that is fitting when combining verified code with unverified code. The specification is a form of...
-
SMT-Based Test-Case Generation and Validation for Programs with Complex Specifications
We present a system which automatically generates an exhaustive set of black-box test-cases, up to a given size, for units under test requiring...
-
Reliability and Interpretability in Science and Deep Learning
In recent years, the question of the reliability of Machine Learning (ML) methods has acquired significant importance, and the analysis of the...
-
Inferring Interval-Valued Floating-Point Preconditions
Aggregated roundoff errors caused by floating-point arithmetic can make numerical code highly unreliable. Verified postconditions for floating-point...
-
Integrating Owicki–Gries for C11-Style Memory Models into Isabelle/HOL
Weak memory presents a new challenge for program verification and has resulted in the development of a variety of specialised logics. For C11-style...
-
Automatic Execution of the Ontological Piloting Procedures
Intelligent educational systems currently use ontological knowledge modeling for their expert component. The associated semantics of the ontological...
-
Verifying Read-Copy Update Under RC11
Read-Copy Update (RCU) is a key lock-free synchronisation mechanism that is used extensively in the Linux kernel. One use of RCU is safe memory...
-
Overcoming Memory Weakness with Unified Fairness
We consider the verification of liveness properties for concurrent programs running on weak memory models. To that end, we identify notions of...
-
Rotational-XOR Differential Rectangle Cryptanalysis on Simon-Like Ciphers
In this paper, we propose a rectangle-like method called rotational-XOR differential rectangle attack to search for better distinguishers. It is a...
-
CGPM: Poverty Map** Framework Based on Multi-Modal Geographic Knowledge Integration and Macroscopic Social Network Mining
Having high-precision and high-resolution poverty map is a prerequisite for monitoring the United Nations Sustainable Development Goals(SDGs) and for...
-
Refinement of Parallel Algorithms Down to LLVM: Applied to Practically Efficient Parallel Sorting
We present a stepwise refinement approach to develop verified parallel algorithms, down to efficient LLVM code. The resulting algorithms’ performance...
