Dilian Gurov

Dilian Gurov

Auto-generated profile, based on publicly available information

Dilian Gurov

Swedish Institute of Computer Science

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2002 in Journal of Logic and Computation
Verified
Journal Article
Closed access
PDF file
MDMads Dam
Mads Dam
DGDilian Gurov
Dilian Gurov
We present a Gentzen‐style sequent calculus for program verification which accommodates both model checking‐like verification based on global state space exploration, and compositional reasoning. To handle the complexities arising from the presence of fixed‐point formulas, programs with dynamically evolving architecture, and cut rules we use transition assertions, and introduce fixed‐point approximants explicitly into the assertion language. We address, in a game‐based manner, the semantical basis of this approach, as it applies to the entailment subproblem. Soundness and completeness results are obtained, and examples are shown illustrating some of the concepts.

1 August 2003 in International Journal on Software Tools for Technology Transfer
Verified
Journal Article
Closed access
PDF file
LFLars–Åke Fredlund
Lars–Åke Fredlund
DGDilian Gurov
Dilian Gurov
TNThomas Noll
Thomas Noll
MDMads Dam
Mads Dam
TAThomas Arts
Thomas Arts
GCGennady Chugunov
Gennady Chugunov

1 January 1998
Verified
Book Chapter
Closed access
PDF file
TAThomas Arts
Thomas Arts
MDMads Dam
Mads Dam
LFLars -Åke Fredlund
Lars -Åke Fredlund
DGDilian Gurov
Dilian Gurov

1 July 1999 in RAIRO - Theoretical Informatics and Applications
Verified
Journal Article
Closed access
PDF file
DGDilian Gurov
Dilian Gurov
BKBruce Kapron
Bruce Kapron
Proof systems with sequents of the form U ⊢ Φ for proving validity of a propositional modal μ-calculus formula Φ over a set U of states in a given model usually handle fixed-point formulae through unfolding, thus allowing such formulae to reappear in a proof. Tagging is a technique originated by Winskel for annotating fixed-point formulae with information about the proof states at which these are unfolded. This information is used later in the proof to avoid unnecessary unfolding, without having to investigate the history of the proof. Depending on whether tags are used for acceptance or for rejection of a branch in the proof tree, we refer to “positive” or “negative” tagging, respectively. In their simplest form, tags consist of the sets U at which fixed-point formulae are unfolded. In this paper, we generalise results of earlier work by Andersen et al. which, in the case of least fixed-point formulae, are applicable to singleton U sets only.