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

[1] [2] [3] [4] [5]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters

1. Baluda, Mauro. Test generation for high coverage with abstraction refinement and coarsening (ARC).

Degree: 2014, Università della Svizzera italiana

 Testing is the main approach used in the software industry to expose failures. Producing thorough test suites is an expensive and error prone task that… (more)

Subjects/Keywords: Reachability

…approach in Synergy. . . . . . . . . . Testing and Reachability Analysis benefit each other when… …generation and reachability analysis generate test suites with high code coverage for industrially… …questions: Q1 Can the symbolic approach to test input generation be combined with reachability… …technique able to support both test generation and reachability analysis 4 1.2 Structure of the… …reachability analysis. Chapter 3 introduces the fundamental software analysis approaches that… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Baluda, M. (2014). Test generation for high coverage with abstraction refinement and coarsening (ARC). (Thesis). Università della Svizzera italiana. Retrieved from http://doc.rero.ch/record/235915

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

Baluda, Mauro. “Test generation for high coverage with abstraction refinement and coarsening (ARC).” 2014. Thesis, Università della Svizzera italiana. Accessed October 18, 2019. http://doc.rero.ch/record/235915.

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

MLA Handbook (7th Edition):

Baluda, Mauro. “Test generation for high coverage with abstraction refinement and coarsening (ARC).” 2014. Web. 18 Oct 2019.

Vancouver:

Baluda M. Test generation for high coverage with abstraction refinement and coarsening (ARC). [Internet] [Thesis]. Università della Svizzera italiana; 2014. [cited 2019 Oct 18]. Available from: http://doc.rero.ch/record/235915.

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

Council of Science Editors:

Baluda M. Test generation for high coverage with abstraction refinement and coarsening (ARC). [Thesis]. Università della Svizzera italiana; 2014. Available from: http://doc.rero.ch/record/235915

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


University of Georgia

2. Akella, Venkata Sri Ram. Efficient indexing technique for answering reachability queiries on time-evolving hierarchies.

Degree: MS, Computer Science, 2013, University of Georgia

 There are many applications involving tree structures. In these applications, trees are subject to discrete changes such as insertions and deletions of vertices or edges.… (more)

Subjects/Keywords: Reachability queries; Time-evolving hierarchies

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Akella, V. S. R. (2013). Efficient indexing technique for answering reachability queiries on time-evolving hierarchies. (Masters Thesis). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/akella_venkata-sri-ram_201305_ms

Chicago Manual of Style (16th Edition):

Akella, Venkata Sri Ram. “Efficient indexing technique for answering reachability queiries on time-evolving hierarchies.” 2013. Masters Thesis, University of Georgia. Accessed October 18, 2019. http://purl.galileo.usg.edu/uga_etd/akella_venkata-sri-ram_201305_ms.

MLA Handbook (7th Edition):

Akella, Venkata Sri Ram. “Efficient indexing technique for answering reachability queiries on time-evolving hierarchies.” 2013. Web. 18 Oct 2019.

Vancouver:

Akella VSR. Efficient indexing technique for answering reachability queiries on time-evolving hierarchies. [Internet] [Masters thesis]. University of Georgia; 2013. [cited 2019 Oct 18]. Available from: http://purl.galileo.usg.edu/uga_etd/akella_venkata-sri-ram_201305_ms.

Council of Science Editors:

Akella VSR. Efficient indexing technique for answering reachability queiries on time-evolving hierarchies. [Masters Thesis]. University of Georgia; 2013. Available from: http://purl.galileo.usg.edu/uga_etd/akella_venkata-sri-ram_201305_ms


Delft University of Technology

3. Wolfslag, W.J. Reachability and task execution speed analysis of a resonating robotic arm:.

Degree: 2012, Delft University of Technology

This thesis analyses the range of motion of a resonating robotic arm under motor torque and time limitations and shows the beneficial effects it has on the speed of executing a pick and place task. Advisors/Committee Members: Van der Helm, F.C.T., Wisse, M..

Subjects/Keywords: robot resonating arm reachability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wolfslag, W. J. (2012). Reachability and task execution speed analysis of a resonating robotic arm:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:136fa68c-105c-49d5-9300-5de16b3c35b8

Chicago Manual of Style (16th Edition):

Wolfslag, W J. “Reachability and task execution speed analysis of a resonating robotic arm:.” 2012. Masters Thesis, Delft University of Technology. Accessed October 18, 2019. http://resolver.tudelft.nl/uuid:136fa68c-105c-49d5-9300-5de16b3c35b8.

MLA Handbook (7th Edition):

Wolfslag, W J. “Reachability and task execution speed analysis of a resonating robotic arm:.” 2012. Web. 18 Oct 2019.

Vancouver:

Wolfslag WJ. Reachability and task execution speed analysis of a resonating robotic arm:. [Internet] [Masters thesis]. Delft University of Technology; 2012. [cited 2019 Oct 18]. Available from: http://resolver.tudelft.nl/uuid:136fa68c-105c-49d5-9300-5de16b3c35b8.

Council of Science Editors:

Wolfslag WJ. Reachability and task execution speed analysis of a resonating robotic arm:. [Masters Thesis]. Delft University of Technology; 2012. Available from: http://resolver.tudelft.nl/uuid:136fa68c-105c-49d5-9300-5de16b3c35b8


University of Illinois – Urbana-Champaign

4. Fan, Chuchu. Automatic simulation-driven reachability using matrix measures.

Degree: MS, Electrical & Computer Engr, 2016, University of Illinois – Urbana-Champaign

 Simulation-driven verification is a promising approach that provides formal safety guarantees for otherwise intractable nonlinear and hybrid system models. A key step in simulation-driven algorithms… (more)

