Sciweavers

819 search results - page 9 / 164
» Using Assumptions to Distribute CTL Model Checking
Sort
View
80
Voted
EUROMICRO
2000
IEEE
15 years 4 months ago
Formal Coverification of Embedded Systems Using Model Checking
The complexity of embedded systems is increasing rapidly. In consequence, new verification techniques that overcome the limitations of traditional methods and are suitable for har...
Luis Alejandro Cortés, Petru Eles, Zebo Pen...
123
Voted
KDD
2012
ACM
217views Data Mining» more  KDD 2012»
13 years 2 months ago
Cross-domain collaboration recommendation
Interdisciplinary collaborations have generated huge impact to society. However, it is often hard for researchers to establish such cross-domain collaborations. What are the patte...
Jie Tang, Sen Wu, Jimeng Sun, Hang Su
ENTCS
2006
173views more  ENTCS 2006»
15 years 14 days ago
Concurrent LSC Verification: On Decomposition Properties of Partially Ordered Symbolic Automata
Partially Ordered Symbolic Automata (POSAs) are used as the semantical foundation of visual formalisms like the scenario based language of Live Sequence Charts (LSCs). To check whe...
Tobe Toben, Bernd Westphal
141
Voted
SACMAT
2009
ACM
15 years 7 months ago
Towards formal security analysis of GTRBAC using timed automata
An access control system is often viewed as a state transition system. Given a set of access control policies, a general safety requirement in such a system is to determine whethe...
Samrat Mondal, Shamik Sural, Vijayalakshmi Atluri
CONCUR
1999
Springer
15 years 4 months ago
Robust Satisfaction
In order to check whether an open system satisfies a desired property, we need to check the behavior of the system with respect to an arbitrary environment. In the most general se...
Orna Kupferman, Moshe Y. Vardi