In the law, it is generally acknowledged that there are intuitive differences between reasoning with rules and reasoning with principles. For instance, a rule seems to lead directl...
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
Software engineers often inspect program differences when reviewing others' code changes, when writing check-in comments, or when determining why a program behaves differentl...
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...