Results 261 to 270 of about 37,961 (305)
Some of the next articles are maybe not open access.
Verified compilation on a verified processor
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019Developing technology for building verified stacks, i.e., computer systems with comprehensive proofs of correctness, is one way the science of programming languages furthers the computing discipline. While there have been successful projects verifying complex, realistic system components, including compilers (software) and processors (hardware), to ...
Andreas Lööw +6 more
openaire +1 more source
To Verify or Not to Verify, That is The Question
Proceedings of the Human Factors and Ergonomics Society Annual Meeting, 2014Recently developed secure, end-to-end voting systems are designed to allow voters to confidentially verify on the internet that their ballot selections are cast and counted correctly. In response, this research paper characterizes both voters’ desire to actually use vote verification methods and the format of verification that users expected.
Claudia Ziegler Acemyan, Philip Kortum
openaire +1 more source
A verified staged interpreter is a verified compiler
Proceedings of the 5th international conference on Generative programming and component engineering, 2006Dependent types and multi-stage programming have both been used, separately, in programming language design and implementation. Each technique has its own advantages --- with dependent types, we can verify aspects of interpreters and compilers such as type safety and stack invariants. Multi-stage programming, on the other hand, can give the implementor
Edwin C. Brady, Kevin Hammond
openaire +1 more source
2021
Civl is a static verifier for concurrent programs designed around the conceptual framework of layered refinement, which views the task of verifying a program as a sequence of program simplification steps each justified by its own invariant. Civl verifies a layered concurrent program that compactly expresses all the programs in this sequence and the ...
Bernhard Kragl, Shaz Qadeer
openaire +1 more source
Civl is a static verifier for concurrent programs designed around the conceptual framework of layered refinement, which views the task of verifying a program as a sequence of program simplification steps each justified by its own invariant. Civl verifies a layered concurrent program that compactly expresses all the programs in this sequence and the ...
Bernhard Kragl, Shaz Qadeer
openaire +1 more source
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
Verifiability and strong verifiability
Journal of Mathematical Sciences, 1994See the review in Zbl 0742.62022.
openaire +2 more sources
To Verify or Not to Verify — That is the Question
Noise & Vibration Worldwide, 2001Ian Campbell reports on the meeting of the Institute of Acoustic's Measurement and Instrumentation Group, held in London on February 14.
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
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
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