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:(Static verification). Showing records 1 – 30 of 67 total matches.

[1] [2] [3]

Search Limiters

Last 2 Years | English Only

Country

▼ Search Limiters


University of Sydney

1. Subotic, Pavle. Applying Elimination-Based Algorithms to Abstract Interpretation .

Degree: 2014, University of Sydney

 Unbounded abstract domains are used in static program analysis frameworks for representing ranges of variables, and their applications include elimination of assertions in programs, automatically… (more)

Subjects/Keywords: Static Analysis; Abstract Interpretation; Formal Verification; LLVM

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Subotic, P. (2014). Applying Elimination-Based Algorithms to Abstract Interpretation . (Thesis). University of Sydney. Retrieved from http://hdl.handle.net/2123/12052

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):

Subotic, Pavle. “Applying Elimination-Based Algorithms to Abstract Interpretation .” 2014. Thesis, University of Sydney. Accessed June 01, 2020. http://hdl.handle.net/2123/12052.

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

MLA Handbook (7th Edition):

Subotic, Pavle. “Applying Elimination-Based Algorithms to Abstract Interpretation .” 2014. Web. 01 Jun 2020.

Vancouver:

Subotic P. Applying Elimination-Based Algorithms to Abstract Interpretation . [Internet] [Thesis]. University of Sydney; 2014. [cited 2020 Jun 01]. Available from: http://hdl.handle.net/2123/12052.

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

Council of Science Editors:

Subotic P. Applying Elimination-Based Algorithms to Abstract Interpretation . [Thesis]. University of Sydney; 2014. Available from: http://hdl.handle.net/2123/12052

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


Virginia Tech

2. Kusano, Markus Jan Urban. Constraint-Based Thread-Modular Abstract Interpretation.

Degree: PhD, Electrical and Computer Engineering, 2018, Virginia Tech

 In this dissertation, I present a set of novel constraint-based thread-modular abstract-interpretation techniques for static analysis of concurrent programs. Specifically, I integrate a lightweight constraint… (more)

Subjects/Keywords: abstract interpretation; concurrency; verification; static analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kusano, M. J. U. (2018). Constraint-Based Thread-Modular Abstract Interpretation. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/84399

Chicago Manual of Style (16th Edition):

Kusano, Markus Jan Urban. “Constraint-Based Thread-Modular Abstract Interpretation.” 2018. Doctoral Dissertation, Virginia Tech. Accessed June 01, 2020. http://hdl.handle.net/10919/84399.

MLA Handbook (7th Edition):

Kusano, Markus Jan Urban. “Constraint-Based Thread-Modular Abstract Interpretation.” 2018. Web. 01 Jun 2020.

Vancouver:

Kusano MJU. Constraint-Based Thread-Modular Abstract Interpretation. [Internet] [Doctoral dissertation]. Virginia Tech; 2018. [cited 2020 Jun 01]. Available from: http://hdl.handle.net/10919/84399.

Council of Science Editors:

Kusano MJU. Constraint-Based Thread-Modular Abstract Interpretation. [Doctoral Dissertation]. Virginia Tech; 2018. Available from: http://hdl.handle.net/10919/84399

3. Weng, Min-Hsien. Efficient compilation of a verification-friendly programming language .

Degree: 2019, University of Waikato

 This thesis develops a compiler to convert a program written in the verification friendly programming language Whiley into an efficient implementation in C. Our compiler… (more)

Subjects/Keywords: Optimizing Compiler, Program Efficiency, Static Analysis, Formal Verification, Parallel Programming; Program Efficiency; Static Analysis; Formal Verification; Parallel Programming; thesis by publication

Page 1 Page 2

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Weng, M. (2019). Efficient compilation of a verification-friendly programming language . (Doctoral Dissertation). University of Waikato. Retrieved from http://hdl.handle.net/10289/12432

Chicago Manual of Style (16th Edition):

Weng, Min-Hsien. “Efficient compilation of a verification-friendly programming language .” 2019. Doctoral Dissertation, University of Waikato. Accessed June 01, 2020. http://hdl.handle.net/10289/12432.

MLA Handbook (7th Edition):

Weng, Min-Hsien. “Efficient compilation of a verification-friendly programming language .” 2019. Web. 01 Jun 2020.

Vancouver:

Weng M. Efficient compilation of a verification-friendly programming language . [Internet] [Doctoral dissertation]. University of Waikato; 2019. [cited 2020 Jun 01]. Available from: http://hdl.handle.net/10289/12432.

Council of Science Editors:

Weng M. Efficient compilation of a verification-friendly programming language . [Doctoral Dissertation]. University of Waikato; 2019. Available from: http://hdl.handle.net/10289/12432


Brno University of Technology

4. Krajčír, Stanislav. Sada příkladů pro demonstraci práce s platformou Questa: Questa Capabilities Demonstration Set.

Degree: 2019, Brno University of Technology

 This bachelor thesis deals with presentation of capabilities of verification platform Questa Static from Mentor Graphics company. The basic information about the principles of assertion… (more)

Subjects/Keywords: Verifikace založená na formálnich tvrzeních; Formálni verifikace; Questa Static; Assertion Based Verification; Formal Verification; Questa Static

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Krajčír, S. (2019). Sada příkladů pro demonstraci práce s platformou Questa: Questa Capabilities Demonstration Set. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/54967

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):

Krajčír, Stanislav. “Sada příkladů pro demonstraci práce s platformou Questa: Questa Capabilities Demonstration Set.” 2019. Thesis, Brno University of Technology. Accessed June 01, 2020. http://hdl.handle.net/11012/54967.

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

MLA Handbook (7th Edition):

Krajčír, Stanislav. “Sada příkladů pro demonstraci práce s platformou Questa: Questa Capabilities Demonstration Set.” 2019. Web. 01 Jun 2020.

Vancouver:

Krajčír S. Sada příkladů pro demonstraci práce s platformou Questa: Questa Capabilities Demonstration Set. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Jun 01]. Available from: http://hdl.handle.net/11012/54967.

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

Council of Science Editors:

Krajčír S. Sada příkladů pro demonstraci práce s platformou Questa: Questa Capabilities Demonstration Set. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/54967

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


University of California – San Diego

5. Vazou, Niki. Liquid Haskell: Haskell as a Theorem Prover.

Degree: Computer Science, 2016, University of California – San Diego

 Code deficiencies and bugs constitute an unavoidable part of software systems. In safety-critical systems, like aircrafts or medical equipment, even a single bug can lead… (more)

Subjects/Keywords: Computer science; Automatic Verification; Haskell; Programming Languages; Refinement Types; Static Verification; Type Systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vazou, N. (2016). Liquid Haskell: Haskell as a Theorem Prover. (Thesis). University of California – San Diego. Retrieved from http://www.escholarship.org/uc/item/8dm057ws

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):

Vazou, Niki. “Liquid Haskell: Haskell as a Theorem Prover.” 2016. Thesis, University of California – San Diego. Accessed June 01, 2020. http://www.escholarship.org/uc/item/8dm057ws.

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

MLA Handbook (7th Edition):

Vazou, Niki. “Liquid Haskell: Haskell as a Theorem Prover.” 2016. Web. 01 Jun 2020.

Vancouver:

Vazou N. Liquid Haskell: Haskell as a Theorem Prover. [Internet] [Thesis]. University of California – San Diego; 2016. [cited 2020 Jun 01]. Available from: http://www.escholarship.org/uc/item/8dm057ws.

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

Council of Science Editors:

Vazou N. Liquid Haskell: Haskell as a Theorem Prover. [Thesis]. University of California – San Diego; 2016. Available from: http://www.escholarship.org/uc/item/8dm057ws

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

6. Djaballah, Adel. Calcul par analyse intervalle de certificats de barrière pour les systèmes dynamiques hybrides : Computation of barrier certificates for dynamical hybrids systems using interval analysis.

Degree: Docteur es, Automatique, 2017, Université Paris-Saclay (ComUE)

 Cette thèse développe des outils permettant de prouver qu’un système dynamique est sûr. En supposant qu’une partie de l’espace d’état est dangereuse, un système dynamique… (more)

Subjects/Keywords: Système hybride; Verification formelle; Intervalle; Analyse statique; Hybrid systems; Formal verification; Interval; Static analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Djaballah, A. (2017). Calcul par analyse intervalle de certificats de barrière pour les systèmes dynamiques hybrides : Computation of barrier certificates for dynamical hybrids systems using interval analysis. (Doctoral Dissertation). Université Paris-Saclay (ComUE). Retrieved from http://www.theses.fr/2017SACLS195

Chicago Manual of Style (16th Edition):

Djaballah, Adel. “Calcul par analyse intervalle de certificats de barrière pour les systèmes dynamiques hybrides : Computation of barrier certificates for dynamical hybrids systems using interval analysis.” 2017. Doctoral Dissertation, Université Paris-Saclay (ComUE). Accessed June 01, 2020. http://www.theses.fr/2017SACLS195.

MLA Handbook (7th Edition):

Djaballah, Adel. “Calcul par analyse intervalle de certificats de barrière pour les systèmes dynamiques hybrides : Computation of barrier certificates for dynamical hybrids systems using interval analysis.” 2017. Web. 01 Jun 2020.

Vancouver:

Djaballah A. Calcul par analyse intervalle de certificats de barrière pour les systèmes dynamiques hybrides : Computation of barrier certificates for dynamical hybrids systems using interval analysis. [Internet] [Doctoral dissertation]. Université Paris-Saclay (ComUE); 2017. [cited 2020 Jun 01]. Available from: http://www.theses.fr/2017SACLS195.

Council of Science Editors:

Djaballah A. Calcul par analyse intervalle de certificats de barrière pour les systèmes dynamiques hybrides : Computation of barrier certificates for dynamical hybrids systems using interval analysis. [Doctoral Dissertation]. Université Paris-Saclay (ComUE); 2017. Available from: http://www.theses.fr/2017SACLS195

7. Carloto, Carlos José Abreu Dias da Silva. Towards a formally verified microkernel using the Frama-C toolset.

Degree: 2010, RCAAP

 This dissertation is included in the MSc course in Computer Science of the University of Beira Interior. It is a Formal Method’s related dissertation, where… (more)

Subjects/Keywords: Design by contract; Formal verification; xLuna; Formal methods; Frama-C; Hoare logic; Static verification; Deductive verification; Separation Kernel

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Carloto, C. J. A. D. d. S. (2010). Towards a formally verified microkernel using the Frama-C toolset. (Thesis). RCAAP. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:ubibliorum.ubi.pt:10400.6/3716

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):

Carloto, Carlos José Abreu Dias da Silva. “Towards a formally verified microkernel using the Frama-C toolset.” 2010. Thesis, RCAAP. Accessed June 01, 2020. http://www.rcaap.pt/detail.jsp?id=oai:ubibliorum.ubi.pt:10400.6/3716.

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

MLA Handbook (7th Edition):

Carloto, Carlos José Abreu Dias da Silva. “Towards a formally verified microkernel using the Frama-C toolset.” 2010. Web. 01 Jun 2020.

Vancouver:

Carloto CJADdS. Towards a formally verified microkernel using the Frama-C toolset. [Internet] [Thesis]. RCAAP; 2010. [cited 2020 Jun 01]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:ubibliorum.ubi.pt:10400.6/3716.

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

Council of Science Editors:

Carloto CJADdS. Towards a formally verified microkernel using the Frama-C toolset. [Thesis]. RCAAP; 2010. Available from: http://www.rcaap.pt/detail.jsp?id=oai:ubibliorum.ubi.pt:10400.6/3716

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


Louisiana State University

