Theoretical computer science | Formal methods

Formal methods

In computer science, formal methods are mathematically rigorous techniques for the specification, development, and verification of software and hardware systems. The use of formal methods for software and hardware design is motivated by the expectation that, as in other engineering disciplines, performing appropriate mathematical analysis can contribute to the reliability and robustness of a design. Formal methods employ a variety of theoretical computer science fundamentals, including logic calculi, formal languages, automata theory, control theory, program semantics, type systems, and type theory. (Wikipedia).

Video thumbnail

BM4. Methods of Proof

Basic Methods: We note the different methods of informal proof, which include direct proof, proof by contradiction, and proof by induction. We give proofs that sqrt(2) is irrational and that there are infinitely many primes, among others.

From playlist Math Major Basics

Video thumbnail

Introduction to Direct Proofs: If n is even, then n squared is even

This video introduces the mathematical proof method of direct proof provides an example of a direct proof. mathispower4u.com

From playlist Symbolic Logic and Proofs (Discrete Math)

Video thumbnail

Quantum Mechanics -- a Primer for Mathematicians

Juerg Frohlich ETH Zurich; Member, School of Mathematics, IAS December 3, 2012 A general algebraic formalism for the mathematical modeling of physical systems is sketched. This formalism is sufficiently general to encompass classical and quantum-mechanical models. It is then explained in w

From playlist Mathematics

Video thumbnail

Introduction to Common Mathematical Proof Methods

This video introduces the common methods of mathematical proofs and provides a basic example of a direct proof. mathispower4u.com

From playlist Symbolic Logic and Proofs (Discrete Math)

Video thumbnail

Formal verification and learning of complex systems - Professor Alessandro Abate

For slides, future Logic events and more, please visit: https://logic-data-science.github.io/?page=logic_learning Two known shortcomings of standard techniques in formal verification are the limited capability to provide system-level assertions, and the scalability to large-scale, complex

From playlist Logic and learning workshop

Video thumbnail

Physics Students Need to Know These 5 Methods for Differential Equations

Differential equations are hard! But these 5 methods will enable you to solve all kinds of equations that you'll encounter throughout your physics studies. Get the notes for free here: https://courses.physicswithelliot.com/notes-sign-up Sign up for my newsletter for additional physics les

From playlist Physics Help Room

Video thumbnail

Formal Definition of a Function using the Cartesian Product

Learning Objectives: In this video we give a formal definition of a function, one of the most foundation concepts in mathematics. We build this definition out of set theory. **************************************************** YOUR TURN! Learning math requires more than just watching vid

From playlist Discrete Math (Full Course: Sets, Logic, Proofs, Probability, Graph Theory, etc)

Video thumbnail

B01 An introduction to numerical methods

Most differential equations cannot be solved by the analytical techniques that we have learned up until now. I these cases, we can approximate a solution by a set of points, by using a variety of numerical methods. The first of these is Euler's method.

From playlist A Second Course in Differential Equations

Video thumbnail

Micaela Mayero - Overview of real numbers in theorem provers: application with real analysis in Coq

Recorded 15 February 2023. Micaela Mayero of the Galilee Institute - Paris Nord University presents "An overview of the real numbers in theorem provers: an application with real analysis in Coq" at IPAM's Machine Assisted Proofs Workshop. Abstract: Formalizing real numbers in a formal proo

From playlist 2023 Machine Assisted Proofs Workshop

Video thumbnail

Basic Methods of Proof -- How to do mathematical proofs (PART 5)

This is the third video on a series of videos on: How to do mathematical proofs. The course is structured in such a way to make the transition from applied-style problems in mathematics (sometimes referred to as engineering mathematics) to pure mathematics much smoother. In this video, w

From playlist How to do Mathematical Proofs

Video thumbnail

RubyHACK 2018: Interfaces Not Required by James Thompson

RubyHACK 2018: Interfaces Not Required by James Thompson Interfaces give classes a way to guarantee they behave in compatible ways. How can such a guarantee be afforded in Ruby without a language construct to provide it? Explore getting the same assurances through testing and behavior-ori

From playlist RubyHACK 2018

Video thumbnail

Fabian Immler : Verified numerics for ODEs in Isabelle/HOL

Abstract : This talk is about verified numerical algorithms in Isabelle/HOL, with a focus on guaranteed enclosures for solutions of ODEs. The enclosures are represented by zonotopes, arising from the use of affine arithmetic. Enclosures for solutions of ODEs are computed by set-based varia

