Hongjun Zheng

dblp:18/1656 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2001
0000-0003-2297-4319ORCID · corroborated

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

Software engineering, systems software and programming languages · 4

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
2 papers
Program analysis · 50% Program verification · 46% Programming languages and type systems · 5%

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

TopicWeightPapersLastEvidence papers
Program verification
model checking
0.122001
Tool-Supported Program Abstraction for Finite-State Verification · ICSE 2001
Bandera: extracting finite-state models from Java source code · ICSE 2000
Program verification
abstraction-based verification
0.012001
Tool-Supported Program Abstraction for Finite-State Verification · ICSE 2001
Program analysis
program abstraction
0.012001
Tool-Supported Program Abstraction for Finite-State Verification · ICSE 2001
Program analysis
static analysis
0.012001
Tool-Supported Program Abstraction for Finite-State Verification · ICSE 2001
Program analysis › specification mining
finite-state automaton inference
0.012000
Bandera: extracting finite-state models from Java source code · ICSE 2000
Programming languages and type systems › object-oriented programming
java
0.012001
Tool-Supported Program Abstraction for Finite-State Verification · ICSE 2001
Program analysis
source code analysis
0.012000
Bandera: extracting finite-state models from Java source code · ICSE 2000

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

program transformation · 0.0abstraction · 0.0
YearPublicationVenuePosition
2001 Tool-Supported Program Abstraction for Finite-State Verification
abstract
Numerous researchers have reported success in reasoning about properties of small programs using finite-state verification techniques. We believe, as do most researchers in this area, that in order to scale those initial successes to realistic programs, aggressive abstraction of program data will be necessary. Furthermore, we believe that to make abstraction-based verification usable by non-experts significant tool support will be required. In this paper we describe how several different program analysis and transformation techniques are integrated into the Bandera toolset to provide facilities for abstracting Java programs to produce compact, finite-state models that are amenable to verification for example via model checking. We illustrate the application of Bandera's abstraction facilities to analyze a realistic multi-threaded Java program.
Matthew B. Dwyer, John Hatcliff, Roby Joehanes, Shawn Laubach, Corina Pasareanu, Robby, Hongjun Zheng, Willem Visser
ICSE7
2000 Bandera: extracting finite-state models from Java source code
abstract
Finite-state verification techniques, such as model checking, have shown promise as a cost-effective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a finite-state model that approximates the executable behavior of the software system of interest. Current best-practice involves hand-construction of models which is expensive (prohibitive for all but the smallest systems), prone to errors (which can result in misleading verification results), and difficult to optimize (which is necessary to combat the exponential complexity of verification algorithms).
James C. Corbett, Matthew B. Dwyer, John Hatcliff, Shawn Laubach, Corina Pasareanu, Robby, Hongjun Zheng
ICSE7
1999 A Formal Study of Slicing for Multi-threaded Programs with JVM Concurrency Primitives
John Hatcliff, James C. Corbett, Matthew B. Dwyer, Stefan Sokolowski, Hongjun Zheng
SAS5
1998 Market-Driven Symbolic Execution of Methods of Manufacturing Enterprises
abstract
We apply formal description techniques (FDT) to model, compose and give operational meaning to the class of reactive systems representing manufacturing enterprises. The enterprise pursues its activities by means of resources and processes that execute concurrently on the resources, subject to internal (resource) and external (market) constraints. Some modelling techniques are familiar for reactive systems, other are specific to this domain: modelling management decisions, product transfer during one-to-one (one supplier one consumer) synchronisation, marketing and many-to-one (many suppliers one consumer) synchronisation. The paper is a novel application of FDTs, also a contribution to the semantics of enterprise engineering.
Tomasz Janowski, Hongjun Zheng, Gustavo Giménez Lugo
ICFEM2