Andrey Rybalchenko
Program verification as constraint solving (also for existential and universal CTL properties)
Program verification as constraint solving (also for existential and universal CTL properties)
Joint work with Tudor Jebelean (RISC, Austria) and Hoon Hong (NCSU, USA)
Fast Routing Table Construction Using Small Messages

Graph Logics and Relations on Words

MemCAD, a Modular Abstract Domain for Reasoning on Memory States
September 4th, 2012