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

[1] [2] [3] [4] [5] … [14]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


Università della Svizzera italiana

1. de Sá Alt, Leonardo. Controlled and effective interpolation.

Degree: 2016, Università della Svizzera italiana

Model checking is a well established technique to verify systems, exhaustively and automatically. The state space explosion, known as the main difficulty in model checking(more)

Subjects/Keywords: Model checking

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

de Sá Alt, L. (2016). Controlled and effective interpolation. (Thesis). Università della Svizzera italiana. Retrieved from http://doc.rero.ch/record/309121

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

de Sá Alt, Leonardo. “Controlled and effective interpolation.” 2016. Thesis, Università della Svizzera italiana. Accessed May 26, 2019. http://doc.rero.ch/record/309121.

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

MLA Handbook (7th Edition):

de Sá Alt, Leonardo. “Controlled and effective interpolation.” 2016. Web. 26 May 2019.

Vancouver:

de Sá Alt L. Controlled and effective interpolation. [Internet] [Thesis]. Università della Svizzera italiana; 2016. [cited 2019 May 26]. Available from: http://doc.rero.ch/record/309121.

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

Council of Science Editors:

de Sá Alt L. Controlled and effective interpolation. [Thesis]. Università della Svizzera italiana; 2016. Available from: http://doc.rero.ch/record/309121

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

2. Pellegrino, Giancarlo. Détection d'anomalies logiques dans les logiciels d'entreprise multi-partis à travers des tests de sécurité : Detection of logic flaws in multi-party business applications via security testing.

Degree: Docteur es, Informatique et réseaux, 2013, Paris, ENST

Les logiciels multi-partis sont des applications distribuées sur le web qui mettent en oeuvre des fonctions collaboratives. Ces applications sont les principales cibles des attaquants… (more)

Subjects/Keywords: Authentification unique; Model checking; SSO; Model checking

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pellegrino, G. (2013). Détection d'anomalies logiques dans les logiciels d'entreprise multi-partis à travers des tests de sécurité : Detection of logic flaws in multi-party business applications via security testing. (Doctoral Dissertation). Paris, ENST. Retrieved from http://www.theses.fr/2013ENST0064

Chicago Manual of Style (16th Edition):

Pellegrino, Giancarlo. “Détection d'anomalies logiques dans les logiciels d'entreprise multi-partis à travers des tests de sécurité : Detection of logic flaws in multi-party business applications via security testing.” 2013. Doctoral Dissertation, Paris, ENST. Accessed May 26, 2019. http://www.theses.fr/2013ENST0064.

MLA Handbook (7th Edition):

Pellegrino, Giancarlo. “Détection d'anomalies logiques dans les logiciels d'entreprise multi-partis à travers des tests de sécurité : Detection of logic flaws in multi-party business applications via security testing.” 2013. Web. 26 May 2019.

Vancouver:

Pellegrino G. Détection d'anomalies logiques dans les logiciels d'entreprise multi-partis à travers des tests de sécurité : Detection of logic flaws in multi-party business applications via security testing. [Internet] [Doctoral dissertation]. Paris, ENST; 2013. [cited 2019 May 26]. Available from: http://www.theses.fr/2013ENST0064.

Council of Science Editors:

Pellegrino G. Détection d'anomalies logiques dans les logiciels d'entreprise multi-partis à travers des tests de sécurité : Detection of logic flaws in multi-party business applications via security testing. [Doctoral Dissertation]. Paris, ENST; 2013. Available from: http://www.theses.fr/2013ENST0064


Brno University of Technology

3. Chalk, Matěj. Nástroj pro abstraktní regulární model checking .

Degree: 2018, Brno University of Technology

 Metody formální verifikace mohou poskytnout automatizované ověření korektnosti softwaru (stavěné na matematických základech), což je velmi důležité. Jednou z těchto metod je abstraktní regulární model(more)

Subjects/Keywords: formální verifikace; model checking; regulární model checking; abstraktní regulární model checking; automaty; převodníky; symbolické automaty; formal verification; model checking; regular model checking; abstract regular model checking; automata; transducers; symbolic automata

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chalk, M. (2018). Nástroj pro abstraktní regulární model checking . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/84907

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

Chalk, Matěj. “Nástroj pro abstraktní regulární model checking .” 2018. Thesis, Brno University of Technology. Accessed May 26, 2019. http://hdl.handle.net/11012/84907.

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

MLA Handbook (7th Edition):

Chalk, Matěj. “Nástroj pro abstraktní regulární model checking .” 2018. Web. 26 May 2019.

Vancouver:

Chalk M. Nástroj pro abstraktní regulární model checking . [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2019 May 26]. Available from: http://hdl.handle.net/11012/84907.

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

Council of Science Editors:

Chalk M. Nástroj pro abstraktní regulární model checking . [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/84907

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


University of Limerick

4. Pantelic, Vera. Inspection of concurrent systems: combining tables, theorem proving and model checking.

Degree: 2006, University of Limerick

non-peer-reviewed

A process for rigorous inspection of concurrent systems using tabular specification was developed and applied to the classic Readers/Writers concurrent program by Jin in… (more)

Subjects/Keywords: model checking

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pantelic, V. (2006). Inspection of concurrent systems: combining tables, theorem proving and model checking. (Thesis). University of Limerick. Retrieved from http://hdl.handle.net/10344/159

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

Pantelic, Vera. “Inspection of concurrent systems: combining tables, theorem proving and model checking.” 2006. Thesis, University of Limerick. Accessed May 26, 2019. http://hdl.handle.net/10344/159.

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

MLA Handbook (7th Edition):

Pantelic, Vera. “Inspection of concurrent systems: combining tables, theorem proving and model checking.” 2006. Web. 26 May 2019.

Vancouver:

Pantelic V. Inspection of concurrent systems: combining tables, theorem proving and model checking. [Internet] [Thesis]. University of Limerick; 2006. [cited 2019 May 26]. Available from: http://hdl.handle.net/10344/159.

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

Council of Science Editors:

Pantelic V. Inspection of concurrent systems: combining tables, theorem proving and model checking. [Thesis]. University of Limerick; 2006. Available from: http://hdl.handle.net/10344/159

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


University of Canterbury

5. Keating, Daniel. Model Checking Time Triggered CAN Protocols.

Degree: Electrical and Computer Engineering, 2011, University of Canterbury

Model checking is used to aid in the design and verification of complex concurrent systems. An abstracted finite state model of a system and a… (more)

Subjects/Keywords: TTCAN; CAN; model checking; SPIN

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Keating, D. (2011). Model Checking Time Triggered CAN Protocols. (Thesis). University of Canterbury. Retrieved from http://hdl.handle.net/10092/5754

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

Keating, Daniel. “Model Checking Time Triggered CAN Protocols.” 2011. Thesis, University of Canterbury. Accessed May 26, 2019. http://hdl.handle.net/10092/5754.

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

MLA Handbook (7th Edition):

Keating, Daniel. “Model Checking Time Triggered CAN Protocols.” 2011. Web. 26 May 2019.

Vancouver:

Keating D. Model Checking Time Triggered CAN Protocols. [Internet] [Thesis]. University of Canterbury; 2011. [cited 2019 May 26]. Available from: http://hdl.handle.net/10092/5754.

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

Council of Science Editors:

Keating D. Model Checking Time Triggered CAN Protocols. [Thesis]. University of Canterbury; 2011. Available from: http://hdl.handle.net/10092/5754

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

6. Kang, Eun-Young. Abstractions booléennes pour la vérification des systèmes temps-réel : Tools supported real-time system verification with combination of abstraction/deduction and Model checking.

Degree: Docteur es, Informatique, 2007, Université Henri Poincaré – Nancy I

Cette thèse présente un schéma formel et efficace pour la vérification de systèmes temps-réel. Ce schéma repose sur la combinaison par abstraction de techniques déductives… (more)

Subjects/Keywords: Model checking

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kang, E. (2007). Abstractions booléennes pour la vérification des systèmes temps-réel : Tools supported real-time system verification with combination of abstraction/deduction and Model checking. (Doctoral Dissertation). Université Henri Poincaré – Nancy I. Retrieved from http://www.theses.fr/2007NAN10089

Chicago Manual of Style (16th Edition):

Kang, Eun-Young. “Abstractions booléennes pour la vérification des systèmes temps-réel : Tools supported real-time system verification with combination of abstraction/deduction and Model checking.” 2007. Doctoral Dissertation, Université Henri Poincaré – Nancy I. Accessed May 26, 2019. http://www.theses.fr/2007NAN10089.

MLA Handbook (7th Edition):

Kang, Eun-Young. “Abstractions booléennes pour la vérification des systèmes temps-réel : Tools supported real-time system verification with combination of abstraction/deduction and Model checking.” 2007. Web. 26 May 2019.

Vancouver:

Kang E. Abstractions booléennes pour la vérification des systèmes temps-réel : Tools supported real-time system verification with combination of abstraction/deduction and Model checking. [Internet] [Doctoral dissertation]. Université Henri Poincaré – Nancy I; 2007. [cited 2019 May 26]. Available from: http://www.theses.fr/2007NAN10089.

Council of Science Editors:

Kang E. Abstractions booléennes pour la vérification des systèmes temps-réel : Tools supported real-time system verification with combination of abstraction/deduction and Model checking. [Doctoral Dissertation]. Université Henri Poincaré – Nancy I; 2007. Available from: http://www.theses.fr/2007NAN10089


Université Catholique de Louvain

7. Nauw, Olivier. A framework for visualizing and manipulating structured execution graphs.

Degree: 2015, Université Catholique de Louvain

Ce travail présente un outil qui permet d'afficher et de manipuler des graphes d’exécutions structurées. Ceux-ci représentent des chemins possibles dans un système et ils… (more)

Subjects/Keywords: Graphes; Model Checking; Visualisation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nauw, O. (2015). A framework for visualizing and manipulating structured execution graphs. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/thesis:3128

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

Nauw, Olivier. “A framework for visualizing and manipulating structured execution graphs.” 2015. Thesis, Université Catholique de Louvain. Accessed May 26, 2019. http://hdl.handle.net/2078.1/thesis:3128.

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

MLA Handbook (7th Edition):

Nauw, Olivier. “A framework for visualizing and manipulating structured execution graphs.” 2015. Web. 26 May 2019.

Vancouver:

Nauw O. A framework for visualizing and manipulating structured execution graphs. [Internet] [Thesis]. Université Catholique de Louvain; 2015. [cited 2019 May 26]. Available from: http://hdl.handle.net/2078.1/thesis:3128.

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

Council of Science Editors:

Nauw O. A framework for visualizing and manipulating structured execution graphs. [Thesis]. Université Catholique de Louvain; 2015. Available from: http://hdl.handle.net/2078.1/thesis:3128

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


Virginia Tech

8. Adhikari, Kiran. Verifying a Quantitative Relaxation of Linearizability via Refinement.

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

 Concurrent data structures have found increasingly widespread use in both multicore and distributed computing environments, thereby escalating the priority for verifying their correctness. The thread… (more)

Subjects/Keywords: Quasi Linearizability; Refinement; Model Checking

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Adhikari, K. (2013). Verifying a Quantitative Relaxation of Linearizability via Refinement. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/23222

Chicago Manual of Style (16th Edition):

Adhikari, Kiran. “Verifying a Quantitative Relaxation of Linearizability via Refinement.” 2013. Masters Thesis, Virginia Tech. Accessed May 26, 2019. http://hdl.handle.net/10919/23222.

MLA Handbook (7th Edition):

Adhikari, Kiran. “Verifying a Quantitative Relaxation of Linearizability via Refinement.” 2013. Web. 26 May 2019.

Vancouver:

Adhikari K. Verifying a Quantitative Relaxation of Linearizability via Refinement. [Internet] [Masters thesis]. Virginia Tech; 2013. [cited 2019 May 26]. Available from: http://hdl.handle.net/10919/23222.

Council of Science Editors:

Adhikari K. Verifying a Quantitative Relaxation of Linearizability via Refinement. [Masters Thesis]. Virginia Tech; 2013. Available from: http://hdl.handle.net/10919/23222


University of Waterloo

9. Ben-David, Shoham. Applications of Description Logic and Causality in Model Checking.

Degree: 2009, University of Waterloo

Model checking is an automated technique for the verification of finite-state systems that is widely used in practice. In model checking, a model M is… (more)

Subjects/Keywords: Model Checking; Description Logic; Causality

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ben-David, S. (2009). Applications of Description Logic and Causality in Model Checking. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/4485

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

Ben-David, Shoham. “Applications of Description Logic and Causality in Model Checking.” 2009. Thesis, University of Waterloo. Accessed May 26, 2019. http://hdl.handle.net/10012/4485.

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

MLA Handbook (7th Edition):

Ben-David, Shoham. “Applications of Description Logic and Causality in Model Checking.” 2009. Web. 26 May 2019.

Vancouver:

Ben-David S. Applications of Description Logic and Causality in Model Checking. [Internet] [Thesis]. University of Waterloo; 2009. [cited 2019 May 26]. Available from: http://hdl.handle.net/10012/4485.

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

Council of Science Editors:

Ben-David S. Applications of Description Logic and Causality in Model Checking. [Thesis]. University of Waterloo; 2009. Available from: http://hdl.handle.net/10012/4485

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


University of Waterloo

10. Taleghani, Ali. Using Software Model Checking for Software Certification.

Degree: 2010, University of Waterloo

 Software certification is defined as the process of independently confirming that a system or component complies with its specified requirements and is acceptable for use.… (more)

Subjects/Keywords: Model Checking; Software Certification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Taleghani, A. (2010). Using Software Model Checking for Software Certification. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5484

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

Taleghani, Ali. “Using Software Model Checking for Software Certification.” 2010. Thesis, University of Waterloo. Accessed May 26, 2019. http://hdl.handle.net/10012/5484.

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

MLA Handbook (7th Edition):

Taleghani, Ali. “Using Software Model Checking for Software Certification.” 2010. Web. 26 May 2019.

Vancouver:

Taleghani A. Using Software Model Checking for Software Certification. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2019 May 26]. Available from: http://hdl.handle.net/10012/5484.

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