From playlist Mathematical Aspects of Computer Science

Video thumbnail

10/25/19, Fabian Immler

Fabian Immler, Carnegie Mellon University Formal mathematics and a proof of chaos Formal proof has been successfully applied to the verification of hardware and software systems. But formal proof is also applicable to mathematics: proofs can be checked with ultimate rigor and one can bui

From playlist Fall 2019 Kolchin Seminar in Differential Algebra

Video thumbnail

C# Delegates Explained | C# Delegates And Events Tutorial | C# Delegates Example | Simplilearn

šŸ”„Post Graduate Program In Full Stack Web Development: https://www.simplilearn.com/pgp-full-stack-web-development-certification-training-course?utm_campaign=CSharpDelegates-vOlLd2SsKM4&utm_medium=DescriptionFF&utm_source=youtube šŸ”„Caltech Coding Bootcamp (US Only): https://www.simplilearn.co

From playlist C# Training šŸ”„[2022 Updated]

Video thumbnail

12/13/2019,Ā Yi Zhang

Yi Zhang, University of Texas at Dallas Apparent Singularities of D-Finite Systems We generalize the notions of ordinary points and singularities from linear ordinary differential equations to D-finite systems. Ordinary points and apparent singularities of a D-finite system are character

From playlist Fall 2019 Kolchin Seminar in Differential Algebra

Video thumbnail

Kernel Recipes 2019 - Formal modeling made easy

Modeling parts of Linux has become a recurring topic. For instance, the memory model, the model for PREEMPT_RT synchronization, and so on. But the term ā€œformal modelā€ causes panic for most of the developers. Mainly because of the complex notations and reasoning that involves formal languag

From playlist Kernel Recipes 2019

Video thumbnail

Kurt Gƶdel Centenary - Part I

Institute for Advanced Study November 17, 2006 Karl Sigmund (University of Vienna) Solomon Feferman (Stanford University) More videos on http://video.ias.edu

From playlist Kurt Gƶdel Centenary

Video thumbnail

PMP Communication Management | PMPĀ® Training Videos | Project Management Tutorial | Simplilearn

šŸ”„ Post Graduate Program In Project Management: https://www.simplilearn.com/pgp-project-management-certification-training-course?utm_campaign=ProjectCommunicationManagement-k8KjFuhzBaQ&utm_medium=DescriptionFF&utm_source=youtube šŸ”„ PMPĀ® Certification Training Course: https://www.simplilearn.

From playlist PMP Training Videos [2022 Updated]

Video thumbnail

SYN103 - Grammar (Overview)

There is a great deal of confusion about the term 'grammar'. Most people associate with it a book written about a language. In fact, there are various manifestations of this traditional term: presecriptive, descriptive and reference grammar. In theoretical linguistics, grammars are theory

From playlist VLC107 - Syntax: Part II

Video thumbnail

Michael Lindsey - Many-body perturbation theory and Green's function methods - IPAM at UCLA

Recorded 10 March 2022. Michael Lindsey of New York University Mathematics presents "Many-body perturbation theory and Green's function methods" at IPAM's Advancing Quantum Mechanics with Mathematics and Statistics Tutorials. Abstract: Beyond the single-particle picture of density function

From playlist Tutorials: Advancing Quantum Mechanics with Mathematics and Statistics - March 8-11, 2022

Related pages

Uppaal Model Checker | Postcondition | Common Algebraic Specification Language | SPARK (programming language) | TLA+ | Domain theory | Theoretical computer science | Esterel | Knowledge Based Software Assistant | Operational semantics | Binary decision diagram | Ambiguity | Abstract interpretation | MALPAS Software Static Analysis Toolset | SPIN model checker | Automated theorem proving | Oracle machine | Formal verification | Logic in computer science | Mathematical proof | Language Of Temporal Ordering Specification | Perfect Developer | Formal language | Rigorous Approach to Industrial Software Engineering | Automata theory | Backusā€“Naur form | BCS-FACS | Java Modeling Language | Predicative programming | Formal specification | PAT (model checker) | Specification and Description Language | Control theory | ACL2 | Mathematics | Correctness (computer science) | Denotational semantics | Vienna Development Method | Dansk Datamatik Center | Axiomatic semantics | Z User Group | Web Ontology Language | MCRL2 | Universal Systems Language | Object Constraint Language | Z notation | Atelier B | Actor model | Model checking | Specification language | Type theory | Formal system | Petri net | Precondition | First-order logic | B-Method | Formal Methods Europe