Difference between revisions of "Publications/michaud.15.spin"
From LRDE
(Created page with "{{Publication | published = true | date = 2015-06-15 | authors = Thibaud Michaud, Alexandre Duret-Lutz | title = Practical Stutter-Invariance Checks for ω-Regular Languages |...") |
|||
| Line 6: | Line 6: | ||
| booktitle = Proceedings of the 22th International SPIN Symposium on Model Checking of Software (SPIN'15) |
| booktitle = Proceedings of the 22th International SPIN Symposium on Model Checking of Software (SPIN'15) |
||
| pages = ?? to ?? |
| pages = ?? to ?? |
||
| + | | series = Lecture Notes in Computer Science |
||
| − | | publisher = |
+ | | publisher = Springer |
| urllrde = 201508-Spin2 |
| urllrde = 201508-Spin2 |
||
| − | | abstract = We propose several automata-based constructions that check whether a specification is stutter-invariant. These constructions assume that a specification and its negation can be translated into Büchi automata, but aside from that, they are independent of the specification formalism. These transformations were inspired by a construction due to Holzmann and Kupferman, but that we broke down into two operations that can have different realizations, and that can be combined in different ways. As it turns |
+ | | abstract = We propose several automata-based constructions that check whether a specification is stutter-invariant. These constructions assume that a specification and its negation can be translated into Büchi automata, but aside from that, they are independent of the specification formalism. These transformations were inspired by a construction due to Holzmann and Kupferman, but that we broke down into two operations that can have different realizations, and that can be combined in different ways. As it turns outimplementing only one of these operations is needed to obtain a functional stutter-invariant check. Finally we have implemented these techniques in a tool so that users can easily check whether an LTL or PSL formula is stutter-invariant. |
| lrdeprojects = Spot |
| lrdeprojects = Spot |
||
| lrdenewsdate = 2015-06-15 |
| lrdenewsdate = 2015-06-15 |
||
| Line 23: | Line 24: | ||
year = 2015, |
year = 2015, |
||
pages = <nowiki>{</nowiki>??--??<nowiki>}</nowiki>, |
pages = <nowiki>{</nowiki>??--??<nowiki>}</nowiki>, |
||
| − | + | series = <nowiki>{</nowiki>Lecture Notes in Computer Science<nowiki>}</nowiki>, |
|
| + | publisher = <nowiki>{</nowiki>Springer<nowiki>}</nowiki>, |
||
abstract = <nowiki>{</nowiki>We propose several automata-based constructions that check |
abstract = <nowiki>{</nowiki>We propose several automata-based constructions that check |
||
whether a specification is stutter-invariant. These |
whether a specification is stutter-invariant. These |
||
Revision as of 11:03, 29 June 2015
- Authors
- Thibaud Michaud, Alexandre Duret-Lutz
- Where
- Proceedings of the 22th International SPIN Symposium on Model Checking of Software (SPIN'15)
- Type
- inproceedings
- Publisher
- Springer
- Projects
- Spot
- Date
- 2015-06-15
Abstract
We propose several automata-based constructions that check whether a specification is stutter-invariant. These constructions assume that a specification and its negation can be translated into Büchi automata, but aside from that, they are independent of the specification formalism. These transformations were inspired by a construction due to Holzmann and Kupferman, but that we broke down into two operations that can have different realizations, and that can be combined in different ways. As it turns outimplementing only one of these operations is needed to obtain a functional stutter-invariant check. Finally we have implemented these techniques in a tool so that users can easily check whether an LTL or PSL formula is stutter-invariant.
Bibtex (lrde.bib)
@InProceedings{ michaud.15.spin,
author = {Thibaud Michaud and Alexandre Duret-Lutz},
title = {Practical Stutter-Invariance Checks for {$\omega$}-Regular
Languages},
booktitle = {Proceedings of the 22th International SPIN Symposium on
Model Checking of Software (SPIN'15)},
year = 2015,
pages = {??--??},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
abstract = {We propose several automata-based constructions that check
whether a specification is stutter-invariant. These
constructions assume that a specification and its negation
can be translated into B{\"u}chi automata, but aside from
that, they are independent of the specification formalism.
These transformations were inspired by a construction due
to Holzmann and Kupferman, but that we broke down into two
operations that can have different realizations, and that
can be combined in different ways. As it turns out,
implementing only one of these operations is needed to
obtain a functional stutter-invariant check. Finally we
have implemented these techniques in a tool so that users
can easily check whether an LTL or PSL formula is
stutter-invariant.},
note = {To appear}
}