Zobrazeno 1 - 10
of 615
pro vyhledávání: '"B. Hocking"'
Autor:
Martin B. B. Hocking
The Handbook of Chemical Technology and Pollution Control, Third Edition provides a detailed review of the chemistry and operating conditions of many of the present large-scale chemical processes important to our economy and high standards of living.
Autor:
Ben L. Di Vito, Ashlie B. Hocking
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030763831
NFM
NFM
Geometric algorithms can present significant challenges for formal methods. We describe the formalization and verification of an algorithm posing such challenges. Given two overlapping polygons A and B, the Polygon Merge algorithm derives a new polyg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f5122119942cd6fd12a56b2d70ce2eeb
https://doi.org/10.1007/978-3-030-76384-8_6
https://doi.org/10.1007/978-3-030-76384-8_6
Publikováno v:
2020 AIAA/IEEE 39th Digital Avionics Systems Conference (DASC).
SPARK Ada's support for proofs of correctness make the programming language ideal for implementing a PVS specification. Algorithmically implementing a PVS specification in SPARK Ada allows users to maintain the rigor of PVS in executable code. The go
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::77a6f0c67fb296177468b0c46c8d6d66
https://doi.org/10.1109/dasc50938.2020.9256479
https://doi.org/10.1109/dasc50938.2020.9256479
Publikováno v:
2020 AIAA/IEEE 39th Digital Avionics Systems Conference (DASC).
The kinds of systems we are building, and the ways we are building them, are evolving. This evolution is invalidating analyses and assumptions upon which we have relied as bases for design assurance, imposing a need for new criteria and means of comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::65eaeb585c803ec6ec3ac9b9db49194f
https://doi.org/10.1109/dasc50938.2020.9256762
https://doi.org/10.1109/dasc50938.2020.9256762
Publikováno v:
ISSRE Workshops
Unit lemmas and a checklist of questions used to generate them can identify flaws in formal requirements and specifications early in the design process, reducing the overall cost and increasing confidence in the final product. We demonstrate how we c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::031ee1a2e0549ef0cea896b9ce567a19
https://doi.org/10.1109/issrew51248.2020.00063
https://doi.org/10.1109/issrew51248.2020.00063
Publikováno v:
ISSRE Workshops
To address the problem of assuring complex modern systems, we propose assurance driven development where the inferences of assurance are themselves directly tested. We refer to this as test-driven-assurance-based development, or TDABD. TDABD focuses
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::44c775852b762c95b25956e1f0fb3d5e
https://doi.org/10.1109/issrew51248.2020.00064
https://doi.org/10.1109/issrew51248.2020.00064
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Ashlie B. Hocking, M. Anthony Aiello
Publikováno v:
Kalpa Publications in Computing.
Cyber-physical systems model physical phenomena, implicitly or explicitly, in order to interact with the real world. Representation of physical phenomena, including dimensionality and units, using the PVS type system provides users with the ability t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f72660fa8f04732ef4aa93ddb9c74e1a
https://doi.org/10.29007/jt21
https://doi.org/10.29007/jt21
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319572871
NFM
NFM
Real-world applications often include large, empirically defined discrete-valued functions. When proving properties about these applications, the proof naturally breaks into one case per entry in the first function reached, and again into one case pe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a15c16caaa3ac7a48ca890398aedd51
https://doi.org/10.1007/978-3-319-57288-8_10
https://doi.org/10.1007/978-3-319-57288-8_10