Formal methods: Practice and experience

J Woodcock, PG Larsen, J Bicarregui… - ACM computing surveys …, 2009 - dl.acm.org
Formal methods use mathematical models for analysis and verification at any part of the
program life-cycle. We describe the state of the art in the industrial use of formal methods …

New opportunities for integrated formal methods

M Gleirscher, S Foster, J Woodcock - ACM Computing Surveys (CSUR), 2019 - dl.acm.org
Formal methods have provided approaches for investigating software engineering
fundamentals and also have high potential to improve current practices in dependability …

Rodin: an open toolset for modelling and reasoning in Event-B

JR Abrial, M Butler, S Hallerstede, TS Hoang… - International journal on …, 2010 - Springer
Event-B is a formal method for system-level modelling and analysis. Key features of Event-B
are the use of set theory as a modelling notation, the use of refinement to represent systems …

Preliminary design of JML: A behavioral interface specification language for Java

GT Leavens, AL Baker, C Ruby - ACM SIGSOFT Software Engineering …, 2006 - dl.acm.org
JML is a behavioral interface specification language tailored to Java (TM). Besides pre-and
postconditions, it also allows assertions to be intermixed with Java code; these aid …

Forward and backward simulations

N Lynch, F Vaandrager - Information and Computation, 1995 - Elsevier
A unified, comprehensive presentation of simulation techniques for verification of concurrent
systems is given, in terms of a simple untimed automaton model. In particular,(1) …

[KNIHA][B] Data refinement: model-oriented proof methods and their comparison

WP De Roever, K Engelhardt - 1998 - books.google.com
The goal of this book is to provide a comprehensive and systematic introduction to the
important and highly applicable method of data refinement and the simulation methods used …

Refinement, decomposition, and instantiation of discrete models: Application to Event-B

JR Abrial, S Hallerstede - Fundamenta Informaticae, 2007 - content.iospress.com
We argue that formal modeling should be the starting point for any serious development of
computer systems. This claim poses a challenge for modeling: at first it must cope with the …

[KNIHA][B] Concurrency verification: Introduction to compositional and non-compositional methods

WP De Roever - 2001 - books.google.com
This is a systematic and comprehensive introduction both to compositional proof methods for
the state-based verification of concurrent programs, such as the assumption-commitment …

[KNIHA][B] Nets, terms and formulas: three views of concurrent processes and their relationship

ER Olderog - 1992 - dl.acm.org
Nets, terms and formulas | Guide books skip to main content ACM Digital Library home ACM
Association for Computing Machinery corporate logo Google, Inc. (search) Advanced Search …

Advanced weakest precondition calculi for probabilistic programs

BL Kaminski - 2019 - discovery.ucl.ac.uk
Wir studieren die quantitative Analyse probabilistischer Programme. Dabei untersuchen wir
vornehmlich zwei Aspekte: Die Analysetechniken selbst, sowie die komplexitäts-bzw …