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

Pawel Gancarski

dblp:91/7450 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2010
0000-0001-9198-8429ORCID · reported

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

Software engineering, systems software and programming languages · 2 · 1 first-authorTheory of computation · 2 · 2 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
1 paper
Programming languages and type systems · 87% Requirements engineering and software design · 13%

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

TopicWeightPapersLastEvidence papers
Programming languages and type systems › language semantics › formal semantics
denotational semantics
0.112009
The Denotational Semantics of slotted-Circus · FM 2009
Programming languages and type systems › language semantics
formal semantics
0.112009
The Denotational Semantics of slotted-Circus · FM 2009
Requirements engineering and software design › formal specification
circus
0.012009
The Denotational Semantics of slotted-Circus · FM 2009

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

slotted-circus · 0.1
YearPublicationVenuePosition
2010 Prioritized slotted-Circus
Pawel Gancarski, Andrew Butterfield
ICTAC1
2009 The Denotational Semantics of slotted-Circus
Pawel Gancarski, Andrew Butterfield
FM1
2009 State Visibility and Communication in Unifying Theories of Programming
abstract
We explore the interactions between program-variable state visibility and communication behaviour in state-rich CSP-like processes, using the Unifying Theories of Programming (UTP) framework. The key results of this work are: having variable state visible while a process is waiting to communicate, results in an operationally complex theory of behaviour; by contrast, considering state as unobservable during communication wait periods results in an elegant theory, with much cleaner operational intuitions. The language constructs most affected by this observability choice are those of external choice and parallel composition. We also discuss situations where this state hiding can prevent the adoption of interesting operators that seize control from waiting processes.
Andrew Butterfield, Pawel Gancarski, Jim Woodcock 0001
TASE2