1274 search results - page 9 / 255 » New Proofs for |
BIRTHDAY
2004
Springer
14 years 27 days ago
2004
Springer
We present a new proof that languages generated by (non extended) H systems with finite sets of axioms and rules are regular.
IPL
2006
13 years 7 months ago
2006
In this paper, we propose a new proof method for strong normalization of calculi with control operators, and, by this method, we prove strong normalization of the system
COCO
2003
Springer
14 years 22 days ago
2003
Springer
A fruitful connection between algorithm design and proof complexity is the formalization of the ¤¦¥¨§©§ approach to satisfiability testing in terms of tree-like resolution...
IPL
2007
13 years 7 months ago
2007
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
FM
1997
Springer
13 years 11 months ago
1997
Springer
In this paper an extension of the IFAD VDM-SL Toolbox with a proof obligation generator is described. Static type checking in VDM is undecidable in general and therefore the type c...