Ranking function synthesis for bit-vector relations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6015 LNCS, Issue , 2010, Pages 236-250

  Cook, Byron ^a   Kroening, Daniel ^b   Rümmer, Philipp ^b   Wintersteiger, Christoph M ^c  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

DEVICE DRIVER; EFFICIENT SYNTHESIS; IMPERATIVE PROGRAMS; LINEAR RANKING; NOVEL ALGORITHM; OPEN PROBLEMS; PRE-DEFINED CLASS; PRESBURGER ARITHMETIC; RANKING FUNCTIONS;

ALGORITHMS; COMPUTER SOFTWARE; SYNTHESIS (CHEMICAL); DIGITAL ARITHMETIC; FUNCTIONS; INFORMATION RETRIEVAL; TEMPLATE MATCHING;

RATIONAL FUNCTIONS;

EID: 77951543872     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12002-2_19     Document Type: Conference Paper

References (20)

1. Babic, D., Hu, A.J., Rakamaric, Z., Cook, B.: Proving termination by divergence. In: SEFM, pp. 93-102. IEEE, Los Alamitos (2007)
2. Ball, T., Kupferman, O., Sagiv, M.: Leaping loops in the presence of abstraction. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 491-503. Springer, Heidelberg (2007)
3. Benedetti, M.: sKizzo: A suite to evaluate and certify QBFs. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 369-376. Springer, Heidelberg (2005)
4. Biere, A.: Resolve and expand. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 59-70. Springer, Heidelberg (2005)
5. Biere, A., Artho, C., Schuppan, V.: Liveness checking as safety checking. In: FMICS. ENTCS, vol. 66, pp. 160-177. Elsevier, Amsterdam (2002)
6. Bradley, A.R., Manna, Z., Sipma, H.B.: Termination analysis of integer linear loops. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 488-502. Springer, Heidelberg (2005)
7. Clarke, E.M., Kroening, D., Sharygina, N., Yorav, K.: Predicate abstraction of ANSI-C programs using SAT. FMSD 25(2-3), 105-127 (2004)
8. Cook, B., Podelski, A., Rybalchenko, A.: Abstraction refinement for termination. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol. 3672, pp. 87-101. Springer, Heidelberg (2005)
9. Cook, B., Podelski, A., Rybalchenko, A.: Termination proofs for systems code. In: PLDI, pp. 415-426. ACM, New York (2006)
10. Encrenaz, E., Finkel, A.: Automatic verification of counter systems with ranking functions. In: INFINITY. ENTCS, pp. 85-103. Elsevier, Amsterdam (2009)
11. Giunchiglia, E., Narizzano, M., Tacchella, A.: QuBE++: an efficient QBF solver. In: Hu, A.J., Martin, A.K. (eds.) FMCAD 2004. LNCS, vol. 3312, pp. 201-213. Springer, Heidelberg (2004)
12. Horwitz, S., Reps, T.W., Binkley, D.: Interprocedural slicing using dependence graphs. In: PLDI, pp. 35-46. ACM, New York (1988)
13. Jussila, T., Biere, A., Sinz, C., Kroening, D., Wintersteiger, C.M.: A first step towards a unified proof checker for QBF. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 201-214. Springer, Heidelberg (2007)
14. Podelski, A., Rybalchenko, A.: A complete method for the synthesis of linear ranking functions. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol. 2937, pp. 239-251. Springer, Heidelberg (2004)
15. Podelski, A., Rybalchenko, A.: Transition invariants. In: LICS, pp. 32-41. IEEE, Los Alamitos (2004)
16. Podelski, A., Rybalchenko, A.: ARMC: The logical choice for software model checking with abstraction refinement. In: Hanus, M. (ed.) PADL 2007. LNCS, vol. 4354, pp. 245-259. Springer, Heidelberg (2006)
17. Presburger, M.: Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In: Sprawozdanie z I Kongresu metematyków slowiańskich, Warsaw 1929, pp. 92-101 (1930)
18. Rümmer, P.: A constraint sequent calculus for first-order logic with linear integer arithmetic. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 274-289. Springer, Heidelberg (2008)
19. Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)
20. Yang, H., Lee, O., Berdine, J., Calcagno, C., Cook, B., Distefano, D., O'Hearn, P.W.: Scalable shape analysis for systems code. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 385-398. Springer, Heidelberg (2008)