Sciweavers

294 search results - page 15 / 59
» Formal Verification of the Implementability of Timing Requir...
Sort
View
CORR
2010
Springer
122views Education» more  CORR 2010»
13 years 7 months ago
Specifying Reusable Components
Reusable software components need well-defined interfaces, rigorously and completely documented features, and a design amenable both to reuse and to formal verification; all these...
Nadia Polikarpova, Carlo A. Furia, Bertrand Meyer
ACSD
2001
IEEE
74views Hardware» more  ACSD 2001»
13 years 11 months ago
From Code to Models
One of the corner stones of formal methods is the notion traction enables analysis. By the construction of act model we can trade implementation detail for analytical power. The i...
Gerard J. Holzmann
CJ
2004
93views more  CJ 2004»
13 years 7 months ago
An Architecture for Kernel-Level Verification of Executables at Run Time
Digital signatures have been proposed by several researchers as a way of preventing execution of malicious code. In this paper we propose a general architecture for performing the...
Luigi Catuogno, Ivan Visconti
ICCAD
2003
IEEE
115views Hardware» more  ICCAD 2003»
14 years 4 months ago
Efficient Verification of Hazard-Freedom in Gate-Level Timed Asynchronous Circuits
This paper presents an efficient method for verifying hazard freedom in timed asynchronous circuits. Timed circuits are a class of asynchronous circuits that utilize explicit tim...
Curtis A. Nelson, Chris J. Myers, Tomohiro Yoneda
EUROMICRO
2000
IEEE
13 years 11 months ago
Formal Coverification of Embedded Systems Using Model Checking
The complexity of embedded systems is increasing rapidly. In consequence, new verification techniques that overcome the limitations of traditional methods and are suitable for har...
Luis Alejandro Cortés, Petru Eles, Zebo Pen...