- MONSTR II --Suspending Semantics and Independence (Computer Science Dept., Manchester University, Manchester, M13 9PL, U.K.
- Under consideration for publication in Formal Aspects of Computing Atomicity Failure and the Retrenchment
- The usefulness of the generalised computational model of Term Graph Rewriting Systems (TGRS) for designing and
- Graph Transformation via Abstract Diagrams , A. Corradinib
- Simple Feature Engineering via Neat Default Retrenchments
- Abstract Diagrams Computer Science Dept., Manchester University, Manchester, M13 9PL, U.K.
- Stronger Compositions for Retrenchments, and Feature Engineering
- Retrenching the Purse: Finite Sequence Numbers, and the Tower Pattern
- Coarse Grained Retrenchment and the Mondex Denial of Service Attacks Richard Banach
- Electronic Notes in Theoretical Computer Science 66 No. 4 (2002) URL: http://www.elsevier.nl/locate/entcs/volume66.html 15 pages
- MONSTR I ---Fundamental Issues and the Design of (Computer Science Dept., Manchester University, Manchester, M13 9PL, U.K.
- Retrenching the Purse: Hashing Injective CLEAR Codes, and Security Properties
- PARALLELTERMGRAPHREWRITINGAND CONCURRENT LOGIC PROGRAMS
- Structuring Retrenchments in the small with B Michael Poppleton1
- Consider a crude style rule basis S that is concrete (no polymorphism) and complete (each type has a rule). Build the final typegraph D, whose nodes are the concrete type symbols, and whose arcs are given by: for
- MONSTR V ---Transitive Coercing Semantics and the ChurchRosser Property
- 1Reconciling Retrenchments and Refinements II: This document presents the proofs for the construction presented in Section 5 of Recon-
- DACTL REWRITING IS CATEGORICAL Computer Science Department, Manchester University,
- Maximally Abstract Retrenchments Computer Science Dept., Manchester University, Manchester, M13 9PL, U.K.
- Under consideration for publication in Formal Aspects of Computing Retrenchment and Promotion in Z
- Structuring Retrenchments in B by Decomposition
- Under consideration for publication in Formal Aspects of Computing Atomic Actions, and their Refinements to
- Model Based Engineering of Specifications by Retrenching Partial Requirements , M. Poppletonb
- Reconciling Retrenchments and Refinements I: This document presents the proofs for the construction presented in Section 5 of Recon-
- Retrenchment and the Mondex Electronic Purse (Extended Abstract)
- Retrenchment and the Atomicity Pattern Richard Banach,
- The Contractum in Algebraic Graph Rewriting R. Banach 1
- Maximally Abstract Retrenchments Computer Science Dept., Manchester University, Manchester, M13 9PL, U.K.
- Fundamenta Informaticae XXXXXXXXX (2066) 101140 101 Retrenching the Purse: The Balance Enquiry Quandary,
- Transitive Term Graph Rewriting Computer Science Dept., Manchester University,
- 18 ANNALS OF MATHEMATICS, COMPUTING & TELEINFORMATICS, VOL 1, NO 3, 2005, PP 18-26 Dynamic aspects of retrenchments through
- A Translation of the PiCalculus Into MONSTR (Computer Science Dept., Manchester University, Manchester, M13 9PL, U.K.
- Reconciling Retrenchments and Refinements I Czeslaw Jeske, Richard Banach
- Stronger Compositions for Retrenchments R. Banach, C. Jeske
- Submitted to: Refine 2011
- The Mondex Purse: Requirements and Retrenchments
- On the Refinement of Atomic Actions Richard Banach1
- Retrenching the Purse: Hashing Injective CLEAR Codes, and Security Properties
- Structuring Retrenchments in B by Decomposition
- Retrenchment: Extending the Reach of Refinement M.R. Poppleton
- Retrenchment and Punctured Simulation , M. Poppletona,b
- The Contractum in Algebraic Graph Rewriting Computer Science Department, Manchester University,
- MONSTR: TERM GRAPH REWRITING FOR PARALLEL MACHINES
- Under consideration for publication in Formal Aspects of Computing Atomicity Failure and the Retrenchment
- Retrenching Partial Requirements into System Definitions: A Simple Feature Interaction Case Study
- A Multiply Hierarchical Automaton Semantics for the IWIM Coordination Model
- MONSTR I --Fundamental Issues and the Design of (Computer Science Dept., Manchester University, Manchester, M13 9PL, U.K.
- ON REGULARITY IN SOFTWARE Computer Science Department, Manchester University,
- Retrenchment and System Properties Computer Science Dept., Manchester University, Manchester, M13 9PL, U.K.
- A Multiply Fibred Automaton Semantics Computer Science Dept., Manchester University, Manchester, M13 9PL, U.K.
- MECHANIZED SUPPORT FOR RETRENCHMENT
- Mobility and Modularity: expressing calculus in CCS
- Controlling control systems: an application of evolving retrenchment
- A ConceptDriven Construction of the Mondex Protocol using Three Refinements
- A Multiply Fibred Automaton Semantics Computer Science Dept., Manchester University, Manchester, M13 9PL, U.K.
- Reconciling Retrenchments and Refinements I Czeslaw Jeske, Richard Banach
- Coarse Grained Retrenchment and the Mondex Denial of Service Attacks Richard Banach
- A Deidealisation Semantics for KAOS Richard Banach
- Reconciling Retrenchments and Refinements I: This document presents the proofs for the construction presented in Section 5 of Recon
- Reconciling Retrenchments and Refinements C. Jeske, R. Banach
- Dynamic aspects of retrenchments through temporal logic
- Transitive Term Graph Rewriting Computer Science Dept., Manchester University,
- MONSTR: TERM GRAPH REWRITING FOR PARALLEL MACHINES
- Stronger Compositions for Retrenchments R. Banach, C. Jeske
- Retrenching the Purse: Finite Exception Logs, and Validating the Small Richard Banach,
- Fundamenta Informaticae XXXXXXXXX (2066) 101--140 101 Retrenching the Purse: The Balance Enquiry Quandary,
- Retrenchment, and the Generation of Fault Trees for Static, Dynamic and Cyclic Systems ?
- Retrenchment R. Banach a , M. Poppleton a,b
- Fragmented Retrenchment, Concurrency and Fairness R. Banach a , M. Poppleton a,b
- ANNALS OF MATHEMATICS, COMPUTING & TELEINFORMATICS, VOL 1, NO 3, 2005, PP XXYY 1 Dynamic aspects of retrenchments through
- Model Based Refinement and the Tools of Tomorrow Richard Banach
- Retrenchment: An Engineering Variation on Refinement , M. Poppletona,b
- Minimally and Maximally Abstract Retrenchments C. Jeske, R. Banach
- Structuring Retrenchments in the small with B Michael Poppleton 1 and Richard Banach 2
- Under consideration for publication in Formal Aspects of Computing The Mechanical Generation of Fault Trees
- Retrenchment, Refinement and Simulation R. Banach a , M. Poppleton a,b
- Retrenchment and Refinement Interworking: the Tower Theorems
- Under consideration for publication in Formal Aspects of Computing The Mechanical Generation of Fault Trees
- A Translation of the Pi-Calculus Into MONSTR (Computer Science Dept., Manchester University, Manchester, M13 9PL, U.K.
- Department of Computer Science, University of Manchester, Manchester, M13 9PL, U.K., banach@cs.man.ac.uk
- Retrenchment: Extending Refinement for Continuous and Control Systems
- Retrenchment and System Properties Computer Science Dept., Manchester University, Manchester, M13 9PL, U.K.
- MONSTR: Term Graph Rewriting for Parallel
- UseCase-wise Development: Retrenchment for Event-B Richard Banach
- Software Is More Than Code Sriram K. Rajamani
- Algebraic Integration of Retrenchment and A thesis submitted to The University of Manchester for the degree of
- Under consideration for publication in Formal Aspects of Computing Retrenchment and Promotion in Z
- Sharp Retrenchment, Modulated Refinement and Simulation
- Retrenchment, Refinement and Simulation , M. Poppletona,b
- Stronger Compositions for Retrenchments, and Feature Engineering
- Jaoua A., Mili A., Boudriga N., Durieux J. L. (1991); Regularity of Relations: A Measure of Uniformity, Theoretical Computer Science, 79, 323339.
- Submitted to: Refine 2011 c
- Abstract Diagrams and an Opfibration Account of Typed Graph Transformation
- Stronger Compositions for Retrenchments R. Banach, C. Jeske
- Minimally and Maximally Abstract Retrenchments C. Jeske, R. Banach
- The Mondex Purse: Requirements and Retrenchments
- Retrenching the Purse: Finite Sequence Numbers, and the Tower Pattern
- Retrenching Partial Requirements into System Definitions: A Simple Feature Interaction Case Study
- Under consideration for publication in Formal Aspects of Computing Atomic Actions, and their Refinements to
- PARALLEL TERM GRAPH REWRITING AND CONCURRENT LOGIC PROGRAMS
- Requirements Validation by Lifting Retrenchments in B Michael Poppleton
- A Concept-Driven Construction of the Mondex Protocol using Three Refinements
- Composition Mechanisms for Retrenchment R. Banach a , C. Jeske a , M. Poppleton b
- Retrenchment and Punctured Simulation R. Banach a , M. Poppleton a,b
- Graph Transformation via Abstract Diagrams R. Banach a , A. Corradini b
- Abstract Diagrams Computer Science Dept., Manchester University, Manchester, M13 9PL, U.K.
- Approaching the Formal Design and Development of Complex Systems
- Model Based Engineering of Specifications by Retrenching Partial Requirements R. Banach a , M. Poppleton b
- A Deidealisation Semantics for KAOS Richard Banach
- A Multiply Hierarchical Automaton Semantics for the IWIM Coordination Model
- Filtering Retrenchments into Refinements Retrenchment is a weakening of model based refinement
- Reconciling Retrenchments and Refinements C. Jeske, R. Banach
- Retrenchment, and the Generation of Fault Trees for Static, Dynamic and Cyclic Systems
- Model Based Refinement and the Design of Retrenchments
- ournal of Programming Languages 5 , 1997, 201231
- Retrenchment: Extending the Reach of Refinement M.R. Poppleton y;z R.H. Banach z
- Under consideration for publication in Formal Aspects of Computing Atomic Actions, and their Refinements to
- Under consideration for publication in Formal Aspects of Computing The Mechanical Generation of Fault Trees
- Abstract Diagrams and an Opfibration Account of Typed Graph Transformation
- Reconciling Retrenchments and Refinements II Czeslaw Jeske, Richard Banach
- Retrenchment and the Mondex Electronic Purse (Extended Abstract)
- Journal of Programming Languages 5, 1997, 201--231 A study of two graph rewriting formalisms
- Engineering and Theoretical Underpinnings of Retrenchment
- Retrenchment and the B-Toolkit Richard Banach and Simon Fraser
- Under consideration for publication in Formal Aspects of Computing Atomic Actions, and their Refinements to
- MONSTR V --Transitive Coercing Semantics and the Church-Rosser Property
- Filtering Retrenchments into Refinements Retrenchment is a weakening of model based refinement
- Engineering and Theoretical Underpinnings of Retrenchment
- Model Based Refinement and the Design of Retrenchments
- 1 Reconciling Retrenchments and Refinements II: This document presents the proofs for the construction presented in Section 5 of Recon
- REFINE 2007 On the Refinement of Atomic Actions
- Under consideration for publication in Formal Aspects of Computing The Mechanical Generation of Fault Trees
- Under consideration for publication in Formal Aspects of Computing Retrenchment for EventB: UseCasewise
- DACTL REWRITING IS CATEGORICAL Computer Science Department, Manchester University,
- Safety Requirements and Fault Trees using Retrenchment
- Reconciling Retrenchments and Refinements II Czeslaw Jeske, Richard Banach
- Requirements Validation by Lifting Retrenchments in B Michael Poppleton
- mess:Read[ans] nxt] state] => *QMyCounter[self qhd curr state],
- A Fibration Semantics for Extended Term Graph
- Retrenchment and Refinement Interworking: the Tower Theorems
- Simple Feature Engineering via Neat Default Retrenchments
- Sharp Retrenchment, Modulated Refinement and Simulation
- Retrenchment and the Atomicity Pattern Richard Banach,
- Stronger Compositions for Retrenchments R. Banach, C. Jeske
- MONSTR II ---Suspending Semantics and Independence (Computer Science Dept., Manchester University, Manchester, M13 9PL, U.K.
- Retrenching the Purse: Finite Exception Logs, and Validating the Small Richard Banach,
- Expressing Runtime Structure and Synchronisation in Concurrent OO Languages with MONSTR
- Under consideration for publication in Formal Aspects of Computing Retrenchment for Event-B: UseCase-wise
- Fragmented Retrenchment, Concurrency and Fairness , M. Poppletona,b
- Model Based Refinement and the Tools of Tomorrow Richard Banach
- Consider a crude style rule basis that is concrete (no polymorphism) and complete (each type has a rule). Build the final type-graph , whose nodes are the concrete type symbols, and whose arcs are given by: for
- Guest Editorial: Formal Methods Richard Banach
- UseCasewise Development: Retrenchment for EventB Richard Banach
- malisms ([7,8]). A full translation gives the added benefit of allowing rigorous reasoning about all aspects of a language; eg. the way [6] gives an alternative perspective on process calculi.
- "!#%$'&(')0 21'325476859@6A&(CB6AB'DFEG$ 9@6A6AHPIRQSDTUVD
- Composition Mechanisms for Retrenchment , C. Jeskea
- Continuous Behaviour in EventB: A Sketch Richard Banach 1# , Huibiao Zhu 2## , Wen Su 2 , and Xiaofeng Wu 2
- ASM and Controller Synthesis Richard Banach 1# , Huibiao Zhu 2## , Wen Su 2 , and Xiaofeng Wu 2
- Continuous ASM, and a Pacemaker Sensing Fragment Richard Banach 1# , Huibiao Zhu 2## , Wen Su 2 , and Xiaofeng Wu 2
- ASM and Controller Synthesis Richard Banach1
- Continuous ASM, and a Pacemaker Sensing Fragment Richard Banach1
- Continuous Behaviour in Event-B: A Sketch Richard Banach1
