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

Brahma Dathan

dblp:56/1594 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 2018
—ORCID · none

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

Databases, data management, data science and information retrieval · 2 · 2 first-authorHuman-computer interaction and ubiquitous computing · 2Artificial intelligence and machine learning · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1

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.

Software engineering, system software, and programming languages
1 paper
Debugging and program repair · 50% Software testing · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Debugging and program repair › concurrent program debugging
distributed debugging
0.011995
Testing and Debugging Distributed Programs Using Global Predicates · IEEE Trans. Software Eng. 1995
Software testing › structural testing
predicate testing
0.011995
Testing and Debugging Distributed Programs Using Global Predicates · IEEE Trans. Software Eng. 1995
Distributed systems
fault tolerance
0.011995
Testing and Debugging Distributed Programs Using Global Predicates · IEEE Trans. Software Eng. 1995

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

message complexity analysis · 0.0distributed algorithm · 0.0
YearPublicationVenuePosition
2018 Algorithms for Computing Inequality Joins
Brahma Dathan, Stefan Trausan-Matu
DATA1
2008 Evolving an integrated curriculum for object-oriented analysis and design
abstract
Object-Oriented Analysis and Design has established itself as an integral and critically vital part of the software development process. In this paper, we describe an integrated approach to teaching this subject so that it covers vital components of this vast field: analysis, object-oriented design principles such as the Liskov Substitution Principle, the design process, which shows how and where the rules are applied, modeling, design and architectural patterns, language features, and refactoring. The course has evolved over the past 10 years to one that revolves around three major case studies. This evolution has resulted in a course that covers all important aspects of OOAD in a manner that emphasizes their inter-relatedness and hence their relevance to overall design process. Feedback suggests that this approach has improved students' understanding of the OOAD concepts.
Sarnath Ramnath, Brahma Dathan
SIGCSE2
2005 Computer forensics programs in higher education: a preliminary study
abstract
This paper presents a preliminary survey of computer forensics programs in North America. It summarizes existing requirements for associate, bachelor's, and master's degree programs as well as certificate programs. It briefly discusses factors which must be considered when introducing a new program (curriculum design, faculty, students, facilities, and budget).
Larry Gottschalk, Jigang Liu, Brahma Dathan, Sue Fitzgerald
SIGCSE3
1995 Testing and Debugging Distributed Programs Using Global Predicates
abstract
Testing and debugging programs are more involved in distributed systems than in uniprocessor systems because of the presence of the communication medium and the inherent concurrency. Past research has established that predicate testing is an approach that can alleviate some of the problems in this area. However, checking whether a general predicate is true in a particular distributed execution appears to be a computationally hard problem. This paper considers a class of predicates called conjunctive form predicates (CFP) that is quite useful in distributed program development, but can be tested efficiently. We develop fully-distributed algorithms to test CFP's, prove that these algorithms are correct, and analyze them for their message complexity. The analysis shows that our techniques incur a fairly low overhead on the distributed system.>
S. Venkatesan 0001, Brahma Dathan
IEEE Trans. Software Eng.2
1993 Transaction management in N-version programmed database systems
Brahma Dathan
Inf. Syst.1