213 search results - page 40 / 43 » Automated Termination Analysis for Logic Programs with Cut |
276
click to vote
POPL
2007
ACM
16 years 6 months ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
149
Voted
ICLP
2005
Springer
15 years 11 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
156
click to vote
CSFW
2004
IEEE
15 years 9 months ago
2004
IEEE
Non-interference is a high-level security property that guarantees the absence of illicit information leakages through executing programs. More precisely, non-interference for a p...
211
click to vote
CI
2000
15 years 5 months ago
2000
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
133
click to vote
DAC
2005
ACM
16 years 6 months ago
2005
ACM
We describe IODINE, a tool to automatically extract likely design properties using dynamic analysis. A practical bottleneck in the formal verification of hardware designs is the n...