Subjects/Keywords: Reachability; Nonlinear systems; Matrix measures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fan, C. (2016). Automatic simulation-driven reachability using matrix measures. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/93069

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

Fan, Chuchu. “Automatic simulation-driven reachability using matrix measures.” 2016. Thesis, University of Illinois – Urbana-Champaign. Accessed October 18, 2019. http://hdl.handle.net/2142/93069.

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

MLA Handbook (7th Edition):

Fan, Chuchu. “Automatic simulation-driven reachability using matrix measures.” 2016. Web. 18 Oct 2019.

Vancouver:

Fan C. Automatic simulation-driven reachability using matrix measures. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2016. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/2142/93069.

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

Council of Science Editors:

Fan C. Automatic simulation-driven reachability using matrix measures. [Thesis]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/93069

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


Texas A&M University

5. Deng, Yue. SAT-based Verification for Analog and Mixed-signal Circuits.

Degree: 2012, Texas A&M University

 The wide application of analog and mixed-signal (AMS) designs makes the verification of AMS circuits an important task. However, verification of AMS circuits remains as… (more)

Subjects/Keywords: Analog; verification; simulation; SAT; modeling; reachability anlysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Deng, Y. (2012). SAT-based Verification for Analog and Mixed-signal Circuits. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11221

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

Deng, Yue. “SAT-based Verification for Analog and Mixed-signal Circuits.” 2012. Thesis, Texas A&M University. Accessed October 18, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11221.

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

MLA Handbook (7th Edition):

Deng, Yue. “SAT-based Verification for Analog and Mixed-signal Circuits.” 2012. Web. 18 Oct 2019.

Vancouver:

Deng Y. SAT-based Verification for Analog and Mixed-signal Circuits. [Internet] [Thesis]. Texas A&M University; 2012. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11221.

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

Council of Science Editors:

Deng Y. SAT-based Verification for Analog and Mixed-signal Circuits. [Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11221

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


Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ)

6. Γρηγοριάδου, Αναστασία. Ανάλυση και σύνθεση συστημάτων αυτόματου ελέγχου διακριτού χρόνου μέσω της αλγεβρο-πολυωνυμικής προσέγγισης.

Degree: 2013, Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ)

In the present Phd thesis, the most familiar methods with which we can convert the continuous time systems into equivalent discrete time systems are presented… (more)

Subjects/Keywords: Διακριτοποίηση; Εφικτότητα; Ελεγξιμότητα; Discretization; Reachability; Controllability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Γρηγοριάδου, . . (2013). Ανάλυση και σύνθεση συστημάτων αυτόματου ελέγχου διακριτού χρόνου μέσω της αλγεβρο-πολυωνυμικής προσέγγισης. (Thesis). Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ). Retrieved from http://hdl.handle.net/10442/hedi/31338

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

Γρηγοριάδου, Αναστασία. “Ανάλυση και σύνθεση συστημάτων αυτόματου ελέγχου διακριτού χρόνου μέσω της αλγεβρο-πολυωνυμικής προσέγγισης.” 2013. Thesis, Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ). Accessed October 18, 2019. http://hdl.handle.net/10442/hedi/31338.

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

MLA Handbook (7th Edition):

Γρηγοριάδου, Αναστασία. “Ανάλυση και σύνθεση συστημάτων αυτόματου ελέγχου διακριτού χρόνου μέσω της αλγεβρο-πολυωνυμικής προσέγγισης.” 2013. Web. 18 Oct 2019.

Vancouver:

Γρηγοριάδου . Ανάλυση και σύνθεση συστημάτων αυτόματου ελέγχου διακριτού χρόνου μέσω της αλγεβρο-πολυωνυμικής προσέγγισης. [Internet] [Thesis]. Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ); 2013. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/10442/hedi/31338.

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

Council of Science Editors:

Γρηγοριάδου . Ανάλυση και σύνθεση συστημάτων αυτόματου ελέγχου διακριτού χρόνου μέσω της αλγεβρο-πολυωνυμικής προσέγγισης. [Thesis]. Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ); 2013. Available from: http://hdl.handle.net/10442/hedi/31338

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


University of Southern California

7. Shirani-Mehr, Houtan. Efficient reachability query evaluation in large spatiotemporal contact networks.

Degree: PhD, Computer Science, 2013, University of Southern California

 In many application scenarios, an item, such as a message, a piece of sensitive information, contagious virus or a malicious malware, passes between two objects,… (more)

Subjects/Keywords: contact networks; query processing; reachability query

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shirani-Mehr, H. (2013). Efficient reachability query evaluation in large spatiotemporal contact networks. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/307725/rec/2247

Chicago Manual of Style (16th Edition):

Shirani-Mehr, Houtan. “Efficient reachability query evaluation in large spatiotemporal contact networks.” 2013. Doctoral Dissertation, University of Southern California. Accessed October 18, 2019. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/307725/rec/2247.

MLA Handbook (7th Edition):

Shirani-Mehr, Houtan. “Efficient reachability query evaluation in large spatiotemporal contact networks.” 2013. Web. 18 Oct 2019.

Vancouver:

Shirani-Mehr H. Efficient reachability query evaluation in large spatiotemporal contact networks. [Internet] [Doctoral dissertation]. University of Southern California; 2013. [cited 2019 Oct 18]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/307725/rec/2247.

Council of Science Editors:

Shirani-Mehr H. Efficient reachability query evaluation in large spatiotemporal contact networks. [Doctoral Dissertation]. University of Southern California; 2013. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/307725/rec/2247


Virginia Tech

8. 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

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 October 18, 2019. http://hdl.handle.net/10919/75293.

MLA Handbook (7th Edition):

Agrawal, Akash. “Static Analysis to improve RTL Verification.” 2017. Web. 18 Oct 2019.

Vancouver:

