106 search results - page 13 / 22 » On Verifying Complex Properties using Symbolic Shape Analysi... |
107
Voted
ISORC
2005
IEEE
15 years 4 months ago
2005
IEEE
As complexity of real-time embedded software grows, it is desirable to use formal verification techniques to achieve a high level of assurance. We discuss application of model-ch...
IANDC
2008
14 years 11 months ago
2008
Automatic security protocol analysis is currently feasible only for small protocols. Since larger protocols quite often are composed of many small protocols, compositional analysi...
95
Voted
EACL
2003
ACL Anthology
15 years 8 days ago
2003
ACL Anthology
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
60
Voted
ICCAD
2005
IEEE
15 years 7 months ago
2005
IEEE
State-equivalence based reduction techniques, e.g. bisimulation minimization, can be used to reduce a state transition system to facilitate subsequent verification tasks. However...
122
Voted
POPL
2011
ACM
14 years 1 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...