Sciweavers

616 search results - page 25 / 124
» Bounded Model Checking with Description Logic Reasoning
Sort
View
DLOG
2009
13 years 10 months ago
Using Description Logics in Relation Based Access Control
Relation Based Access Control (RelBAC) is an access control model designed for the new scenarios of access control on Web 2.0. Under this model, we discuss in this paper how to for...
Rui Zhang, Alessandro Artale, Fausto Giunchiglia, ...
KBSE
2007
IEEE
14 years 3 months ago
Sequential circuits for program analysis
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
Fadi A. Zaraket, Adnan Aziz, Sarfraz Khurshid
ISMVL
2003
IEEE
117views Hardware» more  ISMVL 2003»
14 years 2 months ago
CTL Model-Checking over Logics with Non-Classical Negations
In earlier work [9], we defined CTL model-checking over finite-valued logics with De Morgan negation. In this paper, we extend this work to logics with intuitionistic, Galois an...
Marsha Chechik, Wendy MacCaull
TPHOL
2008
IEEE
14 years 3 months ago
Formal Reasoning About Causality Analysis
Systems that can immediately react to their inputs may suffer from cyclic dependencies between their actions and the corresponding trigger conditions. For this reason, causality an...
Jens Brandt, Klaus Schneider
CAV
2005
Springer
127views Hardware» more  CAV 2005»
14 years 2 months ago
Incremental and Complete Bounded Model Checking for Full PLTL
Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. R...
Keijo Heljanko, Tommi A. Junttila, Timo Latvala