Sciweavers

446 search results - page 42 / 90
» A Theorem Prover for a Computational Logic
Sort
View
TKDE
2008
177views more  TKDE 2008»
14 years 9 months ago
Analyzing and Managing Role-Based Access Control Policies
Today more and more security-relevant data is stored on computer systems; security-critical business processes are mapped to their digital counterparts. This situation applies to ...
Karsten Sohr, Michael Drouineaud, Gail-Joon Ahn, M...
CCA
2009
Springer
15 years 1 months ago
Effective Choice and Boundedness Principles in Computable Analysis
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...
Vasco Brattka, Guido Gherardi
IGPL
1998
97views more  IGPL 1998»
14 years 9 months ago
Towards Structurally-Free Theorem Proving
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
Marcelo Finger
JAR
2008
98views more  JAR 2008»
14 years 9 months ago
A Mechanical Analysis of Program Verification Strategies
We analyze three proof strategies commonly used in deductive verification of deterministic sequential programs formalized with operational semantics. The strategies are: (i) stepw...
Sandip Ray, Warren A. Hunt Jr., John Matthews, J. ...
TPHOL
2005
IEEE
15 years 3 months ago
From PSL to LTL: A Formal Validation in HOL
Using the HOL theorem prover, we proved the correctness of a translation from a subset of Accellera’s property specification language PSL to linear temporal logic LTL. Moreover,...
Thomas Tuerk, Klaus Schneider