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

Milica Barjaktarovic

dblp:46/1055 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1997
—ORCID · none

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

Software engineering, systems software and programming languages · 3 · 3 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 networks
1 paper
Internet architecture and protocols · 77% Network management and operations · 23%
Software engineering, system software, and programming languages
1 paper
Concurrent programming · 100%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › network architecture design › layered architecture
session layer protocol
0.011996
Formal Specification and Verification of the Kernel Functional Unit of the OSI Session Layer Protocol and Service Using CCS · ISSTA 1996
Concurrent programming › concurrency theory
process calculi
0.011996
Formal Specification and Verification of the Kernel Functional Unit of the OSI Session Layer Protocol and Service Using CCS · ISSTA 1996
Network management and operations
protocol verification
0.011996
Formal Specification and Verification of the Kernel Functional Unit of the OSI Session Layer Protocol and Service Using CCS · ISSTA 1996

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

formal specification · 0.0CCS · 0.0
YearPublicationVenuePosition
1997 Formal Specification and Verification of the MISSI Sender and Local Cache using SPIN
abstract
We constructed a formal specification for sending secure Internet e-mail using Multilevel Information System Security Initiative (MISSI). We used formal language PROMELA, based on Hoare's CSP. We verified the model using AT&T's automated model checker SPIN. We propose a software engineering approach where we translate from English to pseudocode to a process algebra specification, verify the specification, and discover ambiguities, omissions, and errors in the English description. This work shows that formal methods can be used to speed up and clarify the software engineering process. It took eight weeks to choose SPIN among several tools, learn SPIN and MISSI, and produce and verify a sender model. We later added a local cache specification. The complexity of the process is intensified by starting from the purely English- and figure-based original specification, which relies on many separate documents and standards that operate together.
Milica Barjaktarovic
ICFEM1
1996 Formal Specification and Verification of the Kernel Functional Unit of the OSI Session Layer Protocol and Service Using CCS
Milica Barjaktarovic, Shiu-Kai Chin, Kamal Jabbour
ISSTA1
1995 Formal specification and verification of communication protocols using automated tools
abstract
The paper compares and contrasts various methods presently available for specification, validation and verification, with emphasis on verification. We describe an application of formal methods to protocol specification, validation, and verification, using an actual protocol as an example. We use a process algebra to build models of an OSI protocol and test these models using a model checker. Model checking allows us to verify large and complex models and use formal methods as practical solutions. We also show an example with an automated theorem prover.
Milica Barjaktarovic, Shiu-Kai Chin, Kamal Jabbour
ICECCS1