1948 search results - page 359 / 390 » Formalizing Mirror Theory |
POPL
2006
ACM
14 years 10 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
POPL
2004
ACM
14 years 10 months ago
2004
ACM
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
POPL
2004
ACM
14 years 10 months ago
2004
ACM
Ensuring the correctness of multithreaded programs is difficult, due to the potential for unexpected interactions between concurrent threads. Much previous work has focused on det...
CADE
2005
Springer
14 years 10 months ago
2005
Springer
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
SIGMOD
2009
ACM
14 years 10 months ago
2009
ACM
Research has investigated mappings among data sources under two perspectives. On one side, there are studies of practical tools for schema mapping generation; these focus on algor...