Bruda.CA
https://bruda.ca/
2024-03-19T11:53:35+00:00Bruda.CA
https://bruda.ca/
https://bruda.ca/_media/wiki/dokuwiki.svgtext/html2024-02-07T15:26:13+00:00stefan (stefan@undisclosed.example.com)publications - [Journal papers]
https://bruda.ca/part/publications
<table><tr><th colspan="2" width="50%">Sat 11 Feb 2017 11:34 am -0500</th><th colspan="2" width="50%">current</th></tr><tr><td class="diff-blockheader" colspan="2">Line 8:</td>
<td class="diff-blockheader" colspan="2">Line 8:</td>
</tr>
<tr><td class="diff-lineheader"> </td><td class="diff-context"></td><td class="diff-lineheader"> </td><td class="diff-context"></td></tr>
<tr><td class="diff-lineheader"> </td><td class="diff-context">====== Journal papers ======</td><td class="diff-lineheader"> </td><td class="diff-context">====== Journal papers ======</td></tr>
<tr><td colspan="2"> </td><td class="diff-lineheader">+</td><td class="diff-addedline"><strong class="diff-mark">  - O. N. Timo, T. Xiao, F. Avellaneda, Y. Malik, and S. Bruda, __Evaluating trustworthiness of decision tree learning algorithms based on equivalence checking__, AI and Ethics (2024), [[https://doi.org/10.1007/s43681-023-00415-0]]. </strong></td></tr>
<tr><td colspan="2"> </td><td class="diff-lineheader">+</td><td class="diff-addedline"><strong class="diff-mark">  - C. Huang and S. D. Bruda, [[http://www.acta.sapientia.ro/acta-info/C12-2/info12-2-2.pdf|Improved balance in multiplayer online battle arena games]], [[http://www.acta.sapientia.ro/acta-info/|Acta Universitatis Sapientiae, Informatica]], 12:2 (2020) 183-204.</strong></td></tr>
<tr><td class="diff-lineheader"> </td><td class="diff-context">  - Mary Sarah Ruth Wilkin and Stefan D. Bruda, [[http://www.acta.sapientia.ro/acta-info/C8-2/info82-01.pdf|Parallel communicating grammar systems with context-free components are Turing complete for any communication model]], [[http://www.acta.sapientia.ro/acta-info/|Acta Universitatis Sapientiae, Informatica]], 8:2 (2016), 113−170.</td><td class="diff-lineheader"> </td><td class="diff-context">  - Mary Sarah Ruth Wilkin and Stefan D. Bruda, [[http://www.acta.sapientia.ro/acta-info/C8-2/info82-01.pdf|Parallel communicating grammar systems with context-free components are Turing complete for any communication model]], [[http://www.acta.sapientia.ro/acta-info/|Acta Universitatis Sapientiae, Informatica]], 8:2 (2016), 113−170.</td></tr>
<tr><td class="diff-lineheader"> </td><td class="diff-context">  - Stefan D. Bruda and Mary Sarah Ruth Wilkin, __Limitations of Coverability Trees for Context-Free Parallel Communicating Grammar Systems and Why these Grammar Systems are not Linear Space__, Parallel Processing Letters, 26 (2016), 1650012. </td><td class="diff-lineheader"> </td><td class="diff-context">  - Stefan D. Bruda and Mary Sarah Ruth Wilkin, __Limitations of Coverability Trees for Context-Free Parallel Communicating Grammar Systems and Why these Grammar Systems are not Linear Space__, Parallel Processing Letters, 26 (2016), 1650012. </td></tr>
</table>text/html2024-01-11T21:54:54+00:00stefan (stefan@undisclosed.example.com)msc_theses
https://bruda.ca/part/msc_theses
<table><tr><th colspan="2" width="50%">Wed 27 Apr 2022 2:19 pm -0400</th><th colspan="2" width="50%">current</th></tr><tr><td class="diff-blockheader" colspan="2">Line 1:</td>
<td class="diff-blockheader" colspan="2">Line 1:</td>
</tr>
<tr><td colspan="2"> </td><td class="diff-lineheader">+</td><td class="diff-addedline">====== Grading with TorXakis ======</td></tr>
<tr><td colspan="2"> </td><td class="diff-lineheader">+</td><td class="diff-addedline">By Movahed Abdolahi, August 2023.  Full paper: {{ :part:abdolahi20230823.pdf |}}</td></tr>
<tr><td colspan="2"> </td><td class="diff-lineheader">+</td><td class="diff-addedline"></td></tr>
<tr><td colspan="2"> </td><td class="diff-lineheader">+</td><td class="diff-addedline">Software development models and processes have become incredibly complex and sensitive since many governments and companies are implementing software to perform critical matters including such highly dangerous activities as surgeries. Evidently, with increasing sensitivity delivering robust and bug free software is getting more important than ever. This thesis discusses the use of model-based testing to grade and validate various functionalities of a network application which in this case is a Bulletin Board System (BBS). In model-based testing test cases are automatically generated algorithmically to verify the correctness of the implementation of a system according to the model that describes the expected behavior of that system. We are intending to use TorXakis (a model-based testing tool) to grade 30 submissions to a final project in a graduate course at Bishop’s University. We create a model according to the assignment handout and then we apply this model to the student submissions by using a MBT tool. The submissions will also be validated manually using telnet manually. Comparing model-based testing results with human tested results we can see a high degree of similarity while automated grading is much more resource efficient. </td></tr>
<tr><td colspan="2"> </td><td class="diff-lineheader">+</td><td class="diff-addedline"></td></tr>
<tr><td colspan="2"> </td><td class="diff-lineheader">+</td><td class="diff-addedline">====== Model-Based Testing of Reactive Software Product Line with Formal Methods ======</td></tr>
<tr><td colspan="2"> </td><td class="diff-lineheader">+</td><td class="diff-addedline">By Ali Irannezhadi, January 2023.  Full paper: {{ :part:irannezhadi20230105.pdf |}}</td></tr>
<tr><td colspan="2"> </td><td class="diff-lineheader">+</td><td class="diff-addedline"></td></tr>
<tr><td colspan="2"> </td><td class="diff-lineheader">+</td><td class="diff-addedline">With the increasing complexity of software in recent years model-based testing has attracted more attention in industry and research, and the task of functional test of the reactive software product lines is increasingly challenging and time consuming. In model-based testing test cases are automatically generated to verify the correctness of the implementation of a system according to the model that describes the expected behavior of that system. In this research, a model-based test method is presented for the functional test of the reactive software product lines. In the proposed method, the system specification model is described by an extension of the finite state machine model. In other words, a formal method is presented to apply variability in finite state machines. Then, one of the efficient test methods on finite state machines is selected and refined to be used for production line testing. The conducted tests show that the obtained method reduces the time required to generate the requisite test cases compared to the original method.</td></tr>
<tr><td colspan="2"> </td><td class="diff-lineheader">+</td><td class="diff-addedline"></td></tr>
<tr><td class="diff-lineheader"> </td><td class="diff-context">====== The Generative Power of Unsynchronized Context-Free Parallel Communicating Grammar Systems ======</td><td class="diff-lineheader"> </td><td class="diff-context">====== The Generative Power of Unsynchronized Context-Free Parallel Communicating Grammar Systems ======</td></tr>
<tr><td class="diff-lineheader"> </td><td class="diff-context">By Simin Li, April 2022.  FUll paper: {{ :part:li20220405.pdf |}}</td><td class="diff-lineheader"> </td><td class="diff-context">By Simin Li, April 2022.  FUll paper: {{ :part:li20220405.pdf |}}</td></tr>
</table>text/html2024-01-11T21:52:29+00:00stefan (stefan@undisclosed.example.com)abdolahi20230823.pdf - created
https://bruda.ca/?image=part%3Aabdolahi20230823.pdf&ns=part&do=media
<table><tr><th width="50%"></th><th width="50%">current</th></tr><tr><td align="center"></td><td align="center"></td></tr></table>text/html2024-01-03T22:09:33+00:00stefan (stefan@undisclosed.example.com)start - [Teaching]
https://bruda.ca/start
<table><tr><th colspan="2" width="50%">Sat 2 Sep 2023 9:18 am -0400</th><th colspan="2" width="50%">current</th></tr><tr><td class="diff-blockheader" colspan="2">Line 18:</td>
<td class="diff-blockheader" colspan="2">Line 18:</td>
</tr>
<tr><td class="diff-lineheader"> </td><td class="diff-context">====== Teaching ======</td><td class="diff-lineheader"> </td><td class="diff-context">====== Teaching ======</td></tr>
<tr><td class="diff-lineheader"> </td><td class="diff-context"></td><td class="diff-lineheader"> </td><td class="diff-context"></td></tr>
<tr><td class="diff-lineheader">-</td><td class="diff-deletedline">This term (<strong class="diff-mark">Fall 2023</strong>) I am teaching [[http://cs.ubishops.ca/home/<strong class="diff-mark">cs403</strong>|CS <strong class="diff-mark">403 </strong>- <strong class="diff-mark">Principles of Programming Languages]] and [[http://cs.ubishops.ca/home/cs464|CS 464/564 - Network Programming/Network Programming and Distributed Algorithms</strong>]].<strong class="diff-mark"> </strong></td><td class="diff-lineheader">+</td><td class="diff-addedline">This term (<strong class="diff-mark">Winter 2024</strong>) I am teaching [[http://cs.ubishops.ca/home/<strong class="diff-mark">cs310</strong>|CS <strong class="diff-mark">310 </strong>- <strong class="diff-mark">Introduction to Software Specifications</strong>]].</td></tr>
<tr><td class="diff-lineheader"> </td><td class="diff-context"></td><td class="diff-lineheader"> </td><td class="diff-context"></td></tr>
<tr><td class="diff-lineheader"> </td><td class="diff-context">[[teaching|More...]]</td><td class="diff-lineheader"> </td><td class="diff-context">[[teaching|More...]]</td></tr>
</table>text/html2024-01-03T22:08:27+00:00stefan (stefan@undisclosed.example.com)teaching
https://bruda.ca/teaching
<table><tr><th colspan="2" width="50%">Sat 2 Sep 2023 9:16 am -0400</th><th colspan="2" width="50%">current</th></tr><tr><td class="diff-blockheader" colspan="2">Line 1:</td>
<td class="diff-blockheader" colspan="2">Line 1:</td>
</tr>
<tr><td class="diff-lineheader"> </td><td class="diff-context">The following are all the undergraduate courses that I teach at Bishop's (some more occasionally than others), together with their most recent Web sites.</td><td class="diff-lineheader"> </td><td class="diff-context">The following are all the undergraduate courses that I teach at Bishop's (some more occasionally than others), together with their most recent Web sites.</td></tr>
<tr><td colspan="2"> </td><td class="diff-lineheader">+</td><td class="diff-addedline"></td></tr>
<tr><td colspan="2"> </td><td class="diff-lineheader">+</td><td class="diff-addedline">  * [[http://cs.ubishops.ca/home/cs310|CS 310, Introduction to Software Specifications]] (Winter 2024)</td></tr>
<tr><td class="diff-lineheader"> </td><td class="diff-context"></td><td class="diff-lineheader"> </td><td class="diff-context"></td></tr>
<tr><td class="diff-lineheader"> </td><td class="diff-context">  * [[http://cs.ubishops.ca/home/cs403|CS 403, Principles of Programming Languages]] (Fall 2023)</td><td class="diff-lineheader"> </td><td class="diff-context">  * [[http://cs.ubishops.ca/home/cs403|CS 403, Principles of Programming Languages]] (Fall 2023)</td></tr>
<tr><td class="diff-lineheader"> </td><td class="diff-context">  * [[http://cs.ubishops.ca/home/cs464|CS 464/564, Network Programming/Network Programming and Distributed Algorithms]] (Fall 2023)</td><td class="diff-lineheader"> </td><td class="diff-context">  * [[http://cs.ubishops.ca/home/cs464|CS 464/564, Network Programming/Network Programming and Distributed Algorithms]] (Fall 2023)</td></tr>
<tr><td class="diff-lineheader">-</td><td class="diff-deletedline"></td><td colspan="2"> </td></tr>
<tr><td class="diff-lineheader">-</td><td class="diff-deletedline">  * [[http://cs.ubishops.ca/home/cs310|CS 310, Introduction to Software Specifications]] (Winter 2023)</td><td colspan="2"> </td></tr>
<tr><td class="diff-lineheader"> </td><td class="diff-context">  * [[http://cs.ubishops.ca/home/cs316|CS 316, Artificial Intelligence]] (Winter 2023)</td><td class="diff-lineheader"> </td><td class="diff-context">  * [[http://cs.ubishops.ca/home/cs316|CS 316, Artificial Intelligence]] (Winter 2023)</td></tr>
<tr><td class="diff-lineheader"> </td><td class="diff-context">  * [[http://cs.ubishops.ca/home/cs467|CS 467/567, Special/Advanced Topics in Algorithms]] (Winter 2023)</td><td class="diff-lineheader"> </td><td class="diff-context">  * [[http://cs.ubishops.ca/home/cs467|CS 467/567, Special/Advanced Topics in Algorithms]] (Winter 2023)</td></tr>
</table>