231 search results - page 4 / 47 » Mu-calculus path checking |
IFIP
2010
Springer
13 years 2 months ago
2010
Springer
Concurrent software is difficult to verify. Because the thread schedule is not controlled by the application, testing may miss defects that occur under specific thread schedules. T...
OOPSLA
2010
Springer
13 years 5 months ago
2010
Springer
Glass box software model checking incorporates novel techniques to identify similarities in the state space of a model checker and safely prune large numbers of redundant states w...
CONCUR
2003
Springer
14 years 19 days ago
2003
Springer
We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This problem is at the heart of “runtime verification” ...
SEW
2006
IEEE
2006
IEEE
Model Checking of Software Components: Combining Java PathFinder and Behavior Protocol Model Checker
14 years 1 months ago
Although there exist several software model checkers that check the code against properties specified e.g. via a temporal logic and assertions, or just verifying low-level propert...
IFM
2009
Springer
14 years 1 months ago
2009
Springer
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...