Council of Science Editors:

Taleghani A. Using Software Model Checking for Software Certification. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/5484

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


Princeton University

11. Ahn, Sunha. AUTOMATED FIRMWARE VERIFICATION USING FIRMWARE-HARDWARE INTERACTION PATTERNS .

Degree: PhD, 2016, Princeton University

 Firmware refers to low-level software that is tied to a specific hardware platform. For instance, low-level drivers that physically interface with the peripherals are an… (more)

Subjects/Keywords: Firmware; Model checking; Testing; Verifiation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ahn, S. (2016). AUTOMATED FIRMWARE VERIFICATION USING FIRMWARE-HARDWARE INTERACTION PATTERNS . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01s4655k00v

Chicago Manual of Style (16th Edition):

Ahn, Sunha. “AUTOMATED FIRMWARE VERIFICATION USING FIRMWARE-HARDWARE INTERACTION PATTERNS .” 2016. Doctoral Dissertation, Princeton University. Accessed May 26, 2019. http://arks.princeton.edu/ark:/88435/dsp01s4655k00v.

MLA Handbook (7th Edition):

Ahn, Sunha. “AUTOMATED FIRMWARE VERIFICATION USING FIRMWARE-HARDWARE INTERACTION PATTERNS .” 2016. Web. 26 May 2019.

Vancouver:

Ahn S. AUTOMATED FIRMWARE VERIFICATION USING FIRMWARE-HARDWARE INTERACTION PATTERNS . [Internet] [Doctoral dissertation]. Princeton University; 2016. [cited 2019 May 26]. Available from: http://arks.princeton.edu/ark:/88435/dsp01s4655k00v.

Council of Science Editors:

Ahn S. AUTOMATED FIRMWARE VERIFICATION USING FIRMWARE-HARDWARE INTERACTION PATTERNS . [Doctoral Dissertation]. Princeton University; 2016. Available from: http://arks.princeton.edu/ark:/88435/dsp01s4655k00v

12. Bozianu, Rodica. Synthesis of Interactive Reactive Systems : Synthèse des systèmes réactifs interactifs.

Degree: Docteur es, Informatique, 2016, Université Paris-Est

Nous étudions le problème de la synthèse automatique de programmes dans des architectures multi-composants tels qu'elles respectent les spécifications par construction. Le principal objectif de… (more)

Subjects/Keywords: Synthèse; Model Checking; Verification; Jeux; Synthesis; Model Checking; Verification; Games

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bozianu, R. (2016). Synthesis of Interactive Reactive Systems : Synthèse des systèmes réactifs interactifs. (Doctoral Dissertation). Université Paris-Est. Retrieved from http://www.theses.fr/2016PESC1026

Chicago Manual of Style (16th Edition):

Bozianu, Rodica. “Synthesis of Interactive Reactive Systems : Synthèse des systèmes réactifs interactifs.” 2016. Doctoral Dissertation, Université Paris-Est. Accessed May 26, 2019. http://www.theses.fr/2016PESC1026.

MLA Handbook (7th Edition):

Bozianu, Rodica. “Synthesis of Interactive Reactive Systems : Synthèse des systèmes réactifs interactifs.” 2016. Web. 26 May 2019.

Vancouver:

