Having fun with Programming
Monday, May 16, 2016
Symbolic executions
Symbolic Execution Tutorial
Symbolic Execution for Software Testing: Three Decades Later
Monday, May 9, 2016
Graph logics
The paper
Simulate transitive closure using FO logic
uses first-order theorem provers to prove transitive closures of certain binary predicates.
Courcelle's theorem
Newer Posts
Older Posts
Home
Subscribe to:
Posts (Atom)