T. Amtoft, K. Androutsopoulos, and D. Clark, Correctness of slicing finite state machines, 2013.

T. Amtoft and A. Banerjee, A theory of slicing for probabilistic control flow graphs, FoSSaCS, vol.9634, pp.180-196, 2016.

H. Agrawal, R. A. Demillo, and E. H. Spafford, Debugging with dynamic slicing and backtracking, Softw., Pract. Exper, vol.23, issue.6, pp.589-616, 1993.

M. Allen and S. Horwitz, Slicing Java programs that throw and catch exceptions, PEPM 2003, pp.44-54, 2003.

M. Aung, S. Horwitz, R. Joiner, and T. W. , Reps. Specialization slicing. ACM Trans. Program. Lang. Syst, vol.36, issue.2, 2014.

F. E. Allen, Control flow analysis, Proceedings of a Symposium on Compiler Optimization, pp.1-19, 1970.

, The Alt-Ergo automated theorem prover, v1, vol.30, 2016.

T. Amtoft, Slicing for modern program structures: a theory for eliminating irrelevant loops, Inf. Process. Lett, vol.106, issue.2, pp.45-51, 2008.

P. Anderson, T. W. Reps, and T. Teitelbaum, Design and implementation of a fine-grained software inspection tool, IEEE Trans. Software Eng, vol.29, issue.8, pp.721-733, 2003.

A. V. Aho, R. Sethi, and J. D. Ullman, Compilers: Principles, Techniques, and Tools. Addison-Wesley series in computer science / World student series edition, 1986.

R. W. Barraclough, D. Binkley, S. Danicic, M. Harman, and R. M. Hierons, Akos Kiss, Mike Laurence, and Lahcen Ouarbya. A trajectory-based strict semantics for program slicing, Theor. Comp. Sci, vol.411, pp.1372-1386, 2010.

J. , F. Bergeretti, and B. Carré, Information-flow and data-flow analysis of while-programs, ACM Trans. Program. Lang. Syst, vol.7, issue.1, pp.37-61, 1985.

Y. Bertot and P. Castéran, Interactive Theorem Proving and Program Development, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00344237

F. Bobot, E. Sylvain-conchon, S. Contejean, and . Lescuyer, Implementing polymorphism in SMT solvers, Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning, pp.1-5, 2008.

C. Barrett, C. L. Conway, M. Deters, L. Hadarean, D. Jovanovi'c et al., Proceedings of the 23rd International Conference on Computer Aided Verification (CAV '11), vol.6806, pp.171-177, 2011.

J. Bernardo-barros, D. Carneiro-da-cruz, P. R. Henriques, and J. S. Pinto, Assertion-based slicing and slice graphs, Formal Asp. Comput, vol.24, issue.2, pp.217-248, 2012.

S. Blazy, D. Demange, and D. Pichardie, Validating dominator trees for a fast, verified dominance test, ITP, vol.9236, pp.84-99, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01193281

B. Baudin, J. C. Filliâtre, T. Hubert, C. Marché, B. Monate et al., ACSL: ANSI/ISO C Specification Language, 2016.

W. David, K. B. Binkley, and . Gallagher, Program slicing. Advances in Computers, vol.43, pp.1-50, 1996.

W. Bgh-+-14]-david, N. Binkley, M. Gold, . Harman, S. Syed et al., ORBS: language-independent program slicing, SIGSOFT FSE, pp.109-120, 2014.

T. Ball and S. Horwitz, Slicing programs with arbitrary control-flow, AADEBUG 1993, 1993.
DOI : 10.1007/bfb0019410
URL : https://minds.wisconsin.edu/bitstream/1793/59686/1/TR1128.pdf

D. Binkley and M. Harman, A survey of empirical results on program slicing, Advances in Computers, vol.62, pp.105-178, 2004.

D. W. Binkley, S. Horwitz, and T. W. Reps, Program integration for languages with procedure calls, ACM Trans. Softw. Eng. Methodol, vol.4, issue.1, pp.3-35, 1995.
DOI : 10.1145/201055.201056

D. W. Binkley, The application of program slicing to regression testing, Information & Software Technology, vol.40, pp.583-594, 1998.

S. Blazy, A. Maroneze, and D. Pichardie, Verified validation of program slicing, CPP 2015, pp.109-117, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01110821

G. Bilardi and K. Pingali, Generalized dominance and control dependence, PLDI, pp.291-300, 1996.

