Published in: OASIcs, Volume 55, 16th International Workshop on Worst-Case Execution Time Analysis (WCET 2016)
Boris Dreyer, Christian Hochberger, Alexander Lange, Simon Wegener, and Alexander Weiss. Continuous Non-Intrusive Hybrid WCET Estimation Using Waypoint Graphs. In 16th International Workshop on Worst-Case Execution Time Analysis (WCET 2016). Open Access Series in Informatics (OASIcs), Volume 55, pp. 4:1-4:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{dreyer_et_al:OASIcs.WCET.2016.4, author = {Dreyer, Boris and Hochberger, Christian and Lange, Alexander and Wegener, Simon and Weiss, Alexander}, title = {{Continuous Non-Intrusive Hybrid WCET Estimation Using Waypoint Graphs}}, booktitle = {16th International Workshop on Worst-Case Execution Time Analysis (WCET 2016)}, pages = {4:1--4:11}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-025-5}, ISSN = {2190-6807}, year = {2016}, volume = {55}, editor = {Schoeberl, Martin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2016.4}, URN = {urn:nbn:de:0030-drops-68977}, doi = {10.4230/OASIcs.WCET.2016.4}, annote = {Keywords: Hybrid Worst-Case Execution Time (WCET) Estimation for Multicore Processors, Real-time Systems} }
Published in: OASIcs, Volume 47, 15th International Workshop on Worst-Case Execution Time Analysis (WCET 2015)
Boris Dreyer, Christian Hochberger, Simon Wegener, and Alexander Weiss. Precise Continuous Non-Intrusive Measurement-Based Execution Time Estimation. In 15th International Workshop on Worst-Case Execution Time Analysis (WCET 2015). Open Access Series in Informatics (OASIcs), Volume 47, pp. 45-54, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{dreyer_et_al:OASIcs.WCET.2015.45, author = {Dreyer, Boris and Hochberger, Christian and Wegener, Simon and Weiss, Alexander}, title = {{Precise Continuous Non-Intrusive Measurement-Based Execution Time Estimation}}, booktitle = {15th International Workshop on Worst-Case Execution Time Analysis (WCET 2015)}, pages = {45--54}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-95-8}, ISSN = {2190-6807}, year = {2015}, volume = {47}, editor = {Cazorla, Francisco J.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2015.45}, URN = {urn:nbn:de:0030-drops-52555}, doi = {10.4230/OASIcs.WCET.2015.45}, annote = {Keywords: Hybrid Worst-Case Execution Time (WCET) Estimation for Multicore Processors, Real-time Systems} }
Published in: Dagstuhl Seminar Proceedings, Volume 10271, Verification over discrete-continuous boundaries (2010)
Michael Brickenstein and Alexander Dreyer. Network-driven Boolean Normal Forms. In Verification over discrete-continuous boundaries. Dagstuhl Seminar Proceedings, Volume 10271, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{brickenstein_et_al:DagSemProc.10271.3, author = {Brickenstein, Michael and Dreyer, Alexander}, title = {{Network-driven Boolean Normal Forms}}, booktitle = {Verification over discrete-continuous boundaries}, pages = {1--8}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10271}, editor = {Bernd Becker and Luca Cardelli and Holger Hermanns and Sofiene Tahar}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10271.3}, URN = {urn:nbn:de:0030-drops-27894}, doi = {10.4230/DagSemProc.10271.3}, annote = {Keywords: Groebner, normal forms, Boolean polynomials, cryptanalysis, verification} }
Published in: Dagstuhl Seminar Proceedings, Volume 9461, Algorithms and Applications for Next Generation SAT Solvers (2010)
Markus Wedler, Evgeny Pavlenko, Alexander Dreyer, Frank Seelisch, Dominik Stoffel, Gert-Martin Greuel, and Wolfgang Kunz. Solving hard instances in QF-BV combining Boolean reasoning with computer algebra. In Algorithms and Applications for Next Generation SAT Solvers. Dagstuhl Seminar Proceedings, Volume 9461, pp. 1-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{wedler_et_al:DagSemProc.09461.4, author = {Wedler, Markus and Pavlenko, Evgeny and Dreyer, Alexander and Seelisch, Frank and Stoffel, Dominik and Greuel, Gert-Martin and Kunz, Wolfgang}, title = {{Solving hard instances in QF-BV combining Boolean reasoning with computer algebra}}, booktitle = {Algorithms and Applications for Next Generation SAT Solvers}, pages = {1--20}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {9461}, editor = {Bernd Becker and Valeria Bertacoo and Rolf Drechsler and Masahiro Fujita}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09461.4}, URN = {urn:nbn:de:0030-drops-25096}, doi = {10.4230/DagSemProc.09461.4}, annote = {Keywords: SAT modulo Theory, Quantifier Free logic over fixed sized bitvectors; Computer Algebra} }
Feedback for Dagstuhl Publishing