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 500 total matches.

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


Penn State University

1. Zhang, Can. A model checking approach to countering the dynamics of infection propagation over network.

Degree: 2016, Penn State University

 With the outbreak of Ebola over the past year, attention has been paid on predicting and resolving the propagation of infectious disease over network of… (more)

Subjects/Keywords: Model checking

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, C. (2016). A model checking approach to countering the dynamics of infection propagation over network. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/28899

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, Can. “A model checking approach to countering the dynamics of infection propagation over network.” 2016. Thesis, Penn State University. Accessed March 07, 2021. https://submit-etda.libraries.psu.edu/catalog/28899.

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

MLA Handbook (7th Edition):

Zhang, Can. “A model checking approach to countering the dynamics of infection propagation over network.” 2016. Web. 07 Mar 2021.

Vancouver:

Zhang C. A model checking approach to countering the dynamics of infection propagation over network. [Internet] [Thesis]. Penn State University; 2016. [cited 2021 Mar 07]. Available from: https://submit-etda.libraries.psu.edu/catalog/28899.

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

Council of Science Editors:

Zhang C. A model checking approach to countering the dynamics of infection propagation over network. [Thesis]. Penn State University; 2016. Available from: https://submit-etda.libraries.psu.edu/catalog/28899

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


Università della Svizzera italiana

2. 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 March 07, 2021. 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. 07 Mar 2021.

Vancouver:

de Sá Alt L. Controlled and effective interpolation. [Internet] [Thesis]. Università della Svizzera italiana; 2016. [cited 2021 Mar 07]. 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

3. 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 March 07, 2021. 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. 07 Mar 2021.

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 2021 Mar 07]. 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


University of Toronto

4. Berryhill, Ryan. Novel Approaches to Hardware Safety Checking and Certificate Minimization.

Degree: PhD, 2020, University of Toronto

 Verification is an ever-growing challenge in hardware design due to the complexity of modern designs. As a result, formal verification methodologies are seeing rapid adoption… (more)

Subjects/Keywords: Model Checking; Safety Checking; Verification; 0464

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Berryhill, R. (2020). Novel Approaches to Hardware Safety Checking and Certificate Minimization. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/103653

Chicago Manual of Style (16th Edition):

Berryhill, Ryan. “Novel Approaches to Hardware Safety Checking and Certificate Minimization.” 2020. Doctoral Dissertation, University of Toronto. Accessed March 07, 2021. http://hdl.handle.net/1807/103653.

MLA Handbook (7th Edition):

Berryhill, Ryan. “Novel Approaches to Hardware Safety Checking and Certificate Minimization.” 2020. Web. 07 Mar 2021.

Vancouver:

Berryhill R. Novel Approaches to Hardware Safety Checking and Certificate Minimization. [Internet] [Doctoral dissertation]. University of Toronto; 2020. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/1807/103653.

Council of Science Editors:

Berryhill R. Novel Approaches to Hardware Safety Checking and Certificate Minimization. [Doctoral Dissertation]. University of Toronto; 2020. Available from: http://hdl.handle.net/1807/103653


Brno University of Technology

5. Chalk, Matěj. Nástroj pro abstraktní regulární model checking: Tool for Abstract Regular Model Checking.

Degree: 2019, Brno University of Technology

 Formal verification methods offer a large potential to provide automated software correctness checking (based on sound mathematical roots), which is of vital importance. One such… (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. (2019). Nástroj pro abstraktní regulární model checking: Tool for Abstract Regular 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: Tool for Abstract Regular Model Checking.” 2019. Thesis, Brno University of Technology. Accessed March 07, 2021. 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: Tool for Abstract Regular Model Checking.” 2019. Web. 07 Mar 2021.

Vancouver:

Chalk M. Nástroj pro abstraktní regulární model checking: Tool for Abstract Regular Model Checking. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2021 Mar 07]. 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: Tool for Abstract Regular Model Checking. [Thesis]. Brno University of Technology; 2019. 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

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 March 07, 2021. 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. 07 Mar 2021.

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 2021 Mar 07]. 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


University of Limerick

7. 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 March 07, 2021. 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. 07 Mar 2021.

Vancouver:

Pantelic V. Inspection of concurrent systems: combining tables, theorem proving and model checking. [Internet] [Thesis]. University of Limerick; 2006. [cited 2021 Mar 07]. 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


Virginia Tech

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

Degree: MS, 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 March 07, 2021. http://hdl.handle.net/10919/23222.

MLA Handbook (7th Edition):

Adhikari, Kiran. “Verifying a Quantitative Relaxation of Linearizability via Refinement.” 2013. Web. 07 Mar 2021.

Vancouver:

Adhikari K. Verifying a Quantitative Relaxation of Linearizability via Refinement. [Internet] [Masters thesis]. Virginia Tech; 2013. [cited 2021 Mar 07]. 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 Canterbury

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

