Transfer Function Synthesis without Quantifier Elimination (long version)

Subject: QA76

References
(89)
[1] Atmel Products. AVR32 Architecture Manual, 2007. http://www.atmel.com/.
[2] R. Bagnara, P. M. Hill, and E. Zaffanella. Weaklyrelational shapes for numeric abstractions: improved algorithms and proofs of correctness. Formal Methods in System Design, 35(3):279323, 2009.
[3] R. Bagnara, E. Rodr´ıguezCarbonell, and E. Zaffanella. Generation of Basic Semialgebraic Invariants Using Convex Polyhedra. In SAS, volume 3672 of LNCS, pages 1934. Springer, 2005.
[4] C. Baier and J.P. Katoen. Principles of Model Checking. The MIT Press, 2008.
[5] G. Balakrishnan. WYSINWYX: What You See Is Not What You eXecute. PhD thesis, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, USA, August 2007.
[6] G. Balakrishnan and T. Reps. WYSINWYX: What You See Is Not What You eXecute. ACM Trans. Program. Lang. Syst., 32(6), 2010.
[7] S. Bardin and P. Herrmann. Structural Testing of Executables. In ICST, pages 2231. IEEE Computer Society, 2008.
[8] S. Bardin and P. Herrmann. OSMOSE: Automatic Structural Testing of Executables. Softw. Test., Verif. Reliab., 21(1):2954, 2011.
[9] S. Bardin, P. Herrmann, J. Leroux, O. Ly, R. Tabary, and A. Vincent. The BINCOA Framework for Binary Code Analysis. In CAV, volume 6806 of LNCS, pages 165170. Springer, 2011.
[10] C. Barrett, R. Sebastiani, S. A. Seshia, and C. Tinelli. Handbook of Satisfiability, chapter Satisfiability Modulo Theories, pages 737797. IOS Press, 2009.
 Similar Research Results (1)

Metrics
0views in OpenAIRE0views in local repository12downloads in local repository
The information is available from the following content providers:
From Number Of Views Number Of Downloads Kent Academic Repository  IRUSUK 0 12

 Download from


Cite this publication