Agrawal A. Static Analysis to improve RTL Verification. [Internet] [Masters thesis]. Virginia Tech; 2017. [cited 2019 Oct 18]. 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

9. Nguyen, Hoang Hai. An approach to incorporating uncertainty in network security analysis.

Degree: MS, Electrical & Computer Engr, 2018, University of Illinois – Urbana-Champaign

 Attack graphs used in network security analysis are analyzed to determine sequences of exploits that lead to successful acquisition of privileges or data at critical… (more)

Subjects/Keywords: network security; uncertainty; attach graph; reachability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nguyen, H. H. (2018). An approach to incorporating uncertainty in network security analysis. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/102416

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

Nguyen, Hoang Hai. “An approach to incorporating uncertainty in network security analysis.” 2018. Thesis, University of Illinois – Urbana-Champaign. Accessed October 18, 2019. http://hdl.handle.net/2142/102416.

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

MLA Handbook (7th Edition):

Nguyen, Hoang Hai. “An approach to incorporating uncertainty in network security analysis.” 2018. Web. 18 Oct 2019.

Vancouver:

Nguyen HH. An approach to incorporating uncertainty in network security analysis. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2018. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/2142/102416.

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

Council of Science Editors:

Nguyen HH. An approach to incorporating uncertainty in network security analysis. [Thesis]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/102416

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


University of New South Wales

10. Shang, Lei. Efficient points-to analysis based on CFL-reachability summarisation.

Degree: Computer Science & Engineering, 2012, University of New South Wales

 Points-to analysis plays a critical role in modern compilers and a wide range of program understanding and bug detection tools. Nevertheless, developing precise and scalable… (more)

Subjects/Keywords: Summarisation; Points-to analysis; CFL-reachability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shang, L. (2012). Efficient points-to analysis based on CFL-reachability summarisation. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/52343 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11016/SOURCE01?view=true

Chicago Manual of Style (16th Edition):

Shang, Lei. “Efficient points-to analysis based on CFL-reachability summarisation.” 2012. Doctoral Dissertation, University of New South Wales. Accessed October 18, 2019. http://handle.unsw.edu.au/1959.4/52343 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11016/SOURCE01?view=true.

MLA Handbook (7th Edition):

Shang, Lei. “Efficient points-to analysis based on CFL-reachability summarisation.” 2012. Web. 18 Oct 2019.

Vancouver:

Shang L. Efficient points-to analysis based on CFL-reachability summarisation. [Internet] [Doctoral dissertation]. University of New South Wales; 2012. [cited 2019 Oct 18]. Available from: http://handle.unsw.edu.au/1959.4/52343 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11016/SOURCE01?view=true.

Council of Science Editors:

Shang L. Efficient points-to analysis based on CFL-reachability summarisation. [Doctoral Dissertation]. University of New South Wales; 2012. Available from: http://handle.unsw.edu.au/1959.4/52343 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11016/SOURCE01?view=true


Clemson University

11. Shen, Kai. Advances in Reachability Analysis for Nonlinear Dynamic Systems.

Degree: PhD, Chemical and Biomolecular Engineering, 2019, Clemson University

  Systems of nonlinear ordinary differential equations (ODEs) are used to model an incredible variety of dynamic phenomena in chemical, oil and gas, and pharmaceutical… (more)

Subjects/Keywords: Differential inequalities; Interval analysis; Reachability; Uncertainty propagation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shen, K. (2019). Advances in Reachability Analysis for Nonlinear Dynamic Systems. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/2380

Chicago Manual of Style (16th Edition):

Shen, Kai. “Advances in Reachability Analysis for Nonlinear Dynamic Systems.” 2019. Doctoral Dissertation, Clemson University. Accessed October 18, 2019. https://tigerprints.clemson.edu/all_dissertations/2380.

MLA Handbook (7th Edition):

Shen, Kai. “Advances in Reachability Analysis for Nonlinear Dynamic Systems.” 2019. Web. 18 Oct 2019.

Vancouver:

Shen K. Advances in Reachability Analysis for Nonlinear Dynamic Systems. [Internet] [Doctoral dissertation]. Clemson University; 2019. [cited 2019 Oct 18]. Available from: https://tigerprints.clemson.edu/all_dissertations/2380.

Council of Science Editors:

Shen K. Advances in Reachability Analysis for Nonlinear Dynamic Systems. [Doctoral Dissertation]. Clemson University; 2019. Available from: https://tigerprints.clemson.edu/all_dissertations/2380


University of New Mexico

12. Lesser, Kendra Anne. Computational Techniques for Stochastic Reachability.

Degree: Electrical and Computer Engineering, 2015, University of New Mexico

 As automated control systems grow in prevalence and complexity, there is an increasing demand for verification and controller synthesis methods to ensure these systems perform… (more)

Subjects/Keywords: Control Theory; Reachability; Stochastic Hybrid Systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lesser, K. A. (2015). Computational Techniques for Stochastic Reachability. (Doctoral Dissertation). University of New Mexico. Retrieved from http://hdl.handle.net/1928/25795

Chicago Manual of Style (16th Edition):

Lesser, Kendra Anne. “Computational Techniques for Stochastic Reachability.” 2015. Doctoral Dissertation, University of New Mexico. Accessed October 18, 2019. http://hdl.handle.net/1928/25795.

MLA Handbook (7th Edition):

Lesser, Kendra Anne. “Computational Techniques for Stochastic Reachability.” 2015. Web. 18 Oct 2019.

Vancouver:

Lesser KA. Computational Techniques for Stochastic Reachability. [Internet] [Doctoral dissertation]. University of New Mexico; 2015. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/1928/25795.

Council of Science Editors:

Lesser KA. Computational Techniques for Stochastic Reachability. [Doctoral Dissertation]. University of New Mexico; 2015. Available from: http://hdl.handle.net/1928/25795


