Results 1  10
of
457
ML4PG in computer algebra verification
 In Conf. on Intelligent Computer Mathematics, 2013. HKJM13. Jónathan Heras, Ekaterina Komendantskaya, Moa Johansson, and Ewen Maclean. Proofpattern recognition and lemma discovery in acl2. In McMillan et al. [MMV13
"... Abstract. ML4PG is a machinelearning extension that provides statistical proof hints during the process of Coq/SSReflect proof development. In this paper, we use ML4PG to find proof patterns in the CoqEAL library – a library that was devised to verify the correctness of Computer Algebra algorithm ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. ML4PG is a machinelearning extension that provides statistical proof hints during the process of Coq/SSReflect proof development. In this paper, we use ML4PG to find proof patterns in the CoqEAL library – a library that was devised to verify the correctness of Computer Algebra
A generic process algebra
 Proc. of the Workshop Essays on Algebraic Process Calculi (APC 25), volume 162 of Electr. Notes Theor. Comput. Sci
, 2006
"... Process algebra is the study of distributed or parallel systems by algebraic means. Originating in computer science, process algebra has been extended in recent years to encompass not just discreteevent systems, but also continuously evolving phenomena, resulting in socalled hybrid process algebra ..."
Abstract

Cited by 253 (22 self)
 Add to MetaCart
Process algebra is the study of distributed or parallel systems by algebraic means. Originating in computer science, process algebra has been extended in recent years to encompass not just discreteevent systems, but also continuously evolving phenomena, resulting in socalled hybrid process
Formal Specification and Verification of Computer Algebra Software
, 2014
"... In this thesis, we present a novel framework for the formal specification and verification of computer algebra programs and its application to a nontrivial computer algebra package. The programs are written in the language MiniMaple which is a substantial subset of the language of the commercial co ..."
Abstract
 Add to MetaCart
In this thesis, we present a novel framework for the formal specification and verification of computer algebra programs and its application to a nontrivial computer algebra package. The programs are written in the language MiniMaple which is a substantial subset of the language of the commercial
MIZAR Verification of Generic Algebraic Algorithms
, 1997
"... Although generic programming founds more and more attention  nowadays generic programming languages as well as generic libraries exist  there are hardly approaches for the verification of generic algorithms or generic libraries. This thesis deals with generic algorithms in the field of computer ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
. Answering this question that especially arises if one wants to implement generic programming languages, in the field of computer algebra requires non trival mathematical knowledge. To build a verification system using the Mizar theorem prover, we also implemented a generator which almost automatically
Hidden Verification for Computational Mathematics
"... We present hidden verification as a means to make the power of computational logic available to users of computer algebra systems while shielding them fi'om its complexity. We have implemented in PVS a library of facts about elementary and transcendental functions, and automatic procedures ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We present hidden verification as a means to make the power of computational logic available to users of computer algebra systems while shielding them fi'om its complexity. We have implemented in PVS a library of facts about elementary and transcendental functions, and automatic procedures
Using Probabilistic Kleene Algebra pKA for Protocol Verification
"... We propose a method for verification of probabilistic distributed systems in which a variation of Kozen’s Kleene Algebra with Tests [11] is used to take account of the wellknown interaction of probability and “adversarial ” scheduling [17]. We describe pKA, a probabilistic Kleenestyle algebra, bas ..."
Abstract
 Add to MetaCart
, based on a widely accepted model of probabilistic/demonic computation [7,25,17]. Our technical aim is to express probabilistic versions of Cohen’s separation theorems[4]. Separation theorems simplify reasoning about distributed systems, where with purely algebraic reasoning they can reduce complicated
Computer Verification in Cryptography
 In International Conference of Computer Science
"... Abstract — In this paper we explore the application of a formal proof system to verification problems in cryptography. Cryptographic properties concerning correctness or security of some cryptographic algorithms are of great interest. Beside some basic lemmata, we explore an implementation of a comp ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
complex function that is used in cryptography. More precisely, we describe formal properties of this implementation that we computer prove. We describe formalized probability distributions (σalgebras, probability spaces and conditional probabilities). These are given in the formal language of the formal
Combining Logic and Algebraic Techniques for Program Verification in Theorema
 SECOND INTERNATIONAL SYMPOSIUM ON LEVERAGING APPLICATIONS OF FORMAL METHODS, VERIFICATION AND VALIDATION
, 2007
"... We study and implement concrete methods for the verification of both imperative as well as functional programs in the frame of the Theorema system. The distinctive features of our approach consist in the automatic generation of loop invariants (by using combinatorial and algebraic techniques), and ..."
Abstract

Cited by 8 (8 self)
 Add to MetaCart
We study and implement concrete methods for the verification of both imperative as well as functional programs in the frame of the Theorema system. The distinctive features of our approach consist in the automatic generation of loop invariants (by using combinatorial and algebraic techniques
Theorem Proving with the Real Numbers
, 1996
"... This thesis discusses the use of the real numbers in theorem proving. Typically, theorem provers only support a few `discrete' datatypes such as the natural numbers. However the availability of the real numbers opens up many interesting and important application areas, such as the verification ..."
Abstract

Cited by 119 (13 self)
 Add to MetaCart
of floating point hardware and hybrid systems. It also allows the formalization of many more branches of classical mathematics, which is particularly relevant for attempts to inject more rigour into computer algebra systems. Our work is conducted in a version of the HOL theorem prover. We describe
Results 1  10
of
457