Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(SAT solvers). Showing records 1 – 11 of 11 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Univerzitet u Beogradu

1. Banković, Milan M., 1982-. Унапређивање SMT решаваче коришћењем CSP техника и техника паралелизације.

Degree: Matematički fakultet, 2017, Univerzitet u Beogradu

Рачунарство - Аутоматско резоновање / Computer science - Automated reasoning

SMT решавачи имплементирају процедуре одлучивања за испитивање задовољивости логичких формула првог реда у односу на… (more)

Subjects/Keywords: computer science; automated reasoning; SAT solvers; SMT solvers; CSP solvers; parallelization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Banković, Milan M., 1. (2017). Унапређивање SMT решаваче коришћењем CSP техника и техника паралелизације. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:15293/bdef:Content/get

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Banković, Milan M., 1982-. “Унапређивање SMT решаваче коришћењем CSP техника и техника паралелизације.” 2017. Thesis, Univerzitet u Beogradu. Accessed December 13, 2018. https://fedorabg.bg.ac.rs/fedora/get/o:15293/bdef:Content/get.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Banković, Milan M., 1982-. “Унапређивање SMT решаваче коришћењем CSP техника и техника паралелизације.” 2017. Web. 13 Dec 2018.

Vancouver:

Banković, Milan M. 1. Унапређивање SMT решаваче коришћењем CSP техника и техника паралелизације. [Internet] [Thesis]. Univerzitet u Beogradu; 2017. [cited 2018 Dec 13]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:15293/bdef:Content/get.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Banković, Milan M. 1. Унапређивање SMT решаваче коришћењем CSP техника и техника паралелизације. [Thesis]. Univerzitet u Beogradu; 2017. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:15293/bdef:Content/get

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

2. Reis, Poliana Magalhães. Análise da distribuição do número de operações de resolvedores SAT.

Degree: Mestrado, Ciência da Computação, 2012, University of São Paulo

No estudo da complexidade de problemas computacionais destacam-se duas classes conhecidas como P e NP. A questao P=NP e um dos maiores problemas nao resolvidos… (more)

Subjects/Keywords: Chaff; Chaff; NP-complete; NP-completo; P=NP; P=NP; SAT; SAT; SAT Solvers; SAT Solvers; zChaff.; zChaff.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Reis, P. M. (2012). Análise da distribuição do número de operações de resolvedores SAT. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-21012013-220441/ ;

Chicago Manual of Style (16th Edition):

Reis, Poliana Magalhães. “Análise da distribuição do número de operações de resolvedores SAT.” 2012. Masters Thesis, University of São Paulo. Accessed December 13, 2018. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-21012013-220441/ ;.

MLA Handbook (7th Edition):

Reis, Poliana Magalhães. “Análise da distribuição do número de operações de resolvedores SAT.” 2012. Web. 13 Dec 2018.

Vancouver:

Reis PM. Análise da distribuição do número de operações de resolvedores SAT. [Internet] [Masters thesis]. University of São Paulo; 2012. [cited 2018 Dec 13]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-21012013-220441/ ;.

Council of Science Editors:

Reis PM. Análise da distribuição do número de operações de resolvedores SAT. [Masters Thesis]. University of São Paulo; 2012. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-21012013-220441/ ;


University of Waterloo

3. Zulkoski, Edward. Understanding and Enhancing CDCL-based SAT Solvers.

Degree: 2018, University of Waterloo

 Modern conflict-driven clause-learning (CDCL) Boolean satisfiability (SAT) solvers routinely solve formulas from industrial domains with millions of variables and clauses, despite the Boolean satisfiability problem… (more)

Subjects/Keywords: SAT Solvers; Backdoors; Computer Algebra Systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zulkoski, E. (2018). Understanding and Enhancing CDCL-based SAT Solvers. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13525

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Zulkoski, Edward. “Understanding and Enhancing CDCL-based SAT Solvers.” 2018. Thesis, University of Waterloo. Accessed December 13, 2018. http://hdl.handle.net/10012/13525.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Zulkoski, Edward. “Understanding and Enhancing CDCL-based SAT Solvers.” 2018. Web. 13 Dec 2018.

Vancouver:

Zulkoski E. Understanding and Enhancing CDCL-based SAT Solvers. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2018 Dec 13]. Available from: http://hdl.handle.net/10012/13525.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zulkoski E. Understanding and Enhancing CDCL-based SAT Solvers. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13525

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Texas – Austin

4. Lierler, Yuliya. SAT-based answer set programming.

