NDLI: Relational concurrent refinement part II: Internal operations and outputs

Content Provider	Springer Nature Link
Author	Boiten, Eerke Derrick, John Schellhorn, Gerhard
Copyright Year	2008
Abstract	Two styles of description arise naturally in formal specification: state-based and behavioural. In state-based notations, a system is characterised by a collection of variables, and their values determine which actions may occur throughout a system history. Behavioural specifications describe the chronologies of actions—interactions between a system and its environment. The exact nature of such interactions is captured in a variety of semantic models with corresponding notions of refinement; refinement in state based systems is based on the semantics of sequential programs and is modelled relationally. Acknowledging that these viewpoints are complementary, substantial research has gone into combining the paradigms. The purpose of this paper is to do three things. First, we survey recent results linking the relational model of refinement to the process algebraic models. Specifically, we detail how variations in the relational framework lead to relational data refinement being in correspondence with traces–divergences, singleton failures and failures–divergences refinement in a process semantics. Second, we generalise these results by providing a general flexible scheme for incorporating the two main “erroneous” concurrent behaviours: deadlock and divergence, into relational refinement. This is shown to subsume previous characterisations. In doing this we derive relational refinement rules for specifications containing both internal operations and outputs that corresponds to failures–divergences refinement. Third, the theory has been formally specified and verified using the interactive theorem prover KIV.
Starting Page	65
Ending Page	102
Page Count	38
File Format	PDF
ISSN	09345043
Journal	Formal Aspects of Computing
Volume Number	21
Issue Number	1-2
e-ISSN	1433299X
Language	English
Publisher	Springer-Verlag
Publisher Date	2008-01-04
Publisher Place	London
Access Restriction	Subscribed
Subject Keyword	Data refinement Z Simulations, Process algebraic semantics Failures–divergences refinement Deadlock Internal operations Outputs Mechanisation KIV Computational Mathematics and Numerical Analysis Theory of Computation Math Applications in Computer Science
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Relational concurrent refinement part II: Internal operations and outputs

Relational Concurrent Refinement

Relational concurrent refinement part III: traces, partial relations and automata

A singleton failures semantics for Communicating Sequential Processes

Introducing extra operations in refinement

The behavioural semantics of Event-B refinement

Data refinement and singleton failures refinement are not equivalent

Verification of Mondex electronic purses with KIV: from transactions to a security protocol

Unifying theories in ProofPower-Z

Relational concurrent refinement part II: Internal operations and outputs

Similar Documents

Relational concurrent refinement part II: Internal operations and outputs

Relational Concurrent Refinement

Relational concurrent refinement part III: traces, partial relations and automata

A singleton failures semantics for Communicating Sequential Processes

Introducing extra operations in refinement

The behavioural semantics of Event-B refinement

Data refinement and singleton failures refinement are not equivalent

Verification of Mondex electronic purses with KIV: from transactions to a security protocol

Unifying theories in ProofPower-Z

Relational concurrent refinement part II: Internal operations and outputs