8. Lu, Zheng. Deductive formal verification of embedded systems.

Degree: PhD, Computer Sciences, 2012, Louisiana State University

 <div align = "justify"> We combine static analysis techniques with model-based deductive verification using SMT solvers to provide a framework that, given an analysis aspect… (more)

Subjects/Keywords: Coq; Static Code Analysis; Theorem Proving; Android; Formal Verification; SMT

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lu, Z. (2012). Deductive formal verification of embedded systems. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-11102012-171915 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1525

Chicago Manual of Style (16th Edition):

Lu, Zheng. “Deductive formal verification of embedded systems.” 2012. Doctoral Dissertation, Louisiana State University. Accessed June 01, 2020. etd-11102012-171915 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1525.

MLA Handbook (7th Edition):

Lu, Zheng. “Deductive formal verification of embedded systems.” 2012. Web. 01 Jun 2020.

Vancouver:

Lu Z. Deductive formal verification of embedded systems. [Internet] [Doctoral dissertation]. Louisiana State University; 2012. [cited 2020 Jun 01]. Available from: etd-11102012-171915 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1525.

Council of Science Editors:

Lu Z. Deductive formal verification of embedded systems. [Doctoral Dissertation]. Louisiana State University; 2012. Available from: etd-11102012-171915 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1525


University of Colorado

9. Blackshear, Samuel H. Flexible Goal-Directed Abstraction.

Degree: PhD, Computer Science, 2015, University of Colorado

Static program analysis is a powerful technique for bug-finding, verification, and program understanding. Yet static analyses remain conspicuously absent from the toolbox of the… (more)

Subjects/Keywords: Abstract interpretation; Static analysis; Verification; Android; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Blackshear, S. H. (2015). Flexible Goal-Directed Abstraction. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/csci_gradetds/103

Chicago Manual of Style (16th Edition):

Blackshear, Samuel H. “Flexible Goal-Directed Abstraction.” 2015. Doctoral Dissertation, University of Colorado. Accessed June 01, 2020. https://scholar.colorado.edu/csci_gradetds/103.

MLA Handbook (7th Edition):

Blackshear, Samuel H. “Flexible Goal-Directed Abstraction.” 2015. Web. 01 Jun 2020.

Vancouver:

Blackshear SH. Flexible Goal-Directed Abstraction. [Internet] [Doctoral dissertation]. University of Colorado; 2015. [cited 2020 Jun 01]. Available from: https://scholar.colorado.edu/csci_gradetds/103.

Council of Science Editors:

Blackshear SH. Flexible Goal-Directed Abstraction. [Doctoral Dissertation]. University of Colorado; 2015. Available from: https://scholar.colorado.edu/csci_gradetds/103


University of Waterloo

10. Kuderski, Jakub. Scalable Context-Sensitive Pointer Analysis for LLVM.

Degree: 2019, University of Waterloo

 Pointer analysis is indispensable for effectively verifying heap-manipulating programs. Even though it has been studied extensively, there are no publicly available pointer analyses for low-level… (more)

Subjects/Keywords: pointer analysis; alias analysis; LLVM; program analysis; program verification; static analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kuderski, J. (2019). Scalable Context-Sensitive Pointer Analysis for LLVM. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14875

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):

Kuderski, Jakub. “Scalable Context-Sensitive Pointer Analysis for LLVM.” 2019. Thesis, University of Waterloo. Accessed June 01, 2020. http://hdl.handle.net/10012/14875.

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

MLA Handbook (7th Edition):

Kuderski, Jakub. “Scalable Context-Sensitive Pointer Analysis for LLVM.” 2019. Web. 01 Jun 2020.

Vancouver:

Kuderski J. Scalable Context-Sensitive Pointer Analysis for LLVM. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2020 Jun 01]. Available from: http://hdl.handle.net/10012/14875.

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

Council of Science Editors:

Kuderski J. Scalable Context-Sensitive Pointer Analysis for LLVM. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/14875

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


University of Melbourne

11. Neelofar. Spectrum-based fault localization using machine learning.

Degree: 2017, University of Melbourne

 Debugging is critical in the production of reliable software. One of the effective bug localization techniques is Spectrum-based Fault Localization (SBFL). This technique locates a… (more)

Subjects/Keywords: SBFL; Debugging and Verification, Software Testing; Static and Dynamic Analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Neelofar. (2017). Spectrum-based fault localization using machine learning. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/212432

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16th Edition):

Neelofar. “Spectrum-based fault localization using machine learning.” 2017. Doctoral Dissertation, University of Melbourne. Accessed June 01, 2020. http://hdl.handle.net/11343/212432.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7th Edition):

Neelofar. “Spectrum-based fault localization using machine learning.” 2017. Web. 01 Jun 2020.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

Neelofar. Spectrum-based fault localization using machine learning. [Internet] [Doctoral dissertation]. University of Melbourne; 2017. [cited 2020 Jun 01]. Available from: http://hdl.handle.net/11343/212432.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

Neelofar. Spectrum-based fault localization using machine learning. [Doctoral Dissertation]. University of Melbourne; 2017. Available from: http://hdl.handle.net/11343/212432

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

12. Settenvini, Matteo. Algorithmic Analysis of Name-Bounded Programs : From Java programs to Petri Nets via π-calculus.

Degree: 2014, , Department of Software Engineering

Context. Name-bounded analysis is a type of static analysis that allows us to take a concurrent program, abstract away from it, and check for… (more)

Subjects/Keywords: pi-calculus; static verification; static analysis; concurrency; petri nets; name boundedness; Information Systems; Systemvetenskap, informationssystem och informatik; Software Engineering; Programvaruteknik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Settenvini, M. (2014). Algorithmic Analysis of Name-Bounded Programs : From Java programs to Petri Nets via π-calculus. (Thesis). , Department of Software Engineering. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:bth-3112

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):

