Sciweavers

2137 search results - page 54 / 428
» Proving Abstract Non-interference
Sort
View
DLOG
2010
14 years 8 months ago
Paraconsistent Description Logics Revisited
Abstract. Inconsistency handling is of growing importance in Knowledge Representation since inconsistencies may frequently occur in an open world. Paraconsistent (or inconsistency-...
Norihiro Kamide
CADE
2008
Springer
15 years 10 months ago
On Automating the Calculus of Relations
Relation algebras provide abstract equational axioms for the calculus of binary relations. They name an established area of mathematics with various applications in computer scienc...
Georg Struth, Peter Höfner
CADE
2007
Springer
15 years 10 months ago
A Termination Checker for Isabelle Hoare Logic
Abstract. Hoare logic is widely used for software specification and verification. Frequently we need to prove the total correctness of a program: to prove that the program not only...
Jia Meng, Lawrence C. Paulson, Gerwin Klein
CADE
2006
Springer
15 years 10 months ago
Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems
Abstract. Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far i...
Adam Koprowski, Hans Zantema
ISW
2007
Springer
15 years 4 months ago
Specifying Imperative Data Obfuscations
Abstract. An obfuscation aims to transform a program, without affecting the functionality, so that some secret information within the program can be hidden for as long as possible...
Stephen Drape, Clark D. Thomborson, Anirban Majumd...