Sciweavers

105 search results - page 9 / 21
» Dynamic Partial Order Reduction Using Probe Sets
Sort
View
PPOPP
2009
ACM
14 years 7 months ago
Formal verification of practical MPI programs
This paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our app...
Anh Vo, Sarvani S. Vakkalanka, Michael Delisi, Gan...
CSMR
1999
IEEE
13 years 11 months ago
Employing Use-cases and Domain Knowledge for Comprehending Resource Usage
Philips Electronics is a world wide electronics company that develops many products containing embedded software. These products range from shavers with only few hundred bytes of ...
René L. Krikhaar, Maarten Pennings, J. Zonn...
IJCAI
2007
13 years 8 months ago
Memory-Bounded Dynamic Programming for DEC-POMDPs
Decentralized decision making under uncertainty has been shown to be intractable when each agent has different partial information about the domain. Thus, improving the applicabil...
Sven Seuken, Shlomo Zilberstein
ECIS
2000
13 years 8 months ago
Security and Productivity Improvements - Sufficient for the Success of Secure Electronic Transaction?
Online payments in business-to-consumer electronic commerce are mainly made with credit cards. Fraud and chargebacks are a significant issue for merchants and payment card brands, ...
Michael Fritscher, Oliver Kump
KBSE
2007
IEEE
14 years 1 months ago
Testing concurrent programs using value schedules
Concurrent programs are difficult to debug and verify because of the nondeterministic nature of concurrent executions. A particular concurrency-related bug may only show up under ...
Jun Chen, Steve MacDonald