University of Connecticut

13. Wang, Heqiang. Reachability Analysis of Power Electronic Converters.

Degree: MS, Electrical Engineering, 2019, University of Connecticut

  This work presents a reachability analysis approach for dual active bridge (DAB) converters in the presence of heterogeneous uncertainties induced by manufacturing tolerance, temperature,… (more)

Subjects/Keywords: Reachability Analysis; Dual Active Bridge Converter

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, H. (2019). Reachability Analysis of Power Electronic Converters. (Masters Thesis). University of Connecticut. Retrieved from https://opencommons.uconn.edu/gs_theses/1381

Chicago Manual of Style (16th Edition):

Wang, Heqiang. “Reachability Analysis of Power Electronic Converters.” 2019. Masters Thesis, University of Connecticut. Accessed October 18, 2019. https://opencommons.uconn.edu/gs_theses/1381.

MLA Handbook (7th Edition):

Wang, Heqiang. “Reachability Analysis of Power Electronic Converters.” 2019. Web. 18 Oct 2019.

Vancouver:

Wang H. Reachability Analysis of Power Electronic Converters. [Internet] [Masters thesis]. University of Connecticut; 2019. [cited 2019 Oct 18]. Available from: https://opencommons.uconn.edu/gs_theses/1381.

Council of Science Editors:

Wang H. Reachability Analysis of Power Electronic Converters. [Masters Thesis]. University of Connecticut; 2019. Available from: https://opencommons.uconn.edu/gs_theses/1381


University of Utah

14. Fisher, Andrew N. Efficient, sound formal verification for analog/mixed-signal circuits.

Degree: PhD, Electrical & Computer Engineering, 2015, University of Utah

 The increasing demand for smaller, more efficient circuits has created a need for both digital and analog designs to scale down. Digital technologies have been… (more)

Subjects/Keywords: Analog/Mixed Signal; Octagons; Reachability Analysis; verification; Zones

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fisher, A. N. (2015). Efficient, sound formal verification for analog/mixed-signal circuits. (Doctoral Dissertation). University of Utah. Retrieved from http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/3937/rec/840

Chicago Manual of Style (16th Edition):

Fisher, Andrew N. “Efficient, sound formal verification for analog/mixed-signal circuits.” 2015. Doctoral Dissertation, University of Utah. Accessed October 18, 2019. http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/3937/rec/840.

MLA Handbook (7th Edition):

Fisher, Andrew N. “Efficient, sound formal verification for analog/mixed-signal circuits.” 2015. Web. 18 Oct 2019.

Vancouver:

Fisher AN. Efficient, sound formal verification for analog/mixed-signal circuits. [Internet] [Doctoral dissertation]. University of Utah; 2015. [cited 2019 Oct 18]. Available from: http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/3937/rec/840.

Council of Science Editors:

Fisher AN. Efficient, sound formal verification for analog/mixed-signal circuits. [Doctoral Dissertation]. University of Utah; 2015. Available from: http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/3937/rec/840


University of Bradford

15. Hanashi, Abdalla Musbah Omar. Enhanced probabilistic broadcasting scheme for routing in MANETs : an investigation in the design analysis and performance evaluation of an enhanced probabilistic broadcasting scheme for on-demand routing protocols in mobile ad-hoc networks.

Degree: PhD, 2009, University of Bradford

 Broadcasting is an essential and effective data propagation mechanism with several important applications, such as route discovery, address resolution and many other network services. Though… (more)

Subjects/Keywords: 621.382; AODV,; MANETs,; Probabilistic broadcasting; Reachability; Performance; Collisions; Contention; Relays

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hanashi, A. M. O. (2009). Enhanced probabilistic broadcasting scheme for routing in MANETs : an investigation in the design analysis and performance evaluation of an enhanced probabilistic broadcasting scheme for on-demand routing protocols in mobile ad-hoc networks. (Doctoral Dissertation). University of Bradford. Retrieved from http://hdl.handle.net/10454/4321

Chicago Manual of Style (16th Edition):

Hanashi, Abdalla Musbah Omar. “Enhanced probabilistic broadcasting scheme for routing in MANETs : an investigation in the design analysis and performance evaluation of an enhanced probabilistic broadcasting scheme for on-demand routing protocols in mobile ad-hoc networks.” 2009. Doctoral Dissertation, University of Bradford. Accessed October 18, 2019. http://hdl.handle.net/10454/4321.

MLA Handbook (7th Edition):

Hanashi, Abdalla Musbah Omar. “Enhanced probabilistic broadcasting scheme for routing in MANETs : an investigation in the design analysis and performance evaluation of an enhanced probabilistic broadcasting scheme for on-demand routing protocols in mobile ad-hoc networks.” 2009. Web. 18 Oct 2019.

Vancouver:

Hanashi AMO. Enhanced probabilistic broadcasting scheme for routing in MANETs : an investigation in the design analysis and performance evaluation of an enhanced probabilistic broadcasting scheme for on-demand routing protocols in mobile ad-hoc networks. [Internet] [Doctoral dissertation]. University of Bradford; 2009. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/10454/4321.

Council of Science Editors:

Hanashi AMO. Enhanced probabilistic broadcasting scheme for routing in MANETs : an investigation in the design analysis and performance evaluation of an enhanced probabilistic broadcasting scheme for on-demand routing protocols in mobile ad-hoc networks. [Doctoral Dissertation]. University of Bradford; 2009. Available from: http://hdl.handle.net/10454/4321

16. Bourgeois, Jérémy. Représentations motrices et perception de l'espace péripersonnel : Motor representations and the perception of peripersonal space.

Degree: Docteur es, Psychologie, 2012, Lille 3

