Results 241 to 250 of about 192,432 (282)
Some of the next articles are maybe not open access.
Totally verified systems: linking verified software to verified hardware
1989We 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
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
Verifying Implementation Relations
2001Implementation relations are a means to relate the behaviour of implementation and specification systems built of communicating processes in the event that respective implementation and specification processes have differing interfaces. In this paper we first present a graph-theoretic statement of such relations, and then derive algorithms for their ...
BURTON J, KOUTNY M, PAPPALARDO, Giuseppe
openaire +2 more sources
Software: Practice and Experience, 1974
AbstractThe PFORT Verifier is a program which checks a FORTRAN program (i.e. a main program and a set of subprograms) for adherence to a large, carefully defined, portable subset of American National Standard FORTRAN called PFORT. Unlike many FORTRAN implementations, the Verifier diagnoses errors in interprogram‐unit communication through argument ...
openaire +1 more source
AbstractThe PFORT Verifier is a program which checks a FORTRAN program (i.e. a main program and a set of subprograms) for adherence to a large, carefully defined, portable subset of American National Standard FORTRAN called PFORT. Unlike many FORTRAN implementations, the Verifier diagnoses errors in interprogram‐unit communication through argument ...
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
Journal of the ACM, 1976
It is shown that specifications of program performance can be formally verified. Formal verification techniques, in particular, the method of inductive assertions, can be adapted to show that a program's maximum or mean execution time is correctly described by specifications supplied with the program.
openaire +2 more sources
It is shown that specifications of program performance can be formally verified. Formal verification techniques, in particular, the method of inductive assertions, can be adapted to show that a program's maximum or mean execution time is correctly described by specifications supplied with the program.
openaire +2 more sources
VeriFL: Communication-Efficient and Fast Verifiable Aggregation for Federated Learning
IEEE Transactions on Information Forensics and Security, 2021Xiaojie Guo, Zheli Liu, Jin Li
exaly
SVeriFL: Successive verifiable federated learning with privacy-preserving
Information Sciences, 2023Tiegang Gao
exaly