7988 search results - page 8 / 1598 » A Useful Undecidable Theory |
130
click to vote
CADE
2007
Springer
16 years 6 hour ago
2007
Springer
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
176
click to vote
POPL
2003
ACM
16 years 7 hour ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
110
click to vote
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
In Twenty Problems in the Theory of Cellular Automata, Stephen Wolfram asks “how common computational universality and undecidability [are] in cellular automata.” This papers p...
116
Voted
CSL
2007
Springer
15 years 3 months ago
2007
Springer
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
120
click to vote
TRIER
2002
14 years 11 months ago
2002
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs w...