Sciweavers

2137 search results - page 10 / 428
» Proving Abstract Non-interference
Sort
View
CHARME
1999
Springer
100views Hardware» more  CHARME 1999»
15 years 2 months ago
Xs are for Trajectory Evaluation, Booleans are for Theorem Proving
Abstract. This paper describes a semantic connection between the symbolic trajectory evaluation model-checking algorithm and relational verification in higher-order logic. We prov...
Mark Aagaard, Thomas F. Melham, John W. O'Leary
EPIA
1999
Springer
15 years 2 months ago
Critical Agents Supporting Interactive Theorem Proving
We introduce a resource adaptive agent mechanism which supports the user of an interactive theorem proving system. The mechanism, an extension of 5 , uses a two layered architectur...
Christoph Benzmüller, Volker Sorge
AI
2011
Springer
14 years 4 months ago
Instantiating abstract argumentation with classical logic arguments: Postulates and properties
ating Abstract Argumentation with Classical Logic Arguments: Postulates and Properties Nikos Gorogiannisa , Anthony Hunterb,∗ aDepartment of Computer Science, Queen Mary, Univers...
Nikos Gorogiannis, Anthony Hunter
LPAR
2012
Springer
13 years 5 months ago
Lazy Abstraction with Interpolants for Arrays
traction with Interpolants for Arrays Francesco Alberti1 , Roberto Bruttomesso2 , Silvio Ghilardi2 , Silvio Ranise3 , Natasha Sharygina1 1 Universit`a della Svizzera Italiana, Luga...
Francesco Alberti, Roberto Bruttomesso, Silvio Ghi...
FROCOS
2005
Springer
15 years 3 months ago
Proving Liveness with Fairness Using Rewriting
Abstract. In this paper we combine rewriting techniques with verification issues. More precisely, we show how techniques for proving relative termination of term rewrite systems (...
Adam Koprowski, Hans Zantema