Sciweavers

244 search results - page 40 / 49
» Counterexamples in Probabilistic Model Checking
Sort
View
IJNSEC
2008
190views more  IJNSEC 2008»
13 years 7 months ago
Probabilistic Analysis and Verification of the ASW Protocol using PRISM
The ASW protocol is one of the prominent optimistic fair exchange protocols that is used for contract signing between two participants, the originator and the responder, with the ...
Salekul Islam, Mohammad Abu Zaid
KBSE
1999
IEEE
13 years 11 months ago
Modular and Incremental Analysis of Concurrent Software Systems
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...
Hassen Saïdi
FASE
2009
Springer
13 years 11 months ago
Interface Generation and Compositional Verification in JavaPathfinder
Abstract. We present a novel algorithm for interface generation of software components. Given a component, our algorithm uses learning techniques to compute a permissive interface ...
Dimitra Giannakopoulou, Corina S. Pasareanu
ENTCS
2008
101views more  ENTCS 2008»
13 years 7 months ago
Improving Fault-based Conformance Testing
Fault-based conformance testing is a conformance testing strategy that relies on specific fault models. Previously, this mutation testing technique has been applied to protocol spe...
Bernhard K. Aichernig, Martin Weiglhofer, Franz Wo...
VLSID
2010
IEEE
155views VLSI» more  VLSID 2010»
13 years 5 months ago
Synchronized Generation of Directed Tests Using Satisfiability Solving
Directed test generation is important for the functional verification of complex system-on-chip designs. SAT based bounded model checking is promising for counterexample generatio...
Xiaoke Qin, Mingsong Chen, Prabhat Mishra