Dans le cadre de ce travail de thèse, nous nous sommes intéressés aux relations étroites qu'entretiennent processus moteurs et sensoriels pour déterminer les régions de… (more)

Subjects/Keywords: Espace péripersonnel; Atteignabilité; Perception; Peripersonal space; Reachability; Perception

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bourgeois, J. (2012). Représentations motrices et perception de l'espace péripersonnel : Motor representations and the perception of peripersonal space. (Doctoral Dissertation). Lille 3. Retrieved from http://www.theses.fr/2012LIL30039

Chicago Manual of Style (16th Edition):

Bourgeois, Jérémy. “Représentations motrices et perception de l'espace péripersonnel : Motor representations and the perception of peripersonal space.” 2012. Doctoral Dissertation, Lille 3. Accessed October 18, 2019. http://www.theses.fr/2012LIL30039.

MLA Handbook (7th Edition):

Bourgeois, Jérémy. “Représentations motrices et perception de l'espace péripersonnel : Motor representations and the perception of peripersonal space.” 2012. Web. 18 Oct 2019.

Vancouver:

Bourgeois J. Représentations motrices et perception de l'espace péripersonnel : Motor representations and the perception of peripersonal space. [Internet] [Doctoral dissertation]. Lille 3; 2012. [cited 2019 Oct 18]. Available from: http://www.theses.fr/2012LIL30039.

Council of Science Editors:

Bourgeois J. Représentations motrices et perception de l'espace péripersonnel : Motor representations and the perception of peripersonal space. [Doctoral Dissertation]. Lille 3; 2012. Available from: http://www.theses.fr/2012LIL30039


UCLA

17. Zhang, Haitao. NDNFit: An Open mHealth Application Built on Named Data Networking.

Degree: Computer Science, 2018, UCLA

 Inspired by the Open mHealth application architecture, which emphasizes user-controlled data security, reusable common modules and inter-operability among different mHealth applications, this dissertation introduces NDNFit,… (more)

Subjects/Keywords: Computer science; mHealth; mobility; NDN; processing; reachability; security

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, H. (2018). NDNFit: An Open mHealth Application Built on Named Data Networking. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/8h8950n3

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

Zhang, Haitao. “NDNFit: An Open mHealth Application Built on Named Data Networking.” 2018. Thesis, UCLA. Accessed October 18, 2019. http://www.escholarship.org/uc/item/8h8950n3.

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

MLA Handbook (7th Edition):

Zhang, Haitao. “NDNFit: An Open mHealth Application Built on Named Data Networking.” 2018. Web. 18 Oct 2019.

Vancouver:

Zhang H. NDNFit: An Open mHealth Application Built on Named Data Networking. [Internet] [Thesis]. UCLA; 2018. [cited 2019 Oct 18]. Available from: http://www.escholarship.org/uc/item/8h8950n3.

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

Council of Science Editors:

Zhang H. NDNFit: An Open mHealth Application Built on Named Data Networking. [Thesis]. UCLA; 2018. Available from: http://www.escholarship.org/uc/item/8h8950n3

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


Université de Grenoble

18. Karoui, Mohamed. Surveillance des processus dynamiques évènementiels : Monitoring of the event-driven dynamic processes.

Degree: Docteur es, Sciences et technologie industrielles, 2011, Université de Grenoble

Dans le cadre de ce sujet de thèse, on s'intéresse à la surveillance des systèmes hybrides à forte dynamique événementielle. L'objectif est de détecter les… (more)

Subjects/Keywords: Surveillance; Automate hybride linéaire; Analyse d'atteignabilité; Monitoring; Hybrid automata; Reachability analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Karoui, M. (2011). Surveillance des processus dynamiques évènementiels : Monitoring of the event-driven dynamic processes. (Doctoral Dissertation). Université de Grenoble. Retrieved from http://www.theses.fr/2011GRENT110

Chicago Manual of Style (16th Edition):

Karoui, Mohamed. “Surveillance des processus dynamiques évènementiels : Monitoring of the event-driven dynamic processes.” 2011. Doctoral Dissertation, Université de Grenoble. Accessed October 18, 2019. http://www.theses.fr/2011GRENT110.

MLA Handbook (7th Edition):

Karoui, Mohamed. “Surveillance des processus dynamiques évènementiels : Monitoring of the event-driven dynamic processes.” 2011. Web. 18 Oct 2019.

Vancouver:

Karoui M. Surveillance des processus dynamiques évènementiels : Monitoring of the event-driven dynamic processes. [Internet] [Doctoral dissertation]. Université de Grenoble; 2011. [cited 2019 Oct 18]. Available from: http://www.theses.fr/2011GRENT110.

Council of Science Editors:

Karoui M. Surveillance des processus dynamiques évènementiels : Monitoring of the event-driven dynamic processes. [Doctoral Dissertation]. Université de Grenoble; 2011. Available from: http://www.theses.fr/2011GRENT110


Loughborough University

19. Chen, Shang. Reachability problems for systems with linear dynamics.

Degree: PhD, 2016, Loughborough University

 This thesis deals with reachability and freeness problems for systems with linear dynamics, including hybrid systems and matrix semigroups. Hybrid systems are a type of… (more)

Subjects/Keywords: 004.2; Linear dynamics; Hybrid systems; Matrix semigroups; Reachability; Mortality; Freeness

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, S. (2016). Reachability problems for systems with linear dynamics. (Doctoral Dissertation). Loughborough University. Retrieved from https://dspace.lboro.ac.uk/2134/22331 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.706205

Chicago Manual of Style (16th Edition):

Chen, Shang. “Reachability problems for systems with linear dynamics.” 2016. Doctoral Dissertation, Loughborough University. Accessed October 18, 2019. https://dspace.lboro.ac.uk/2134/22331 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.706205.

MLA Handbook (7th Edition):

