Quantum software testing: State of the art
A García de la Barrera… - Journal of Software …, 2023 - Wiley Online Library
Quantum computing is expected to exponentially outperform classic computing on a broad
set of problems, including encryption, machine learning, and simulations. It has an impact …
set of problems, including encryption, machine learning, and simulations. It has an impact …
Quantum programming language: A systematic review of research topic and top cited languages
Quantum programming is an emerging area developed in last 2 decades from the
multidisciplinary research on quantum computing. Quantum computing combines the idea of …
multidisciplinary research on quantum computing. Quantum computing combines the idea of …
Dynamic logic
Among the many approaches to formal reasoning about programs, Dynamic Logic enjoys
the singulax aclv~ ntage of being strongly related to classical logic. Its variants constitute …
the singulax aclv~ ntage of being strongly related to classical logic. Its variants constitute …
Verifying quantitative reliability for programs that execute on unreliable hardware
Emerging high-performance architectures are anticipated to contain unreliable components
that may exhibit soft errors, which silently corrupt the results of computations. Full detection …
that may exhibit soft errors, which silently corrupt the results of computations. Full detection …
[图书][B] Formal verification of probabilistic systems
L De Alfaro - 1998 - search.proquest.com
Methods for the formal verification and specification of systems are a critical tool for the
development of correct systems, and they have been applied to the design of hardware …
development of correct systems, and they have been applied to the design of hardware …
PSI: Exact Symbolic Inference for Probabilistic Programs
Probabilistic inference is a key mechanism for reasoning about probabilistic programs.
Since exact inference is theoretically expensive, most probabilistic inference systems today …
Since exact inference is theoretically expensive, most probabilistic inference systems today …
Outcome logic: A unifying foundation for correctness and incorrectness reasoning
Program logics for bug-finding (such as the recently introduced Incorrectness Logic) have
framed correctness and incorrectness as dual concepts requiring different logical …
framed correctness and incorrectness as dual concepts requiring different logical …
Symbolic model checking for probabilistic processes
We introduce a symbolic model checking procedure for Probabilistic Computation Tree
Logic PCTL over labelled Markov chains as models. Model checking for probabilistic logics …
Logic PCTL over labelled Markov chains as models. Model checking for probabilistic logics …
A static analysis for quantifying information flow in a simple imperative language
We propose an approach to quantify interference in a simple imperative language that
includes a looping construct. In this paper we focus on a particular case of this definition of …
includes a looping construct. In this paper we focus on a particular case of this definition of …
[PDF][PDF] A new proof rule for almost-sure termination
We present a new proof rule for proving almost-sure termination of probabilistic programs,
including those that contain demonic non-determinism. An important question for a …
including those that contain demonic non-determinism. An important question for a …