Settenvini, Matteo. “Algorithmic Analysis of Name-Bounded Programs : From Java programs to Petri Nets via π-calculus.” 2014. Thesis, , Department of Software Engineering. Accessed June 01, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-3112.

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

MLA Handbook (7th Edition):

Settenvini, Matteo. “Algorithmic Analysis of Name-Bounded Programs : From Java programs to Petri Nets via π-calculus.” 2014. Web. 01 Jun 2020.

Vancouver:

Settenvini M. Algorithmic Analysis of Name-Bounded Programs : From Java programs to Petri Nets via π-calculus. [Internet] [Thesis]. , Department of Software Engineering; 2014. [cited 2020 Jun 01]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-3112.

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

Council of Science Editors:

Settenvini M. Algorithmic Analysis of Name-Bounded Programs : From Java programs to Petri Nets via π-calculus. [Thesis]. , Department of Software Engineering; 2014. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-3112

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


Louisiana State University

13. Chen, Hongyi. Program analysis : termination proofs for Linear Simple Loops.

Degree: PhD, Computer Sciences, 2012, Louisiana State University

 Termination proof synthesis for simple loops, i.e., loops with only conjoined constraints in the loop guard and variable updates in the loop body, is the… (more)

Subjects/Keywords: Formal Verification; Static Analysis; Termination Proofs; Linear Simple Loops; Disjunctive Ranking Relation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, H. (2012). Program analysis : termination proofs for Linear Simple Loops. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-01222013-102917 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3093

Chicago Manual of Style (16th Edition):

Chen, Hongyi. “Program analysis : termination proofs for Linear Simple Loops.” 2012. Doctoral Dissertation, Louisiana State University. Accessed June 01, 2020. etd-01222013-102917 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3093.

MLA Handbook (7th Edition):

Chen, Hongyi. “Program analysis : termination proofs for Linear Simple Loops.” 2012. Web. 01 Jun 2020.

Vancouver:

Chen H. Program analysis : termination proofs for Linear Simple Loops. [Internet] [Doctoral dissertation]. Louisiana State University; 2012. [cited 2020 Jun 01]. Available from: etd-01222013-102917 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3093.

Council of Science Editors:

Chen H. Program analysis : termination proofs for Linear Simple Loops. [Doctoral Dissertation]. Louisiana State University; 2012. Available from: etd-01222013-102917 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3093


Universidade Nova

14. Ferreira, Paulo Jorge Abreu Duarte. Information flow analysis using data-dependent logical propositions.

Degree: 2012, Universidade Nova

Dissertação para obtenção do Grau de Mestre em Engenharia Informática

A significant number of today’s software systems are designed around database systems that store business… (more)

Subjects/Keywords: Programming language; Static verification; Security policies; Informationflow analysis; Type system; Data manipulation primitives

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ferreira, P. J. A. D. (2012). Information flow analysis using data-dependent logical propositions. (Thesis). Universidade Nova. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/8451

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):

Ferreira, Paulo Jorge Abreu Duarte. “Information flow analysis using data-dependent logical propositions.” 2012. Thesis, Universidade Nova. Accessed June 01, 2020. http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/8451.

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

MLA Handbook (7th Edition):

Ferreira, Paulo Jorge Abreu Duarte. “Information flow analysis using data-dependent logical propositions.” 2012. Web. 01 Jun 2020.

Vancouver:

Ferreira PJAD. Information flow analysis using data-dependent logical propositions. [Internet] [Thesis]. Universidade Nova; 2012. [cited 2020 Jun 01]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/8451.

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

Council of Science Editors:

Ferreira PJAD. Information flow analysis using data-dependent logical propositions. [Thesis]. Universidade Nova; 2012. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/8451

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

15. NORMAN HUGH ANDERSON. Exploring linear size-change terminating programs.

Degree: 2007, National University of Singapore

Subjects/Keywords: Program verification; termination; runtime; static analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

ANDERSON, N. H. (2007). Exploring linear size-change terminating programs. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/13016

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):

ANDERSON, NORMAN HUGH. “Exploring linear size-change terminating programs.” 2007. Thesis, National University of Singapore. Accessed June 01, 2020. http://scholarbank.nus.edu.sg/handle/10635/13016.

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

MLA Handbook (7th Edition):

ANDERSON, NORMAN HUGH. “Exploring linear size-change terminating programs.” 2007. Web. 01 Jun 2020.

Vancouver:

ANDERSON NH. Exploring linear size-change terminating programs. [Internet] [Thesis]. National University of Singapore; 2007. [cited 2020 Jun 01]. Available from: http://scholarbank.nus.edu.sg/handle/10635/13016.

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

Council of Science Editors:

ANDERSON NH. Exploring linear size-change terminating programs. [Thesis]. National University of Singapore; 2007. Available from: http://scholarbank.nus.edu.sg/handle/10635/13016

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


University of Central Florida

16. Sanchez Salazar, Jose. Reasoning Tradeoffs in Implicit Invocation and Aspect Oriented Languages.

Degree: 2015, University of Central Florida

 To reason about a program means to state or conclude, by logical means, some properties the program exhibits; like its correctness according to certain expected… (more)

Subjects/Keywords: Program reasoning; static verification; implicit invocation; aspect orientation; ptolemy language; jml; events; Computer Sciences; Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sanchez Salazar, J. (2015). Reasoning Tradeoffs in Implicit Invocation and Aspect Oriented Languages. (Doctoral Dissertation). University of Central Florida. Retrieved from https://stars.library.ucf.edu/etd/1174

Chicago Manual of Style (16th Edition):

Sanchez Salazar, Jose. “Reasoning Tradeoffs in Implicit Invocation and Aspect Oriented Languages.” 2015. Doctoral Dissertation, University of Central Florida. Accessed June 01, 2020. https://stars.library.ucf.edu/etd/1174.

MLA Handbook (7th Edition):