P. Cousot and R. Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, the 4th Symposium on Principles of Programming Languages (POPL 1977), pp.238-252, 1977.

]. O. Chebaro, P. Cuoq, N. Kosmatov, B. Marre, A. Pacalet et al., Behind the scenes in SANTE: a combination of static and dynamic analyses, Autom. Softw. Eng, vol.21, issue.1, pp.107-143, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00818147

G. Canfora, A. Cimitile, and A. D. Lucia, Conditioned program slicing. Information & Software Technology, vol.40, pp.595-607, 1998.
DOI : 10.1016/s0950-5849(98)00086-x

E. M. Clarke, E. A. Emerson, and A. P. Sistla, Automatic verification of finite-state concurrent systems using temporal logic specifications, ACM Trans. Program. Lang. Syst, vol.8, issue.2, pp.244-263, 1986.

R. Cartwright and M. Felleisen, The semantics of program dependence, PLDI 1989, 1989.

J. Sylvain-conchon, J. Filliâtre, and . Signoles, Designing a generic graph library using ML functors, Trends in Functional Programming, vol.8, pp.124-140, 2007.

J. Joseph, J. M. Comuzzi, and . Hart, Program slicing using weakest preconditions, FME, vol.1051, pp.557-575, 1996.

T. J. Keith-d-cooper, K. Harvey, and . Kennedy, A simple, fast dominance algorithm, Software Practice & Experience, vol.4, issue.1, pp.1-8, 2001.

O. Chebaro, N. Kosmatov, A. Giorgetti, and J. Julliand, Program slicing enhances a verification technique combining static and dynamic analysis, SAC 2012, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00746814

, The Coq Development Team. The Coq proof assistant, 2017.

, CVC4, the smt solver, v1.5, 2017.

M. Chalupa, M. Vitovská, and J. Strej?ek, SYMBIOTIC 5: Boosted instrumentation-(competition contribution), TACAS, vol.10806, pp.442-446, 2018.
DOI : 10.1007/978-3-319-89963-3_29
URL : https://link.springer.com/content/pdf/10.1007%2F978-3-319-89963-3_29.pdf

S. Danicic, R. W. Barraclough, M. Harman, J. Howroyd, Á. Kiss et al., A unifying theory of control dependence and its application to arbitrary program structures, Theor. Comput. Sci, vol.412, issue.49, pp.6809-6842, 2011.

D. E. Denning and P. J. Denning, Certification of programs for secure information flow, Commun. ACM, vol.20, issue.7, pp.504-513, 1977.

C. Dubois, S. Elloumi, B. Robillard, and C. Vincent, Graphes et couplages en Coq, Vingt-sixièmes Journées Francophones des Langages Applicatifs, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01099140

L. Mendonça-de-moura and N. Bjørner, Z3: an efficient SMT solver, TACAS, vol.4963, pp.337-340, 2008.

. The-e-theorem and . Prover, , 2017.

W. Fraczak, L. Georgiadis, A. Miller, and R. E. Tarjan, Finding dominators via disjoint set union, 23rd International Workshop on Combinatorial Algorithms, vol.23, 2013.
DOI : 10.1016/j.jda.2013.10.003
URL : https://doi.org/10.1016/j.jda.2013.10.003

J. Ferrante, K. J. Ottenstein, and J. D. Warren, The program dependence graph and its use in optimization, ACM Trans. Program. Lang. Syst, vol.9, issue.3, pp.319-349, 1987.
DOI : 10.1007/3-540-12925-1_33
URL : http://www.cs.utexas.edu/users/less/reading/spring00/ferrante.pdf

J. , C. Filliâtre, and A. Paskevich, Why3-where programs meet provers, ESOP, vol.7792, pp.125-128, 2013.

J. Field, G. Ramalingam, and F. Tip, Parametric program slicing, POPL, pp.379-392, 1995.
DOI : 10.1145/199448.199534

, Free Software Foundation, 2007.

B. Keith, J. R. Gallagher, and . Lyle, Using program slicing in software maintenance, IEEE Trans. Software Eng, vol.17, issue.8, pp.751-761, 1991.

R. Giacobazzi and I. Mastroeni, Non-standard semantics for program slicing. Higher-Order and Symbolic Computation, vol.16, pp.297-339, 2003.
DOI : 10.1023/a:1025872819613

G. Gonthier, Formal proof-the four-color theorem, Notices of the AMS, vol.55, issue.11, pp.1382-1393, 2008.