Chen, Shang. “Reachability problems for systems with linear dynamics.” 2016. Web. 18 Oct 2019.

Vancouver:

Chen S. Reachability problems for systems with linear dynamics. [Internet] [Doctoral dissertation]. Loughborough University; 2016. [cited 2019 Oct 18]. Available from: https://dspace.lboro.ac.uk/2134/22331 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.706205.

Council of Science Editors:

Chen S. Reachability problems for systems with linear dynamics. [Doctoral Dissertation]. Loughborough University; 2016. Available from: https://dspace.lboro.ac.uk/2134/22331 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.706205


Kent State University

20. Xiang, Yang. Reachability, Routing and Distance Labeling Schemes in Graphs with Applications in Networks and Graph Databases.

Degree: PhD, College of Arts and Sciences / Department of Computer Science, 2009, Kent State University

  Three fundamental and related problems, with applications in networks and graph databases, are the focus of this dissertation. They are: how to answer quickly… (more)

Subjects/Keywords: Computer Science; Reachability; Routing; Distance; Labeling schemes; Graphs; Networks; Graph databases

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xiang, Y. (2009). Reachability, Routing and Distance Labeling Schemes in Graphs with Applications in Networks and Graph Databases. (Doctoral Dissertation). Kent State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=kent1258172703

Chicago Manual of Style (16th Edition):

Xiang, Yang. “Reachability, Routing and Distance Labeling Schemes in Graphs with Applications in Networks and Graph Databases.” 2009. Doctoral Dissertation, Kent State University. Accessed October 18, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=kent1258172703.

MLA Handbook (7th Edition):

Xiang, Yang. “Reachability, Routing and Distance Labeling Schemes in Graphs with Applications in Networks and Graph Databases.” 2009. Web. 18 Oct 2019.

Vancouver:

Xiang Y. Reachability, Routing and Distance Labeling Schemes in Graphs with Applications in Networks and Graph Databases. [Internet] [Doctoral dissertation]. Kent State University; 2009. [cited 2019 Oct 18]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1258172703.

Council of Science Editors:

Xiang Y. Reachability, Routing and Distance Labeling Schemes in Graphs with Applications in Networks and Graph Databases. [Doctoral Dissertation]. Kent State University; 2009. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1258172703


Kent State University

21. Ruan, Ning. Network Backbone with Applications in Reachability and Shortest Path Computation.

Degree: PhD, College of Arts and Sciences / Department of Computer Science, 2012, Kent State University

  This dissertation focuses on developing novel techniques to help understand, analyze, and query large graphs by utilizing backbone structures. Network backbone depicts a core… (more)

Subjects/Keywords: Computer Science; network backbone; graph simplification; reachability; shortest path computation; scalability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ruan, N. (2012). Network Backbone with Applications in Reachability and Shortest Path Computation. (Doctoral Dissertation). Kent State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=kent1334516240

Chicago Manual of Style (16th Edition):

Ruan, Ning. “Network Backbone with Applications in Reachability and Shortest Path Computation.” 2012. Doctoral Dissertation, Kent State University. Accessed October 18, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=kent1334516240.

MLA Handbook (7th Edition):

Ruan, Ning. “Network Backbone with Applications in Reachability and Shortest Path Computation.” 2012. Web. 18 Oct 2019.

Vancouver:

Ruan N. Network Backbone with Applications in Reachability and Shortest Path Computation. [Internet] [Doctoral dissertation]. Kent State University; 2012. [cited 2019 Oct 18]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1334516240.

Council of Science Editors:

Ruan N. Network Backbone with Applications in Reachability and Shortest Path Computation. [Doctoral Dissertation]. Kent State University; 2012. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1334516240


Louisiana State University

22. Krishnan, Hari. Garbage Collection for General Graphs.

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

 Garbage collection is moving from being a utility to a requirement of every modern programming language. With multi-core and distributed systems, most programs written recently… (more)

Subjects/Keywords: reachability; graph; distributed algorithm; garbage collection; shared memory; concurrency

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Krishnan, H. (2016). Garbage Collection for General Graphs. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-06232016-154210 ; https://digitalcommons.lsu.edu/gradschool_dissertations/573

Chicago Manual of Style (16th Edition):

Krishnan, Hari. “Garbage Collection for General Graphs.” 2016. Doctoral Dissertation, Louisiana State University. Accessed October 18, 2019. etd-06232016-154210 ; https://digitalcommons.lsu.edu/gradschool_dissertations/573.

MLA Handbook (7th Edition):

Krishnan, Hari. “Garbage Collection for General Graphs.” 2016. Web. 18 Oct 2019.

Vancouver:

Krishnan H. Garbage Collection for General Graphs. [Internet] [Doctoral dissertation]. Louisiana State University; 2016. [cited 2019 Oct 18]. Available from: etd-06232016-154210 ; https://digitalcommons.lsu.edu/gradschool_dissertations/573.

Council of Science Editors:

Krishnan H. Garbage Collection for General Graphs. [Doctoral Dissertation]. Louisiana State University; 2016. Available from: etd-06232016-154210 ; https://digitalcommons.lsu.edu/gradschool_dissertations/573


University of California – Berkeley

23. Chen, Mo. High Dimensional Reachability Analysis: Addressing the Curse of Dimensionality in Formal Verification.

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

 Automation is becoming pervasive in everyday life, and many automated systems, such as unmanned aerial systems, autonomous cars, and many types of robots, are complex… (more)

Subjects/Keywords: Artificial intelligence; Robotics; Dimensionality reduction; Reachability analysis; Robotics; Unmanned Airspace; Verification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, M. (2017). High Dimensional Reachability Analysis: Addressing the Curse of Dimensionality in Formal Verification. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/8m7423mq

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

