12774 search results - page 338 / 2555 » A Framework for Proof Systems |
219
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...
179
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...
173
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,...
221
click to vote
AGTIVE
2003
Springer
16 years 1 days ago
2003
Springer
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
182
click to vote
ICFP
2010
ACM
15 years 8 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...