6978 search results - page 1129 / 1396 » On Proofs in System P |
194
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
215
click to vote
VMCAI
2010
Springer
16 years 4 months ago
2010
Springer
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
200
click to vote
ICS
2009
Tsinghua U.
16 years 1 months ago
2009
Tsinghua U.
“Is transactional memory useful?” is the question that cannot be answered until we provide substantial applications that can evaluate its capabilities. While existing TM appli...
175
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
169
click to vote
ICIW
2009
IEEE
16 years 1 months ago
2009
IEEE
Today’s cross-organizations are increasingly coordinating their capabilities in the quest of dynamically adaptable and thus highly competitive realistic services. Unfortunately,...