Sciweavers

554 search results - page 13 / 111
» Verifying Security Protocols Modelled by Networks of Automat...
Sort
View
FM
2009
Springer
146views Formal Methods» more  FM 2009»
15 years 2 months ago
Verifying Real-Time Systems against Scenario-Based Requirements
Abstract. We propose an approach to automatic verification of realtime systems against scenario-based requirements. A real-time system is modeled as a network of Timed Automata (TA...
Kim Guldstrand Larsen, Shuhao Li, Brian Nielsen, S...
FORMATS
2004
Springer
15 years 10 months ago
Bounded Model Checking for Region Automata
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this reg...
Fang Yu, Bow-Yaw Wang, Yao-Wen Huang
IJFCS
2006
110views more  IJFCS 2006»
15 years 5 months ago
Sat-based Model Checking for Region Automata
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this re...
Fang Yu, Bow-Yaw Wang
129
Voted
ICUMT
2009
15 years 2 months ago
A syntactic approach for identifying multi-protocol attacks
In the context of multiple security protocols running in the same environment, we propose a syntactical approach for identifying multi-protocol attacks. The proposed approach uses ...
Béla Genge, Piroska Haller
IFIP
2010
Springer
14 years 11 months ago
Reasoning about Probabilistic Security Using Task-PIOAs
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
Aaron D. Jaggard, Catherine Meadows, Michael Mislo...