{"id":337016,"date":"2016-12-15T10:46:00","date_gmt":"2016-12-15T18:46:00","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/?post_type=msr-research-item&p=337016"},"modified":"2018-10-16T20:14:20","modified_gmt":"2018-10-17T03:14:20","slug":"assertion-checking-unified-2","status":"publish","type":"msr-research-item","link":"https:\/\/www.microsoft.com\/en-us\/research\/publication\/assertion-checking-unified-2\/","title":{"rendered":"Assertion Checking Unified"},"content":{"rendered":"

We revisit the connection between equality assertion checking in programs and unification. Using a general formalization of this connection, we establish interesting connections between the complexity of assertion checking in programs and unification theory of the underlying program expressions. In particular, we show that assertion checking is:<\/p>\n