Bozianu R. Synthesis of Interactive Reactive Systems : Synthèse des systèmes réactifs interactifs. [Internet] [Doctoral dissertation]. Université Paris-Est; 2016. [cited 2019 May 26]. Available from: http://www.theses.fr/2016PESC1026.

Council of Science Editors:

Bozianu R. Synthesis of Interactive Reactive Systems : Synthèse des systèmes réactifs interactifs. [Doctoral Dissertation]. Université Paris-Est; 2016. Available from: http://www.theses.fr/2016PESC1026

13. Sakho, Mouhamadou Tafsir. ⌈-Pomset pour la modélisation et la vérification de systèmes parallèles : ⌈-Pomset for modelling and verifying parallel systems.

Degree: Docteur es, Mathématiques-Informatique, 2014, Orléans; Université polytechnique de l'Ouest Africain (Dakar, Sénégal)

Un comportement distribué peut être décrit avec un multi-ensemble partiellement ordonné (pomset). Bien que compacts et très intuitifs, ces modèles sont difficiles à vérifier. La… (more)

Subjects/Keywords: Pomset; Model-checking; Satisfiabilité; Traces; Pomset; Model-checking; Satisfiability; Trace; 004.3

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sakho, M. T. (2014). ⌈-Pomset pour la modélisation et la vérification de systèmes parallèles : ⌈-Pomset for modelling and verifying parallel systems. (Doctoral Dissertation). Orléans; Université polytechnique de l'Ouest Africain (Dakar, Sénégal). Retrieved from http://www.theses.fr/2014ORLE2068

Chicago Manual of Style (16th Edition):

Sakho, Mouhamadou Tafsir. “⌈-Pomset pour la modélisation et la vérification de systèmes parallèles : ⌈-Pomset for modelling and verifying parallel systems.” 2014. Doctoral Dissertation, Orléans; Université polytechnique de l'Ouest Africain (Dakar, Sénégal). Accessed May 26, 2019. http://www.theses.fr/2014ORLE2068.

MLA Handbook (7th Edition):

Sakho, Mouhamadou Tafsir. “⌈-Pomset pour la modélisation et la vérification de systèmes parallèles : ⌈-Pomset for modelling and verifying parallel systems.” 2014. Web. 26 May 2019.

Vancouver:

Sakho MT. ⌈-Pomset pour la modélisation et la vérification de systèmes parallèles : ⌈-Pomset for modelling and verifying parallel systems. [Internet] [Doctoral dissertation]. Orléans; Université polytechnique de l'Ouest Africain (Dakar, Sénégal); 2014. [cited 2019 May 26]. Available from: http://www.theses.fr/2014ORLE2068.

Council of Science Editors:

Sakho MT. ⌈-Pomset pour la modélisation et la vérification de systèmes parallèles : ⌈-Pomset for modelling and verifying parallel systems. [Doctoral Dissertation]. Orléans; Université polytechnique de l'Ouest Africain (Dakar, Sénégal); 2014. Available from: http://www.theses.fr/2014ORLE2068

14. Declerck, David. Vérification par model-checking de programmes concurrents paramétrés sur des modèles mémoires faibles : Verification via Model Checking of Parameterized Concurrent Programs on Weak Memory Models.

Degree: Docteur es, Informatique, 2018, Paris Saclay

Les multiprocesseurs et microprocesseurs multicœurs modernes mettent en oeuvre des modèles mémoires dits faibles ou relâchés, dans dans lesquels l'ordre apparent des opérations mémoire ne… (more)

Subjects/Keywords: Mémoire faible; Model checking; Vérification; Weak memory; Model checking; Verification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Declerck, D. (2018). Vérification par model-checking de programmes concurrents paramétrés sur des modèles mémoires faibles : Verification via Model Checking of Parameterized Concurrent Programs on Weak Memory Models. (Doctoral Dissertation). Paris Saclay. Retrieved from http://www.theses.fr/2018SACLS336

Chicago Manual of Style (16th Edition):

Declerck, David. “Vérification par model-checking de programmes concurrents paramétrés sur des modèles mémoires faibles : Verification via Model Checking of Parameterized Concurrent Programs on Weak Memory Models.” 2018. Doctoral Dissertation, Paris Saclay. Accessed May 26, 2019. http://www.theses.fr/2018SACLS336.

MLA Handbook (7th Edition):

Declerck, David. “Vérification par model-checking de programmes concurrents paramétrés sur des modèles mémoires faibles : Verification via Model Checking of Parameterized Concurrent Programs on Weak Memory Models.” 2018. Web. 26 May 2019.

Vancouver:

Declerck D. Vérification par model-checking de programmes concurrents paramétrés sur des modèles mémoires faibles : Verification via Model Checking of Parameterized Concurrent Programs on Weak Memory Models. [Internet] [Doctoral dissertation]. Paris Saclay; 2018. [cited 2019 May 26]. Available from: http://www.theses.fr/2018SACLS336.

Council of Science Editors:

Declerck D. Vérification par model-checking de programmes concurrents paramétrés sur des modèles mémoires faibles : Verification via Model Checking of Parameterized Concurrent Programs on Weak Memory Models. [Doctoral Dissertation]. Paris Saclay; 2018. Available from: http://www.theses.fr/2018SACLS336

15. Fronc, Lukasz. Compilation de réseaux de Petri : modèles haut niveau et symétries de processus : Compilation of Petri nets : high-level models and process symmetries.

Degree: Docteur es, Informatique, 2013, Evry-Val d'Essonne

Cette thèse s'intéresse à la vérification de systèmes automatisables par model-checking. La question sous-jacente autour de laquelle se construit la contribution est la recherche d'un… (more)

Subjects/Keywords: Model-checking; Model-checking; High-level Petri nets; Compilation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fronc, L. (2013). Compilation de réseaux de Petri : modèles haut niveau et symétries de processus : Compilation of Petri nets : high-level models and process symmetries. (Doctoral Dissertation). Evry-Val d'Essonne. Retrieved from http://www.theses.fr/2013EVRY0034

