Sciweavers

1472 search results - page 92 / 295
» On Model Checking Infinite-State Systems
Sort
View
LMCS
2007
132views more  LMCS 2007»
15 years 3 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
CAV
2009
Springer
215views Hardware» more  CAV 2009»
16 years 4 months ago
Homer: A Higher-Order Observational Equivalence Model checkER
We present HOMER, an observational-equivalence model checker for the 3rd-order fragment of Idealized Algol (IA) augmented with iteration. It works by first translating terms of the...
David Hopkins, C.-H. Luke Ong
ACSD
2005
IEEE
162views Hardware» more  ACSD 2005»
15 years 9 months ago
Complexity Results for Checking Distributed Implementability
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...
Keijo Heljanko, Alin Stefanescu
120
Voted
SACMAT
2010
ACM
15 years 8 months ago
Role updating for assignments
The role-based access control (RBAC) has significantly simplified the management of users and permissions in computing systems. In dynamic environments, systems are usually unde...
Jinwei Hu, Yan Zhang, Ruixuan Li, Zhengding Lu
I3E
2001
196views Business» more  I3E 2001»
15 years 5 months ago
Security Modelling for Electronic Commerce: The Common Electronic Purse Specifications
: Designing security-critical systems correctly is very difficult. We present work on software engineering of security critical systems, supported by the CASE tool AUTOFOCUS. Secur...
Jan Jürjens, Guido Wimmel