Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Sound Control Flow Graph Extraction from Incomplete Java Bytecode Programs
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.ORCID iD: 0000-0002-6468-1605
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS. Polytechnic University of Turin.
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.ORCID iD: 0000-0002-0074-8786
2014 (English)In: Fundamental Approaches to Software Engineering: 17th International Conference, FASE 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings / [ed] Stefania Gnesi and Arend Rensink, Springer Berlin/Heidelberg, 2014, 215-229 p.Conference paper, Published paper (Refereed)
Abstract [en]

The modular analysis of control flow of incompleteJava bytecode programs is challenging, mainly because of the complex semantics of the language,and the unknown inter-dependencies between the available and unavailable components.In this paper we describe a technique for incremental, modular extraction ofcontrol flow graphs that are provably sound w.r.t.~sequences of method invocations and exceptions.The extracted models are suitable for various program analyses,in particular model-checking of temporal control flow safety properties.Soundness comes at the price of over-approximation,potentially giving rise to false positives reports during verification.Still, our technique supports incremental refinement of the already extracted models,as more components code becomes available.The extraction has been implemented as the ConFlex tool, and test-cases show its utility and efficiency.

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2014. 215-229 p.
Series
Lecture Notes in Computer Science, 8411
Keyword [en]
Incomplete Programs, Java Bytecode, Program Models, Formal Verification
National Category
Computer Science
Research subject
Computer Science; Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-154786DOI: 10.1007/978-3-642-54804-8_15Scopus ID: 2-s2.0-84900555960ISBN: 978-3-642-54803-1 (print)OAI: oai:DiVA.org:kth-154786DiVA: diva2:758433
Conference
Fundamental Approaches to Software Engineering (FASE),
Note

QC 20141117

Available from: 2014-10-27 Created: 2014-10-27 Last updated: 2014-11-17Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopusThe final publication is available at www.springerlink.com

Authority records BETA

de Carvalho Gomes, PedroGurov, Dilian

Search in DiVA

By author/editor
de Carvalho Gomes, PedroPicoco, AttilioGurov, Dilian
By organisation
Theoretical Computer Science, TCS
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 33 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf