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

Cristian Gherghina

dblp:48/6278 · DBLP profile ↗
← Back
12ranked-venue papers
4as first author
0since 2021 · last 2014
—ORCID · none

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

Software engineering, systems software and programming languages · 12 · 4 first-authorTheory of computation · 3 · 1 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.

Software engineering, system software, and programming languages
3 papers
Program verification · 48% Program analysis · 32% Programming languages and type systems · 21%

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

TopicWeightPapersLastEvidence papers
Program analysis › static analysis › pointer analysis
shape analysis
0.212014
Shape Analysis via Second-Order Bi-Abduction · CAV 2014
Program verification › pointer program verification
heap-manipulating program verification
0.112011
Structured Specifications for Better Verification of Heap-Manipulating Programs · FM 2011
Programming languages and type systems
program specification
0.112011
Structured Specifications for Better Verification of Heap-Manipulating Programs · FM 2011
Program verification › program logic
separation logic
0.012011
Structured Specifications for Better Verification of Heap-Manipulating Programs · FM 2011

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

separation logic · 0.2bi-abduction · 0.2structured specifications · 0.1specialization calculus · 0.1
YearPublicationVenuePosition
2014 Shape Analysis via Second-Order Bi-Abduction
Quang Loc Le, Cristian Gherghina, Shengchao Qin, Wei-Ngan Chin
CAV2
2014 A Resource-Based Logic for Termination and Non-termination Proofs
Ton Chanh Le, Cristian Gherghina, Aquinas Hobor, Wei-Ngan Chin
ICFEM2
2014 Automated verification of the FreeRTOS scheduler in Hip/Sleek
João F. Ferreira 0001, Cristian Gherghina, Guanhua He, Shengchao Qin, Wei-Ngan Chin
Int. J. Softw. Tools Technol. Transf.2
2014 Expressive program verification via structured specifications
Cristian Gherghina, Cristina David, Shengchao Qin, Wei-Ngan Chin
Int. J. Softw. Tools Technol. Transf.1
2013 A Proof Slicing Framework for Program Verification
Ton Chanh Le, Cristian Gherghina, Razvan Voicu, Wei-Ngan Chin
ICFEM2
2012 Decision Procedures over Sophisticated Fractional Permissions
Xuan Bach Le, Cristian Gherghina, Aquinas Hobor
APLAS2
2011 A Specialization Calculus for Pruning Disjunctive Predicates to Support Verification
Wei-Ngan Chin, Cristian Gherghina, Razvan Voicu, Quang Loc Le, Florin Craciun, Shengchao Qin
CAV2
2011 Barriers in Concurrent Separation Logic
Aquinas Hobor, Cristian Gherghina
ESOP2
2011 Structured Specifications for Better Verification of Heap-Manipulating Programs
Cristian Gherghina, Cristina David, Shengchao Qin, Wei-Ngan Chin
FM1
2010 A Specification Logic for Exceptions and Beyond
Cristian Gherghina, Cristina David
ATVA1
2009 Translation and optimization for a core calculus with exceptions
abstract
A requirement of any source language is to be rich in features and concise to use by the programmers. As a drawback, it is often too complex to analyse, causing research studies to omit some of the fancy features. For instance, exception handling is an important aspect of programming languages that is instrumental for building robust software with good error handling capability. However, exceptions are often omitted during the initial formulation on program analysis and optimization. Moreover, when considering the traditional approach of converting programs from high level languages to machine code, the target code is meant for the machine, being too cryptic (or low level) for program analysis. Our goal is to design an intermediate, minimal but expressive, core calculus which can be easily analysed and manipulated, and to show that this calculus can handle major language features by translating a significant imperative source language into it. The translation to the core calculus enables us to easily analyse and optimize the code, while not sacrificing the flexibility and rich characteristic of the source language.
Cristina David, Cristian Gherghina, Wei-Ngan Chin
PEPM2
2009 Automated Verification Using Unified Control Flows
abstract
Exception handling is an important feature in modern programming methodology. However, it introduces abnormal control flows due to which the analysis becomes considerable more difficult. In general, automated verification of programs with diversified control flows can prove to be a difficult problem. We propose an approach to verification that handles different control flow types in a unified manner.
Cristian Gherghina, Cristina David
TASE1