Software model checking

R Jhala, R Majumdar - ACM Computing Surveys (CSUR), 2009 - dl.acm.org
Software model checking Page 1 21 Software Model Checking RANJIT JHALA University of
California, San Diego and RUPAK MAJUMDAR University of California, Los Angeles We survey …

Contracts for system design

A Benveniste, B Caillaud, D Nickovic… - … and Trends® in …, 2018 - nowpublishers.com
Recently, contract-based design has been proposed as an “orthogonal” approach that
complements system design methodologies proposed so far to cope with the complexity of …

Reactive modules

R Alur, TA Henzinger - Formal methods in system design, 1999 - Springer
We present a formal model for concurrent systems. The model represents synchronous and
asynchronous components in a uniform framework that supports compositional (assume …

Composing specifications

M Abadi, L Lamport - ACM Transactions on Programming Languages …, 1993 - dl.acm.org
A rigorous modular specification method requires a proof rule asserting that if each
component behaves correctly in isolation, then it behaves correctly in concert with other …

[图书][B] Robust composition: Towards a uni ed approach to access control and concurrency control

M Miller - 2006 - jscholarship.library.jhu.edu
When separately written programs are composed so that they may cooperate, they may
instead destructively interfere in unanticipated ways. These hazards limit the scale and …

Conjoining specifications

M Abadi, L Lamport - ACM Transactions on Programming Languages …, 1995 - dl.acm.org
We show how to specify components of concurrent systems. The specification of a system is
the conjunction of its components' specifications. Properties of the system are proved by …

[图书][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 …

You assume, we guarantee: Methodology and case studies

TA Henzinger, S Qadeer, SK Rajamani - … , BC, Canada, June 28–July 2 …, 1998 - Springer
Assume-guarantee reasoning has long been advertised as an important method for
decomposing proof obligations in system verification. Refinement mappings …

[图书][B] The theory of timed I/O automata

DK Kaynar - 2011 - books.google.com
This monograph presents the Timed Input/Output Automaton (TIOA) modeling framework, a
basic mathematical framework to support description and analysis of timed (computing) …

Proof rules for automated compositional verification through learning

H Barringer, D Giannakopoulou, CS Pasareanu - SAVBS 2003, 2003 - ntrs.nasa.gov
Compositional proof systems not only enable the stepwise development of concurrent
processes but also provide a basis to alleviate the state explosion problem associated with …