Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Pescetti, Andrea"'
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking functions are particularly interesting because many terminating loops a
Externí odkaz:
http://arxiv.org/abs/1004.0944
The design and implementation of precise static analyzers for significant fragments of modern imperative languages like C, C++, Java and Python is a challenging problem. In this paper, we consider a core imperative language that has several features
Externí odkaz:
http://arxiv.org/abs/cs/0703116
Fully automatic worst-case complexity analysis has a number of applications in computer-assisted program manipulation. A classical and powerful approach to complexity analysis consists in formally deriving, from the program syntax, a set of constrain
Externí odkaz:
http://arxiv.org/abs/cs/0512056
Publikováno v:
In Information and Computation June 2012 215:47-67