L. Georgiadis, R. E. Tarjan, R. Fonseca, and F. , Werneck. Finding dominators in practice, J. Graph Algorithms Appl, vol.10, issue.1, pp.69-94, 2006.

X. Ge, K. Taneja, T. Xie, and N. Tillmann, DyTa: dynamic symbolic execution guided with static verification results, the 33rd International Conference on Software Engineering (ICSE 2011), pp.992-994, 2011.

M. Harman, D. Binkley, S. Hatcliff, J. C. Corbett, M. B. Dwyer et al., A formal study of slicing for multithreaded programs with JVM concurrency primitives, SAS, vol.68, pp.1-18, 1999.

M. Harman and S. Danicic, Using program slicing to simplify testing, Softw. Test., Verif. Reliab, vol.5, issue.3, pp.143-162, 1995.
DOI : 10.1002/stvr.4370050303

R. M. Hierons, M. Harman, and S. Danicic, Using program slicing to assist in the detection of equivalent mutants, Softw. Test., Verif. Reliab, vol.9, issue.4, pp.233-262, 1999.

C. A. Hoare, An axiomatic basis for computer programming, Communications of the ACM, vol.12, issue.10, pp.567-580, 1969.
DOI : 10.1145/357980.358001

S. Horwitz, T. Reps, and D. Binkley, Interprocedural slicing using dependence graphs, PLDI 1988, 1988.
DOI : 10.1145/989393.989419
URL : https://minds.wisconsin.edu/bitstream/1793/58948/1/TR756.pdf

M. Harman, D. Simpson, and S. Danicic, Slicing programs in the presence of errors, Formal Aspects of Computing, vol.8, issue.4, pp.490-497, 1996.

J. Jourdan, V. Laporte, S. Blazy, X. Leroy, and D. Pichardie, A formally-verified C static analyzer, POPL, pp.247-259, 2015.
DOI : 10.1145/2775051.2676966
URL : https://hal.archives-ouvertes.fr/hal-01078386

J. C. King, Symbolic execution and program testing, Commun. ACM, vol.19, issue.7, pp.385-394, 1976.

. Kkp-+-15]-florent, N. Kirchner, V. Kosmatov, J. Prevosto, B. Signoles et al., Frama-C: A software analysis perspective, Formal Asp. Comput, vol.27, issue.3, pp.573-609, 2015.

B. Korel and J. W. Laski, Dynamic program slicing, Inf. Process. Lett, vol.29, issue.3, pp.155-163, 1988.
DOI : 10.1016/0020-0190(88)90054-3
URL : http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.158.9078&rep=rep1&type=pdf

S. Kusumoto and A. Nishimatsu, Keisuke Nishie, and Katsuro Inoue. Experimental evaluation of program slicing for fault localization, Empirical Software Engineering, vol.7, issue.1, pp.49-76, 2002.

B. Korel and J. Rilling, Program slicing in understanding of large programs, IWPC, pp.145-152, 1998.

J. Krinke, Program slicing, Handbook Of Software Engineering And Knowledge Engineering, vol.3, pp.307-332, 2005.

. Wan-kwon-lee, Gwang Sik Yoon, and Yong Rae Kwon. Specification-based program slicing and its applications, Sang Chung, vol.47, pp.427-443, 2001.

J. Léchenet, Formalization of relaxed slicing, 2016.

J. Léchenet, Formalization of weak control dependence, 2018.

X. Leroy, Formal verification of a realistic compiler, Commun. ACM, vol.52, issue.7, pp.107-115, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00415861

J. L. Lions, Ariane 5 Flight 501 Failure-Report by the Inquiry Board, 1996.

J. Léchenet, N. Kosmatov, and P. L. Gall, Coq a dit : fromage tranché ne peut cacher ses trous, Vingtseptièmes Journées Francophones des Langages Applicatifs, 2016.

J. Léchenet, N. Kosmatov, and P. L. Gall, Cut branches before looking for bugs: Sound verification on relaxed slices, FASE'16 (Part of ETAPS'16), pp.179-196, 2016.

J. Léchenet, N. Kosmatov, and P. L. Gall, Cut branches before looking for bugs: certifiably sound verification on relaxed slices. Formal Aspects of Computing, vol.30, pp.107-131, 2018.

J. Léchenet, N. Kosmatov, and P. L. Gall, Why3 a dit : gardez le contrôle en toute situation, Vingt-neuvièmes Journées Francophones des Langages Applicatifs (JFLA 2018), pp.219-225, 2018.