Chicago Manual of Style (16th Edition):

Fronc, Lukasz. “Compilation de réseaux de Petri : modèles haut niveau et symétries de processus : Compilation of Petri nets : high-level models and process symmetries.” 2013. Doctoral Dissertation, Evry-Val d'Essonne. Accessed May 26, 2019. http://www.theses.fr/2013EVRY0034.

MLA Handbook (7th Edition):

Fronc, Lukasz. “Compilation de réseaux de Petri : modèles haut niveau et symétries de processus : Compilation of Petri nets : high-level models and process symmetries.” 2013. Web. 26 May 2019.

Vancouver:

Fronc L. Compilation de réseaux de Petri : modèles haut niveau et symétries de processus : Compilation of Petri nets : high-level models and process symmetries. [Internet] [Doctoral dissertation]. Evry-Val d'Essonne; 2013. [cited 2019 May 26]. Available from: http://www.theses.fr/2013EVRY0034.

Council of Science Editors:

Fronc L. Compilation de réseaux de Petri : modèles haut niveau et symétries de processus : Compilation of Petri nets : high-level models and process symmetries. [Doctoral Dissertation]. Evry-Val d'Essonne; 2013. Available from: http://www.theses.fr/2013EVRY0034

16. Naujokat, Stefan. Automatische Generierung von Prozessen im jABC.

Degree: 2009, Technische Universität Dortmund

 Serviceorientierung ist ein zentrales Element zur Wiederverwendung in der Softwareentwicklung und die Modellierung von ausführbaren Prozessen aus Services (Orchestrierung) ermöglicht auch Anwendungsexperten, die in der… (more)

Subjects/Keywords: Datenflussanalyse; Lose Spezifikation; Model checking; Prozesssynthese; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Naujokat, S. (2009). Automatische Generierung von Prozessen im jABC. (Thesis). Technische Universität Dortmund. Retrieved from http://hdl.handle.net/2003/29822

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

Naujokat, Stefan. “Automatische Generierung von Prozessen im jABC.” 2009. Thesis, Technische Universität Dortmund. Accessed May 26, 2019. http://hdl.handle.net/2003/29822.

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

MLA Handbook (7th Edition):

Naujokat, Stefan. “Automatische Generierung von Prozessen im jABC.” 2009. Web. 26 May 2019.

Vancouver:

Naujokat S. Automatische Generierung von Prozessen im jABC. [Internet] [Thesis]. Technische Universität Dortmund; 2009. [cited 2019 May 26]. Available from: http://hdl.handle.net/2003/29822.

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

Council of Science Editors:

Naujokat S. Automatische Generierung von Prozessen im jABC. [Thesis]. Technische Universität Dortmund; 2009. Available from: http://hdl.handle.net/2003/29822

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

17. Oliveira, João Paulo dos Santos. Rabbit: A novel approach to find data-races during state-space exploration .

Degree: 2012, Universidade Federal de Pernambuco

 Data-races are an important kind of error in concurrent shared-memory programs. Software model checking is a popular approach to find them. This research proposes a… (more)

Subjects/Keywords: Concorrency; Software Verification; Model Checking; Race conditions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Oliveira, J. P. d. S. (2012). Rabbit: A novel approach to find data-races during state-space exploration . (Thesis). Universidade Federal de Pernambuco. Retrieved from http://repositorio.ufpe.br/handle/123456789/10891

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

Oliveira, João Paulo dos Santos. “Rabbit: A novel approach to find data-races during state-space exploration .” 2012. Thesis, Universidade Federal de Pernambuco. Accessed May 26, 2019. http://repositorio.ufpe.br/handle/123456789/10891.

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

MLA Handbook (7th Edition):

Oliveira, João Paulo dos Santos. “Rabbit: A novel approach to find data-races during state-space exploration .” 2012. Web. 26 May 2019.

Vancouver:

Oliveira JPdS. Rabbit: A novel approach to find data-races during state-space exploration . [Internet] [Thesis]. Universidade Federal de Pernambuco; 2012. [cited 2019 May 26]. Available from: http://repositorio.ufpe.br/handle/123456789/10891.

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

Council of Science Editors:

Oliveira JPdS. Rabbit: A novel approach to find data-races during state-space exploration . [Thesis]. Universidade Federal de Pernambuco; 2012. Available from: http://repositorio.ufpe.br/handle/123456789/10891

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

18. Friggens, David. On the Use of Model Checking for the Bounded and Unbounded Verification of Nonblocking Concurrent Data Structures.

Degree: 2013, Victoria University of Wellington

 Concurrent data structure algorithms have traditionally been designed using locks to regulate the behaviour of interacting threads, thus restricting access to parts of the shared… (more)

Subjects/Keywords: Nonblocking algorithms; Model checking; Canonical abstraction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Friggens, D. (2013). On the Use of Model Checking for the Bounded and Unbounded Verification of Nonblocking Concurrent Data Structures. (Doctoral Dissertation). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/2702

Chicago Manual of Style (16th Edition):

Friggens, David. “On the Use of Model Checking for the Bounded and Unbounded Verification of Nonblocking Concurrent Data Structures.” 2013. Doctoral Dissertation, Victoria University of Wellington. Accessed May 26, 2019. http://hdl.handle.net/10063/2702.

MLA Handbook (7th Edition):

Friggens, David. “On the Use of Model Checking for the Bounded and Unbounded Verification of Nonblocking Concurrent Data Structures.” 2013. Web. 26 May 2019.

Vancouver:

Friggens D. On the Use of Model Checking for the Bounded and Unbounded Verification of Nonblocking Concurrent Data Structures. [Internet] [Doctoral dissertation]. Victoria University of Wellington; 2013. [cited 2019 May 26]. Available from: http://hdl.handle.net/10063/2702.

Council of Science Editors:

Friggens D. On the Use of Model Checking for the Bounded and Unbounded Verification of Nonblocking Concurrent Data Structures. [Doctoral Dissertation]. Victoria University of Wellington; 2013. Available from: http://hdl.handle.net/10063/2702


University of Colorado

19. Hassan, Zyad. Incremental, Inductive Model Checking.

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

Model checking has become a widely adopted approach for the verification of hardware designs. The ever increasing complexity of these designs creates a continuous… (more)

Subjects/Keywords: Formal Verification; Model Checking; Satisfiability; Computer Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hassan, Z. (2014). Incremental, Inductive Model Checking. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/ecen_gradetds/86

Chicago Manual of Style (16th Edition):

Hassan, Zyad. “Incremental, Inductive Model Checking.” 2014. Doctoral Dissertation, University of Colorado. Accessed May 26, 2019. https://scholar.colorado.edu/ecen_gradetds/86.

MLA Handbook (7th Edition):

Hassan, Zyad. “Incremental, Inductive Model Checking.” 2014. Web. 26 May 2019.

Vancouver:

Hassan Z. Incremental, Inductive Model Checking. [Internet] [Doctoral dissertation]. University of Colorado; 2014. [cited 2019 May 26]. Available from: https://scholar.colorado.edu/ecen_gradetds/86.

Council of Science Editors:

Hassan Z. Incremental, Inductive Model Checking. [Doctoral Dissertation]. University of Colorado; 2014. Available from: https://scholar.colorado.edu/ecen_gradetds/86


University of Edinburgh

20. Lehtinen, Maria Karoliina. Syntactic complexity in the modal μ calculus.

Degree: PhD, 2017, University of Edinburgh

 This thesis studies how to eliminate syntactic complexity in Lμ, the modal μ calculus. Lμ is a verification logic in which a least fixpoint operator… (more)

Subjects/Keywords: verification logic; ; model-checking; Lµ formula

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lehtinen, M. K. (2017). Syntactic complexity in the modal μ calculus. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/29520

Chicago Manual of Style (16th Edition):

Lehtinen, Maria Karoliina. “Syntactic complexity in the modal μ calculus.” 2017. Doctoral Dissertation, University of Edinburgh. Accessed May 26, 2019. http://hdl.handle.net/1842/29520.

MLA Handbook (7th Edition):

Lehtinen, Maria Karoliina. “Syntactic complexity in the modal μ calculus.” 2017. Web. 26 May 2019.

Vancouver:

Lehtinen MK. Syntactic complexity in the modal μ calculus. [Internet] [Doctoral dissertation]. University of Edinburgh; 2017. [cited 2019 May 26]. Available from: http://hdl.handle.net/1842/29520.

Council of Science Editors:

Lehtinen MK. Syntactic complexity in the modal μ calculus. [Doctoral Dissertation]. University of Edinburgh; 2017. Available from: http://hdl.handle.net/1842/29520

21. Evrot, Dominique. Contribution à la vérification d'exigences de sécurité : application au domaine de la machine industrielle : Contribution to safety requirements verification : application to industrial machinery domain.

Degree: Docteur es, Automatique, Traitement du Signal, Génie Informatique, 2008, Université Henri Poincaré – Nancy I

L’introduction des nouvelles technologies de l’information et de la communication dans les systèmes automatisés entraîne un accroissement de la complexité des fonctions qu’ils supportent. Cet… (more)

Subjects/Keywords: Analyse des exigences; Vérification par model checking

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Evrot, D. (2008). Contribution à la vérification d'exigences de sécurité : application au domaine de la machine industrielle : Contribution to safety requirements verification : application to industrial machinery domain. (Doctoral Dissertation). Université Henri Poincaré – Nancy I. Retrieved from http://www.theses.fr/2008NAN10038

Chicago Manual of Style (16th Edition):

Evrot, Dominique. “Contribution à la vérification d'exigences de sécurité : application au domaine de la machine industrielle : Contribution to safety requirements verification : application to industrial machinery domain.” 2008. Doctoral Dissertation, Université Henri Poincaré – Nancy I. Accessed May 26, 2019. http://www.theses.fr/2008NAN10038.

MLA Handbook (7th Edition):

Evrot, Dominique. “Contribution à la vérification d'exigences de sécurité : application au domaine de la machine industrielle : Contribution to safety requirements verification : application to industrial machinery domain.” 2008. Web. 26 May 2019.

Vancouver:

Evrot D. Contribution à la vérification d'exigences de sécurité : application au domaine de la machine industrielle : Contribution to safety requirements verification : application to industrial machinery domain. [Internet] [Doctoral dissertation]. Université Henri Poincaré – Nancy I; 2008. [cited 2019 May 26]. Available from: http://www.theses.fr/2008NAN10038.

Council of Science Editors:

Evrot D. Contribution à la vérification d'exigences de sécurité : application au domaine de la machine industrielle : Contribution to safety requirements verification : application to industrial machinery domain. [Doctoral Dissertation]. Université Henri Poincaré – Nancy I; 2008. Available from: http://www.theses.fr/2008NAN10038


Université de Bordeaux I

22. Chucri, Farès. Exploiting model structure in CEGAR verification method : Exploiter la structure des modèles pour la vérification par la méthode CEGAR.

Degree: Docteur es, Informatique, 2012, Université de Bordeaux I

Cette thèse a eu pour but l'étude et la mise en oeuvre des méthodes de vérification par abstraction pour les modèles AltaRica. A cette effet,… (more)

Subjects/Keywords: Verification; Raffinement; Abstraction; Model Checking; Cegar; Abstraction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chucri, F. (2012). Exploiting model structure in CEGAR verification method : Exploiter la structure des modèles pour la vérification par la méthode CEGAR. (Doctoral Dissertation). Université de Bordeaux I. Retrieved from http://www.theses.fr/2012BOR14641

Chicago Manual of Style (16th Edition):

