Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
26
click to vote
ICFEM
2000
Springer
favorite
Email
discuss
report
87
views
Software Engineering
»
more
ICFEM 2000
»
Maximally Abstract Retrenchments
14 years 2 months ago
Download
www.cs.man.ac.uk
Richard Banach
Real-time Traffic
ICFEM 2000
|
Software Engineering
|
claim paper
Related Content
»
Retrenchment and Punctured Simulation
»
Fragmented Retrenchment Concurrency and Fairness
»
Stronger compositions for retrenchments
»
Structuring Retrenchments in B by Decomposition
»
Composition mechanisms for retrenchment
»
Retrenchment Refinement and Simulation
»
Retrenching the Purse Finite Exception Logs and Validating the Small
»
Retrenching the Purse Finite Sequence Numbers and the Tower Pattern
»
Categoricity in abstract elementary classes with no maximal models
more »
Post Info
More Details (n/a)
Added
24 Aug 2010
Updated
24 Aug 2010
Type
Conference
Year
2000
Where
ICFEM
Authors
Richard Banach
Comments
(0)
Researcher Info
Software Engineering Study Group
Computer Vision