Unal et al., 2006
| Publication | Publication Date | Title |
|---|---|---|
| Wassermann et al. | An analysis framework for security in web applications | |
| Governatori et al. | Computing strong and weak permissions in defeasible logic | |
| Motik et al. | OWL datatypes: Design and implementation | |
| Janicke et al. | Dynamic access control policies: Specification and verification | |
| Löding et al. | Foundations for natural proofs and quantifier instantiation | |
| Koch et al. | Decidability of safety in graph-based models for access control | |
| Cau et al. | Verification and enforcement of access control policies | |
| Barker et al. | Term rewriting for access control | |
| Yuan et al. | A verifiable formal specification for rbac model with constraints of separation of duty | |
| Omodeo et al. | A computerized referee | |
| Unal et al. | Theorem proving for modeling and conflict checking of authorization policies | |
| Ahmad et al. | Formal reasoning of web application firewall rules through ontological modeling | |
| Hardin et al. | The Guardol language and verification system | |
| Nishihara et al. | On validating attack trees with attack effects | |
| Governatori et al. | Computing temporal defeasible logic | |
| Antoniou et al. | Forgetting for defeasible logic | |
| Bailey et al. | Abstract interpretation for termination analysis in functional active databases | |
| Meseguer | Variants in the infinitary unification wonderland | |
| Bruni et al. | Executable tile specifications for process calculi | |
| Bolotov et al. | Natural deduction calculus for computation tree logic | |
| Stark | Names, equations, relations: Practical ways to reason about new | |
| Aldewereld et al. | Verifying norm compliancy of protocols | |
| Hu et al. | The computational complexity of enforceability validation for generic access control rules | |
| Laan | Incremental verification of physical access control systems | |
| Schwichtenberg | Recursion on the partial continuous functionals |