Results 241 to 250 of about 1,057,123 (303)
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 +3 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 +3 more sources
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
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
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 +2 more sources
IEEE Transactions on Communications, 1982
A version of the standard high level data link control protocol has been verified as an experiment with an automated verification system. This paper tries to answer questions such as: How can HDLC and its properties be represented? To what extent can they be proved? What are the main obstacles in verifying protocols like HDLC.
Daniel Brand, William H. Joyner Jr.
openaire +1 more source
A version of the standard high level data link control protocol has been verified as an experiment with an automated verification system. This paper tries to answer questions such as: How can HDLC and its properties be represented? To what extent can they be proved? What are the main obstacles in verifying protocols like HDLC.
Daniel Brand, William H. Joyner Jr.
openaire +1 more source