Sciweavers

109 search results - page 12 / 22
» Invariants and state in testing and formal methods
Sort
View
KBSE
2000
IEEE
13 years 12 months ago
Model Checking Programs
The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it eas...
Willem Visser, Klaus Havelund, Guillaume P. Brat, ...
CAV
2007
Springer
118views Hardware» more  CAV 2007»
14 years 1 months ago
Local Proofs for Global Safety Properties
This paper explores the concept of locality in proofs of global safety properties of asynchronously composed, multi-process programs. Model checking on the full state space is ofte...
Ariel Cohen 0002, Kedar S. Namjoshi
JSS
2002
101views more  JSS 2002»
13 years 7 months ago
Software requirements validation via task analysis
As a baseline for software development, a correct and complete requirements definition is one foundation of software quality. Previously, a novel approach to static testing of sof...
Hong Zhu, Lingzi Jin, Dan Diaper, Ganghong Bai
FMCAD
2008
Springer
13 years 9 months ago
Optimal Constraint-Preserving Netlist Simplification
Abstract-- We consider the problem of optimal netlist simplification in the presence of constraints. Because constraints restrict the reachable states of a netlist, they may enhanc...
Jason Baumgartner, Hari Mony, Adnan Aziz
MSWIM
2006
ACM
14 years 1 months ago
Testing methodology for an ad hoc routing protocol
In this paper, we define a model of an ad hoc routing protocol, i.e. the OLSR (Optimized Link-State Routing) protocol. This model handles novel constraints related to such networ...
Stéphane Maag, Fatiha Zaïdi