96 search results - page 6 / 20 » On Several Proofs of the Recognizability Theorem |
SIGCSE
1999
ACM
15 years 1 months ago
1999
ACM
An automata theory course can be taught in an interactive, hands-on manner using a computer. At Duke we have been using the software tool JFLAP to provide interaction and feedback...
POPL
2012
ACM
13 years 5 months ago
2012
ACM
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
IJCAI
2003
14 years 11 months ago
2003
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
120
click to vote
MKM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Formal verification of numerical programs is notoriously difficult. On the one hand, there exist automatic tools specialized in floatingpoint arithmetic, such as Gappa...