Degree: M. Eng., Electrical 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. (Masters Thesis). University of Canterbury. Retrieved from http://dx.doi.org/10.26021/3492

Chicago Manual of Style (16th Edition):

Keating, Daniel. “Model Checking Time Triggered CAN Protocols.” 2011. Masters Thesis, University of Canterbury. Accessed March 07, 2021. http://dx.doi.org/10.26021/3492.

MLA Handbook (7th Edition):

Keating, Daniel. “Model Checking Time Triggered CAN Protocols.” 2011. Web. 07 Mar 2021.

Vancouver:

Keating D. Model Checking Time Triggered CAN Protocols. [Internet] [Masters thesis]. University of Canterbury; 2011. [cited 2021 Mar 07]. Available from: http://dx.doi.org/10.26021/3492.

Council of Science Editors:

Keating D. Model Checking Time Triggered CAN Protocols. [Masters Thesis]. University of Canterbury; 2011. Available from: http://dx.doi.org/10.26021/3492


Princeton University

10. 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 March 07, 2021. http://arks.princeton.edu/ark:/88435/dsp01s4655k00v.

MLA Handbook (7th Edition):

Ahn, Sunha. “AUTOMATED FIRMWARE VERIFICATION USING FIRMWARE-HARDWARE INTERACTION PATTERNS .” 2016. Web. 07 Mar 2021.

Vancouver:

Ahn S. AUTOMATED FIRMWARE VERIFICATION USING FIRMWARE-HARDWARE INTERACTION PATTERNS . [Internet] [Doctoral dissertation]. Princeton University; 2016. [cited 2021 Mar 07]. 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

11. 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 March 07, 2021. 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. 07 Mar 2021.

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 2021 Mar 07]. 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

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 March 07, 2021. 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. 07 Mar 2021.

Vancouver:

Bozianu R. Synthesis of Interactive Reactive Systems : Synthèse des systèmes réactifs interactifs. [Internet] [Doctoral dissertation]. Université Paris-Est; 2016. [cited 2021 Mar 07]. 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. 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 March 07, 2021. 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. 07 Mar 2021.

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 2021 Mar 07]. 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

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, Université Paris-Saclay (ComUE)

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). Université Paris-Saclay (ComUE). 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, Université Paris-Saclay (ComUE). Accessed March 07, 2021. 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. 07 Mar 2021.

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]. Université Paris-Saclay (ComUE); 2018. [cited 2021 Mar 07]. 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]. Université Paris-Saclay (ComUE); 2018. Available from: http://www.theses.fr/2018SACLS336


Tampere University

15. Biswas, Prasun. Model-to-Model Transformation Of Nuclear Industry I&C Logic To Assist Model Checking .

Degree: 2020, Tampere University

 The demand for electricity has increased proportionately with massive urbanisation and in-dustrialisation. Nuclear energy is a strong candidate which can be one of the solutions… (more)

Subjects/Keywords: Model Transformation ; Formal Verification ; Model Checking ; NuSMV

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Biswas, P. (2020). Model-to-Model Transformation Of Nuclear Industry I&C Logic To Assist Model Checking . (Masters Thesis). Tampere University. Retrieved from https://trepo.tuni.fi/handle/10024/121539

Chicago Manual of Style (16th Edition):

Biswas, Prasun. “Model-to-Model Transformation Of Nuclear Industry I&C Logic To Assist Model Checking .” 2020. Masters Thesis, Tampere University. Accessed March 07, 2021. https://trepo.tuni.fi/handle/10024/121539.

MLA Handbook (7th Edition):

Biswas, Prasun. “Model-to-Model Transformation Of Nuclear Industry I&C Logic To Assist Model Checking .” 2020. Web. 07 Mar 2021.

Vancouver:

Biswas P. Model-to-Model Transformation Of Nuclear Industry I&C Logic To Assist Model Checking . [Internet] [Masters thesis]. Tampere University; 2020. [cited 2021 Mar 07]. Available from: https://trepo.tuni.fi/handle/10024/121539.

Council of Science Editors:

Biswas P. Model-to-Model Transformation Of Nuclear Industry I&C Logic To Assist Model Checking . [Masters Thesis]. Tampere University; 2020. Available from: https://trepo.tuni.fi/handle/10024/121539


University of Melbourne

16. Nguyen, Cattram. Diagnostic methods for checking multiple imputation models.

Degree: 2014, University of Melbourne

 Multiple imputation is an increasingly popular method for handling missing data. A key task in the imputation process is the specification of a model for… (more)

Subjects/Keywords: missing data; multiple imputation, posterior predictive checking; diagnostics; model checking

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nguyen, C. (2014). Diagnostic methods for checking multiple imputation models. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/45205

