Results 221 to 230 of about 20,882 (259)
Some of the next articles are maybe not open access.
Totally verified systems: Linking verified software to verified hardware
1990We describe exploratory efforts to design and verify a compiler for a formally verified microprocessor as one aspect of the eventual goal of building totally verified systems. Together with a formal proof of correctness for the microprocessor this yields a precise and rigorously established link between the semantics of the source language and the ...
openaire +1 more source
Proceedings of 37th Conference on Foundations of Computer Science, 2002
We provide an O˜(n^2) time randomized algorithm to check whether a given operation f:S×S→S is associative (letting n=|S|). They prove this performance is optimal (up to polylogarithmic factors) even in case the operation is "cancellative". No sub-n^3 algorithm was previously known for this task.
Rajagopalan, Sridhar +1 more
openaire +2 more sources
We provide an O˜(n^2) time randomized algorithm to check whether a given operation f:S×S→S is associative (letting n=|S|). They prove this performance is optimal (up to polylogarithmic factors) even in case the operation is "cancellative". No sub-n^3 algorithm was previously known for this task.
Rajagopalan, Sridhar +1 more
openaire +2 more sources
Computing in Science & Engineering, 2002
At the recent Joint Mathematics Meetings held in San Diego, I ran into an old friend who told me he is now doing "post-modern" mathematics, or PMM for short. Without even being asked, he explained that PMM is the term that replaced the phrase, "I believe the following mathematical statement to be true, but I can't prove it (yet)."
openaire +1 more source
At the recent Joint Mathematics Meetings held in San Diego, I ran into an old friend who told me he is now doing "post-modern" mathematics, or PMM for short. Without even being asked, he explained that PMM is the term that replaced the phrase, "I believe the following mathematical statement to be true, but I can't prove it (yet)."
openaire +1 more source
Information Processing Letters, 1986
An algebra is called rigid if it has no other endomorphism than identity. We prove that the problem whether a finite algebra A is nonrigid is NP- complete as soon as the type of A has either one binary or two unary symbols. The apparently harder problem whether \(| End A| >k\), for a given integer \(k\geq 1\), can be reduced to the nonrigidity problem ...
Pavel Goralcik, Václav Koubek
openaire +2 more sources
An algebra is called rigid if it has no other endomorphism than identity. We prove that the problem whether a finite algebra A is nonrigid is NP- complete as soon as the type of A has either one binary or two unary symbols. The apparently harder problem whether \(| End A| >k\), for a given integer \(k\geq 1\), can be reduced to the nonrigidity problem ...
Pavel Goralcik, Václav Koubek
openaire +2 more sources
Verifying the Verifier is the second brief in the AVAAS methodology series. It answers the oldest question in governance, who verifies the verifier, as it applies to a certification body that grades the behavior of deployed AI systems. The brief specifies the AVAAS trust stack, eight layers that make the certifier auditable by construction rather than ...
openaire +1 more source
openaire +1 more source
Journal of Medical Ethics, 2013
I agree with Dr Eyal that the ‘trust-promotion argument for informed consent’ fails to account for common sense intuitions about informed consent.1 Appealing to ‘social trust, especially trust in caretakers and medical institutions’ cannot, by itself, justify informed consent requirements. And stipulating, in the trust-promoting argument's first clause,
openaire +2 more sources
I agree with Dr Eyal that the ‘trust-promotion argument for informed consent’ fails to account for common sense intuitions about informed consent.1 Appealing to ‘social trust, especially trust in caretakers and medical institutions’ cannot, by itself, justify informed consent requirements. And stipulating, in the trust-promoting argument's first clause,
openaire +2 more sources
IEEE Security & Privacy, 2014
Do you believe the software packages you buy and install are secure? Today that belief is largely a matter of faith. Could a third-party verification process, whether similar to Underwriters Laboratories or the US Food and Drug Administration, give us greater assurance of secure software?
openaire +1 more source
Do you believe the software packages you buy and install are secure? Today that belief is largely a matter of faith. Could a third-party verification process, whether similar to Underwriters Laboratories or the US Food and Drug Administration, give us greater assurance of secure software?
openaire +1 more source
1990
The concept of Design for Verifiability is introduced as a means of attacking the complexity problem encountered when verifying the correctness of hardware designs using mathematical proof techniques. The inherent complexity of systems implemented as integrated circuits results in a comparable descriptive complexity when modelling them in any framework
openaire +1 more source
The concept of Design for Verifiability is introduced as a means of attacking the complexity problem encountered when verifying the correctness of hardware designs using mathematical proof techniques. The inherent complexity of systems implemented as integrated circuits results in a comparable descriptive complexity when modelling them in any framework
openaire +1 more source
New England Journal of Medicine, 2005
Dr. Eric Topol asks, How can a drug that is associated with higher rates of both renal dysfunction and death than placebo — and that costs 50 times as much as standard therapies — be given to more than 600,000 patients and be promoted throughout the United States for serial outpatient use, an indication not listed on the label?
openaire +2 more sources
Dr. Eric Topol asks, How can a drug that is associated with higher rates of both renal dysfunction and death than placebo — and that costs 50 times as much as standard therapies — be given to more than 600,000 patients and be promoted throughout the United States for serial outpatient use, an indication not listed on the label?
openaire +2 more sources
Consensus algorithm based on verifiable quantum random numbers
International Journal of Intelligent Systems, 2022Fangguo Zhang, , Zhiwei Sun
exaly