Sciweavers

33 search results - page 2 / 7
» A Methodology for the Formal Verification of FFT Algorithms ...
Sort
View
FMCAD
2004
Springer
13 years 11 months ago
A Partitioning Methodology for BDD-Based Verification
The main challenge in BDD-based verification is dealing with the memory explosion problem during reachability analysis. In this paper we advocate a methodology to handle this probl...
Debashis Sahoo, Subramanian K. Iyer, Jawahar Jain,...
FMSD
2002
114views more  FMSD 2002»
13 years 7 months ago
The Correctness of the Fast Fourier Transform: A Structured Proof in ACL2
The powerlists data structure, created by Misra in the early 90s, is well suited to express recursive, data-parallel algorithms. Misra has shown how powerlists can be used to give ...
Ruben Gamboa
HF
2007
131views more  HF 2007»
13 years 7 months ago
Formal Analysis and Automatic Generation of User Interfaces: Approach, Methodology, and an Algorithm
In this paper we propose a formal approach and methodology for analysis and generation of human-machine interfaces, with special emphasis on human-automation interaction. Our appr...
Michael Heymann, Asaf Degani
CHARME
2003
Springer
97views Hardware» more  CHARME 2003»
13 years 11 months ago
Coverage Metrics for Formal Verification
In formal verification, we verify that a system is correct with respect to a specification. Even when the system is proven to be correct, there is still a question of how complete ...
Hana Chockler, Orna Kupferman, Moshe Y. Vardi
FSTTCS
2000
Springer
13 years 11 months ago
Formal Verification of the Ricart-Agrawala Algorithm
Abstract. This paper presents the first formal verification of the RicartAgrawala algorithm [RA81] for distributed mutual exclusion of an arbitrary number of nodes. It uses the Tem...
Ekaterina Sedletsky, Amir Pnueli, Mordechai Ben-Ar...