Degree: Computer Sciences, 2010, University of Texas – Austin

 Answer set programming (ASP) is a declarative programming paradigm oriented towards difficult combinatorial search problems. Syntactically, ASP programs look like Prolog programs, but solutions are… (more)

Subjects/Keywords: Answer set programming; Logic programming; Propositional satisfiability; Answer set solvers; SAT; SAT solvers; Smodels; Cmodels

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lierler, Y. (2010). SAT-based answer set programming. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2010-05-888

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lierler, Yuliya. “SAT-based answer set programming.” 2010. Thesis, University of Texas – Austin. Accessed December 13, 2018. http://hdl.handle.net/2152/ETD-UT-2010-05-888.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lierler, Yuliya. “SAT-based answer set programming.” 2010. Web. 13 Dec 2018.

Vancouver:

Lierler Y. SAT-based answer set programming. [Internet] [Thesis]. University of Texas – Austin; 2010. [cited 2018 Dec 13]. Available from: http://hdl.handle.net/2152/ETD-UT-2010-05-888.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lierler Y. SAT-based answer set programming. [Thesis]. University of Texas – Austin; 2010. Available from: http://hdl.handle.net/2152/ETD-UT-2010-05-888

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


EPFL

5. Petkovska, Ana. Exploiting Satisfiability Solvers for Efficient Logic Synthesis.

Degree: 2017, EPFL

 Logic synthesis is an important part of electronic design automation (EDA) flows, which enable the implementation of digital systems. As the design size and complexity… (more)

Subjects/Keywords: electronic design automation; logic synthesis; Boolean satisfiability; SAT solvers

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Petkovska, A. (2017). Exploiting Satisfiability Solvers for Efficient Logic Synthesis. (Thesis). EPFL. Retrieved from http://infoscience.epfl.ch/record/231150

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Petkovska, Ana. “Exploiting Satisfiability Solvers for Efficient Logic Synthesis.” 2017. Thesis, EPFL. Accessed December 13, 2018. http://infoscience.epfl.ch/record/231150.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Petkovska, Ana. “Exploiting Satisfiability Solvers for Efficient Logic Synthesis.” 2017. Web. 13 Dec 2018.

Vancouver:

Petkovska A. Exploiting Satisfiability Solvers for Efficient Logic Synthesis. [Internet] [Thesis]. EPFL; 2017. [cited 2018 Dec 13]. Available from: http://infoscience.epfl.ch/record/231150.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Petkovska A. Exploiting Satisfiability Solvers for Efficient Logic Synthesis. [Thesis]. EPFL; 2017. Available from: http://infoscience.epfl.ch/record/231150

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Univerzitet u Beogradu

6. Nikolić, Mladen S. Usmeravanje pretrage u automatskom dokazivanju teorema.

Degree: Matematički fakultet, 2015, Univerzitet u Beogradu

Računarstvo-Automatsko dokazivanje teorema / computer science-Automated theorem proving

U ovom radu se razmatra problem usmeravanja pretrage u automatskom dokazivanju teorema. Rad se sastoji od dva… (more)

Subjects/Keywords: automated theorem proving; search; SAT solvers; coherent logic; data mining

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Nikolić, M. S. (2015). Usmeravanje pretrage u automatskom dokazivanju teorema. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:8050/bdef:Content/get

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Nikolić, Mladen S. “Usmeravanje pretrage u automatskom dokazivanju teorema.” 2015. Thesis, Univerzitet u Beogradu. Accessed December 13, 2018. https://fedorabg.bg.ac.rs/fedora/get/o:8050/bdef:Content/get.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Nikolić, Mladen S. “Usmeravanje pretrage u automatskom dokazivanju teorema.” 2015. Web. 13 Dec 2018.

Vancouver:

Nikolić MS. Usmeravanje pretrage u automatskom dokazivanju teorema. [Internet] [Thesis]. Univerzitet u Beogradu; 2015. [cited 2018 Dec 13]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:8050/bdef:Content/get.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Nikolić MS. Usmeravanje pretrage u automatskom dokazivanju teorema. [Thesis]. Univerzitet u Beogradu; 2015. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:8050/bdef:Content/get

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


McMaster University

7. Bergstra, Jameson P. A Formal Approach to Concurrent Error Detection in FPGA LUTs.

Degree: MASc, 2012, McMaster University

In this thesis we discuss a formal approach to the design of concurrent error detection (CED) logic in field-programmable gate arrays (FPGAs). Single event… (more)

Subjects/Keywords: SEUs; Error Detection; SAT solvers; Synthesis; Digital Circuits; Digital Circuits

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bergstra, J. P. (2012). A Formal Approach to Concurrent Error Detection in FPGA LUTs. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/12555

