Sciweavers

145 search results - page 9 / 29
» The use of random simulation in formal verification
Sort
View
JCST
2010
189views more  JCST 2010»
13 years 2 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
DATE
2008
IEEE
113views Hardware» more  DATE 2008»
14 years 2 months ago
Random Stimulus Generation using Entropy and XOR Constraints
Despite the growing research effort in formal verification, constraint-based random simulation remains an integral part of design validation, especially for large design componen...
Stephen Plaza, Igor L. Markov, Valeria Bertacco
SAFECOMP
1998
Springer
13 years 11 months ago
Safety Verification of Software Using Structured Petri Nets
A method is described for the analysis and the verification of safety in software systems. The method offers a formal notation for describing the software structure, the means for ...
Krzysztof Sacha
ICFEM
2009
Springer
13 years 5 months ago
Verifying Ptolemy II Discrete-Event Models Using Real-Time Maude
Abstract. This paper shows how Ptolemy II discrete-event (DE) models can be formally analyzed using Real-Time Maude. We formalize in Real-Time Maude the semantics of a subset of hi...
Kyungmin Bae, Peter Csaba Ölveczky, Thomas Hu...
DAC
2008
ACM
14 years 8 months ago
Construction of concrete verification models from C++
C++ based verification methodologies are now emerging as the preferred method for SOC design. However most of the verification involving the C++ models are simulation based. The c...
Malay Haldar, Gagandeep Singh, Saurabh Prabhakar, ...