819 search results - page 45 / 164 » Using Assumptions to Distribute CTL Model Checking |
110
Voted
ICRA
2009
IEEE
15 years 7 months ago
2009
IEEE
— This paper addresses the problem of coverage control of a network of mobile sensors. In the current literature, this is commonly formulated as a locational optimization problem...
101
Voted
CCS
2009
ACM
15 years 7 months ago
2009
ACM
We enforce information flow policies in programs that run at multiple locations, with diverse levels of security. We build a compiler from a small imperative language with locali...
119
click to vote
ICFEM
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We develop a way of analyzing the behavior of systems modeled using Discrete Time Markov Chains (DTMC). Specifically, we define iLTL, an LTL with linear inequalities on...
126
Voted
DATE
2009
IEEE
15 years 7 months ago
2009
IEEE
—Verification is a major issue in circuit and system design. Formal methods like bounded model checking (BMC) can guarantee a high quality of the verification. There are severa...
88
Voted
PDPTA
2003
15 years 1 months ago
2003
We present a novel approach to parallel Boolean satisfiability (SAT) checking. A distinctive feature of our parallel SAT checker is that it incorporates all essential heuristics ...