Fetching the paper…
Reading the bibliography…
Program verification is vital for ensuring software reliability, especially in the context of increasingly complex systems.
1905
Earlier work this paper cites.
C. A. R. Hoare, “An axiomatic basis for computer programming,” Communications of the ACM , vol. 12, no. 10, pp. 576–580, 1969
1969
Earlier work this paper cites.
C. G. Nelson, Techniques for program verification . Stanford University, 1980
1980
Earlier work this paper cites.
J. H. Fetzer, “Program verification: The very idea,” Communications of the ACM , vol. 31, no. 9, pp. 1048–1063, 1988
1988
Earlier work this paper cites.
M. D. Ernst, J. H. Perkins, P. J. Guo, S. McCamant, C. Pacheco, M. S. Tschantz, and C. Xiao, “The daikon system for dynamic detection of likely invariants,” Science of computer programming , vol. 69, no. 1-3, pp. 35–45, 2007
2007
Earlier work this paper cites.
L. De Moura and N. Bjørner, “Z3: An efficient smt solver,” in International conference on Tools and Algorithms for the Construction and Analysis of Systems . Springer, 2008, pp. 337–340
2008
Earlier work this paper cites.
S. Srivastava, S. Gulwani, and J. S. Foster, “From program verification to program synthesis,” in Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages , 2010, pp. 313–326
2010
Earlier work this paper cites.
J. B. Almeida, M. J. Frade, J. S. Pinto, and S. M. De Sousa, Rigorous software development: an introduction to program verification . Springer, 2011, vol. 1
2011
Earlier work this paper cites.
K. Sieber, The foundations of program verification . Springer-Verlag, 2013
2013
Earlier work this paper cites.
J.-C. Filliâtre and A. Paskevich, “Why3—where programs meet provers,” in Programming Languages and Systems: 22nd European Symposium on Programming, ESOP 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings 22 . Springer, 2013, pp. 125–128
2013
Earlier work this paper cites.
Z. Daw, R. Cleaveland, and M. Vetter, “Formal verification of software-based medical devices considering medical guidelines,” International journal of computer assisted radiology and surgery , vol. 9, pp. 145–153, 2014
2014
Earlier work this paper cites.
C. A. Furia, B. Meyer, and S. Velder, “Loop invariants: Analysis, classification, and examples,” ACM Computing Surveys (CSUR) , vol. 46, no. 3, pp. 1–51, 2014
2014
Earlier work this paper cites.
P. Koopman and M. Wagner, “Challenges in autonomous vehicle testing and validation,” SAE International Journal of Transportation Safety , vol. 4, no. 1, pp. 15–24, 2016
2016
Earlier work this paper cites.
P. Garg, D. Neider, P. Madhusudan, and D. Roth, “Learning invariants using decision trees and implication counterexamples,” in Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2016, St. Petersburg, FL, USA, January 20 - 22, 2016 , R. Bodík and R. Majumdar, Eds. ACM, 2016, pp. 499–512. [Online]. Available: https://doi.org/10.1145/2837614.2837664
2016
Earlier work this paper cites.
S. Padhi, R. Sharma, and T. D. Millstein, “Data-driven precondition inference with learned features,” in Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2016, Santa Barbara, CA, USA, June 13-17, 2016 , 2016, pp. 42–56. [Online]. Available: http://doi.acm.org/10.1145/2908080.2908099
2016
Earlier work this paper cites.
S. Padhi, R. Sharma, and T. Millstein, “Data-driven precondition inference with learned features,” ACM SIGPLAN Notices , vol. 51, no. 6, pp. 42–56, 2016
2016
Earlier work this paper cites.
2017
Earlier work this paper cites.
S.-W. Lin, J. Sun, H. Xiao, Y. Liu, D. Sanán, and H. Hansen, “Fib: Squeezing loop invariants by interpolation between forward/backward predicate transformers,” in 2017 32nd IEEE/ACM International Conference on Automated Software Engineering (ASE) . IEEE, 2017, pp. 793–803
2017
Cited alongside, same era.
2017
Cited alongside, same era.
C. Colombo and G. J. Pace, “Industrial experiences with runtime verification of financial transaction systems: lessons learnt and standing challenges,” in Lectures on Runtime Verification: Introductory and Advanced Topics . Springer, 2018, pp. 211–232
2018
Cited alongside, same era.
X. Si, H. Dai, M. Raghothaman, M. Naik, and L. Song, “Learning loop invariants for program verification,” in Proceedings of the 32nd International Conference on Neural Information Processing Systems , ser. NIPS’18. Red Hook, NY, USA: Curran Associates Inc., 2018, p. 7762–7773
2022
Later among the works it cites.
D. Beyer, “Progress on software verification: Sv-comp 2022,” in Tools and Algorithms for the Construction and Analysis of Systems: 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2–7, 2022, Proceedings, Part II . Berlin, Heidelberg: Springer-Verlag, 2022, p. 375–402. [Online]. Available: https://doi.org/10.1007/978-3-030-99527-0_20
2022
Later among the works it cites.
2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2018
Cited alongside, same era.
R. Baldoni, E. Coppa, D. C. D’Elia, C. Demetrescu, and I. Finocchi, “A survey of symbolic execution techniques,” ACM Comput. Surv. , vol. 51, no. 3, 2018
2018
Cited alongside, same era.
M. Echenim, N. Peltier, and Y. Sellami, “A generic framework for implicate generation modulo theories,” in Automated Reasoning: 9th International Joint Conference, IJCAR 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 14-17, 2018, Proceedings 9 . Springer, 2018, pp. 279–294
2018
Cited alongside, same era.
2018
Cited alongside, same era.
2018
Cited alongside, same era.
T. Dreossi, D. J. Fremont, S. Ghosh, E. Kim, H. Ravanbakhsh, M. Vazquez-Chanlatte, and S. A. Seshia, “Verifai: A toolkit for the formal design and analysis of artificial intelligence-based systems,” in International Conference on Computer Aided Verification . Springer, 2019, pp. 432–442
2019
Cited alongside, same era.
P. O’Hearn, “Separation logic,” Commun. ACM , vol. 62, no. 2, p. 86–95, jan 2019. [Online]. Available: https://doi.org/10.1145/3211968
2019
Cited alongside, same era.
M. Echenim, N. Peltier, and Y. Sellami, “Ilinva: Using abduction to generate loop invariants,” in Frontiers of Combining Systems - 12th International Symposium, FroCoS 2019, London, UK, September 4-6, 2019, Proceedings , ser. Lecture Notes in Computer Science, A. Herzig and A. Popescu, Eds., vol. 11715. Springer, 2019, pp. 77–93. [Online]. Available: https://doi.org/10.1007/978-3-030-29007-8_5
2019
Cited alongside, same era.
T. C. Le, G. Zheng, and T. Nguyen, “SLING: using dynamic analysis to infer program invariants in separation logic,” in Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2019, Phoenix, AZ, USA, June 22-26, 2019 , K. S. McKinley and K. Fisher, Eds. ACM, 2019, pp. 788–801. [Online]. Available: https://doi.org/10.1145/3314221.3314634
2019
Cited alongside, same era.
J. Laurent and A. Platzer, “Learning to find proofs and theorems by learning to refine search strategies: The case of loop invariant synthesis,” Advances in Neural Information Processing Systems , vol. 35, pp. 4843–4856, 2022
2022
Later among the works it cites.
M. Bayer, M.-A. Kaufhold, and C. Reuter, “A survey on data augmentation for text classification,” ACM Computing Surveys , vol. 55, no. 7, pp. 1–39, 2022
2022
Later among the works it cites.
F. Rajaona, I. Boureanu, V. Malvone, and F. Belardinelli, “Program semantics and verification technique for ai-centred programs,” in International Symposium on Formal Methods . Springer, 2023, pp. 473–491
2023
Closest in time.
S. Chakraborty et al. , “Ranking llm-generated loop invariants for program verification,” 2023
2023
Closest in time.
K. Pei, D. Bieber, K. Shi, C. Sutton, and P. Yin, “Can large language models reason about program invariants?” 2023
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
R. OpenAI, “Gpt-4 technical report. arxiv 2303.08774,” View in Article , vol. 2, no. 5, 2023
2023
Closest in time.
2023
Closest in time.
OpenAI, “Gpt-4 technical report,” 2023
2023
Closest in time.