Formally verified computation of enclosures of solutions of ordinary differential equations

F Immler - NASA Formal Methods: 6th International Symposium …, 2014 - Springer
Ordinary differential equations (ODEs) are ubiquitous when modeling continuous dynamics.
Classical numerical methods compute approximations of the solution, however without any …

Formally-verified decision procedures for univariate polynomial computation based on Sturm's and Tarski's theorems

A Narkawicz, C Munoz, A Dutle - Journal of Automated Reasoning, 2015 - Springer
Sturm's theorem is a well-known result in real algebraic geometry that provides a function
that computes the number of roots of a univariate polynomial in a semi-open interval, not …

Symbolic reasoning about quantum circuits in Coq

WJ Shi, QX Cao, YX Deng, HR Jiang… - Journal of Computer …, 2021 - Springer
A quantum circuit is a computational unit that transforms an input quantum state to an output
state. A natural way to reason about its behavior is to compute explicitly the unitary matrix …

Formal analysis of optical systems

S Khan-Afshar, U Siddique, MY Mahmoud… - … in Computer Science, 2014 - Springer
Optical systems are becoming increasingly important by resolving many bottlenecks in
today's communication, electronics, and biomedical systems. However, given the continuous …

Formal verification of cyber-physical systems using theorem proving

A Rashid, U Siddique, S Tahar - … workshop on formal techniques for safety …, 2019 - Springer
Due to major breakthroughs in software and engineering technologies, embedded systems
are increasingly being utilized in areas ranging from aerospace and next-generation …

Formalized functional analysis with semilinear maps

F Dupuis, RY Lewis, H Macbeth - Journal of Automated Reasoning, 2024 - Springer
Semilinear maps are a generalization of linear maps between vector spaces where we allow
the scalar action to be twisted by a ring homomorphism such as complex conjugation. In …

Formalization of complex vectors in higher-order logic

SK Afshar, V Aravantinos, O Hasan, S Tahar - International Conference on …, 2014 - Springer
Complex vector analysis is widely used to analyze continuous systems in many disciplines,
including physics and engineering. In this paper, we present a higher-order-logic …

Formalizing the Semantics of a Classical-Quantum Imperative Language in Coq

W Shi, Q Cao, Y Deng - Journal of Circuits, Systems and Computers, 2024 - World Scientific
In order to verify the functional correctness of quantum circuits or algorithms, a prominent
approach is to specify them as quantum programs and semi-automatically deduce them in a …

Formal verification of optical quantum flip gate

MY Mahmoud, V Aravantinos, S Tahar - … , ITP 2014, Held as Part of the …, 2014 - Springer
Quantum computers are promising to efficiently solve hard computational problems,
especially NP problems. In this paper, we propose to tackle the formal verification of …

On the quantum formalization of coherent light in HOL

M Yousri Mahmoud, S Tahar - … Symposium, NFM 2014, Houston, TX, USA …, 2014 - Springer
During the last decade, formal methods, in particular theorem proving, have proven to be
effective as analysis tools in different fields. Among them, quantum optics is a potential area …