933 search results - page 167 / 187 » Fully automatic cross-associations |
111
click to vote
CADE
2005
Springer
16 years 2 days 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...
108
click to vote
CADE
2005
Springer
16 years 2 days ago
2005
Springer
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
ICSE
2007
IEEE-ACM
15 years 12 months ago
2007
IEEE-ACM
Type safety and expressiveness of many existing Java libraries and their client applications would improve, if the libraries were upgraded to define generic classes. Efficient and...
MOBISYS
2006
ACM
15 years 11 months ago
2006
ACM
We introduce a novel infrastructure supporting automatic updates for dynamic content browsing on resource constrained mobile devices. Currently, the client is forced to continuous...
107
click to vote
TPHOL
2009
IEEE
15 years 6 months ago
2009
IEEE
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...