2137 search results - page 79 / 428 » Proving Abstract Non-interference |
102
Voted
ICLP
1997
Springer
15 years 2 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
CADE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equ...
CADE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...
105
Voted
CADE
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Skepticism is one of the most important semantic intuitions in artificial intelligence. The semantics formalizing skeptical reasoning in (disjunctive) logic programming i...
65
Voted
STACS
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neigh...