Name
Abstract | ||
|---|---|---|
Computing invariants is the key issue in the analysis of infinite-state systems whether analysis means testing, verification or parameter synthesis. In particular, methods that allow to treat combinations of loops are of interest. We present a set of algorithms and methods that can be applied to characterize over-approximations of the set of reachable states of combinations of self-loops. We present two families of complementary techniques. The first one identifies a number of basic cases of... |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1007/978-3-540-45099-3_4 | SAS |
Keywords | Field | DocType |
transformational approach,generating non-linear invariants | Transition system,Discrete mathematics,Nonlinear system,Computer science,Static analysis,Algorithm,Theoretical computer science,Presburger arithmetic,Invariant (mathematics),Constraint logic programming,Formal verification,Hybrid automaton | Conference |
Volume | ISSN | ISBN |
1824 | 0302-9743 | 3-540-67668-6 |
Citations | PageRank | References |
8 | 0.79 | 19 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Saddek Bensalem | 1 | 1242 | 106.13 |
| Marius Bozga | 2 | 2100 | 127.83 |
| Jean-Claude Fernandez | 3 | 395 | 29.17 |
| Lucian Ghirvu | 4 | 202 | 12.69 |
| Yassine Lakhnech | 5 | 913 | 78.50 |