Sciweavers

40 search results - page 4 / 8
» Model checking propositional dynamic logic with all extras
Sort
View
TASE
2008
IEEE
14 years 16 days ago
PDL over Accelerated Labeled Transition Systems
We present a thorough study of Propositional Dynamic Logic over a variation of labeled transition systems, called accelerated labelled transition systems, which are transition sys...
Taolue Chen, Jaco van de Pol, Yanjing Wang
TACAS
2001
Springer
135views Algorithms» more  TACAS 2001»
13 years 10 months ago
Implementing a Multi-valued Symbolic Model Checker
Multi-valued logics support the explicit modeling of uncertainty and disagreement by allowing additional truth values in the logic. Such logics can be used for verification of dyn...
Marsha Chechik, Benet Devereux, Steve M. Easterbro...
DAC
2005
ACM
13 years 8 months ago
Prime clauses for fast enumeration of satisfying assignments to boolean circuits
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...
HoonSang Jin, Fabio Somenzi
IAT
2009
IEEE
14 years 27 days ago
Awareness and Forgetting of Facts and Agents
—We propose various logical semantics for change of awareness. The setting is that of multiple agents that may become aware of facts or other agents, or forget about them. We mod...
Hans P. van Ditmarsch, Tim French
DATE
2007
IEEE
165views Hardware» more  DATE 2007»
14 years 15 days ago
Boosting the role of inductive invariants in model checking
This paper focuses on inductive invariants in unbounded model checking to improve efficiency and scalability. First of all, it introduces optimized techniques to speedup the comp...
Gianpiero Cabodi, Sergio Nocco, Stefano Quer