2000 search results - page 161 / 400 » Program Transformation and Proof Transformation |
121
Voted
ECCC
2010
15 years 3 months ago
2010
The IP theorem, which asserts that IP = PSPACE (Lund et. al., and Shamir, in J. ACM 39(4)), is one of the major achievements of complexity theory. The known proofs of the theorem ...
141
click to vote
AIML
2008
15 years 5 months ago
2008
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...
157
Voted
LICS
2008
IEEE
15 years 10 months ago
2008
IEEE
We introduce a systematic procedure to transform large classes of (Hilbert) axioms into equivalent inference rules in sequent and hypersequent calculi. This allows for the automat...
128
Voted
CL
2000
Springer
15 years 7 months ago
2000
Springer
We use Kleene algebra with tests to verify a wide assortment of common compiler optimizations, including dead code elimination, common subexpression elimination, copy propagation,...
116
Voted
CAGD
2006
15 years 3 months ago
2006
We identify a class of monomial supports that are inherently improper because any surface rational parametrization defined on them is improper. A surface support is inherently imp...