Erika Abraham
Erika Abraham
Professor, Computer Science Department, RWTH Aachen University
Bestätigte E-Mail-Adresse bei cs.rwth-aachen.de
Titel
Zitiert von
Zitiert von
Jahr
The Scalasca performance toolset architecture
M Geimer, F Wolf, BJN Wylie, E Ábrahám, D Becker, B Mohr
Concurrency and Computation: Practice and Experience 22 (6), 702-719, 2010
5732010
Flow*: An analyzer for non-linear hybrid systems
X Chen, E Ábrahám, S Sankaranarayanan
International Conference on Computer Aided Verification, 258-263, 2013
4432013
Taylor model flowpipe construction for non-linear hybrid systems
X Chen, E Abraham, S Sankaranarayanan
2012 IEEE 33rd Real-Time Systems Symposium, 183-192, 2012
1982012
PROPhESY: A PRObabilistic ParamEter SYnthesis Tool
C Dehnert, S Junges, N Jansen, F Corzilius, M Volk, H Bruintjes, ...
International Conference on Computer Aided Verification, 214-231, 2015
1112015
Usage of the SCALASCA toolset for scalable performance analysis of large-scale parallel applications
F Wolf, BJN Wylie, E Abrahám, D Becker, W Frings, K Fürlinger, M Geimer, ...
Tools for High Performance Computing, 157-167, 2008
862008
Verification for Java’s reentrant multithreading concept
E Abrahám-Mumm, FS De Boer, WP de Roever, M Steffen
International Conference on Foundations of Software Science and Computation …, 2002
742002
SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving
F Corzilius, G Kremer, S Junges, S Schupp, E Ábrahám
International Conference on Theory and Applications of Satisfiability …, 2015
712015
Accelerating parametric probabilistic verification
N Jansen, F Corzilius, M Volk, R Wimmer, E Ábrahám, JP Katoen, ...
International Conference on Quantitative Evaluation of Systems, 404-420, 2014
562014
DTMC model checking by SCC reduction
E Abrahám, N Jansen, R Wimmer, JP Katoen, B Becker
2010 Seventh International Conference on the Quantitative Evaluation of …, 2010
502010
Verification of hybrid systems: Formalization and proof rules in PVS
E Ábrahám-Mumm, U Hannemann, M Steffen
Proceedings Seventh IEEE International Conference on Engineering of Complex …, 2001
492001
HyPro: A C++ Library of State Set Representations for Hybrid Systems Reachability Analysis
S Schupp, E Abraham, IB Makhlouf, S Kowalewski
NASA Formal Methods Symposium, 288-294, 2017
482017
Optimizing bounded model checking for linear hybrid systems
E Abrahám, B Becker, F Klaedtke, M Steffen
International Workshop on Verification, Model Checking, and Abstract …, 2005
482005
Behavioral interface description of an object-oriented language with futures and promises
E Ábrahám, I Grabe, A Grüner, M Steffen
The Journal of Logic and Algebraic Programming 78 (7), 491-518, 2009
462009
A greedy approach for the efficient repair of stochastic models
S Pathak, E Ábrahám, N Jansen, A Tacchella, JP Katoen
NASA Formal Methods Symposium, 295-309, 2015
452015
SMT-RAT: An SMT-compliant nonlinear real arithmetic toolbox
F Corzilius, U Loup, S Junges, E Ábrahám
International Conference on Theory and Applications of Satisfiability …, 2012
442012
A benchmark suite for hybrid systems reachability analysis
X Chen, S Schupp, IB Makhlouf, E Ábrahám, G Frehse, S Kowalewski
NASA Formal Methods Symposium, 408-414, 2015
432015
Building bridges between symbolic computation and satisfiability checking
E Ábrahám
Proceedings of the 2015 ACM on International Symposium on Symbolic and …, 2015
422015
Minimal critical subsystems for discrete-time Markov models
R Wimmer, N Jansen, E Ábrahám, B Becker, JP Katoen
International Conference on Tools and Algorithms for the Construction and …, 2012
412012
Linear relaxations of polynomial positivity for polynomial lyapunov function synthesis
MA Ben Sassi, S Sankaranarayanan, X Chen, E Ábrahám
IMA Journal of Mathematical Control and Information 33 (3), 723-756, 2016
402016
Counterexample generation for discrete-time Markov models: An introductory survey
E Ábrahám, B Becker, C Dehnert, N Jansen, JP Katoen, R Wimmer
International School on Formal Methods for the Design of Computer …, 2014
402014
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20