Chicago Manual of Style (16th Edition):

Bergstra, Jameson P. “A Formal Approach to Concurrent Error Detection in FPGA LUTs.” 2012. Masters Thesis, McMaster University. Accessed December 13, 2018. http://hdl.handle.net/11375/12555.

MLA Handbook (7th Edition):

Bergstra, Jameson P. “A Formal Approach to Concurrent Error Detection in FPGA LUTs.” 2012. Web. 13 Dec 2018.

Vancouver:

Bergstra JP. A Formal Approach to Concurrent Error Detection in FPGA LUTs. [Internet] [Masters thesis]. McMaster University; 2012. [cited 2018 Dec 13]. Available from: http://hdl.handle.net/11375/12555.

Council of Science Editors:

Bergstra JP. A Formal Approach to Concurrent Error Detection in FPGA LUTs. [Masters Thesis]. McMaster University; 2012. Available from: http://hdl.handle.net/11375/12555


University of Colorado

8. Han, Hyojung. Increasing The Effectiveness of Deduction in Propositional SAT Solvers.

Degree: PhD, Electrical, Computer & Energy Engineering, 2011, University of Colorado

  The satisfiability (SAT) of a propositional formula is the decision problem to determine whether there is a satisfying assignment that can make the formula… (more)

Subjects/Keywords: CNF; Deductive Power; Dominators; DPLL; Formal Verification; SAT solvers; Computer Sciences; Electrical and Computer Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Han, H. (2011). Increasing The Effectiveness of Deduction in Propositional SAT Solvers. (Doctoral Dissertation). University of Colorado. Retrieved from http://scholar.colorado.edu/ecen_gradetds/22

Chicago Manual of Style (16th Edition):

Han, Hyojung. “Increasing The Effectiveness of Deduction in Propositional SAT Solvers.” 2011. Doctoral Dissertation, University of Colorado. Accessed December 13, 2018. http://scholar.colorado.edu/ecen_gradetds/22.

MLA Handbook (7th Edition):

Han, Hyojung. “Increasing The Effectiveness of Deduction in Propositional SAT Solvers.” 2011. Web. 13 Dec 2018.

Vancouver:

Han H. Increasing The Effectiveness of Deduction in Propositional SAT Solvers. [Internet] [Doctoral dissertation]. University of Colorado; 2011. [cited 2018 Dec 13]. Available from: http://scholar.colorado.edu/ecen_gradetds/22.

Council of Science Editors:

Han H. Increasing The Effectiveness of Deduction in Propositional SAT Solvers. [Doctoral Dissertation]. University of Colorado; 2011. Available from: http://scholar.colorado.edu/ecen_gradetds/22


University of Waterloo

9. Mendonca, Marcilio. Efficient Reasoning Techniques for Large Scale Feature Models.

Degree: 2009, University of Waterloo

 In Software Product Lines (SPLs), a feature model can be used to represent the similarities and differences within a family of software systems. This allows… (more)

Subjects/Keywords: Software Product Lines; Feature Models; Binary Decision Diagrams; SAT Solvers; Feature Model Reasoning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mendonca, M. (2009). Efficient Reasoning Techniques for Large Scale Feature Models. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/4201

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Mendonca, Marcilio. “Efficient Reasoning Techniques for Large Scale Feature Models.” 2009. Thesis, University of Waterloo. Accessed December 13, 2018. http://hdl.handle.net/10012/4201.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Mendonca, Marcilio. “Efficient Reasoning Techniques for Large Scale Feature Models.” 2009. Web. 13 Dec 2018.

Vancouver:

Mendonca M. Efficient Reasoning Techniques for Large Scale Feature Models. [Internet] [Thesis]. University of Waterloo; 2009. [cited 2018 Dec 13]. Available from: http://hdl.handle.net/10012/4201.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mendonca M. Efficient Reasoning Techniques for Large Scale Feature Models. [Thesis]. University of Waterloo; 2009. Available from: http://hdl.handle.net/10012/4201

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

10. Nabhani, Tarek. Symétries locales et globales en logique propositionnelle et leurs extensions aux logiques non monotones : Cognitive psychopathology of schizophrenics intentional processes in verbal interaction.

Degree: Docteur es, Informatique, 2011, Aix-Marseille 1

La symétrie est par définition un concept multidisciplinaire. Il apparaît dans de nombreux domaines. En général, elle revient à une transformation qui laisse invariant un… (more)