J. Léchenet, N. Kosmatov, and P. L. Gall, Fast Computation of Arbitrary Control Dependencies, FASE'18 (Part of ETAPS'18), pp.207-224, 2018.

T. Lengauer and R. E. Tarjan, A fast algorithm for finding dominators in a flowgraph, ACM Trans. Program. Lang. Syst, vol.1, issue.1, pp.121-141, 1979.

I. Mastroeni and D. Zanardini, Abstract program slicing: An abstract interpretation-based approach to program slicing, ACM Trans. Comput. Log, vol.18, issue.1, 2017.

H. Nestra, Transfinite semantics in the form of greatest fixpoint, J. Log. Algebr. Program, vol.78, issue.7, pp.573-592, 2009.

F. Nielson, R. Hanne, C. Nielson, and . Hankin, Principles of Program Analysis, 1999.

K. J. Ottenstein and L. M. Ottenstein, The program dependence graph in a software development environment, the First ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments (SDE 1984), pp.177-184, 1984.

A. Podgurski and L. A. Clarke, A formal model of program dependences and its implications for software testing, debugging, and maintenance, IEEE Trans. Software Eng, vol.16, issue.9, pp.965-979, 1990.

C. Benjamin, C. Pierce, M. Casinghino, M. Gaboardi, C. Greenberg et al., Software foundations 3.2, 2015.

K. Pan, S. Kim, and E. J. Whitehead, Bug classification using program slicing metrics, SCAM, pp.31-42, 2006.

T. Venkatesh-prasad-ranganath, A. Amtoft, J. Banerjee, M. B. Hatcliff, and . Dwyer, A new foundation for control dependence and slicing for modern program structures, ACM Trans. Program. Lang. Syst, vol.29, issue.5, 2007.

W. Thomas, T. Reps, and . Bricker, Illustrating interference in interfering versions of programs, SCM, pp.46-55, 1989.

P. Venkatesh, J. Ranganath, and . Hatcliff, Slicing concurrent java programs using indus and kaveri, International Journal on Software Tools for Technology Transfer, vol.9, issue.5, pp.489-504, 2007.

X. Rival, Understanding the origin of alarms in astrée, SAS, vol.3672, pp.303-319

. Springer, , 2005.

W. Thomas, W. Reps, and . Yang, The semantics of program slicing and program integration, TAPSOFT 1989, 1989.

S. Schulz, System description: E 1.8. In LPAR, vol.8312, pp.735-743, 2013.

J. Silva, A vocabulary of program slicing-based techniques, ACM Comput. Surv, vol.44, issue.3, p.12, 2012.

J. Slabý, J. Strej?ek, and M. Trtík, Checking properties described by state machines: On synergy of instrumentation, slicing, and symbolic execution, FMICS, vol.7437, pp.207-221, 2012.

J. Slaby, J. Strej?ek, and M. Trtík, Symbiotic: Synergy of instrumentation, slicing, and symbolic execution-(competition contribution), TACAS, vol.7795, pp.630-632, 2013.

F. Tip, A survey of program slicing techniques, J. Prog. Lang, vol.3, issue.3, 1995.

G. A. Venkatesh, The semantic approach to program slicing, PLDI, pp.107-119, 1991.

D. Wasserrab, From formal semantics to verified slicing: a modular framework with applications in language based security, Karlsruhe Inst. of Techn, 2011.

M. Weiser, Program slicing, ICSE 1981, 1981.

M. Weiser, Programmers use slices when debugging, Commun. ACM, vol.25, issue.7, pp.446-452, 1982.

M. Weiser, Program slicing, IEEE Trans. Software Eng, vol.10, issue.4, pp.352-357, 1984.

, Why3, a tool for deductive program verification, GNU LGPL 2.1, development version, 2018.

D. Wasserrab, D. Lohner, and G. Snelting, On pdg-based noninterference and its modular proof, PLAS, pp.31-44, 2009.

P. Martin, H. Ward, and . Zedan, Slicing as a program transformation, ACM Trans. Program. Lang. Syst, vol.29, issue.2, p.7, 2007.

. Xqz-+-05]-baowen, J. Xu, X. Qian, Z. Zhang, L. Wu et al., A brief survey of program slicing, ACM SIGSOFT Software Engineering Notes, vol.30, issue.2, pp.1-36, 2005.

, The Z3 Theorem Prover, v4.5.0, 2016.