ion/refinement solvers1 Andreas Bauer , Martin Leucker , Christian Schallhart , Michael Tautschnig Computer Sciences Laboratory, Australian National University Institut f
Andreas Bauer 0002, Martin Leucker, Christian Scha...
The Traveling Tournament Problem (TTP) [E. Easton, G. Nemhauser, M. Trick, The traveling tournament problem description and benchmarks, in: Proceedings of the 7th International Co...
The HM(X) framework is a constraint-based type framework with built-in letpolymorphism. This paper establishes purely syntactic type soundness for the framework, treating an exten...
Recent advances in mechanical techniques for systematic testing have increased our ability to automatically find subtle bugs, and hence to deploy more dependable software. This pap...
Finding point correspondences which are consistent with a geometric constraint is one of the cornerstones of many computer vision problems. This is a difficult task because of sp...