Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Algorithmic Foundations for Systems Certification

Description

This lecture by the instructor from Max Planck Institute for Software Systems focuses on the challenges of designing systems with unreliable components. It covers topics such as multithreaded shared-memory programs, bounded verification, k-context bounded analysis, and the use of binary decision diagrams for efficient verification. The lecture also delves into the decidable nature of context-bounded reachability and the importance of downward closures of languages in verification. Furthermore, it explores the relationship between sequential verification and context-bounded verification, as well as the application of randomized testing with formal guarantees. The lecture concludes with discussions on controller synthesis for cyber-physical systems, the theory of trust in systems design, and the ethical considerations of perfect certification engineering.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Official source

Related concepts (31)

Totally bounded space

In topology and related branches of mathematics, total-boundedness is a generalization of compactness for circumstances in which a set is not necessarily closed. A totally bounded set can be covered by finitely many subsets of every fixed “size” (where the meaning of “size” depends on the structure of the ambient space). The term precompact (or pre-compact) is sometimes used with the same meaning, but precompact is also used to mean relatively compact. These definitions coincide for subsets of a complete metric space, but not in general.

Real analysis

In mathematics, the branch of real analysis studies the behavior of real numbers, sequences and series of real numbers, and real functions. Some particular properties of real-valued sequences and functions that real analysis studies include convergence, limits, continuity, smoothness, differentiability and integrability. Real analysis is distinguished from complex analysis, which deals with the study of complex numbers and their functions.

Bounded operator

In functional analysis and operator theory, a bounded linear operator is a linear transformation between topological vector spaces (TVSs) and that maps bounded subsets of to bounded subsets of If and are normed vector spaces (a special type of TVS), then is bounded if and only if there exists some such that for all The smallest such is called the operator norm of and denoted by A bounded operator between normed spaces is continuous and vice versa. The concept of a bounded linear operator has been extended from normed spaces to all topological vector spaces.

Randomness test

A randomness test (or test for randomness), in data evaluation, is a test used to analyze the distribution of a set of data to see whether it can be described as random (patternless). In stochastic modeling, as in some computer simulations, the hoped-for randomness of potential input data can be verified, by a formal test for randomness, to show that the data are valid for use in simulation runs. In some cases, data reveals an obvious non-random pattern, as with so-called "runs in the data" (such as expecting random 0–9 but finding "4 3 2 1 0 4 3 2 1.

Bounded set

In mathematical analysis and related areas of mathematics, a set is called bounded if it is, in a certain sense, of finite measure. Conversely, a set which is not bounded is called unbounded. The word "bounded" makes no sense in a general topological space without a corresponding metric. Boundary is a distinct concept: for example, a circle in isolation is a boundaryless bounded set, while the half plane is unbounded yet has a boundary. A bounded set is not necessarily a closed set and vice versa.

Related lectures (30)

Exploration Bias

Explores the concept of exploration bias and its impact on data.

Spatial Statistics: Significance

Explains the calculation of statistical significance in spatial statistics using permutation and randomization methods.

Algorithms to Live By: Optimal Stopping and Logarithmic Regret

Explores optimal stopping, explore/exploit, Bayes' Rule, and logarithmic regret in bandit solutions.

Analysis I: Decreasing and Growing Functions

Explores decreasing and growing functions, bounded sequences, and limit existence.

Experimental Design: Replication, Randomization, Blocking