Subjects/Keywords: Problème SAT; Symétrie locales; Symétries sémantiques; Symétries syntaxiques; Solveurs CDCL; Logiques non monotones; Logiques préférentielles; X-logiques; Logiques des défauts; SAT problem; Local symmetry; Symantic symmetry; Syntaxic symmetry; CDCL solvers; Non-monotonic logics; Preferential logics; X-logics; Default logics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Nabhani, T. (2011). Symétries locales et globales en logique propositionnelle et leurs extensions aux logiques non monotones : Cognitive psychopathology of schizophrenics intentional processes in verbal interaction. (Doctoral Dissertation). Aix-Marseille 1. Retrieved from http://www.theses.fr/2011AIX10173

Chicago Manual of Style (16th Edition):

Nabhani, Tarek. “Symétries locales et globales en logique propositionnelle et leurs extensions aux logiques non monotones : Cognitive psychopathology of schizophrenics intentional processes in verbal interaction.” 2011. Doctoral Dissertation, Aix-Marseille 1. Accessed December 13, 2018. http://www.theses.fr/2011AIX10173.

MLA Handbook (7th Edition):

Nabhani, Tarek. “Symétries locales et globales en logique propositionnelle et leurs extensions aux logiques non monotones : Cognitive psychopathology of schizophrenics intentional processes in verbal interaction.” 2011. Web. 13 Dec 2018.

Vancouver:

Nabhani T. Symétries locales et globales en logique propositionnelle et leurs extensions aux logiques non monotones : Cognitive psychopathology of schizophrenics intentional processes in verbal interaction. [Internet] [Doctoral dissertation]. Aix-Marseille 1; 2011. [cited 2018 Dec 13]. Available from: http://www.theses.fr/2011AIX10173.

Council of Science Editors:

Nabhani T. Symétries locales et globales en logique propositionnelle et leurs extensions aux logiques non monotones : Cognitive psychopathology of schizophrenics intentional processes in verbal interaction. [Doctoral Dissertation]. Aix-Marseille 1; 2011. Available from: http://www.theses.fr/2011AIX10173

11. Krieger, Matthias. Test generation and animation based on object-oriented specifications : Génération de tests et animation à partir de spécifications orientées objet.

Degree: Docteur es, Informatique, 2011, Université Paris-Sud – Paris XI

L'objectif de cette thèse est l'assistance à la génération de tests et à l'animation de spécifications orientées objet. Nous cherchons en particulier à profiter de… (more)

Subjects/Keywords: Génération de tests; Animation; Execution de modèle; UML; OCL; Solveurs SAT; Isabelle/HOL; Test generation; Animation; Model Execution; UML; OCL; SAT solvers; Isabelle/HOL

…support based on SAT solvers. We show how SAT solvers, in particular SMT (satisfiability… …2012 Preliminaries 2.1 SAT and SMT Solving Satisfiability (SAT) solvers have had… …solving allows the efficiency of highly optimized Boolean SAT solvers to be exploited for… …in some publications and in the SMT-LIB standard. 2.1. SAT and SMT Solving 11 Solvers… …Isabelle have been created for several third-party theorem proving tools like SAT and SMT solvers… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Krieger, M. (2011). Test generation and animation based on object-oriented specifications : Génération de tests et animation à partir de spécifications orientées objet. (Doctoral Dissertation). Université Paris-Sud – Paris XI. Retrieved from http://www.theses.fr/2011PA112299

Chicago Manual of Style (16th Edition):

Krieger, Matthias. “Test generation and animation based on object-oriented specifications : Génération de tests et animation à partir de spécifications orientées objet.” 2011. Doctoral Dissertation, Université Paris-Sud – Paris XI. Accessed December 13, 2018. http://www.theses.fr/2011PA112299.

MLA Handbook (7th Edition):

Krieger, Matthias. “Test generation and animation based on object-oriented specifications : Génération de tests et animation à partir de spécifications orientées objet.” 2011. Web. 13 Dec 2018.

Vancouver:

Krieger M. Test generation and animation based on object-oriented specifications : Génération de tests et animation à partir de spécifications orientées objet. [Internet] [Doctoral dissertation]. Université Paris-Sud – Paris XI; 2011. [cited 2018 Dec 13]. Available from: http://www.theses.fr/2011PA112299.

Council of Science Editors:

Krieger M. Test generation and animation based on object-oriented specifications : Génération de tests et animation à partir de spécifications orientées objet. [Doctoral Dissertation]. Université Paris-Sud – Paris XI; 2011. Available from: http://www.theses.fr/2011PA112299

.