3552 search results - page 100 / 711 » Proof theory in the abstract |
237
click to vote
IFL
2007
Springer
16 years 14 days ago
2007
Springer
Abstract. The specification and resolution of non-trivial domain constraints has become a well-recognised measure for improving the stability of large software systems. In this pa...
207
click to vote
AIML
2008
15 years 7 months ago
2008
abstract. We investigate an alternative presentation of classical and positive modal logic where the coalgebraic cover modality is taken as primitive. For each logic, we present a ...
193
click to vote
CAV
2012
Springer
13 years 8 months ago
2012
Springer
Abstract. In earlier work, we developed a technique to prove termination of Java programs automatically: first, Java programs are automatically transformed to term rewrite systems...
151
click to vote
SIGCSE
1999
ACM
15 years 10 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...
144
click to vote
MFCS
1993
Springer
15 years 10 months ago
1993
Springer
We present the different constructive definitions of real number that can be found in the literature. Using domain theory we analyse the notion of computability that is substant...