402 search results - page 69 / 81 » Model Checking Quantified Computation Tree Logic |
133
click to vote
FASE
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. To guarantee the security of computer systems, it is necessary to define security permissions to restrict the access to the systems' resources. These permissions enf...
EMSOFT
2004
Springer
15 years 3 months ago
2004
Springer
Embedded devices like smart cards can now run multiple interacting applications. A particular challenge in this domain is to dynamically integrate diverse security policies. In th...
101
Voted
FORMATS
2003
Springer
15 years 2 months ago
2003
Springer
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
AAAI
2006
14 years 11 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
DBPL
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. Based on the recursion mechanism of the XML transformation language XSL, the document transformation language DTL is defined. First the instantiation DTLreg is considere...