Parametric equations for temporal style assertions
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2016
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917205218689024 |
|---|---|
| author | Yodaiken, Victor |
| author_facet | Yodaiken, Victor |
| contents | Temporal logic provided an appealing approach to specifying properties of operating systems and other "reactive" software by allowing propositions to be qualified by "when" they must be true. This paper shows how to get the same effect, with a finer control over specification and a compositional notion of state, using ordinary working mathematics, without the weight of formal logic, by using sequential functions which are an alternate representation of Moore type state machines. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1612_01630 |
| institution | arXiv |
| publishDate | 2016 |
| record_format | arxiv |
| spellingShingle | Parametric equations for temporal style assertions Yodaiken, Victor Logic in Computer Science Temporal logic provided an appealing approach to specifying properties of operating systems and other "reactive" software by allowing propositions to be qualified by "when" they must be true. This paper shows how to get the same effect, with a finer control over specification and a compositional notion of state, using ordinary working mathematics, without the weight of formal logic, by using sequential functions which are an alternate representation of Moore type state machines. |
| title | Parametric equations for temporal style assertions |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/1612.01630 |