Avoiding state enumeration in dynamic checking of distributed programs
Distributed programs are particularly vulnerable to software faults. Bugs in these programs are usually very hard to detect without automatic verification. The idea of checking an expected property in a given distributed program run (also referred to as runtime verification) has recently been attrac...
Main Author: | Al Maghayreh, Eslam |
---|---|
Format: | Others |
Published: |
2008
|
Online Access: | http://spectrum.library.concordia.ca/975869/1/NR37743.pdf Al Maghayreh, Eslam <http://spectrum.library.concordia.ca/view/creators/Al_Maghayreh=3AEslam=3A=3A.html> (2008) Avoiding state enumeration in dynamic checking of distributed programs. PhD thesis, Concordia University. |
Similar Items
-
q- Enumeration of permutations avoiding adjacent patterns
by: Takalani, Ntendeni Annah
Published: (2009) -
Avoiding the Enumeration of Infeasible Elementary Flux Modes by Including Transcriptional Regulatory Rules in the Enumeration Process Saves Computational Costs.
by: Christian Jungreuthmayer, et al.
Published: (2015-01-01) -
Discrete programming by implicite enumeration
by: Balas, Egon
Published: (1966) -
Programming with enumerable sets of structures
by: Kuraj, Ivan, et al.
Published: (2018) -
Enumeration and Wilf-classification of permutations avoiding five patterns of length 4
by: Toufik Mansour
Published: (2020-07-01)