Abstract. Differing from [6] this paper reduces non-linear ranking function discovering for polynomial programs to semi-algebraic system solving, and demonstrates how to apply the...
Yinghua Chen, Bican Xia, Lu Yang, Naijun Zhan, Cha...
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
We present an extension of first-order predicate logic with a novel predicate ‘at t’ meaning intuitively “this term is a variable symbol”. We give simple sequent proof-ru...
The context of this study is timed temporal logics for timed automata. In this paper, we propose an extension of the classical logic TCTL with a new Until modality, called “Until...
Computer science has served to insulate programs and programmers from knowledge of the underlying mechanisms used to manipulate information, however this fiction is increasingly h...
Neil Gershenfeld, David Dalrymple, Kailiang Chen, ...