Case Study: Qualitative and Quantitative Verification of File Ingestion Process
Pages 51 - 54
Abstract
In the development of a software system from a model, one can analyze functional correctness, liveness, timing guarantees, and quantitative properties. On the example of daily file ingestion process, we demonstrate how safety, liveness and quantitative properties can be analyzed by using a model checker. This process makes it possible to prevent errors inexpensively at the early design stages and to perform design optimization decisions based on quantitative verification of a system's properties. It is intuitive, and can be performed by developers without formal knowledge of discrete math, computational tree logic or temporal logic. The goal of model checking approach is an improvement to software quality and engineering efficiency.
References
[1]
Elastic. Elasticsearch. https://www.elastic.co/, January 2019.
[2]
D. Harel. Statecharts: A visual formalism for complex systems. Sci. Comput. Program., 8(3):231--274, June 1987.
[3]
A. Hartmanns. Modest - a unified language for quantitative models. In Specification and Design Languages (FDL), 2012 Forum on, pages 44--51, Sept 2012.
[4]
J.-P. Katoen, I. S. Zapreev, E. M. Hahn, H. Hermanns, and D. N. Jansen. The ins and outs of the probabilistic model checker mrmc. In Proceedings of the Sixth International Conference on the Quantitative Evaluation of Systems, QEST '09, pages 167--176, Los Alamitos, September 2009. IEEE Computer Society Press.
[5]
M. Kwiatkowska, G. Norman, and D. Parker. Prism 4.0: Verification of probabilistic real-time systems. In G. Gopalakrishnan and S. Qadeer, editors, Computer Aided Verification, volume 6806 of Lecture Notes in Computer Science, pages 585--591. Springer Berlin Heidelberg, 2011.
[6]
C. Morgan, A. McIver, and K. Seidel. Probabilistic predicate transformers. Association for Computing Machinery Transactions on Programming Languages and Systems, 18(3):325--353, May 1996.
[7]
B. Nokovic. Verification and Implementation of Embedded Systems from High-Level Models. PhD thesis, McMaster University, 2016.
[8]
B. Nokovic and E. Sekerinski. pState: A probabilistic statecharts translator. In Embedded Computing (MECO), 2013 2nd Mediterranean Conference on, pages 29--32, 2013.
[9]
B. Nokovic and E. Sekerinski. Verification and code generation for timed transitions in pcharts. In Proceedings of the International C* Conference on Computer Science and Software Engineering, C3S2E '14, New York, NY, USA, 2014. ACM.
[10]
E. Sekerinski. Verifying statecharts with state invariants. In K. Breitman, J. Woodcock, R. Sterritt, and M. Hinchey, editors, 13th IEEE International Conference on Engineering of Complex Computer Systems, ICECCS '08, pages 7--14, Belfast, Northern Ireland, March 2008. IEEE Computer Society.
[11]
E. Sekerinski and R. Zurob. iState: A statechart translator. In M. Gogolla and C. Kobryn, editors, UML 2001 -- The Unified Modeling Language, 4th International Conference, volume 2185 of Lecture Notes in Computer Science, pages 376--390, Toronto, Canada, 2001. Springer-Verlag.
Index Terms
- Case Study: Qualitative and Quantitative Verification of File Ingestion Process
Recommendations
A Deductive Verification Infrastructure for Probabilistic Programs
This paper presents a quantitative program verification infrastructure for discrete probabilistic programs. Our infrastructure can be viewed as the probabilistic analogue of Boogie: its central components are an intermediate verification language (...
Latticed k-Induction with an Application to Probabilistic Programs
Computer Aided VerificationAbstractWe revisit two well-established verification techniques, k-induction and bounded model checking (BMC), in the more general setting of fixed point theory over complete lattices. Our main theoretical contribution is latticed k-induction, which (i) ...
End-to-end verification of stack-space bounds for C programs
PLDI '14: Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and ImplementationVerified compilers guarantee the preservation of semantic properties and thus enable formal verification of programs at the source level. However, important quantitative properties such as memory and time usage still have to be verified at the machine ...
Comments
Information & Contributors
Information
Published In
April 2019
276 pages
ISBN:9781450361057
DOI:10.1145/3328833
Copyright © 2019 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 09 April 2019
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
ICSIE '19
ICSIE '19: 2019 8th International Conference on Software and Information Engineering
April 9 - 12, 2019
Cairo, Egypt
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 39Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Reflects downloads up to 12 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in