Chucri, Farès. “Exploiting model structure in CEGAR verification method : Exploiter la structure des modèles pour la vérification par la méthode CEGAR.” 2012. Doctoral Dissertation, Université de Bordeaux I. Accessed May 26, 2019. http://www.theses.fr/2012BOR14641.

MLA Handbook (7th Edition):

Chucri, Farès. “Exploiting model structure in CEGAR verification method : Exploiter la structure des modèles pour la vérification par la méthode CEGAR.” 2012. Web. 26 May 2019.

Vancouver:

Chucri F. Exploiting model structure in CEGAR verification method : Exploiter la structure des modèles pour la vérification par la méthode CEGAR. [Internet] [Doctoral dissertation]. Université de Bordeaux I; 2012. [cited 2019 May 26]. Available from: http://www.theses.fr/2012BOR14641.

Council of Science Editors:

Chucri F. Exploiting model structure in CEGAR verification method : Exploiter la structure des modèles pour la vérification par la méthode CEGAR. [Doctoral Dissertation]. Université de Bordeaux I; 2012. Available from: http://www.theses.fr/2012BOR14641

23. Lopes, Arnaud Da Costa. Propriétés de jeux multi-agents : Multi-agent games properties.

Degree: Docteur es, Informatique, 2011, Cachan, Ecole normale supérieure

Nous etendons les logiques temporelles du temps alternant ATL et ATL* au moyen de contextes strategiques et de contraintes sur la memoire : la premiere… (more)

Subjects/Keywords: Logique temporelle; Vérification formelle; Model-checking

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lopes, A. D. C. (2011). Propriétés de jeux multi-agents : Multi-agent games properties. (Doctoral Dissertation). Cachan, Ecole normale supérieure. Retrieved from http://www.theses.fr/2011DENS0034

Chicago Manual of Style (16th Edition):

Lopes, Arnaud Da Costa. “Propriétés de jeux multi-agents : Multi-agent games properties.” 2011. Doctoral Dissertation, Cachan, Ecole normale supérieure. Accessed May 26, 2019. http://www.theses.fr/2011DENS0034.

MLA Handbook (7th Edition):

Lopes, Arnaud Da Costa. “Propriétés de jeux multi-agents : Multi-agent games properties.” 2011. Web. 26 May 2019.

Vancouver:

Lopes ADC. Propriétés de jeux multi-agents : Multi-agent games properties. [Internet] [Doctoral dissertation]. Cachan, Ecole normale supérieure; 2011. [cited 2019 May 26]. Available from: http://www.theses.fr/2011DENS0034.

Council of Science Editors:

Lopes ADC. Propriétés de jeux multi-agents : Multi-agent games properties. [Doctoral Dissertation]. Cachan, Ecole normale supérieure; 2011. Available from: http://www.theses.fr/2011DENS0034


Universidade Nova

24. Beyene, Tewodros Awgichew. Constraint-based verification of imperative programs.

Degree: 2011, Universidade Nova

work presented in the context of the European Master’s program in Computational Logic, as the partial requirement for obtaining Master of Science degree in Computational… (more)

Subjects/Keywords: Program verification; Model checking; Constraint programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Beyene, T. A. (2011). Constraint-based verification of imperative programs. (Thesis). Universidade Nova. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/7965

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

Beyene, Tewodros Awgichew. “Constraint-based verification of imperative programs.” 2011. Thesis, Universidade Nova. Accessed May 26, 2019. http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/7965.

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

MLA Handbook (7th Edition):

Beyene, Tewodros Awgichew. “Constraint-based verification of imperative programs.” 2011. Web. 26 May 2019.

Vancouver:

Beyene TA. Constraint-based verification of imperative programs. [Internet] [Thesis]. Universidade Nova; 2011. [cited 2019 May 26]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/7965.

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

Council of Science Editors:

Beyene TA. Constraint-based verification of imperative programs. [Thesis]. Universidade Nova; 2011. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/7965

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


Vanderbilt University

25. Li, Yi. Linux Device Driver Synthesis and Verification.

Degree: MS, Computer Science, 2015, Vanderbilt University

 The device driver is a program which provides a software interface to a hardware device, enabling operating systems and other computer programs to access hardware… (more)

Subjects/Keywords: driver synthesis; model checking; domain specific language

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, Y. (2015). Linux Device Driver Synthesis and Verification. (Masters Thesis). Vanderbilt University. Retrieved from http://etd.library.vanderbilt.edu/available/etd-11172015-221551/ ;

Chicago Manual of Style (16th Edition):

Li, Yi. “Linux Device Driver Synthesis and Verification.” 2015. Masters Thesis, Vanderbilt University. Accessed May 26, 2019. http://etd.library.vanderbilt.edu/available/etd-11172015-221551/ ;.

MLA Handbook (7th Edition):

Li, Yi. “Linux Device Driver Synthesis and Verification.” 2015. Web. 26 May 2019.

Vancouver:

Li Y. Linux Device Driver Synthesis and Verification. [Internet] [Masters thesis]. Vanderbilt University; 2015. [cited 2019 May 26]. Available from: http://etd.library.vanderbilt.edu/available/etd-11172015-221551/ ;.

Council of Science Editors:

Li Y. Linux Device Driver Synthesis and Verification. [Masters Thesis]. Vanderbilt University; 2015. Available from: http://etd.library.vanderbilt.edu/available/etd-11172015-221551/ ;

26. Cordy, Maxime. Model Checking for the Masses.

Degree: 2014, DIAL (Belgium)

The model-checking problem for software product lines is harder than for single systems. Indeed, one has to verify all the software variants of a product… (more)

Subjects/Keywords: Formal methods; model checking; software product lines

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cordy, M. (2014). Model Checking for the Masses. (Thesis). DIAL (Belgium). Retrieved from http://hdl.handle.net/2078.2/152729

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

Cordy, Maxime. “Model Checking for the Masses.” 2014. Thesis, DIAL (Belgium). Accessed May 26, 2019. http://hdl.handle.net/2078.2/152729.

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