Chicago Manual of Style (16th Edition):

Nguyen, Cattram. “Diagnostic methods for checking multiple imputation models.” 2014. Doctoral Dissertation, University of Melbourne. Accessed March 07, 2021. http://hdl.handle.net/11343/45205.

MLA Handbook (7th Edition):

Nguyen, Cattram. “Diagnostic methods for checking multiple imputation models.” 2014. Web. 07 Mar 2021.

Vancouver:

Nguyen C. Diagnostic methods for checking multiple imputation models. [Internet] [Doctoral dissertation]. University of Melbourne; 2014. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/11343/45205.

Council of Science Editors:

Nguyen C. Diagnostic methods for checking multiple imputation models. [Doctoral Dissertation]. University of Melbourne; 2014. Available from: http://hdl.handle.net/11343/45205

17. Chai, Xinwei. Reachability Analysis and Revision of Dynamics of Biological Regulatory Networks : Analyse d’accessibilité et révision de la dynamique dans les réseaux de régulations biologiques.

Degree: Docteur es, Informatique, 2019, Ecole centrale de Nantes

Les systèmes concurrents sont un bon choix pour ajuster les données et analyser les mécanismes sous-jacents pour leur sémantique simple mais expressive. Cependant, l’apprentissage et… (more)

Subjects/Keywords: Bioinformatique; Model checking; Heuristique; Révision de modèles; Bioinformatics; Model checking; Heuristics; Model revision

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chai, X. (2019). Reachability Analysis and Revision of Dynamics of Biological Regulatory Networks : Analyse d’accessibilité et révision de la dynamique dans les réseaux de régulations biologiques. (Doctoral Dissertation). Ecole centrale de Nantes. Retrieved from http://www.theses.fr/2019ECDN0014

Chicago Manual of Style (16th Edition):

Chai, Xinwei. “Reachability Analysis and Revision of Dynamics of Biological Regulatory Networks : Analyse d’accessibilité et révision de la dynamique dans les réseaux de régulations biologiques.” 2019. Doctoral Dissertation, Ecole centrale de Nantes. Accessed March 07, 2021. http://www.theses.fr/2019ECDN0014.

MLA Handbook (7th Edition):

Chai, Xinwei. “Reachability Analysis and Revision of Dynamics of Biological Regulatory Networks : Analyse d’accessibilité et révision de la dynamique dans les réseaux de régulations biologiques.” 2019. Web. 07 Mar 2021.

Vancouver:

Chai X. Reachability Analysis and Revision of Dynamics of Biological Regulatory Networks : Analyse d’accessibilité et révision de la dynamique dans les réseaux de régulations biologiques. [Internet] [Doctoral dissertation]. Ecole centrale de Nantes; 2019. [cited 2021 Mar 07]. Available from: http://www.theses.fr/2019ECDN0014.

Council of Science Editors:

Chai X. Reachability Analysis and Revision of Dynamics of Biological Regulatory Networks : Analyse d’accessibilité et révision de la dynamique dans les réseaux de régulations biologiques. [Doctoral Dissertation]. Ecole centrale de Nantes; 2019. Available from: http://www.theses.fr/2019ECDN0014

18. 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 March 07, 2021. 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. 07 Mar 2021.

Vancouver:

Oliveira JPdS. Rabbit: A novel approach to find data-races during state-space exploration . [Internet] [Thesis]. Universidade Federal de Pernambuco; 2012. [cited 2021 Mar 07]. 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


Vanderbilt University

19. 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. (Thesis). Vanderbilt University. Retrieved from http://hdl.handle.net/1803/14577

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

Li, Yi. “Linux Device Driver Synthesis and Verification.” 2015. Thesis, Vanderbilt University. Accessed March 07, 2021. http://hdl.handle.net/1803/14577.

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

MLA Handbook (7th Edition):

Li, Yi. “Linux Device Driver Synthesis and Verification.” 2015. Web. 07 Mar 2021.

Vancouver:

Li Y. Linux Device Driver Synthesis and Verification. [Internet] [Thesis]. Vanderbilt University; 2015. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/1803/14577.

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

Council of Science Editors:

Li Y. Linux Device Driver Synthesis and Verification. [Thesis]. Vanderbilt University; 2015. Available from: http://hdl.handle.net/1803/14577

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

20. 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 March 07, 2021. 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. 07 Mar 2021.

Vancouver:

Naujokat S. Automatische Generierung von Prozessen im jABC. [Internet] [Thesis]. Technische Universität Dortmund; 2009. [cited 2021 Mar 07]. 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

21. 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 March 07, 2021. 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. 07 Mar 2021.

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 2021 Mar 07]. 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

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