Sanchez Salazar, Jose. “Reasoning Tradeoffs in Implicit Invocation and Aspect Oriented Languages.” 2015. Web. 01 Jun 2020.

Vancouver:

Sanchez Salazar J. Reasoning Tradeoffs in Implicit Invocation and Aspect Oriented Languages. [Internet] [Doctoral dissertation]. University of Central Florida; 2015. [cited 2020 Jun 01]. Available from: https://stars.library.ucf.edu/etd/1174.

Council of Science Editors:

Sanchez Salazar J. Reasoning Tradeoffs in Implicit Invocation and Aspect Oriented Languages. [Doctoral Dissertation]. University of Central Florida; 2015. Available from: https://stars.library.ucf.edu/etd/1174


University of Pennsylvania

17. Singhania, Nimit. Static Analysis For Gpu Program Performance.

Degree: 2018, University of Pennsylvania

 GPUs have become popular due to their high computational power. Data scientists rely on GPUs to process loads of data being generated by their systems.… (more)

Subjects/Keywords: Compiler Optimization; GPU Performance; Graphics Processing Units; Program Verification; Static Analysis; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Singhania, N. (2018). Static Analysis For Gpu Program Performance. (Thesis). University of Pennsylvania. Retrieved from https://repository.upenn.edu/edissertations/3186

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):

Singhania, Nimit. “Static Analysis For Gpu Program Performance.” 2018. Thesis, University of Pennsylvania. Accessed June 01, 2020. https://repository.upenn.edu/edissertations/3186.

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

MLA Handbook (7th Edition):

Singhania, Nimit. “Static Analysis For Gpu Program Performance.” 2018. Web. 01 Jun 2020.

Vancouver:

Singhania N. Static Analysis For Gpu Program Performance. [Internet] [Thesis]. University of Pennsylvania; 2018. [cited 2020 Jun 01]. Available from: https://repository.upenn.edu/edissertations/3186.

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

Council of Science Editors:

Singhania N. Static Analysis For Gpu Program Performance. [Thesis]. University of Pennsylvania; 2018. Available from: https://repository.upenn.edu/edissertations/3186

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

18. -4071-6439. Automatic generation of coverage directives targeting signal relationships by statically analyzing RTL.

Degree: MSin Engineering, Electrical and Computer Engineering, 2017, University of Texas – Austin

 The coverage problem has been a long standing issue in simulation- based veri cation. Coverage metrics are required to track the progress and justify completeness… (more)

Subjects/Keywords: Coverage; Verification; Static analysis; RTL

…microprocessors presents critical verification challenges in the design process. Verification engineers… …has been observed that more than 70% of development time goes in verification [20]… …In this thesis, we will be focusing on simulation-based verification and the challenges… …based approaches dominate the verification strategies used for modern designs. The advent of… …environment. The main steps in simulation-based verification are test generation and response… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

-4071-6439. (2017). Automatic generation of coverage directives targeting signal relationships by statically analyzing RTL. (Masters Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/62907

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16th Edition):

-4071-6439. “Automatic generation of coverage directives targeting signal relationships by statically analyzing RTL.” 2017. Masters Thesis, University of Texas – Austin. Accessed June 01, 2020. http://hdl.handle.net/2152/62907.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7th Edition):

-4071-6439. “Automatic generation of coverage directives targeting signal relationships by statically analyzing RTL.” 2017. Web. 01 Jun 2020.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-4071-6439. Automatic generation of coverage directives targeting signal relationships by statically analyzing RTL. [Internet] [Masters thesis]. University of Texas – Austin; 2017. [cited 2020 Jun 01]. Available from: http://hdl.handle.net/2152/62907.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

-4071-6439. Automatic generation of coverage directives targeting signal relationships by statically analyzing RTL. [Masters Thesis]. University of Texas – Austin; 2017. Available from: http://hdl.handle.net/2152/62907

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete


University of Illinois – Urbana-Champaign

19. Athavale, Viraj. Coverage analysis for assertions and emulation based verification.

Degree: MS, 1200, 2012, University of Illinois – Urbana-Champaign

 Coverage analysis is critical in pre-silicon verification of hardware designs for assessing the completeness of verification and identifying inadequately exercised areas of the design. It… (more)

Subjects/Keywords: pre-silicon verification; coverage; assertions; emulation; code coverage; fault coverage; static analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Athavale, V. (2012). Coverage analysis for assertions and emulation based verification. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/29795

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):

Athavale, Viraj. “Coverage analysis for assertions and emulation based verification.” 2012. Thesis, University of Illinois – Urbana-Champaign. Accessed June 01, 2020. http://hdl.handle.net/2142/29795.

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

MLA Handbook (7th Edition):

Athavale, Viraj. “Coverage analysis for assertions and emulation based verification.” 2012. Web. 01 Jun 2020.

Vancouver:

Athavale V. Coverage analysis for assertions and emulation based verification. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2012. [cited 2020 Jun 01]. Available from: http://hdl.handle.net/2142/29795.

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

Council of Science Editors:

Athavale V. Coverage analysis for assertions and emulation based verification. [Thesis]. University of Illinois – Urbana-Champaign; 2012. Available from: http://hdl.handle.net/2142/29795

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


Texas Tech University

20. Garcia, Eric N. Software metrics through fault data from empirical evaluation using verification & validation tools.

Degree: Computer Science, 2008, Texas Tech University

 Traditional software metrics have been highly criticized for their inadequate measuring of software properties. Some metrics have been found to be based upon poor theoretical… (more)

Subjects/Keywords: Software verification; Static analysis; Software metrics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Garcia, E. N. (2008). Software metrics through fault data from empirical evaluation using verification & validation tools. (Thesis). Texas Tech University. Retrieved from http://hdl.handle.net/2346/10826

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):

Garcia, Eric N. “Software metrics through fault data from empirical evaluation using verification & validation tools.” 2008. Thesis, Texas Tech University. Accessed June 01, 2020. http://hdl.handle.net/2346/10826.

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

