 | 2012 |
| 23 |  | Jia Huang,
Jan Olaf Blech,
Andreas Raabe,
Christian Buckl,
Alois Knoll:
Static scheduling of a Time-Triggered Network-on-Chip based on SMT solving.
DATE 2012: 509-514 |
| 22 |  | Jan Olaf Blech,
Dongyue Mou,
Daniel Ratiu:
Reusing Test-Cases on Different Levels of Abstraction in a Model Based Development Tool
MBT 2012: 13-27 |
| 21 |  | Jan Olaf Blech:
On Compositional Reasoning for Guaranteeing Probabilistic Properties
CoRR abs/1203.0415: (2012) |
| 2011 |
| 20 |  | Jia Huang,
Jan Olaf Blech,
Andreas Raabe,
Christian Buckl,
Alois Knoll:
Analysis and optimization of fault-tolerant task scheduling on multiprocessor embedded systems.
CODES+ISSS 2011: 247-256 |
| 19 |  | Jia Huang,
Jan Olaf Blech,
Andreas Raabe,
Christian Buckl,
Alois Knoll:
Reliability-Aware Design Optimization for Multiprocessor Embedded Systems.
DSD 2011: 239-246 |
| 18 |  | Jan Olaf Blech:
Probabilistic Compositional Reasoning for Guaranteeing Fault Tolerance Properties.
OPODIS 2011: 222-234 |
| 17 |  | Jan Olaf Blech:
Proving the security of ElGamal encryption via indistinguishability logic.
SAC 2011: 1625-1632 |
| 16 |  | Jan Olaf Blech,
Sidi Ould Biha:
Verification of PLC Properties Based on Formal Semantics in Coq.
SEFM 2011: 58-73 |
| 15 |  | Jan Olaf Blech:
A Tool for the Certification of PLCs based on a Coq Semantics for Sequential Function Charts
CoRR abs/1102.3529: (2011) |
| 14 |  | Jan Olaf Blech,
Benoît Boyer,
Thanh-Hung Nguyen:
On the Simulation of Time-Triggered Systems on a Chip with BIP
CoRR abs/1109.5505: (2011) |
| 13 |  | Jan Olaf Blech,
Benjamin Grégoire:
Certifying compilers using higher-order theorem provers as certificate checkers.
Formal Methods in System Design 38(1): 33-61 (2011) |
| 2010 |
| 12 |  | Jan Olaf Blech,
Anton Hattendorf,
Jia Huang:
Towards a Property Preserving Transformation from IEC 61131-3 to BIP
CoRR abs/1009.0817: (2010) |
| 2009 |
| 11 |  | Jan Olaf Blech,
Michaël Périn:
Certifying deadlock-freedom for BIP models.
SCOPES 2009: 61-70 |
| 10 |  | Jan Olaf Blech:
Certifying system translations using higher order theorem provers.
University of Kaiserslautern 2009: 1-174 |
| 2007 |
| 9 |  | Jan Olaf Blech,
Ina Schaefer,
Arnd Poetzsch-Heffter:
Translation Validation of System Abstractions.
RV 2007: 139-150 |
| 8 |  | Sabine Glesner,
Johannes Leitner,
Jan Olaf Blech:
Coinductive Verification of Program Optimizations Using Similarity Relations.
Electr. Notes Theor. Comput. Sci. 176(3): 61-77 (2007) |
| 7 |  | Jan Olaf Blech,
Arnd Poetzsch-Heffter:
A Certifying Code Generation Phase.
Electr. Notes Theor. Comput. Sci. 190(4): 65-82 (2007) |
| 2005 |
| 6 |  | Jan Olaf Blech,
Lars Gesellensetter,
Sabine Glesner:
Formal Verification of Dead Code Elimination in Isabelle/HOL.
SEFM 2005: 200-209 |
| 5 |  | Sabine Glesner,
Jan Olaf Blech:
Logische und softwaretechnische Herausforderungen bei der Verifikation optimierender Compiler.
Software Engineering 2005: 131-140 |
| 4 |  | Jan Olaf Blech,
Sabine Glesner,
Johannes Leitner,
Steffen Mülling:
Optimizing Code Generation from SSA Form: A Comparison Between Two Formal Correctness Proofs in Isabelle/HOL.
Electr. Notes Theor. Comput. Sci. 141(2): 33-51 (2005) |
| 2004 |
| 3 |  | Sabine Glesner,
Jan Olaf Blech:
Coalgebraic Semantics for Component Systems.
Architecting Systems with Trustworthy Components 2004: 245-261 |
| 2 |  | Jan Olaf Blech,
Sabine Glesner:
A Formal Correctness Proof for Code Generation from SSA Form in Isabelle/HOL.
GI Jahrestagung (2) 2004: 449-458 |
| 2003 |
| 1 |  | Sabine Glesner,
Jan Olaf Blech:
Classifying and Formally Verifying Integer Constant Folding.
Electr. Notes Theor. Comput. Sci. 82(2): 410-425 (2003) |