Degree: 2012, 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. (2012). Automatische Generierung von Prozessen im jABC. (Masters Thesis). Technische Universität Dortmund. Retrieved from http://dx.doi.org/10.17877/DE290R-10351

Chicago Manual of Style (16th Edition):

Naujokat, Stefan. “Automatische Generierung von Prozessen im jABC.” 2012. Masters Thesis, Technische Universität Dortmund. Accessed March 07, 2021. http://dx.doi.org/10.17877/DE290R-10351.

MLA Handbook (7th Edition):

Naujokat, Stefan. “Automatische Generierung von Prozessen im jABC.” 2012. Web. 07 Mar 2021.

Vancouver:

Naujokat S. Automatische Generierung von Prozessen im jABC. [Internet] [Masters thesis]. Technische Universität Dortmund; 2012. [cited 2021 Mar 07]. Available from: http://dx.doi.org/10.17877/DE290R-10351.

Council of Science Editors:

Naujokat S. Automatische Generierung von Prozessen im jABC. [Masters Thesis]. Technische Universität Dortmund; 2012. Available from: http://dx.doi.org/10.17877/DE290R-10351

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 March 07, 2021. 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. 07 Mar 2021.

Vancouver:

Lopes ADC. Propriétés de jeux multi-agents : Multi-agent games properties. [Internet] [Doctoral dissertation]. Cachan, Ecole normale supérieure; 2011. [cited 2021 Mar 07]. 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


University of Waikato

24. 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 March 07, 2021. http://hdl.handle.net/10289/9001.

MLA Handbook (7th Edition):

Shaw, Adrian Mark. “Partial Order Reduction with Compositional Verification .” 2014. Web. 07 Mar 2021.

Vancouver:

Shaw AM. Partial Order Reduction with Compositional Verification . [Internet] [Masters thesis]. University of Waikato; 2014. [cited 2021 Mar 07]. 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


Universidade Nova

25. 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 March 07, 2021. 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. 07 Mar 2021.

Vancouver:

Beyene TA. Constraint-based verification of imperative programs. [Internet] [Thesis]. Universidade Nova; 2011. [cited 2021 Mar 07]. 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


Université de Bordeaux I

26. 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 March 07, 2021. 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. 07 Mar 2021.

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 2021 Mar 07]. 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


Colorado State University

27. Al Lail, Mustafa. Unified modeling language framework for specifying and analyzing temporal properties, A.

Degree: PhD, Computer Science, 2018, Colorado State University

 In the context of Model-Driven Engineering (MDE), designers use the Unified Modeling Language (UML) to create models that drive the entire development process. Once UML… (more)

Subjects/Keywords: properties; temporal; verification; specification; model checking; UML

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Al Lail, M. (2018). Unified modeling language framework for specifying and analyzing temporal properties, A. (Doctoral Dissertation). Colorado State University. Retrieved from http://hdl.handle.net/10217/191492

Chicago Manual of Style (16th Edition):

Al Lail, Mustafa. “Unified modeling language framework for specifying and analyzing temporal properties, A.” 2018. Doctoral Dissertation, Colorado State University. Accessed March 07, 2021. http://hdl.handle.net/10217/191492.

MLA Handbook (7th Edition):

Al Lail, Mustafa. “Unified modeling language framework for specifying and analyzing temporal properties, A.” 2018. Web. 07 Mar 2021.

Vancouver:

Al Lail M. Unified modeling language framework for specifying and analyzing temporal properties, A. [Internet] [Doctoral dissertation]. Colorado State University; 2018. [cited 2021 Mar 07]. Available from: http://hdl.handle.net/10217/191492.

Council of Science Editors:

Al Lail M. Unified modeling language framework for specifying and analyzing temporal properties, A. [Doctoral Dissertation]. Colorado State University; 2018. Available from: http://hdl.handle.net/10217/191492


University of Colorado

28. 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 March 07, 2021. https://scholar.colorado.edu/ecen_gradetds/86.

MLA Handbook (7th Edition):

Hassan, Zyad. “Incremental, Inductive Model Checking.” 2014. Web. 07 Mar 2021.

Vancouver:

Hassan Z. Incremental, Inductive Model Checking. [Internet] [Doctoral dissertation]. University of Colorado; 2014. [cited 2021 Mar 07]. 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

29. 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 March 07, 2021. http://hdl.handle.net/1842/29520.

MLA Handbook (7th Edition):

Lehtinen, Maria Karoliina. “Syntactic complexity in the modal μ calculus.” 2017. Web. 07 Mar 2021.

Vancouver:

Lehtinen MK. Syntactic complexity in the modal μ calculus. [Internet] [Doctoral dissertation]. University of Edinburgh; 2017. [cited 2021 Mar 07]. 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


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 March 07, 2021. 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. 07 Mar 2021.

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 2021 Mar 07]. 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] … [17]

.