A major development in qualitative model checking was the jump to verifying properties of source code directly, rather than requiring a separately specified model. We describe an...
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
: An Extended Abstract Alwen Tiu Computer Sciences Laboratory Australian National University Abstract. A notion of open bisimulation is formulated for the spi calculus, an extensio...
After informally reviewing the main concepts from game semantics and placing the development of the field in a historical context we examine its main applications. We focus in pa...