5639 search results - page 54 / 1128 » Timed Abstract Non-interference |
ESOP
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. We study the notion of binding-time analysis for logic programs. We formalise the unfolding aspect of an on-line partial deduction s a Prolog program. Using abstract inte...
IAT
2009
IEEE
15 years 6 months ago
2009
IEEE
—We present the STORIES methods and tool for (a) an abstracted story representation from a collection of time-indexed documents; (b) visualising it in a way that encourages users...
109
click to vote
CAV
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. This paper develops a local reasoning method to check lineartime temporal properties of concurrent programs. In practice, it is often infeasible to model check over the p...
112
click to vote
TACAS
2010
Springer
14 years 9 months ago
2010
Springer
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
ANOR
2008
14 years 12 months ago
2008
Abstract We consider the following scheduling setting: a set of