1116 search results - page 207 / 224 » Applying Predicate Abstraction to Abstract State Machines |
IJCAI
2003
15 years 13 days ago
2003
An interpretation system finds the likely mappings from portions of an image to real-world objects. An interpretation policy specifies when to apply which imaging operator, to whi...
FAC
2007
14 years 11 months ago
2007
Abstract. We report on a case study in applying different formal methods to model and verify an architecture for administrating digital signatures. The architecture comprises seve...
INFOCOM
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract—Contending flows in multi-hop 802.11 wireless networks compete with two fundamental asymmetries: (i) channel asymmetry, in which one flow has a stronger signal, potent...
SIGSOFT
2003
ACM
15 years 11 months ago
2003
ACM
State machine based formalisms such as labelled transition systems (LTS) are generally assumed to be complete descriptions m behaviour at some level of abstraction: if a labelled ...
POPL
2010
ACM
15 years 8 months ago
2010
ACM
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...