default search action
Electronic Communication of the European Association of Software Science and Technology, Volume 23
Volume 23: Automated Verification of Critical Systems 2009
- Markus Roggenbach:
Preface.
- Ulrich Berger:
Proofs-as-Programs in Computable Analysis. - Christoph Lüth:
User Interfaces for Theorem Provers: Necessary Nuisance or Unexplored Potential? - Reynald Affeldt, David Nowak, Kiyoshi Yamada:
Certifying Assembly with Formal Cryptographic Proofs: the Case of BBS. - Étienne André, Laurent Fribourg, Jeremy Sproston:
An Extension of the Inverse Method to Probabilistic Timed Automata. - Ulrich Berger, Sion Lloyd:
A coinductive approach to verified exact real number computation. - Loïc Besnard, Thierry Gautier, Matthieu Moy, Jean-Pierre Talpin, Kenneth Johnson, Florence Maraninchi:
Automatic translation of C/C++ parallel code into synchronous formalism using an SSA intermediate form. - Neil C. C. Brown:
Automatically Generating CSP Models for Communicating Haskell Processes. - Nathaniel Charlton, Bernhard Reus:
A decidable class of verification conditions for programs with higher order store. - Holger Gast, Julia Trieflinger:
High-level Proofs about Low-level Programs. - Michael Huth, Nir Piterman, Huaxin Wang:
A workbench for preprocessor design and evaluation: toward benchmarks for parity games. - Hristina Palikareva, Joël Ouaknine, Bill Roscoe:
Faster FDR Counterexample Generation Using SAT-Solving. - Julio C. Peralta, Thierry Gautier:
Towards SMV Model Checking of Signal (multi-clocked) Specifications. - Frank P. M. Stappers, Michel A. Reniers:
Verification of safety requirements for program code using data abstraction. - Beeta Vajar, Steve A. Schneider, Helen Treharne:
Mobile CSP||B.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.