Sciweavers

103 search results - page 9 / 21
» Algebraic Methods for Interactive Proof Systems
Sort
View
ZUM
2000
Springer
107views Formal Methods» more  ZUM 2000»
13 years 11 months ago
How to Drive a B Machine
The B-Method is a state-based formal method that describes behaviour in terms of MACHINES whose states change under OPERATIONS. The process algebra CSP is an event-based formalism ...
Helen Treharne, Steve Schneider
FM
2006
Springer
153views Formal Methods» more  FM 2006»
13 years 11 months ago
Formal Methods and Cryptography
Security-critical systems are an important application area for formal methods. However, such systems often contain cryptographic subsystems. The natural definitions of these subsy...
Michael Backes, Birgit Pfitzmann, Michael Waidner
ISOLA
2010
Springer
13 years 6 months ago
Towards a Connector Algebra
Interoperability of heterogeneous networked systems has yet to reach the maturity required by ubiquitous computing due to the technology-dependent nature of solutions. The Connect ...
Marco Autili, Chris Chilton, Paola Inverardi, Mart...
ATVA
2008
Springer
139views Hardware» more  ATVA 2008»
13 years 9 months ago
Compositional Verification for Component-Based Systems and Application
We present a compositional method for the verification of component-based systems described in a subset of the BIP language encompassing multi-party interaction without data transf...
Saddek Bensalem, Marius Bozga, Joseph Sifakis, Tha...
CADE
2005
Springer
14 years 8 months ago
A Proof-Producing Decision Procedure for Real Arithmetic
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
Sean McLaughlin, John Harrison