Blogs (1) >>
POPL 2019
Sun 13 - Sat 19 January 2019 Cascais, Portugal
Mon 14 Jan 2019 12:00 - 12:30 at Sala III - Decision Procedures Chair(s): Kedar Namjoshi

This paper presents an algorithm for the structure embedding problem: given two finite first-order structures over a common relational vocabulary, does there exist an injective homomorphism from one to the other? The structure embedding problem is NP-complete in the general case, but for monadic structures (each predicate has arity <= 1) we observe that it can be solved in polytime by reduction to bipartite graph matching. Our algorithm, MatchEmbeds, extends the bipartite matching approach to the general case by using it as the foundation of a backtracking search procedure. We show that MatchEmbeds outperforms state-of-the-art SAT, CSP, and subgraph isomorphism solvers on difficult random instances and significantly improves the performance of a client model checker for multi-threaded programs.

A Practical Algorithm for Structure Embedding Slides (vmcai_2019_slides.pdf)5.27MiB

Mon 14 Jan
Times are displayed in time zone: (GMT+01:00) Greenwich Mean Time : Belfast change

11:00 - 12:30: VMCAI 2019 - Decision Procedures at Sala III
Chair(s): Kedar NamjoshiBell Labs, Nokia
VMCAI-201911:00 - 11:30
Jochen HoenickeUniversität Freiburg, Tanja SchindlerUniversity of Freiburg
VMCAI-201911:30 - 12:00
Xiaokang QiuPurdue University, Yanjun WangPurdue University
File Attached
VMCAI-201912:00 - 12:30
Charlie MurphyPrinceton University, Zachary KincaidPrinceton University
File Attached