518 search results - page 90 / 104 » Automating Proofs in Category Theory |
181
Voted
POPL
2005
ACM
16 years 1 days ago
2005
ACM
A lightweight logical approach to race-free sharing of heap storage between concurrent threads is described, based on the notion of permission to access. Transfer of permission be...
104
click to vote
PODS
2007
ACM
15 years 12 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
PEPM
2010
ACM
15 years 8 months ago
2010
ACM
PET is a prototype Partial Evaluation-based Test case generation tool for a subset of Java bytecode programs. It performs white-box test generation by means of two consecutive Par...
GECCO
2009
Springer
15 years 6 months ago
2009
Springer
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...
112
click to vote
COMPGEOM
2009
ACM
15 years 6 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...