MLA Handbook (7th Edition):

Garcia, Eric N. “Software metrics through fault data from empirical evaluation using verification & validation tools.” 2008. Web. 01 Jun 2020.

Vancouver:

Garcia EN. Software metrics through fault data from empirical evaluation using verification & validation tools. [Internet] [Thesis]. Texas Tech University; 2008. [cited 2020 Jun 01]. Available from: http://hdl.handle.net/2346/10826.

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

Council of Science Editors:

Garcia EN. Software metrics through fault data from empirical evaluation using verification & validation tools. [Thesis]. Texas Tech University; 2008. Available from: http://hdl.handle.net/2346/10826

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


University of California – Berkeley

21. Brady, Bryan. Automatic Term-Level Abstraction.

Degree: Electrical Engineering & Computer Sciences, 2011, University of California – Berkeley

 Recent advances in decision procedures for Boolean satisfiability (SAT) and Satisfiability Modulo Theories (SMT) have increased the performance and capacity of formal verification techniques. Even… (more)

Subjects/Keywords: Electrical engineering; Computer science; Computer engineering; automatic abstraction; formal verification; machine learning; random simulation; static analysis; term-level abstraction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brady, B. (2011). Automatic Term-Level Abstraction. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/2h54t3gt

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):

Brady, Bryan. “Automatic Term-Level Abstraction.” 2011. Thesis, University of California – Berkeley. Accessed June 01, 2020. http://www.escholarship.org/uc/item/2h54t3gt.

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

MLA Handbook (7th Edition):

Brady, Bryan. “Automatic Term-Level Abstraction.” 2011. Web. 01 Jun 2020.

Vancouver:

Brady B. Automatic Term-Level Abstraction. [Internet] [Thesis]. University of California – Berkeley; 2011. [cited 2020 Jun 01]. Available from: http://www.escholarship.org/uc/item/2h54t3gt.

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

Council of Science Editors:

Brady B. Automatic Term-Level Abstraction. [Thesis]. University of California – Berkeley; 2011. Available from: http://www.escholarship.org/uc/item/2h54t3gt

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


Virginia Tech

22. Puri, Prateek. Design Validation of RTL Circuits using Binary Particle Swarm Optimization and Symbolic Execution.

Degree: MS, Electrical and Computer Engineering, 2015, Virginia Tech

 Over the last two decades, chip design has been conducted at the register transfer (RT) Level using Hardware Descriptive Languages (HDL), such as VHDL and… (more)

Subjects/Keywords: Design Verification; Particle Swarm Optimization; Static Analysis; Symbolic Backward Execution; Satisfiability Modulo Theory; Pattern Search Methods

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Puri, P. (2015). Design Validation of RTL Circuits using Binary Particle Swarm Optimization and Symbolic Execution. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/55815

Chicago Manual of Style (16th Edition):

Puri, Prateek. “Design Validation of RTL Circuits using Binary Particle Swarm Optimization and Symbolic Execution.” 2015. Masters Thesis, Virginia Tech. Accessed June 01, 2020. http://hdl.handle.net/10919/55815.

MLA Handbook (7th Edition):

Puri, Prateek. “Design Validation of RTL Circuits using Binary Particle Swarm Optimization and Symbolic Execution.” 2015. Web. 01 Jun 2020.

Vancouver:

Puri P. Design Validation of RTL Circuits using Binary Particle Swarm Optimization and Symbolic Execution. [Internet] [Masters thesis]. Virginia Tech; 2015. [cited 2020 Jun 01]. Available from: http://hdl.handle.net/10919/55815.

Council of Science Editors:

Puri P. Design Validation of RTL Circuits using Binary Particle Swarm Optimization and Symbolic Execution. [Masters Thesis]. Virginia Tech; 2015. Available from: http://hdl.handle.net/10919/55815


University of Oxford

23. Nimal, Vincent P. J. Static analyses over weak memory.

Degree: PhD, 2014, University of Oxford

 Writing concurrent programs with shared memory is often not trivial. Correctly synchronising the threads and handling the non-determinism of executions require a good understanding of… (more)

Subjects/Keywords: 005.1; Computer science (mathematics); Theory and automated verification; Software engineering; concurrency; static analysis; weak memory; memory fence

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nimal, V. P. J. (2014). Static analyses over weak memory. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:469907ec-6f61-4015-984e-7ca8757b992c ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.667008

Chicago Manual of Style (16th Edition):

Nimal, Vincent P J. “Static analyses over weak memory.” 2014. Doctoral Dissertation, University of Oxford. Accessed June 01, 2020. http://ora.ox.ac.uk/objects/uuid:469907ec-6f61-4015-984e-7ca8757b992c ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.667008.

MLA Handbook (7th Edition):

Nimal, Vincent P J. “Static analyses over weak memory.” 2014. Web. 01 Jun 2020.

Vancouver:

Nimal VPJ. Static analyses over weak memory. [Internet] [Doctoral dissertation]. University of Oxford; 2014. [cited 2020 Jun 01]. Available from: http://ora.ox.ac.uk/objects/uuid:469907ec-6f61-4015-984e-7ca8757b992c ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.667008.

Council of Science Editors:

Nimal VPJ. Static analyses over weak memory. [Doctoral Dissertation]. University of Oxford; 2014. Available from: http://ora.ox.ac.uk/objects/uuid:469907ec-6f61-4015-984e-7ca8757b992c ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.667008


Mississippi State University

24. Gray Jr, Ricky Lee. VERIFICATION OF A THREE-DIMENSIONAL STATICS MODEL FOR CONTINUUM ROBOTICS AND THE DESIGN AND CONSTRUCTION OF A SMALL CONTINUUM ROBOT (SCR).

Degree: MS, Electrical and Computer Engineering, 2009, Mississippi State University

 Continuum robots are biologically inspired robots that capture the extraordinary abilities of biological structures such as elephant trunks, octopus tentacles, and mamma-lian tongues. They are… (more)

