Results 1  10
of
47
Enabling verification and conformance testing for access control model
 in Proc. of the 13th ACM Symp. on Access Control Models and Technologies
"... Verification and testing are the important step for software assurance. However, such crucial and yet challenging tasks have not been widely adopted in building access control systems. In this paper we propose a methodology to support automatic analysis and conformance testing for access control ..."
Abstract

Cited by 21 (11 self)
 Add to MetaCart
(Show Context)
Verification and testing are the important step for software assurance. However, such crucial and yet challenging tasks have not been widely adopted in building access control systems. In this paper we propose a methodology to support automatic analysis and conformance testing for access control systems, integrating those features to Assurance Management Framework (AMF). Our methodology attempts to verify formal specifications of a rolebased access control model and corresponding policies with selected security properties. Also, we systematically articulate testing cases from formal specifications and validate conformance to the system design and implementation using those cases. In addition, we demonstrate feasibility and effectiveness of our methodology using SAT and Alloy toolset.
Faster Proof Checking in the Edinburgh Logical Framework
 In 18th International Conference on Automated Deduction
, 2002
"... This paper describes optimizations for checking proofs represented in the Edinburgh Logical Framework (LF). The optimizations allow large proofs to be checked eciently which cannot feasibly be checked using the standard algorithm for LF. The crucial optimization is a form of result caching. To f ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
This paper describes optimizations for checking proofs represented in the Edinburgh Logical Framework (LF). The optimizations allow large proofs to be checked eciently which cannot feasibly be checked using the standard algorithm for LF. The crucial optimization is a form of result caching. To formalize this optimization, a path calculus for LF is developed and shown equivalent to a standard calculus.
The Inverse Method
, 2001
"... this paper every formula is equivalent to a formula in negation normal form ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
this paper every formula is equivalent to a formula in negation normal form
SCAN is complete for all Sahlqvist formulae
 In Relational and KleeneAlgebraic Methods in Computer Science (RelMiCS 7
, 2004
"... Abstract. SCAN is an algorithm for reducing monadic existential secondorder logic formulae to equivalent simpler formulae, often firstorder logic formulae. It is provably impossible for such a reduction to firstorder logic to be always successful, even if there is an equivalent firstorder formul ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
(Show Context)
Abstract. SCAN is an algorithm for reducing monadic existential secondorder logic formulae to equivalent simpler formulae, often firstorder logic formulae. It is provably impossible for such a reduction to firstorder logic to be always successful, even if there is an equivalent firstorder formula for a secondorder logic formula. In this paper we show that SCAN successfully computes the firstorder equivalents of all Sahlqvist formulae in the classical (multi)modal language. 1
CoRaL–Policy Language and Reasoning Techniques for Spectrum Policies
 In Eighth IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY
, 2007
"... (CoRaL), a new language for expressing policies that govern the behavior of cognitive radios that opportunistically share spectrum. A Policy Reasoner validates radio transmissions to ensure that they are compliant with the spectrum policies. The Policy Reasoner also discovers spectrum sharing opport ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
(Show Context)
(CoRaL), a new language for expressing policies that govern the behavior of cognitive radios that opportunistically share spectrum. A Policy Reasoner validates radio transmissions to ensure that they are compliant with the spectrum policies. The Policy Reasoner also discovers spectrum sharing opportunities by deriving what requirements have to be fulfilled for transmissions to be valid, i.e., in compliance with policies. A novel mix of reasoning techniques is required to implement such a reasoner. I.
Finite Model Building: Improvements and Comparisons
 In: Model Computation – Principles, Algorithms, Applications, CADE19 Workshop W4
, 2003
"... The paper ivestigates nite model building for rst order logic. We consider two main categories of methods: Macetype and Falcontype methods. The paper has two goals: rst, presenting several improvements and strategies for the basic Macetype and Falcontype algorithms, second, comparing the e ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
The paper ivestigates nite model building for rst order logic. We consider two main categories of methods: Macetype and Falcontype methods. The paper has two goals: rst, presenting several improvements and strategies for the basic Macetype and Falcontype algorithms, second, comparing the eciency of dierent methods. The improvements to the Macetype algorithms are focused on decreasing the size of the propositional subtasks. A new cell selection heuristics is introduced for the Falcontype algorithms. The methods are implemented in the Gandalf theorem prover. We present both the eect of the introduced improvements and the comparison of method categories for several problem classes, based on their syntactical characteristics. Finally, several suggestions for further investigations are given.
Firstorder resolution for CTL
"... In this paper, we describe an approach to theorem proving in Computational Tree Logic (CTL) which utilises classical firstorder resolution techniques. Since there already exist a lot of welldeveloped firstorder logic theorem provers, reusing those techniques provides great benefit for solving oth ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
In this paper, we describe an approach to theorem proving in Computational Tree Logic (CTL) which utilises classical firstorder resolution techniques. Since there already exist a lot of welldeveloped firstorder logic theorem provers, reusing those techniques provides great benefit for solving other similar problems. We do not attempt to prove CTL theorems directly within the temporal logic syntax. We first translate arbitrary CTL formulae into a normal form for CTL and then implement the CTL calculus using resolution in firstorder logic. After that, we utilise an efficient firstorder logic theorem prover, for example, VAMPIRE or SPASS to carry out proof. Further, this approach has the potential to be extended to solve problems in other logics. 1
Directly reflective metaprogramming
 HigherOrder and Symbolic Computation
, 2010
"... Existing metaprogramming languages operate on encodings of programs as data. This paper presents a new metaprogramming language, based on an untyped lambda calculus, in which structurally reflective programming is supported directly, without any encoding. The language features callbyvalue and ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Existing metaprogramming languages operate on encodings of programs as data. This paper presents a new metaprogramming language, based on an untyped lambda calculus, in which structurally reflective programming is supported directly, without any encoding. The language features callbyvalue and callbyname lambda abstractions, as well as novel reflective features enabling the intensional manipulation of arbitrary program terms. The language is scope safe, in the sense that variables can neither be captured nor escape their scopes. The expressiveness of the language is demonstrated by showing how to implement quotation and evaluation operations, as proposed by Wand. The language’s utility for metaprogramming is further demonstrated through additional representative examples. A prototype implementation is described and evaluated.