Titlebook: Computer Aided Verification; 33rd International C Alexandra Silva,K. Rustan M. Leino Conference proceedings‘‘‘‘‘‘‘‘ 2021 The Editor(s) (if

預(yù)測(cè)

隱語(yǔ)

熔巖

Bmd955

https://doi.org/10.1007/978-3-642-99037-3 automated reasoners do not provide ways to specify summations of arbitrary length..In this paper, we present a generalization of first-order logic which can express the unbounded sum of balances. We prove the decidablity of one of our extensions and the undecidability of a slightly richer one. We i

oracle

鈍劍

Computer Aided Verification978-3-030-81685-8Series ISSN 0302-9743 Series E-ISSN 1611-3349

PIZZA

Alexandra Silva,K. Rustan M. LeinoThis book is open access, which means that you have free and unlimited access

先兆

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/233358.jpg

Pastry

過(guò)剩

978-3-030-81684-1The Editor(s) (if applicable) and The Author(s) 2021