Sciweavers

276 search results - page 16 / 56
» Dynamic Path Reduction for Software Model Checking
Sort
View
DAC
2006
ACM
16 years 1 months ago
Early cutpoint insertion for high-level software vs. RTL formal combinational equivalence verification
Ever-growing complexity is forcing design to move above RTL. For example, golden functional models are being written as clearly as possible in software and not optimized or intend...
Xiushan Feng, Alan J. Hu
101
Voted
PVM
2007
Springer
15 years 6 months ago
Practical Model-Checking Method for Verifying Correctness of MPI Programs
Formal program verification often requires creating a model of the program and running it through a model-checking tool. However, this model-creation step is itself error prone, t...
Salman Pervez, Ganesh Gopalakrishnan, Robert M. Ki...
191
Voted
POPL
2008
ACM
16 years 21 days ago
Proving non-termination
The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of...
Ashutosh Gupta, Thomas A. Henzinger, Rupak Majumda...
ECLIPSE
2006
ACM
15 years 4 months ago
A toolsuite for the verification of real-time systems in Eclipse
In this work we present an Eclipse plug-in for the VInTiMe (Verifier of INtegrated TImed ModEls)1 suite of tools that combines high-level expressive power, unassisted propertypres...
Lucía Cavatorta, Guido de Caso, André...
97
Voted
FM
2005
Springer
112views Formal Methods» more  FM 2005»
15 years 6 months ago
Dynamic Component Substitutability Analysis
This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniq...
Natasha Sharygina, Sagar Chaki, Edmund M. Clarke, ...