Search
for Topics
All Reviews
Browse All Reviews
>
Software (D)
>
Software Engineering (D.2)
>
Software/Program Verification (D.2.4)
> Formal Methods (D.2.4...)
Options:
All Media Types
Journals
Proceedings
Div Books
Whole Books
Other
Date Reviewed
Title
Author
Publisher
Published Date
Descending
Ascending
110 of 123 Reviews about "
Formal Methods (D.2.4...)
":
Date Reviewed
Parallel cost analysis
Albert E., Correas J., Johnsen E., Pun K., RománDíez G. ACM Transactions on Computational Logic 19(4): 137, 2018. Type: Article
In this paper, the authors present “static cost analysis for distributed systems that exploits the parallelism among distributed locations to infer a more precise estimation of the parallel cost.” Such a parallel cost analysis can be o...
Apr 2 2021
Systematically ensuring the confidence of realtime home automation IoT systems
Bu L., Xiong W., Liang C., Han S., Zhang D., Lin S., Li X. ACM Transactions on CyberPhysical Systems 2(3): 123, 2018. Type: Article
The quick expansion of computing technology in many areas leads to different new paradigms; among them is the paradigm of cyberphysical systems (CPS) with commonly acquired sensor data that can be processed in real time. One of the manifestations...
Oct 13 2020
Formal methods: an appetizer
Nielson F., Nielson H., Springer International Publishing, New York, NY, 2019. 162 pp. Type: Book (9783030051556)
I’ve occasionally been intimidated into ordering an appetizer as the main course, but have rarely regretted it thanks to the presence of “gourmet” friends. This is an excellent, ultraelegant, and rigorous book. Its 160 printed p...
Apr 23 2020
Modular product programs
Eilers M., Müller P., Hitz S. ACM Transactions on Programming Languages and Systems 42(1): 137, 2019. Type: Article
Some properties of programs are not about a single run of the program; instead, they relate multiple runs. For example, a program is deterministic if, given the same input, two runs will always produce the same answer. Many other properties of int...
Jan 14 2020
Verification methods for the computationally complete symbolic attacker based on indistinguishability
Bana G., Chadha R., Eeralla A., Okada M. ACM Transactions on Computational Logic 21(1): 144, 2019. Type: Article
Firstorder logic formalization for security protocols and attackers enables formal verification. Once a formalization is established, standard tools such as a theorem prover can be used in the analysis....
Dec 16 2019
Reproducibility in scientific computing
Ivie P., Thain D. ACM Computing Surveys 51(3): 136, 2018. Type: Article
The authors discuss reproducible research, that is, research where the same task produces the same result as the original research. Researchers in the computing community are encouraged to make their results reproducible so that others can verify,...
Nov 19 2019
Efficiency through uncertainty: scalable formal synthesis for stochastic hybrid systems
Cauchi N., Laurenti L., Lahijanian M., Abate A., Kwiatkowska M., Cardelli L. HSCC 2019 (Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control, Montreal, Canada, Apr 1618, 2019) 240251, 2019. Type: Proceedings
Hybrid systems are those “with both continuous dynamics and discrete logic” [1]. The discrete logic serves to label or parametrize (my terms) states; statespecific continuous dynamics, modeled largely if not exclusively by differentia...
Jul 12 2019
Inferring extended probabilistic finitestate automaton models from software executions
Emam S., Miller J. ACM Transactions on Software Engineering and Methodology 27(1): 139, 2018. Type: Article
To facilitate the testing and maintenance of software systems, researchers have generated behavioral models in the form of finitestate automata from software execution traces. Even though a finitestate automaton (FSA) is a common dynamic model i...
Oct 25 2018
CoSMed: a confidentialityverified social media platform
Bauerei
T., Pesenti Gritti A., Popescu A., Raimondi F. Journal of Automated Reasoning 61(14): 113139, 2018. Type: Article
What do we mean when we say that a system is verified? In theory it means that certain properties of a system have been proved to hold. In practice, the answer is rather more complicated....
Aug 22 2018
Computer arithmetic and formal proofs: verifying floatingpoint algorithms with the Coq system
Boldo S., Melquiond G., ISTE Press  Elsevier, London, UK, 2017. 326 pp. Type: Book (9781785481123)
The audience for this superlatively researched and crafted book includes postgraduate students and practitioners of floatingpoint (FP) computation or formal verification. The authors “sincerely hope that, after reading this book, you will f...
Aug 8 2018
Display
5
10
15
25
50
100
per page
Reproduction in whole or in part without permission is prohibited. Copyright © 20002021 ThinkLoud, Inc.
Terms of Use

Privacy Policy