Travelled to:
1 × Austria
2 × USA
Collaborated with:
G.Rosu A.Stefanescu S.Ciobaca R.K.Karmani P.Madhusudan L.Peña R.Mereuta T.Serbanuta
Talks about:
reachabl (2) logic (2) path (2) parallel (1) contract (1) coinduct (1) program (1) thread (1) verif (1) safe (1)
Person: Brandon M. Moore
DBLP: Moore:Brandon_M=
Contributed to:
Wrote 4 papers:
- RTA-TLCA-2014-StefanescuCMMSR #logic #reachability
- All-Path Reachability Logic (AS, SC, RM, BMM, TFS, GR), pp. 425–440.
- LICS-2013-RosuSCM #logic #reachability
- One-Path Reachability Logic (GR, AS, SC, BMM), pp. 358–367.
- PPoPP-2011-KarmaniMM #concurrent #contract #parallel #thread
- Thread contracts for safe parallelism (RKK, PM, BMM), pp. 125–134.
- ESOP-2018-MoorePR #induction #verification
- Program Verification by Coinduction (BMM, LP, GR), pp. 589–618.