Open AccessBook
Automated Technology for Verification and Analysis
Reads0
Chats0
TLDR
This poster presents a probabilistic procedure to characterize the response of the immune system to the presence of foreign substances such as cadmium, which is a natural component of infectious disease.Abstract:
ion Refinement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 Pei-Hsin Horead more
Citations
More filters
Journal ArticleDOI
Applying abstract acceleration to (co-)reachability analysis of reactive programs
Peter Schrammel,Bertrand Jeannet +1 more
TL;DR: This article extends the concept of abstract acceleration of Gonnord et al. to numerical input variables, describing the dual analysis for co-reachability and comparing some alternative techniques based on abstract interpretation pointing out its advantages and limitations.
Proceedings ArticleDOI
From hybrid data-flow languages to hybrid automata: a complete translation
Peter Schrammel,Bertrand Jeannet +1 more
TL;DR: In this paper, the authors describe a translation from a hybrid data-flow language to logico-numerical hybrid automata, and expose various zero-crossing semantics, propose a sound translation, and discuss to which extent the original semantics is preserved.
Book ChapterDOI
Compositional Verification of Input-Output Conformance via CSP Refinement Checking
TL;DR: The testing theory can be immediately extended to address deadlock, outputlock and livelock situations if a special output event is used to represent quiescence, and is formally established by showing that this broader view of cspio is equivalent to Tretmans' ioco relation.
Proceedings ArticleDOI
MutRex: A Mutation-Based Generator of Fault Detecting Strings for Regular Expressions
TL;DR: A fault-based approach for generating tests for regexes is proposed, identifying fault classes representing possible mistakes a user can make when writing a regex, and introducing the notion of distinguishing string, i.e., a string that is able to witness a fault.
Proceedings ArticleDOI
ABCD-L: approximating continuous linear systems using boolean models
TL;DR: It is demonstrated that ABCD-L can be applied in conjunction with Model Order Reduction (MOR) techniques, to Booleanize large LTI systems whose direct eigendecomposition may be computationally infeasible.
References
More filters
Book
The Z notation: a reference manual
TL;DR: Tutorial introduction background the Z language the mathematical tool-kit sequential systems syntax summary and how to use it to solve sequential systems problems.
Book
The Java Programming Language
TL;DR: The Java (TM)Programming Language, Second Edition, is the definitive resource for all serious Java programmers and lets you in on the rationale behind Java's design, direct from the language's creator, as well as the tradeoffs involved in using specific features.
Journal ArticleDOI
Eraser: a dynamic data race detector for multithreaded programs
TL;DR: A new tool, called Eraser, is described, for dynamically detecting data races in lock-based multithreaded programs, which uses binary rewriting techniques to monitor every shared-monory reference and verify that consistent locking behavior is observed.
Proceedings ArticleDOI
Eraser: a dynamic data race detector for multi-threaded programs
TL;DR: Eraser as mentioned in this paper uses binary rewriting techniques to monitor every shared memory reference and verify that consistent locking behavior is observed in lock-based multi-threaded programs, which can be used to detect data races.
Proceedings ArticleDOI
Extended static checking for Java
TL;DR: The Extended Static Checker for Java (ESC/Java) is introduced, an experimental compile-time program checker that finds common programming errors and provides programmers with a simple annotation language with which programmer design decisions can be expressed formally.