Results 21  30
of
4,644
Author manuscript, published in "TAP 5th International Conference on Tests and Proofs (2011)" Correct Code Containing Containers
, 2013
"... Abstract. For critical software development, containers such as lists, vectors, sets or maps are an attractive alternative to adhoc data structures based on pointers. As standards like DO178C put formal verification and testing on an equal footing, it is important to give users the ability to appl ..."
Abstract
 Add to MetaCart
can be checked either by execution during testing or by formal proof with an automatic prover. We present a formal semantics for containers and an axiomatization of this semantics targeted at automatic provers. We have proved in Coq that the formal semantics is consistent and that the axiomatization
Experiments with Proof Plans for Induction
 Journal of Automated Reasoning
, 1992
"... The technique of proof plans, is explained. This technique is used to guide automatic inference in order to avoid a combinatorial explosion. Empirical research is described to test this technique in the domain of theorem proving by mathematical induction. Heuristics, adapted from the work of Boye ..."
Abstract

Cited by 105 (37 self)
 Add to MetaCart
The technique of proof plans, is explained. This technique is used to guide automatic inference in order to avoid a combinatorial explosion. Empirical research is described to test this technique in the domain of theorem proving by mathematical induction. Heuristics, adapted from the work
A statistical test suite for random and pseudorandom number generators for cryptographic applications
, 2001
"... (NIST) promotes the U.S. economy and public welfare by providing technical leadership for the nation’s measurement and standards infrastructure. ITL develops tests, test methods, reference data, proof of concept implementations, and technical analysis to advance the development and productive use of ..."
Abstract

Cited by 195 (0 self)
 Add to MetaCart
(NIST) promotes the U.S. economy and public welfare by providing technical leadership for the nation’s measurement and standards infrastructure. ITL develops tests, test methods, reference data, proof of concept implementations, and technical analysis to advance the development and productive use
Elementary proof of the RouthHurwitz test
 Systems and Control Letters 25
, 1995
"... This note presents an elementary proof of the familiar RouthHurwitz test. The proof is basically one continuity argument, it does not rely on Sturm chains, Cauchy index and the principle of the argument and it is fully self contained. In the same style an extended RouthHurwitz test is derived, wh ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
This note presents an elementary proof of the familiar RouthHurwitz test. The proof is basically one continuity argument, it does not rely on Sturm chains, Cauchy index and the principle of the argument and it is fully self contained. In the same style an extended RouthHurwitz test is derived
Testing, Proof and Automation. An Integrated Approach
 In: Proceedings of the 1st international workshop of
, 2000
"... This paper presents a discussion on the complementary roles of testing and proof within automated software verification and validation processes. We demonstrate how a combination of the two approaches can lead to greater levels of automation and integrity. In particular we discuss the use of automat ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
This paper presents a discussion on the complementary roles of testing and proof within automated software verification and validation processes. We demonstrate how a combination of the two approaches can lead to greater levels of automation and integrity. In particular we discuss the use
Maximum score estimation of the stochastic utility model of choice
 Journal of Econometrics
, 1975
"... This paper introduces a class of robust estimators of the parameters of a stochastic utility function. Existing maximum likelihood and regression estimation methods require the assumption of a particular distributional family for the random component of utility. In contrast, estimators of the ‘maxi ..."
Abstract

Cited by 204 (2 self)
 Add to MetaCart
of the ‘maximum score ’ class require only weak distributional assumptions for consistency. Following presentation and proof of the basic consistency theorem, additional results are given. An algorithm for achieving maximum score estimates and some small sample Monte Carlo tests are also described. 1.
Proof Techniques for Cryptographic Processes
 in 14th Annual IEEE Symposium on Logic in Computer Science
, 1999
"... Contextual equivalences for cryptographic process calculi, like the spicalculus, can be used to reason about correctness of protocols, but their definition suffers from quantification over all possible contexts. Here, we focus on two such equivalences, namely maytesting and barbed equivalence, and ..."
Abstract

Cited by 70 (8 self)
 Add to MetaCart
, that avoid quantification over contexts. Our main results are soundness and completeness of trace and weak bisimulation equivalence with respect to maytesting and barbed equivalence, respectively. They lead to more direct proof methods for equivalence checking. The use of these methods is illustrated with a
Towards Animation of Proofs testing proofs by examples
"... In this paper, we introduce the notion of proof animation. It is a new application of the principle of "CurryHoward isomorphism" to formal proof developments. Logically, proof animation is merely a contrapositive of "proofs as programs," which is an application of CurryHoward i ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
In this paper, we introduce the notion of proof animation. It is a new application of the principle of "CurryHoward isomorphism" to formal proof developments. Logically, proof animation is merely a contrapositive of "proofs as programs," which is an application of Curry
The Turing test as interactive proof
 Noûs
"... In this paper, I attempt to reconcile two mutually contradictory but wellfounded attitudes towards the Turing Test, Alan Turing’s proposed replacement for the question “Can machines think? ” On the one hand is the attitude that has become philosophical conventional wisdom, viz., that the Turing ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
In this paper, I attempt to reconcile two mutually contradictory but wellfounded attitudes towards the Turing Test, Alan Turing’s proposed replacement for the question “Can machines think? ” On the one hand is the attitude that has become philosophical conventional wisdom, viz., that the Turing
Program extraction from normalization proofs
 Typed Lambda Calculi and Applications, volume 664 of LNCS
, 1993
"... This paper describes formalizations of Tait’s normalization proof for the simply typed λcalculus in the proof assistants Minlog, Coq and Isabelle/HOL. From the formal proofs programs are machineextracted that implement variants of the wellknown normalizationbyevaluation algorithm. The case stud ..."
Abstract

Cited by 73 (5 self)
 Add to MetaCart
study is used to test and compare the program extraction machineries of the three proof assistants in a nontrivial setting. 1
Results 21  30
of
4,644