Subjects/Keywords: Tentacles; Trunks; Tongues; Statics; Static; Model; Verification; Biological; Continuum; Continuum robots; Biologically inspired robots; Muscular Hydrostat; Hyperredundant; Robots; Robot

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gray Jr, R. L. (2009). VERIFICATION OF A THREE-DIMENSIONAL STATICS MODEL FOR CONTINUUM ROBOTICS AND THE DESIGN AND CONSTRUCTION OF A SMALL CONTINUUM ROBOT (SCR). (Masters Thesis). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-11062009-155747/ ;

Chicago Manual of Style (16th Edition):

Gray Jr, Ricky Lee. “VERIFICATION OF A THREE-DIMENSIONAL STATICS MODEL FOR CONTINUUM ROBOTICS AND THE DESIGN AND CONSTRUCTION OF A SMALL CONTINUUM ROBOT (SCR).” 2009. Masters Thesis, Mississippi State University. Accessed June 01, 2020. http://sun.library.msstate.edu/ETD-db/theses/available/etd-11062009-155747/ ;.

MLA Handbook (7th Edition):

Gray Jr, Ricky Lee. “VERIFICATION OF A THREE-DIMENSIONAL STATICS MODEL FOR CONTINUUM ROBOTICS AND THE DESIGN AND CONSTRUCTION OF A SMALL CONTINUUM ROBOT (SCR).” 2009. Web. 01 Jun 2020.

Vancouver:

Gray Jr RL. VERIFICATION OF A THREE-DIMENSIONAL STATICS MODEL FOR CONTINUUM ROBOTICS AND THE DESIGN AND CONSTRUCTION OF A SMALL CONTINUUM ROBOT (SCR). [Internet] [Masters thesis]. Mississippi State University; 2009. [cited 2020 Jun 01]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-11062009-155747/ ;.

Council of Science Editors:

Gray Jr RL. VERIFICATION OF A THREE-DIMENSIONAL STATICS MODEL FOR CONTINUUM ROBOTICS AND THE DESIGN AND CONSTRUCTION OF A SMALL CONTINUUM ROBOT (SCR). [Masters Thesis]. Mississippi State University; 2009. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-11062009-155747/ ;

25. Agrawal, Akash. Static Analysis to improve RTL Verification.

Degree: MS, Electrical and Computer Engineering, 2017, Virginia Tech

 Integrated circuits have traveled a long way from being a general purpose microprocessor to an application specific circuit. It has become an integral part of… (more)

Subjects/Keywords: Static Analysis; ATPG; Verification; Reachability Analysis

…increase in the circuit complexity has immensely increased the testing and verification efforts… …complexity has imposed a need for new and faster methods for the formal verification of the design… …x5B;3]. At present, at least 50% of the chip design time is spent on verification… …Verification of design needs to be done at each level of the design. The test generation ate one… …verification can be to test all possible input combination for the design and compare the output for… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Agrawal, A. (2017). Static Analysis to improve RTL Verification. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/75293

Chicago Manual of Style (16th Edition):

Agrawal, Akash. “Static Analysis to improve RTL Verification.” 2017. Masters Thesis, Virginia Tech. Accessed June 01, 2020. http://hdl.handle.net/10919/75293.

MLA Handbook (7th Edition):

Agrawal, Akash. “Static Analysis to improve RTL Verification.” 2017. Web. 01 Jun 2020.

Vancouver:

Agrawal A. Static Analysis to improve RTL Verification. [Internet] [Masters thesis]. Virginia Tech; 2017. [cited 2020 Jun 01]. Available from: http://hdl.handle.net/10919/75293.

Council of Science Editors:

Agrawal A. Static Analysis to improve RTL Verification. [Masters Thesis]. Virginia Tech; 2017. Available from: http://hdl.handle.net/10919/75293


University of Illinois – Urbana-Champaign

26. Hertz, Samuel. Enhancing quality of assertion generation: methods for automatic assertion generation and evaluation.

Degree: MS, 1200, 2013, University of Illinois – Urbana-Champaign

 We present methods for automatically generating and evaluating register transfer level (RTL) assertions. We detail the GoldMine methodology and each of its data mining algorithms.… (more)

Subjects/Keywords: assertion; assertion generation; assertion evaluation; assertion ranking; GoldMine; static analysis; data mining; evaluation; ranking; verification; validation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hertz, S. (2013). Enhancing quality of assertion generation: methods for automatic assertion generation and evaluation. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/55156

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):

Hertz, Samuel. “Enhancing quality of assertion generation: methods for automatic assertion generation and evaluation.” 2013. Thesis, University of Illinois – Urbana-Champaign. Accessed June 01, 2020. http://hdl.handle.net/2142/55156.

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

MLA Handbook (7th Edition):

Hertz, Samuel. “Enhancing quality of assertion generation: methods for automatic assertion generation and evaluation.” 2013. Web. 01 Jun 2020.

Vancouver:

Hertz S. Enhancing quality of assertion generation: methods for automatic assertion generation and evaluation. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2013. [cited 2020 Jun 01]. Available from: http://hdl.handle.net/2142/55156.

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

Council of Science Editors:

Hertz S. Enhancing quality of assertion generation: methods for automatic assertion generation and evaluation. [Thesis]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/55156

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


Brno University of Technology

27. Tomčíková, Lucie. Zimní stadion v Olomouci: Winter Stadium in Olomouc.

Degree: 2020, Brno University of Technology

 The content of the bachelor thesis is static verification and the desing of two options of a roofing of the winter stadium in Olomouc. The… (more)

Subjects/Keywords: Ocelová konstrukce; zastřešení; zatížení větrem; zatížení sněhem; statický přepočet; posouzení.; Steel construction; roofing; wind load; snow load; static verification; evaluation.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tomčíková, L. (2020). Zimní stadion v Olomouci: Winter Stadium in Olomouc. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/184312

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):

