Separation is all you need: Foundations for Modular Verification

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (31)

Page 2 of 4

Explores the practical application of language theory, including quicksort, gradual typing, and efficient memory management, as well as the challenges of reduction program synthesis.

Type Inference

Explores type inference in statically typed languages, using algorithms to assign types to program expressions accurately.

Foundations of Scala: Modelling and Type Systems

Covers the foundations of Scala, including modelling recursive types, parameterized types, and variance.

Records and Variants

Introduces records, variants, evaluation rules, typing rules, aliasing challenges, and benefits in programming languages.

Type Systems: Preservation and Typing Rules

Covers preservation, substitution, weakening, and sequencing in type systems.

Hoare Logic: Foundations and Applications

Covers Hoare Logic, its foundations, applications, and significance in program verification.

Concurrency and transactional memory in Dafny

Covers Dafny basics, modeling concurrency, and implementing transactional memory with safety and liveness proofs.

Type Inference: Hindley-Milner Overview

Explores type inference algorithms and rules, including Hindley-Milner type inference for statically typed languages.

Verifying Programs with Stainless: How Stainless Works

Explores the inner workings of the Stainless framework, emphasizing verification-aware transformations and dependent type checking.

Solving Type Constraints

Explains the process of solving type constraints using the unification algorithm and generalization for flexible type inference.