Chen, Mo. “High Dimensional Reachability Analysis: Addressing the Curse of Dimensionality in Formal Verification.” 2017. Thesis, University of California – Berkeley. Accessed October 18, 2019. http://www.escholarship.org/uc/item/8m7423mq.

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

MLA Handbook (7th Edition):

Chen, Mo. “High Dimensional Reachability Analysis: Addressing the Curse of Dimensionality in Formal Verification.” 2017. Web. 18 Oct 2019.

Vancouver:

Chen M. High Dimensional Reachability Analysis: Addressing the Curse of Dimensionality in Formal Verification. [Internet] [Thesis]. University of California – Berkeley; 2017. [cited 2019 Oct 18]. Available from: http://www.escholarship.org/uc/item/8m7423mq.

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

Council of Science Editors:

Chen M. High Dimensional Reachability Analysis: Addressing the Curse of Dimensionality in Formal Verification. [Thesis]. University of California – Berkeley; 2017. Available from: http://www.escholarship.org/uc/item/8m7423mq

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


Virginia Tech

24. Roy, Tonmoy. Reachability Analysis of RTL Circuits Using k-Induction Bounded Model Checking and Test Vector Compaction.

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

 In the first half of this thesis, a novel approach for k-induction bounded model checking using signal domain constraints and property partitioning for proving unreachability… (more)

Subjects/Keywords: RTL Verification; Reachability; k-Induction; Bounded Model Checking; Test Vector Compaction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Roy, T. (2017). Reachability Analysis of RTL Circuits Using k-Induction Bounded Model Checking and Test Vector Compaction. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/78801

Chicago Manual of Style (16th Edition):

Roy, Tonmoy. “Reachability Analysis of RTL Circuits Using k-Induction Bounded Model Checking and Test Vector Compaction.” 2017. Masters Thesis, Virginia Tech. Accessed October 18, 2019. http://hdl.handle.net/10919/78801.

MLA Handbook (7th Edition):

Roy, Tonmoy. “Reachability Analysis of RTL Circuits Using k-Induction Bounded Model Checking and Test Vector Compaction.” 2017. Web. 18 Oct 2019.

Vancouver:

Roy T. Reachability Analysis of RTL Circuits Using k-Induction Bounded Model Checking and Test Vector Compaction. [Internet] [Masters thesis]. Virginia Tech; 2017. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/10919/78801.

Council of Science Editors:

Roy T. Reachability Analysis of RTL Circuits Using k-Induction Bounded Model Checking and Test Vector Compaction. [Masters Thesis]. Virginia Tech; 2017. Available from: http://hdl.handle.net/10919/78801


Delft University of Technology

25. Govindarajan, N. An optimal control approach for estimating aircraft command margins:.

Degree: 2012, Delft University of Technology

 This dissertation presents an optimal control framework to determine a collection of open-loop command signals, that mathematically guarantees operation of a dynamical system within prescribed… (more)

Subjects/Keywords: optimal control; Hamilton Jacobi Bellman PDE; flight envelope protection; reachability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Govindarajan, N. (2012). An optimal control approach for estimating aircraft command margins:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:48dbad61-728a-4c7e-ba3e-cf8382ef1cef

Chicago Manual of Style (16th Edition):

Govindarajan, N. “An optimal control approach for estimating aircraft command margins:.” 2012. Masters Thesis, Delft University of Technology. Accessed October 18, 2019. http://resolver.tudelft.nl/uuid:48dbad61-728a-4c7e-ba3e-cf8382ef1cef.

MLA Handbook (7th Edition):

Govindarajan, N. “An optimal control approach for estimating aircraft command margins:.” 2012. Web. 18 Oct 2019.

Vancouver:

Govindarajan N. An optimal control approach for estimating aircraft command margins:. [Internet] [Masters thesis]. Delft University of Technology; 2012. [cited 2019 Oct 18]. Available from: http://resolver.tudelft.nl/uuid:48dbad61-728a-4c7e-ba3e-cf8382ef1cef.

Council of Science Editors:

Govindarajan N. An optimal control approach for estimating aircraft command margins:. [Masters Thesis]. Delft University of Technology; 2012. Available from: http://resolver.tudelft.nl/uuid:48dbad61-728a-4c7e-ba3e-cf8382ef1cef


University of New Mexico

26. Malone, Nick D. High-Dimensional Motion Planning and Learning Under Uncertain Conditions.

Degree: Department of Computer Science, 2015, University of New Mexico

 Many existing path planning methods do not adequately account for uncertainty. Without uncertainty these existing techniques work well, but in real world environments they struggle… (more)

Subjects/Keywords: Path Planning; Uncertainty; Stochastic Reachability; Reinforcement Learning; Modeling Error

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Malone, N. D. (2015). High-Dimensional Motion Planning and Learning Under Uncertain Conditions. (Doctoral Dissertation). University of New Mexico. Retrieved from http://hdl.handle.net/1928/31730

Chicago Manual of Style (16th Edition):

Malone, Nick D. “High-Dimensional Motion Planning and Learning Under Uncertain Conditions.” 2015. Doctoral Dissertation, University of New Mexico. Accessed October 18, 2019. http://hdl.handle.net/1928/31730.

MLA Handbook (7th Edition):

Malone, Nick D. “High-Dimensional Motion Planning and Learning Under Uncertain Conditions.” 2015. Web. 18 Oct 2019.

Vancouver:

Malone ND. High-Dimensional Motion Planning and Learning Under Uncertain Conditions. [Internet] [Doctoral dissertation]. University of New Mexico; 2015. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/1928/31730.

Council of Science Editors:

Malone ND. High-Dimensional Motion Planning and Learning Under Uncertain Conditions. [Doctoral Dissertation]. University of New Mexico; 2015. Available from: http://hdl.handle.net/1928/31730


