The Spin model checker and its specification language Promela have been used extensively in industry and academia to check the logical properties of distributed algorithms and protocols. Model checking with Spin involves reasoning about a system via an abstract Promela specification, thus the techni
β¦ LIBER β¦
Type inference and type checking for queries over execution traces
β Scribed by Daniel Deutch; Tova Milo
- Publisher
- Springer-Verlag
- Year
- 2011
- Tongue
- English
- Weight
- 783 KB
- Volume
- 21
- Category
- Article
- ISSN
- 1066-8888
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Type inference and strong static type ch
β
Alastair F. Donaldson; Simon J. Gay
π
Article
π
2010
π
Elsevier Science
π
English
β 750 KB
Normal Forms and Conservative Extension
β
Limsoon Wong
π
Article
π
1996
π
Elsevier Science
π
English
β 557 KB
Strong normalization results are obtained for a general language for collection types. An induced normal form for sets and bags is then used to show that the class of functions whose input has height (that is, the maximal depth of nestings of setsΓbagsΓlists in the complex object) at most i and outp