MLA Handbook (7th Edition):

Cordy, Maxime. “Model Checking for the Masses.” 2014. Web. 26 May 2019.

Vancouver:

Cordy M. Model Checking for the Masses. [Internet] [Thesis]. DIAL (Belgium); 2014. [cited 2019 May 26]. Available from: http://hdl.handle.net/2078.2/152729.

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

Council of Science Editors:

Cordy M. Model Checking for the Masses. [Thesis]. DIAL (Belgium); 2014. Available from: http://hdl.handle.net/2078.2/152729

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


University of Waterloo

27. Kajarekar, Tejas. Fully Automated Translation of BoxTalk to Promela.

Degree: 2011, University of Waterloo

 Telecommunication systems are structured to enable incremental growth, so that new telecommunication features can be added to the set of existing features. With the addition… (more)

Subjects/Keywords: Model checking; Automated translation; SPIN; BoxTalk

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kajarekar, T. (2011). Fully Automated Translation of BoxTalk to Promela. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6135

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

Kajarekar, Tejas. “Fully Automated Translation of BoxTalk to Promela.” 2011. Thesis, University of Waterloo. Accessed May 26, 2019. http://hdl.handle.net/10012/6135.

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

MLA Handbook (7th Edition):

Kajarekar, Tejas. “Fully Automated Translation of BoxTalk to Promela.” 2011. Web. 26 May 2019.

Vancouver:

Kajarekar T. Fully Automated Translation of BoxTalk to Promela. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2019 May 26]. Available from: http://hdl.handle.net/10012/6135.

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

Council of Science Editors:

Kajarekar T. Fully Automated Translation of BoxTalk to Promela. [Thesis]. University of Waterloo; 2011. Available from: http://hdl.handle.net/10012/6135

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


University of Waikato

28. Shaw, Adrian Mark. Partial Order Reduction with Compositional Verification .

Degree: 2014, University of Waikato

 This thesis expands the usage of partial order reduction methods in reducing the state space of large models in model checking. The work done can… (more)

Subjects/Keywords: Partial order reduction; Model checking; compositional verification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shaw, A. M. (2014). Partial Order Reduction with Compositional Verification . (Masters Thesis). University of Waikato. Retrieved from http://hdl.handle.net/10289/9001

Chicago Manual of Style (16th Edition):

Shaw, Adrian Mark. “Partial Order Reduction with Compositional Verification .” 2014. Masters Thesis, University of Waikato. Accessed May 26, 2019. http://hdl.handle.net/10289/9001.

MLA Handbook (7th Edition):

Shaw, Adrian Mark. “Partial Order Reduction with Compositional Verification .” 2014. Web. 26 May 2019.

Vancouver:

Shaw AM. Partial Order Reduction with Compositional Verification . [Internet] [Masters thesis]. University of Waikato; 2014. [cited 2019 May 26]. Available from: http://hdl.handle.net/10289/9001.

Council of Science Editors:

Shaw AM. Partial Order Reduction with Compositional Verification . [Masters Thesis]. University of Waikato; 2014. Available from: http://hdl.handle.net/10289/9001


University of Toronto

29. Wei, Ou. Abstraction for Verification and Refutation in Model Checking.

Degree: 2009, University of Toronto

Model checking is an automated technique for deciding whether a computer program satisfies a temporal property. Abstraction is the key to scaling model checking to… (more)

Subjects/Keywords: Model Checking; Abstraction; Verification; Temporal Logic; 0984

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wei, O. (2009). Abstraction for Verification and Refutation in Model Checking. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/24330

Chicago Manual of Style (16th Edition):

Wei, Ou. “Abstraction for Verification and Refutation in Model Checking.” 2009. Doctoral Dissertation, University of Toronto. Accessed May 26, 2019. http://hdl.handle.net/1807/24330.

MLA Handbook (7th Edition):

Wei, Ou. “Abstraction for Verification and Refutation in Model Checking.” 2009. Web. 26 May 2019.

Vancouver:

Wei O. Abstraction for Verification and Refutation in Model Checking. [Internet] [Doctoral dissertation]. University of Toronto; 2009. [cited 2019 May 26]. Available from: http://hdl.handle.net/1807/24330.

Council of Science Editors:

Wei O. Abstraction for Verification and Refutation in Model Checking. [Doctoral Dissertation]. University of Toronto; 2009. Available from: http://hdl.handle.net/1807/24330


Iowa State University

30. Suvorov, Yuly. A model checking approach for analyzing and identifying intervention policies to counter infection propagation over networks.

Degree: 2011, Iowa State University

 The spread of infections (disease, ideas, fires, etc.) in a network (group of people, electronic network, forest, etc.) can be modeled by the evolution of… (more)

Subjects/Keywords: Disease; Infection; Model Checking; Policies; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Suvorov, Y. (2011). A model checking approach for analyzing and identifying intervention policies to counter infection propagation over networks. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/10431

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

Suvorov, Yuly. “A model checking approach for analyzing and identifying intervention policies to counter infection propagation over networks.” 2011. Thesis, Iowa State University. Accessed May 26, 2019. https://lib.dr.iastate.edu/etd/10431.

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

MLA Handbook (7th Edition):

Suvorov, Yuly. “A model checking approach for analyzing and identifying intervention policies to counter infection propagation over networks.” 2011. Web. 26 May 2019.

Vancouver:

Suvorov Y. A model checking approach for analyzing and identifying intervention policies to counter infection propagation over networks. [Internet] [Thesis]. Iowa State University; 2011. [cited 2019 May 26]. Available from: https://lib.dr.iastate.edu/etd/10431.

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

Council of Science Editors:

Suvorov Y. A model checking approach for analyzing and identifying intervention policies to counter infection propagation over networks. [Thesis]. Iowa State University; 2011. Available from: https://lib.dr.iastate.edu/etd/10431

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

[1] [2] [3] [4] [5] … [14]

.