15 search results - page 1 / 3 » CTL Model-Checking over Logics with Non-Classical Negations |
ISMVL
2003
IEEE
13 years 10 months ago
2003
IEEE
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...
FM
2001
Springer
13 years 9 months ago
2001
Springer
Classical logic cannot be used to effectively reason about systems with uncertainty (lack of essential information) or inconsistency (contradictory information often occurring when...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
TACAS
2004
Springer
13 years 10 months ago
2004
Springer
Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the analysis of stochastic systems, or systems with imprecise formal models, tempor...
TACAS
2012
Springer
12 years 9 days ago
2012
Springer
The number of malware is growing extraordinarily fast. Therefore, it is important to have efficient malware detectors. Malware writers try to obfuscate their code by different tec...