395 search results - page 6 / 79 » Polynomial Approximations for Model Checking |
DATE
2002
IEEE
15 years 2 months ago
2002
IEEE
We present a new passive model reduction algorithm based on the Laguerre expansion of the time response of interconnect networks. We derive expressions for the Laguerre coefficie...
TON
2008
14 years 9 months ago
2008
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
FOCS
1992
IEEE
15 years 2 months ago
1992
IEEE
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilisticall...
CAV
2003
Springer
15 years 3 months ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
VMCAI
2009
Springer
15 years 4 months ago
2009
Springer
Given a 3-valued abstraction of a program (possibly generated using rogram analysis and predicate abstraction) and a temporal logic formula, generalized model checking (GMC) checks...