Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
Hoare Logic: Strongest Postcondition and Weakest Precondition
Graph Chatbot
Related lectures (40)
Hoare Logic: Postconditions and Preconditions
Covers Hoare logic, postconditions, preconditions, and program behavior proofs.
Converting Imperative Programs to Formulas
Explores converting imperative programs to formulas, including verification conditions, formula construction, and control flow structures.
Hoare Logic: Strongest Postcondition and Weakest Precondition
Introduces Hoare logic for simplifying program behavior proofs through annotations.
Loops: Control Statements and Functions
Covers modeling control statements with functions in Scala, including while loops, repeat loops, and for-loops translation.
Programming Missions: Starting with the Third Line
MOOC: The Thymio robot as a tool for discovering digital science
Discusses translating program lines into French and using sensors to trigger actions.
Programming Thymio: First Steps
Covers programming Thymio to move, stop, play music, and change colors.
Untitled
Termination Analysis using Dependency Pairs
Explores automated termination analysis using dependency pairs, covering classical and modern techniques, annual competitions, and tools like AProVE.
Predicate Logic: Introduction & Equivalences
Covers predicate logic basics, quantifiers, equivalences, and natural language translation examples.
Stainless Verification System Tutorial
Introduces Stainless, an open-source tool for verifying Scala programs, covering language, modeling, verification tips, and inner workings.
Combinatorial Search: For-Expressions
Explores the use of for-expressions in Scala to simplify computations and solve problems like combinatorial search and N-Queens.
Functional Programming: Concepts and History
Explores imperative programming limitations, theories without mutation, functional programming principles, and the history of functional languages.
Introduction to Object-Oriented Programming in Java
Covers the basic concepts of object-oriented programming in Java, emphasizing encapsulation, abstraction, and the importance of organizing complex programs.
Discrete Event Simulation
Covers discrete event simulation using digital circuits, base components, complex components, and simulation implementation.
Predicate Logic: Nested Quantifiers
Explores nested quantifiers in logic and their translation into natural language and mathematical statements.
Functional Programming Principles
Covers the principles and benefits of functional programming, emphasizing immutable data and functions.
Functional Reactive Programming: Signals and Transformations
Explores functional reactive programming using signals to simplify state changes and event reactions in a more functional and clean approach.
Coq: Introduction
Introduces Coq, covering defining propositions, proving theorems, and using tactics.
Predicate Logic: Translating Natural Language into Logic
Covers the translation of natural language sentences into predicate logic and the importance of quantifier order.
Functional Programming: Concepts and Implementation
Covers the concepts and implementation of functional programming in Scala, emphasizing functions, immutable data, and data abstraction.
Previous
Page 1 of 2
Next