284 search results - page 25 / 57 » On Reversible Combinatory Logic |
IOR
2006
13 years 9 months ago
2006
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
EUROSYS
2010
ACM
14 years 7 months ago
2010
ACM
This paper presents a technique that helps automate the reverse engineering of device drivers. It takes a closed-source binary driver, automatically reverse engineers the driverā...
ITP
2010
14 years 1 months ago
2010
We present a formalisation of separation logic which, by avoiding the use of existential quantiļ¬ers, allows proofs that only use standard equational rewriting methods as found in...
TOCL
2002
13 years 9 months ago
2002
One important class of spatial database queries is the class of topological queries, that is, queries invariant under homeomorphisms. Westudy topological queries expressible in th...
STEP
2005
IEEE
14 years 3 months ago
2005
IEEE
The decomposition of design patterns into simpler elements may reduce significantly the creation of variants in forward engineering, while it increases the possibility of identify...