551 search results - page 49 / 111 » {log}: A Logic Programming Language with Finite Sets |
MFCS
1998
Springer
14 years 8 days ago
1998
Springer
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
POPL
2007
ACM
14 years 8 months ago
2007
ACM
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
In planning as well as in other areas, temporal logic has been used to specify so-called temporally extended goals. Temporally extended goals refer to desirable sequences of state...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
ICFP
2012
ACM
11 years 10 months ago
2012
ACM
In the static analysis of functional programs, pushdown flow analabstract garbage collection skirt just inside the boundaries of soundness and decidability. Alone, each method re...