3333 search results - page 143 / 667 » Abstract Proof Search |
108
click to vote
AIIA
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Efficiency of the first-order logic proof procedure is a major issue when deduction systems are to be used in real environments, both on their own and as a component of ...
138
click to vote
WOLLIC
2010
Springer
15 years 9 months ago
2010
Springer
Proof theoretic characterizations of complexity classes are of considerable interest because they link levels of conceptual abstraction to computational complexity. We consider he...
119
Voted
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
d abstract) Nathan Segerlind∗ Sam Buss† Russell Impagliazzo‡ We prove a new switching lemma that works for restrictions that set only a small fraction of the variables and i...
135
Voted
TPHOL
2002
IEEE
15 years 8 months ago
2002
IEEE
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
151
click to vote
CONCUR
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. A concurrent Kleene algebra offers, next to choice and iteration, operators for sequential and concurrent composition, related by an inequational form of the exchange la...