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

Czeslaw Jeske

dblp:61/6972 · DBLP profile ↗
← Back
8ranked-venue papers
1as first author
0since 2021 · last 2015
—ORCID · none

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

Software engineering, systems software and programming languages · 5 · 1 first-authorTheory of computation · 5 · 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
1 paper
Program verification · 100%
Network and information security
1 paper
Cryptographic protocols and secure computation · 100%

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

TopicWeightPapersLastEvidence papers
Program verification
refinement
0.112005
Retrenching the Purse: Finite Sequence Numbers, and the Tower Pattern · FM 2005

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

tower pattern · 0.1formal methods · 0.1
YearPublicationVenuePosition
2015 Retrenchment and refinement interworking: the tower theorems
abstract
Retrenchment is a flexible model evolution formalism that compensates for the limitations imposed by specific formulations of refinement. Its refinement-like proof obligations feature additional predicates for accommodating design data describing the model change. The best results are obtained when refinement and retrenchment cooperate, the paradigmatic scheme for this being the commuting square or tower, in which ‘horizontal retrenchment rungs’ commute with ‘vertical refinement columns’ to navigate through a much more extensive design space than permitted by refinement alone. In practice, the navigation is accomplished through ‘square completion’ constructions, and we present and prove a full suite of square completion theorems.
Richard Banach, Czeslaw Jeske
Math. Struct. Comput. Sci.2
2013 Atomicity failure and the retrenchment atomicity pattern
abstract
Abstract The issues surrounding the question of atomicity, both in the past and nowadays, are briefly reviewed, and a picture of an ACID (atomic, consistent, isolated, durable) transaction as a refinement problem is presented. An example of a simple air traffic control system is introduced, and the discrepancies that can arise when read-only operations examine the state at atomic and finegrained levels are handled by retrenchment. Non-ACID timing aspects of the ATC example are also handled by retrenchment, and the treatment is generalised to yield the Retrenchment Atomicity Pattern . The utility of the pattern is confirmed against a number of different case studies. One is the Mondex Electronic Purse, its protocol treated as a conventional atomic transaction. Another is the recovery protocol of Mondex, viewed as a compensated transaction (leading to the view that compensated transactions in general fit the pattern). A final one comprises various unruly phenomena occurring in the implementations of software transactional memory systems, which can frequently display non-ACID behaviour. In all cases the Atomicity Pattern is seen to perform well.
Richard Banach, Czeslaw Jeske, Anthony Hall, Susan Stepney
Formal Aspects Comput.2
2007 Retrenchment and the Atomicity Pattern
abstract
The issues surrounding the question of atomicity, both in the past and nowadays, are briefly reviewed, and a picture of an ACID (atomic, consistent, isolated, durable) transaction as a refinement problem is presented. An example of a simple air traffic control system is introduced, and the discrepancies that can arise when read-only operations examine the state at atomic and finegrained levels are handled by retrenchment. Non-ACID timing aspects of the ATC example are also handled by retrenchment, and the treatment is generalised as the retrenchment Atomicity Pattern. The utility of the pattern is confirmed against a different case study, the Mondex Electronic Purse.
Richard Banach, Czeslaw Jeske, Anthony Hall, Susan Stepney
SEFM2
2007 Retrenching the Purse: The Balance Enquiry Quandary, and Generalised and (1, 1) Forward Refinements
Richard Banach, Czeslaw Jeske, Michael Poppleton, Susan Stepney
Fundam. Informaticae2
2007 Engineering and theoretical underpinnings of retrenchment
Richard Banach, Michael Poppleton, Czeslaw Jeske, Susan Stepney
Sci. Comput. Program.3
2006 Retrenching the Purse: Hashing Injective CLEAR Codes, and Security Properties
abstract
The Mondex Electronic Purse is an outstanding example of industrial scale formal refinement, and was the first verification to achieve ITSEC level E6 certification. A formal abstract model and a formal concrete model were developed, and a formal refinement was hand-proved between them. Nevertheless, certain requirements issues were set beyond the scope of the formal development, or handled in an unnatural manner. The retrenchment tower pattern is used to address one such issue in detail: the use of a hash function rather than a total injective function when clearing the highly constrained purse logs. A retrenchment is constructed from the lowest level model to a model using a hash, and is then lifted to create two refinement developments, working at different levels of detail, and connected via retrenchments. The tower development is appropriately validated, vindicating the design used.
Richard Banach, Michael Poppleton, Czeslaw Jeske, Susan Stepney
ISoLA3
2005 Retrenching the Purse: Finite Sequence Numbers, and the Tower Pattern
Richard Banach, Michael Poppleton, Czeslaw Jeske, Susan Stepney
FM3
2002 Minimally and Maximally Abstract Retrenchments
Czeslaw Jeske, Richard Banach
IFM1