17 search results - page 4 / 4 » The complexity of linear-time temporal logic over the class ... |
IANDC
2011
13 years 23 days ago
2011
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...
PLDI
2009
ACM
14 years 17 days ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...