University of New Mexico

27. Shubert, Matthew. Computing the Reach-Avoid Set for Space Vehicle Maneuvering in the Presence of Debris.

Degree: Electrical and Computer Engineering, 2017, University of New Mexico

  The ability to guarantee the safety of autonomously controlled space vehicles is of great importance to help avoid accidents and ensure mission success. In… (more)

Subjects/Keywords: reach-avoid; reachability; space vehicle; debris avoidance; Electrical and Computer Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shubert, M. (2017). Computing the Reach-Avoid Set for Space Vehicle Maneuvering in the Presence of Debris. (Masters Thesis). University of New Mexico. Retrieved from https://digitalrepository.unm.edu/ece_etds/341

Chicago Manual of Style (16th Edition):

Shubert, Matthew. “Computing the Reach-Avoid Set for Space Vehicle Maneuvering in the Presence of Debris.” 2017. Masters Thesis, University of New Mexico. Accessed October 18, 2019. https://digitalrepository.unm.edu/ece_etds/341.

MLA Handbook (7th Edition):

Shubert, Matthew. “Computing the Reach-Avoid Set for Space Vehicle Maneuvering in the Presence of Debris.” 2017. Web. 18 Oct 2019.

Vancouver:

Shubert M. Computing the Reach-Avoid Set for Space Vehicle Maneuvering in the Presence of Debris. [Internet] [Masters thesis]. University of New Mexico; 2017. [cited 2019 Oct 18]. Available from: https://digitalrepository.unm.edu/ece_etds/341.

Council of Science Editors:

Shubert M. Computing the Reach-Avoid Set for Space Vehicle Maneuvering in the Presence of Debris. [Masters Thesis]. University of New Mexico; 2017. Available from: https://digitalrepository.unm.edu/ece_etds/341


University of Illinois – Urbana-Champaign

28. Hope, Eric M. Design verification of power electronics systems subject to bounded uncertain inputs.

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

 This thesis proposes a new methodology for design verification of power electronics systems subject to bounded uncertain inputs. In this method, the power electronics system,… (more)

Subjects/Keywords: power electronics; design verification; power converters; reachability analysis; switched-linear systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hope, E. M. (2010). Design verification of power electronics systems subject to bounded uncertain inputs. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/14643

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

Hope, Eric M. “Design verification of power electronics systems subject to bounded uncertain inputs.” 2010. Thesis, University of Illinois – Urbana-Champaign. Accessed October 18, 2019. http://hdl.handle.net/2142/14643.

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

MLA Handbook (7th Edition):

Hope, Eric M. “Design verification of power electronics systems subject to bounded uncertain inputs.” 2010. Web. 18 Oct 2019.

Vancouver:

Hope EM. Design verification of power electronics systems subject to bounded uncertain inputs. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2010. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/2142/14643.

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

Council of Science Editors:

Hope EM. Design verification of power electronics systems subject to bounded uncertain inputs. [Thesis]. University of Illinois – Urbana-Champaign; 2010. Available from: http://hdl.handle.net/2142/14643

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


University of New South Wales

29. Legg, Alexander. A Counterexample Guided Method.

Degree: Computer Science & Engineering, 2016, University of New South Wales

 Software controllers of reactive systems are ubiquitous in situations where incorrectness has a high cost. In order to place trust in the software, strong guarantees… (more)

Subjects/Keywords: reachability; reactive synthesis; counterexample guided; safety; satisfiability (SAT); interpolation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Legg, A. (2016). A Counterexample Guided Method. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/58766 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:47511/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Legg, Alexander. “A Counterexample Guided Method.” 2016. Doctoral Dissertation, University of New South Wales. Accessed October 18, 2019. http://handle.unsw.edu.au/1959.4/58766 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:47511/SOURCE02?view=true.

MLA Handbook (7th Edition):

Legg, Alexander. “A Counterexample Guided Method.” 2016. Web. 18 Oct 2019.

Vancouver:

Legg A. A Counterexample Guided Method. [Internet] [Doctoral dissertation]. University of New South Wales; 2016. [cited 2019 Oct 18]. Available from: http://handle.unsw.edu.au/1959.4/58766 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:47511/SOURCE02?view=true.

Council of Science Editors:

Legg A. A Counterexample Guided Method. [Doctoral Dissertation]. University of New South Wales; 2016. Available from: http://handle.unsw.edu.au/1959.4/58766 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:47511/SOURCE02?view=true


University of Sydney

30. Hollingum, Nicholas. On the Practice and Application of Context-Free Language Reachability .

Degree: 2017, University of Sydney

 The Context-Free Language Reachability (CFL-R) formalism relates to some of the most important computational problems facing researchers and industry practitioners. CFL-R is a generalisation of… (more)

Subjects/Keywords: context-free languages; static analysis; points-to-analysis; datalog; reachability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hollingum, N. (2017). On the Practice and Application of Context-Free Language Reachability . (Thesis). University of Sydney. Retrieved from http://hdl.handle.net/2123/17866

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

Hollingum, Nicholas. “On the Practice and Application of Context-Free Language Reachability .” 2017. Thesis, University of Sydney. Accessed October 18, 2019. http://hdl.handle.net/2123/17866.

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

MLA Handbook (7th Edition):

Hollingum, Nicholas. “On the Practice and Application of Context-Free Language Reachability .” 2017. Web. 18 Oct 2019.

Vancouver:

Hollingum N. On the Practice and Application of Context-Free Language Reachability . [Internet] [Thesis]. University of Sydney; 2017. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/2123/17866.

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

Council of Science Editors:

Hollingum N. On the Practice and Application of Context-Free Language Reachability . [Thesis]. University of Sydney; 2017. Available from: http://hdl.handle.net/2123/17866

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

[1] [2] [3] [4] [5]

.