NDLI: Mining API protocols based on a balanced probabilistic model

Content Provider	IEEE Xplore Digital Library
Author	Deng Chen Yanduo Zhang Rongcun Wang Wei Wei Huabing Zhou Xun Li Binbin Qu
Copyright Year	2015
Description	Author affiliation: Sch. of Comput. Sci. & Technol., China Univ. of Min. & Technol., Xuzhou, China (Rongcun Wang) \|\| Hubei Provincial Key Lab. of Intell. Robot, Wuhan Inst. of Technol., Wuhan, China (Deng Chen; Yanduo Zhang; Huabing Zhou; Xun Li) \|\| Ind. Robot Eng. Center, Wuhan Inst. of Technol., Wuhan, China (Wei Wei) \|\| Sch. of Comput. Sci. & Technol., Huazhong Univ. of Sci. & Technol., Wuhan, China (Binbin Qu)
Abstract	API protocols are important for modern software development. They can be used in program testing, documentation, understanding and validation. Mining API protocols based on probabilistic models is proved to be an effective method to achieve protocols automatically. In this paper, we discuss the unbalanced probability problem caused by loops and recursive functions in application programs and a method based on the suffix tree is proposed to address it. In order to investigate the feasibility and effectiveness of our approach, we implemented it in our previous prototype tool ISpecMiner and performed a comparison test based on several real-world applications. Experimental results show that our approach can achieve protocols with more balanced probabilities than existing approaches, which provides a strong assurance for achieving valid and precise API protocols.
Starting Page	2276
Ending Page	2282
File Size	383856
Page Count	7
File Format	PDF
e-ISBN	9781467376822
DOI	10.1109/FSKD.2015.7382307
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-08-15
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Protocols tandem array API protocol Automata Documentation Markov processes Probabilistic logic Markov model Data mining Arrays program validation probabilistic model
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Mining Dependent Frequent Serial Episodes from Uncertain Sequence Data

Learning Probabilistic Automata for Model Checking

New Results on Abstract Probabilistic Automata

p-Automata: New Foundations for Discrete-Time Probabilistic Verification

A Probabilistic QoS Model-Checking for Dynamic Routing Protocol

Discrete-Time Verification and Control for Probabilistic Rectangular Hybrid Automata

Fortuna: Model Checking Priced Probabilistic Timed Automata

Performance Analysis of Data Gathering Protocol Using PRISM

Probabilistic Model Checking of Pipe protocol

Mining API protocols based on a balanced probabilistic model

Similar Documents

Mining Dependent Frequent Serial Episodes from Uncertain Sequence Data

Learning Probabilistic Automata for Model Checking

New Results on Abstract Probabilistic Automata

p-Automata: New Foundations for Discrete-Time Probabilistic Verification

A Probabilistic QoS Model-Checking for Dynamic Routing Protocol

Discrete-Time Verification and Control for Probabilistic Rectangular Hybrid Automata

Fortuna: Model Checking Priced Probabilistic Timed Automata

Performance Analysis of Data Gathering Protocol Using PRISM

Probabilistic Model Checking of Pipe protocol

Mining API protocols based on a balanced probabilistic model