Results 311 to 320 of about 3,157,454 (357)
Some of the next articles are maybe not open access.
Design Automation for Field-coupled Nanotechnologies, 2021
Marcel Walter +3 more
semanticscholar +2 more sources
Marcel Walter +3 more
semanticscholar +2 more sources
2005
These lecture notes present a set of techniques for the verification of reactive systems. We concentrate on the case of infinite-states systems and the application of abstraction methods for their verification.
openaire +2 more sources
These lecture notes present a set of techniques for the verification of reactive systems. We concentrate on the case of infinite-states systems and the application of abstraction methods for their verification.
openaire +2 more sources
Formal Verification and Debugging
2010This chapter introduces approaches for formal verification and debugging and therewith completes the proposed approaches towards a design flow for reversible logic. Verification is an essential step that ensures whether obtained designs in fact realize the desired functionality or not.
Rolf Drechsler, Robert Wille
openaire +2 more sources
ACM SIGDA Newsletter, 2005
Formal verification is the use of mathematical techniques to ensure that a design conforms to some precisely expressed notion of functional correctness. Concretely, assume that you have (1) a model of a design, (2) some description of the environment that the design is supposed to operate in, and (3) some properties that the design is intended to ...
openaire +2 more sources
Formal verification is the use of mathematical techniques to ensure that a design conforms to some precisely expressed notion of functional correctness. Concretely, assume that you have (1) a model of a design, (2) some description of the environment that the design is supposed to operate in, and (3) some properties that the design is intended to ...
openaire +2 more sources
Formal verification of parallel programs
Communications of the ACM, 1976Two formal models for parallel computation are presented: an abstract conceptual model and a parallel-program model. The former model does not distinguish between control and data states. The latter model includes the capability for the representation of an infinite set of control states by allowing there to be arbitrarily many instruction pointers (or
openaire +2 more sources
Formal verification of an optimizing compiler
2007 5th IEEE/ACM International Conference on Formal Methods and Models for Codesign (MEMOCODE 2007), 2007Programmers naturally expect that compilers and other code generation tools produce executable code that behaves as prescribed by source programs. However, compilers are complex programs that perform many subtle transformations. Bugs in compilers do happen and can lead to silently producing incorrect executable code from a correct source program.
openaire +3 more sources
Towards formal verification of IoT protocols: A Review
Comput. Networks, 2020Katharina Hofer-Schmitz +1 more
semanticscholar +1 more source
Simplifying Neural Networks Using Formal Verification
NASA Formal Methods, 2020S. Gokulanathan +4 more
semanticscholar +1 more source
Overview of Formal Verification
2010Formal verification of a computing system entails a mathematical proof showing that the system satisfies its desired property or specification. To do this, we must use some mathematical structure to model the system of interest and derive the desired properties of the system as theorems about the structure.
openaire +2 more sources
Formal Methods and Verification
1992Formal methods involve representing an implementation and a specification within a formal theory or calculus. Verification compares the representations within the formal theory, reasoning that under particular constraints the implementation ensures the specification is (or is not) met.
openaire +2 more sources