Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Naeem Abbasi

dblp:72/3574 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
0since 2021 · last 2014
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 4 · 2 first-authorSystems, architecture and hardware · 2Software engineering, systems software and programming languages · 2Computer networks · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 56% Hardware reliability and fault tolerance · 44%
Theoretical computer science
1 paper
Automated reasoning and model checking · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Hardware reliability and fault tolerance
reliability analysis
0.112010
Formal Reliability Analysis Using Theorem Proving · IEEE Trans. Computers 2010
Electronic design automation › hardware verification and test › formal verification
theorem proving
0.112010
Formal Reliability Analysis Using Theorem Proving · IEEE Trans. Computers 2010
Electronic design automation › hardware verification and test
fault analysis
0.012010
Formal Reliability Analysis Using Theorem Proving · IEEE Trans. Computers 2010

Methods — techniques the papers use, named apart from their topics

higher-order logic theorem proving · 0.1
YearPublicationVenuePosition
2014 An approach for lifetime reliability analysis using theorem proving
Naeem Abbasi, Osman Hasan, Sofiène Tahar
J. Comput. Syst. Sci.1
2010 AOP-based high-level power estimation in SystemC
abstract
The paper presents a novel high-level power modeling and estimation framework. The approach is based on a synergic integration of aspect-oriented programming(AOP) and SystemC. Macro module modeling and power estimation are harnessed. A case study demonstrates the effectiveness of the proposed method.
Feng Liu 0029, QingPing Tan, Naeem Abbasi
ACM Great Lakes Symposium on VLSI4
2010 Formal Lifetime Reliability Analysis Using Continuous Random Variables
Naeem Abbasi, Osman Hasan, Sofiène Tahar
WoLLIC1
2010 Formal Reliability Analysis Using Theorem Proving
abstract
Reliability analysis has become a tool of fundamental importance to virtually all electrical and computer engineers because of the extensive usage of hardware systems in safety and mission critical domains, such as medicine, military, and transportation. Due to the strong relationship between reliability theory and probabilistic notions, computer simulation techniques have been traditionally used to perform reliability analysis. However, simulation provides less accurate results and cannot handle large-scale systems due to its enormous CPU time requirements. To ensure accurate and complete reliability analysis and thus more reliable hardware designs, we propose to conduct a formal reliability analysis of systems within the sound core of a higher order logic theorem prover (HOL). In this paper, we present the higher order logic formalization of some fundamental reliability theory concepts, which can be built upon to precisely analyze the reliability of various engineering systems. The proposed approach and formalization is then utilized to analyze the repairability conditions for a reconfigurable memory array in the presence of stuck-at and coupling faults.
Osman Hasan, Sofiène Tahar, Naeem Abbasi
IEEE Trans. Computers3
2009 Formal Reasoning about Expectation Properties for Continuous Random Variables
Osman Hasan, Naeem Abbasi, Behzad Akbarpour, Sofiène Tahar, Reza Akbarpour
FM2
2009 Real-time FPGA architecture of modified Stable Euler-Number algorithm for image binarization
abstract
The stable Euler-Number based image binarization gives excellent visual results for video frames containing high amount of image noise. Being computationally expensive, its implementations are limited to general purpose processors for the most cost-effective solution or in application specific integrated circuits for maximum performance. This paper proposes a modified stable Euler-number based algorithm for image binarization and its real-time hardware implementation in a field programmable gate array with a pipelined architecture. The end result is a design that out-performs known software implementations while keeping the amount of noisy pixels introduced during the binarization process to a minimum. The hardware implementation results show that the proposed architecture gives accurate results compared to the software implementation.
Naeem Abbasi, Jacques Athow, Aishy Amer
ICIP1
2009 Formal Probabilistic Analysis of Stuck-at Faults in Reconfigurable Memory Arrays
Osman Hasan, Naeem Abbasi, Sofiène Tahar
IFM2
1995 Buffer size trade-offs in input/output buffered ATM switches under various conditions
abstract
In this paper the non-linear and complex relationship between packet loss probability and average packet delay for an input/output buffered ATM switch is studied thoroughly using our previously published analysis model. The main contribution is insight into the behavior of the switch and better understanding of the buffer size trade-offs under various traffic conditions speed-up factors, and buffer sizes. For different traffic conditions and buffer sizes, several distinct regions are identified and the behavior of the switch in those regions is explained. The results presented here can provide the basis for an optimum VLSI design methodology for input/output-buffered switches.
Naeem Abbasi, Charles A. Zukowski, Omar Wing
ICCCN2