Sciweavers

225 search results - page 26 / 45
» Cluster-Based LTL Model Checking of Large Systems
Sort
View
KBSE
2005
IEEE
14 years 2 months ago
Learning to verify branching time properties
We present a new model checking algorithm for verifying computation tree logic (CTL) properties. Our technique is based on using language inference to learn the fixpoints necessar...
Abhay Vardhan, Mahesh Viswanathan
CASSIS
2004
Springer
14 years 2 months ago
Modelling Mobility Aspects of Security Policies
Security policies are rules that constrain the behaviour of a system. Different, largely unrelated sets of rules typically govern the physical and logical worlds. However, increa...
Pieter H. Hartel, Pascal van Eck, Sandro Etalle, R...
STTT
2008
86views more  STTT 2008»
13 years 8 months ago
Properties of state spaces and their applications
Explicit model checking algorithms explore the full state space of a system. State spaces are usually treated as directed graphs without any specific features. We gather a large co...
Radek Pelánek
TACAS
2000
Springer
151views Algorithms» more  TACAS 2000»
14 years 8 days ago
Salsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking
Salsa is an invariant checker for speci cations in SAL the SCR Abstract Language. To establish a formula as an invariant without any user guidance Salsa carries out an induction pr...
Ramesh Bharadwaj, Steve Sims
ICAC
2009
IEEE
14 years 3 months ago
Ranking the importance of alerts for problem determination in large computer systems
The complexity of large computer systems has raised unprecedented challenges for system management. In practice, operators often collect large volume of monitoring data from system...
Guofei Jiang, Haifeng Chen, Kenji Yoshihira, Akhil...