Sciweavers

40 search results - page 7 / 8
» Partial Order Reductions for Bisimulation Checking
Sort
View
COMPSEC
2010
146views more  COMPSEC 2010»
13 years 5 months ago
An intruder model with message inspection for model checking security protocols
Model checking security protocols is based on an intruder model that represents the eavesdropping or interception of the exchanged messages, while at the same time performs attack...
Stylianos Basagiannis, Panagiotis Katsaros, Andrew...
PPOPP
2009
ACM
14 years 6 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...
CAV
2008
Springer
113views Hardware» more  CAV 2008»
13 years 7 months ago
Producing Short Counterexamples Using "Crucial Events"
Ideally, a model checking tool should successfully tackle state space explosion for complete system validation, while providing short counterexamples when an error exists. Techniqu...
Sujatha Kashyap, Vijay K. Garg
SEFM
2009
IEEE
14 years 15 days ago
Right Propositional Neighborhood Logic over Natural Numbers with Integer Constraints for Interval Lengths
Interval temporal logics are based on interval structures over linearly (or partially) ordered domains, where time intervals, rather than time instants, are the primitive ontologi...
Davide Bresolin, Valentin Goranko, Angelo Montanar...
SIGSOFT
2009
ACM
14 years 6 months ago
Symbolic pruning of concurrent program executions
We propose a new algorithm for verifying concurrent programs, which uses concrete executions to partition the program into a set of lean partitions called concurrent trace program...
Chao Wang, Swarat Chaudhuri, Aarti Gupta, Yu Yang