Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
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 …
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
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 …
that computes the number of roots of a univariate polynomial in a semi-open interval, not …
Symbolic reasoning about quantum circuits in Coq
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 …
state. A natural way to reason about its behavior is to compute explicitly the unitary matrix …
Formal analysis of optical systems
Optical systems are becoming increasingly important by resolving many bottlenecks in
today's communication, electronics, and biomedical systems. However, given the continuous …
today's communication, electronics, and biomedical systems. However, given the continuous …
Formal verification of cyber-physical systems using theorem proving
Due to major breakthroughs in software and engineering technologies, embedded systems
are increasingly being utilized in areas ranging from aerospace and next-generation …
are increasingly being utilized in areas ranging from aerospace and next-generation …
Formalized functional analysis with semilinear maps
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 …
the scalar action to be twisted by a ring homomorphism such as complex conjugation. In …
Formalization of complex vectors in higher-order logic
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 …
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 …
approach is to specify them as quantum programs and semi-automatically deduce them in a …
Formal verification of optical quantum flip gate
Quantum computers are promising to efficiently solve hard computational problems,
especially NP problems. In this paper, we propose to tackle the formal verification of …
especially NP problems. In this paper, we propose to tackle the formal verification of …
On the quantum formalization of coherent light in HOL
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 …
effective as analysis tools in different fields. Among them, quantum optics is a potential area …