Sciweavers

11 search results - page 2 / 3
» MDGs Reduction Technique Based on the HOL Theorem Prover
Sort
View
FMOODS
2007
13 years 9 months ago
A Mechanized Model of the Theory of Objects
In this paper we present a formalization of Abadi’s and Cardelli’s theory of objects in the interactive theorem prover Isabelle/HOL. Our motivation is to build a mechanized HOL...
Ludovic Henrio, Florian Kammüller
MMMACNS
2005
Springer
14 years 1 months ago
A Modal Logic for Role-Based Access Control
Making correct access-control decisions is central to security, which in turn requires accounting correctly for the identity, credentials, roles, authority, and privileges of users...
Thumrongsak Kosiyatrakul, Susan Older, Shiu-Kai Ch...
RTA
2010
Springer
13 years 11 months ago
Certified Subterm Criterion and Certified Usable Rules
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...
Christian Sternagel, René Thiemann
SAT
2010
Springer
125views Hardware» more  SAT 2010»
13 years 11 months ago
Two Techniques for Minimizing Resolution Proofs
Some SAT-solvers are equipped with the ability to produce resolution proofs for problems which are unsatisfiable. Such proofs are used in a variety of contexts, including finding...
Scott Cotton
POPL
2012
ACM
12 years 3 months ago
Playing in the grey area of proofs
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
Krystof Hoder, Laura Kovács, Andrei Voronko...