Tomčíková, Lucie. “Zimní stadion v Olomouci: Winter Stadium in Olomouc.” 2020. Thesis, Brno University of Technology. Accessed June 01, 2020. http://hdl.handle.net/11012/184312.

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

MLA Handbook (7th Edition):

Tomčíková, Lucie. “Zimní stadion v Olomouci: Winter Stadium in Olomouc.” 2020. Web. 01 Jun 2020.

Vancouver:

Tomčíková L. Zimní stadion v Olomouci: Winter Stadium in Olomouc. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Jun 01]. Available from: http://hdl.handle.net/11012/184312.

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

Council of Science Editors:

Tomčíková L. Zimní stadion v Olomouci: Winter Stadium in Olomouc. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/184312

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


Brno University of Technology

28. Kovalič, Peter. Automatická formální verifikace korektnosti programů v nástrojích SDV, Copper a podobných: Automated Formal Verification of Program Correctness Using SDV, Copper, or Similar Tools.

Degree: 2019, Brno University of Technology

 This thesis is concerning about verification of drivers. Principally is focused on model checking tools, from which the Static Driver Verifier is the most important.… (more)

Subjects/Keywords: verifikace; ovladač; statická analýza; model checking; static driver verifier; ovládač souborového systému; Copper; Ext2Fsd; BLAST; PREfast; Windows driver kit; verification; driver; static analysis; model checking; static driver vernier; file systém driver; Copper; Ext2Fsd; BLAST; PREfast; Windows driver kit

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kovalič, P. (2019). Automatická formální verifikace korektnosti programů v nástrojích SDV, Copper a podobných: Automated Formal Verification of Program Correctness Using SDV, Copper, or Similar Tools. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/55994

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):

Kovalič, Peter. “Automatická formální verifikace korektnosti programů v nástrojích SDV, Copper a podobných: Automated Formal Verification of Program Correctness Using SDV, Copper, or Similar Tools.” 2019. Thesis, Brno University of Technology. Accessed June 01, 2020. http://hdl.handle.net/11012/55994.

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

MLA Handbook (7th Edition):

Kovalič, Peter. “Automatická formální verifikace korektnosti programů v nástrojích SDV, Copper a podobných: Automated Formal Verification of Program Correctness Using SDV, Copper, or Similar Tools.” 2019. Web. 01 Jun 2020.

Vancouver:

Kovalič P. Automatická formální verifikace korektnosti programů v nástrojích SDV, Copper a podobných: Automated Formal Verification of Program Correctness Using SDV, Copper, or Similar Tools. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Jun 01]. Available from: http://hdl.handle.net/11012/55994.

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

Council of Science Editors:

Kovalič P. Automatická formální verifikace korektnosti programů v nástrojích SDV, Copper a podobných: Automated Formal Verification of Program Correctness Using SDV, Copper, or Similar Tools. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/55994

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


University of Stirling

29. Wilson, Thomas. The Omnibus language and integrated verification approach.

Degree: PhD, School of Natural Sciences, 2007, University of Stirling

 This thesis describes the Omnibus language and its supporting framework of tools. Omnibus is an object-oriented language which is superficially similar to the Java programming… (more)

Subjects/Keywords: assertion-based verification; run-time assertion checking; extended static checking; full formal verification; verification policies; Omnibus; Omnibus (Computer program language); Computer programs Verification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wilson, T. (2007). The Omnibus language and integrated verification approach. (Doctoral Dissertation). University of Stirling. Retrieved from http://hdl.handle.net/1893/260

Chicago Manual of Style (16th Edition):

Wilson, Thomas. “The Omnibus language and integrated verification approach.” 2007. Doctoral Dissertation, University of Stirling. Accessed June 01, 2020. http://hdl.handle.net/1893/260.

MLA Handbook (7th Edition):

Wilson, Thomas. “The Omnibus language and integrated verification approach.” 2007. Web. 01 Jun 2020.

Vancouver:

Wilson T. The Omnibus language and integrated verification approach. [Internet] [Doctoral dissertation]. University of Stirling; 2007. [cited 2020 Jun 01]. Available from: http://hdl.handle.net/1893/260.

Council of Science Editors:

Wilson T. The Omnibus language and integrated verification approach. [Doctoral Dissertation]. University of Stirling; 2007. Available from: http://hdl.handle.net/1893/260


Carnegie Mellon University

30. Beckman, Nels E. Types for Correct Concurrent API Usage.

Degree: 2010, Carnegie Mellon University

 This thesis represents an attempt to improve the state of the art in our ability tounderstand and check object protocols, with a particular emphasis on… (more)

Subjects/Keywords: API; object protocol; typestate; concurrency; multi-threading; object-oriented; type theory; type system; static analysis; specification; verification; Java; empirical; polymor- phism; inference; probabilistic; transactional memory; STM; optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Beckman, N. E. (2010). Types for Correct Concurrent API Usage. (Thesis). Carnegie Mellon University. Retrieved from http://repository.cmu.edu/dissertations/40

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):

Beckman, Nels E. “Types for Correct Concurrent API Usage.” 2010. Thesis, Carnegie Mellon University. Accessed June 01, 2020. http://repository.cmu.edu/dissertations/40.

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

MLA Handbook (7th Edition):

Beckman, Nels E. “Types for Correct Concurrent API Usage.” 2010. Web. 01 Jun 2020.

Vancouver:

Beckman NE. Types for Correct Concurrent API Usage. [Internet] [Thesis]. Carnegie Mellon University; 2010. [cited 2020 Jun 01]. Available from: http://repository.cmu.edu/dissertations/40.

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

Council of Science Editors:

Beckman NE. Types for Correct Concurrent API Usage. [Thesis]. Carnegie Mellon University; 2010. Available from: http://repository.cmu.edu/dissertations/40

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

[1] [2] [3]

.