Matrix multiplication via arithmetic progressions
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Three partition refinement algorithms
SIAM Journal on Computing
Introduction to algorithms
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
Online minimization of transition systems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Characteristic formulae for processes with divergence
Information and Computation
IEEE Transactions on Software Engineering
Model checking
Communication and Concurrency
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Classification of Security Properties (Part I: Information Flow)
FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
Modal µ-Calculus, Model Checking and Gauß Elimination
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
XEVE, an ESTEREL Verification Environment
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Symbolic Bisimulation Minimisation
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
An Improved Algorithm for the Evaluation of Fixpoint Expressions
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
The NCSU Concurrency Workbench
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Transforming Processes to Check and Ensure Information Flow Security
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Bisimulation and Unwinding for Verifying Possibilistic Security Properties
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Algorithmic Verification of Noninterference Properties
Electronic Notes in Theoretical Computer Science (ENTCS)
Information flow in systems with schedulers, Part I: Definitions
Theoretical Computer Science
Information flow in systems with schedulers, Part II: Refinement
Theoretical Computer Science
| Hi-index | 0.00 |
Persistent_BNDC (P_BNDC, for short) is a security property for processes in dynamic contexts, i.e., contexts that can be reconfigured at runtime. We study how to efficiently decide if a process is P_BNDC. We exploit a characterization of P_BNDC through a suitable notion of Weak Bisimulation up to high level actions. In the case of finite-state processes, we study two methods for computing the largest weak bisimulation up to high level actions: (1) via Characteristic Formulae and Model Checking for 碌-calculus and (2) via Closure up to a set of actions and Strong Bisimulation. This second method seems to be particularly appealing: it can be performed using already existing tools at a low time complexity.