3552 search results - page 217 / 711 » Proof theory in the abstract |
162
click to vote
AGP
1998
IEEE
15 years 10 months ago
1998
IEEE
It is important that practical data flow analysers are backed bly proven theoretical results. Abstract interpretation provides a sound mathematical framework and necessary generic ...
166
click to vote
TPLP
2002
15 years 6 months ago
2002
It is important that practical data-flow analyzers are backed by reliably proven theoretical Abstract interpretation provides a sound mathematical framework and necessary properti...
139
click to vote
CSL
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. It it shown that the first-order theory of an automatic structure, whose Gaifman graph has bounded degree, is decidable in doubly exponential space (for injective automa...
179
click to vote
SIGCSE
2009
ACM
16 years 1 months ago
2009
ACM
Jeannette Wing’s call for teaching Computational Thinking (CT) as a formative skill on par with reading, writing, and arithmetic places computer science in the category of basic...
192
click to vote
PPDP
2007
Springer
16 years 19 days ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...