Results 261 to 270 of about 828,996 (313)
Some of the next articles are maybe not open access.
SIAM Journal on Computing, 2000
Summary: We provide an \(O(n^2 \log{1 \over \delta})\) time randomized algorithm to check whether a given operation \(\circ :S \times S \rightarrow S\) is associative (where \(n=|S|\) and \(\delta>0\) is the error probability required of the algorithm).
Sridhar Rajagopalan, Leonard J. Schulman
openaire +2 more sources
Summary: We provide an \(O(n^2 \log{1 \over \delta})\) time randomized algorithm to check whether a given operation \(\circ :S \times S \rightarrow S\) is associative (where \(n=|S|\) and \(\delta>0\) is the error probability required of the algorithm).
Sridhar Rajagopalan, Leonard J. Schulman
openaire +2 more sources
Proceedings of the 14th Workshop on Formal Techniques for Java-like Programs, 2012
Program verification is the only way to be certain that a given piece of software is free of (certain types of) errors --- errors that could otherwise disrupt operations in the field. To date, formal verification has been done by specially-trained engineers. Labor costs have heretofore made formal verification too costly to apply beyond small, critical
Werner Dietl +7 more
openaire +1 more source
Program verification is the only way to be certain that a given piece of software is free of (certain types of) errors --- errors that could otherwise disrupt operations in the field. To date, formal verification has been done by specially-trained engineers. Labor costs have heretofore made formal verification too costly to apply beyond small, critical
Werner Dietl +7 more
openaire +1 more source
The Review of Symbolic Logic, 2020
AbstractThis paper clarifies, revises, and extends the account of the transmission of truthmakers by core proofs that was set out in chap. 9 of Tennant (2017). Brauer provided two kinds of example making clear the need for this. Unlike Brouwer’s counterexamples to excluded middle, the examples of Brauer that we are dealing with here establish the need ...
Ethan Brauer, Neil Tennant
openaire +1 more source
AbstractThis paper clarifies, revises, and extends the account of the transmission of truthmakers by core proofs that was set out in chap. 9 of Tennant (2017). Brauer provided two kinds of example making clear the need for this. Unlike Brouwer’s counterexamples to excluded middle, the examples of Brauer that we are dealing with here establish the need ...
Ethan Brauer, Neil Tennant
openaire +1 more source
AJN, American Journal of Nursing, 2017
A visiting nurse finds himself cast as a player in a universal drama.
openaire +2 more sources
A visiting nurse finds himself cast as a player in a universal drama.
openaire +2 more sources
Logical verification and equational verification
ACM SIGACT News, 2005There were some errors in the last article of the Logic Column. Thanks to Claudia Zepeda for spotting them. They have been corrected in the online version of the article, available from the CORR archive at http://arxiv.org/abs/cs.LO/0502031. All articles published in this column are archived at CORR; the following URL will return them all: http://arxiv.
openaire +1 more source
ACM SIGLOG News, 2023
Many verification problems can be formulated as a language inclusion problem where the task is to decide whether the language of the system model (given by the runs of the system) is contained in the language induced by a logical specification. The corresponding verification problem for non-functional properties is the quantitative inclusion problem ...
openaire +1 more source
Many verification problems can be formulated as a language inclusion problem where the task is to decide whether the language of the system model (given by the runs of the system) is contained in the language induced by a logical specification. The corresponding verification problem for non-functional properties is the quantitative inclusion problem ...
openaire +1 more source
Accreditation—a verification ritual lacking verification
BMJ, 2018The King’s Fund found that Care Quality Commission (CQC) audits had little impact on the quality of care.1 Oxebridge has put this in the wider context, saying that placing confidence in related systems from the International Organization for Standardization (ISO) does not prevent loss of life.2 Compliance with such standards is equated with “quality.”
openaire +2 more sources
Proceedings of the 46th Annual Design Automation Conference, 2009
Proving the equivalence of successive, closely related versions of a program has the potential of being easier in practice than functional verification, although both problems are undecidable. There are two main reasons for this claim: it circumvents the problem of specifying what the program should do, and in many cases it is computationally easier ...
Benny Godlin, Ofer Strichman
openaire +1 more source
Proving the equivalence of successive, closely related versions of a program has the potential of being easier in practice than functional verification, although both problems are undecidable. There are two main reasons for this claim: it circumvents the problem of specifying what the program should do, and in many cases it is computationally easier ...
Benny Godlin, Ofer Strichman
openaire +1 more source