3424 search results - page 357 / 685 » Automated Testing of Classes |
147
click to vote
LICS
2007
IEEE
16 years 28 days ago
2007
IEEE
We show that tree-like (Gentzen’s calculus) PK where all cut formulas have depth at most a constant d does not simulate cut-free PK. Generally, we exhibit a family of sequents t...
179
click to vote
SCAM
2007
IEEE
16 years 28 days ago
2007
IEEE
This paper presents an implementation of the “form template method” refactoring. This transformation has not been automated yet, but has many similarities with other transform...
173
click to vote
TPHOL
2007
IEEE
16 years 28 days ago
2007
IEEE
Abstract. Interactive proof assistants should verify the proofs they receive from automatic theorem provers. Normally this proof reconstruction takes place internally, forming part...
170
click to vote
CSL
2007
Springer
16 years 25 days ago
2007
Springer
We define regular expressions for unranked trees (actually, ordered sequences of unranked trees, called forests). These are compared to existing regular expressions for trees. On ...
196
click to vote
CSL
2007
Springer
16 years 25 days ago
2007
Springer
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...