397 search results - page 62 / 80 » Optimizing Modular Logic Languages |
ECOOP
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. Automatic program specialization can derive efficient implementations from generic components, thus reconciling the often opposing goals of genericity and efficiency. Thi...
184
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
DOLAP
2007
ACM
15 years 1 months ago
2007
ACM
ss domain. Using this more abstract approach means that more data sources of varying types can be incorporated with less effort, and such heterogeneous data sources might be very r...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The goal of this lecture is to show how modern theorem provers--in this case, the Coq proof assistant--can be used to mechanize the specification of programming languages and their...
CADE
2007
Springer
15 years 10 months ago
2007
Springer
We present results of our work on using first order theorem proving to reason over a large ontology (the Suggested Upper Merged Ontology ? SUMO), and methods for making SUMO suita...