99 search results - page 6 / 20 » Model Checking Linear Programs with Arrays |
IPPS
1998
IEEE
13 years 12 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
CAV
2003
Springer
14 years 26 days 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...
CADE
2002
Springer
14 years 8 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
SIGSOFT
2007
ACM
14 years 8 months ago
2007
ACM
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
LICS
2003
IEEE
14 years 27 days ago
2003
IEEE
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...