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

Juan Aristizabal

dblp:58/2959 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1988
—ORCID · none

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

Software 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.

Computer networks
1 paper
Internet architecture and protocols · 100%
Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%
Theoretical computer science
1 paper
Automata and formal languages · 100%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
protocol specification
0.011988
Constructing Submodule Specifications and Network Protocols · IEEE Trans. Software Eng. 1988
Programming languages and type systems › module systems
module specification
0.011988
Constructing Submodule Specifications and Network Protocols · IEEE Trans. Software Eng. 1988
Automata and formal languages
finite automata
0.011988
Constructing Submodule Specifications and Network Protocols · IEEE Trans. Software Eng. 1988

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

automated tool · 0.0finite state machine · 0.0finite-state machine · 0.0
YearPublicationVenuePosition
1988 Constructing Submodule Specifications and Network Protocols
abstract
Applications of an automated tool for module specification (ATMS) that finds the specification for a submodule of a system are presented. Given the specification of a system, together with the specification for n-1 submodules, the ATMS constructs the specification for the nth addition submodule such that the interaction among the n submodules is equivalent to the specification of the system. The implementation of the technique is based on an approach proposed by P. Merlin and G.B. Bochmann (1983). The specification of a system and its submodules consists of all possible execution sequences of their individual operations. The ATMS uses finite-state machine concepts to represent the specifications and interactions of the system and its submodules. The specification found by the ATMS for a missing module of a system is the most general one, if one exists. Application of the ATMS in the area of communication protocols is discussed. A manual process to find the specification for a missing module using the Merlin-Bochmann technique is time-consuming and prone to errors. The automated tool presented proves a reliable method for constructing such a module.>
Deepinder P. Sidhu, Juan Aristizabal
IEEE Trans. Software Eng.2