accurate icp based floating point reasoning
play

Accurate ICP-based Floating-Point Reasoning - PowerPoint PPT Presentation

Feb 22, 2024 •135 likes •871 views

Accurate ICP-based Floating-Point Reasoning Albert-Ludwigs-Universitt Freiburg Karsten Scheibler, Felix Neubauer, Ahmed Mahdi, Martin Frnzle, Tino Teige, Tom Bienmller, Detlef Fehrer, Bernd Becker Chair of Computer Architecture FMCAD

  1. Accurate ICP-based Floating-Point Reasoning Albert-Ludwigs-Universität Freiburg Karsten Scheibler, Felix Neubauer, Ahmed Mahdi, Martin Fränzle, Tino Teige, Tom Bienmüller, Detlef Fehrer, Bernd Becker Chair of Computer Architecture FMCAD 2016

  2. Context of this Work FMCAD 2016 Karsten Scheibler – Accurate ICP-based FP Reasoning 2 / 67

  3. Context of this Work (1) Cooperation with Industrypartners (AVACS Transfer Project 1): “Accurate Dead Code Detection in Embedded C Code by Arithmetic Constraint Solving” University of Oldenburg: BTC-ES (Oldenburg): Ahmed Mahdi Tino Teige Martin Fränzle Tom Bienmüller University of Freiburg: SICK (Waldkirch): Felix Neubauer Detlef Fehrer Karsten Scheibler Bernd Becker FMCAD 2016 Karsten Scheibler – Accurate ICP-based FP Reasoning 3 / 67

  4. Context of this Work (2) C SMI HYS BTC-Toolchain SMI2iSAT iSAT3 Scripts FMCAD 2016 Karsten Scheibler – Accurate ICP-based FP Reasoning 4 / 67

  5. Context of this Work (3) C SMI HYS BTC-Toolchain SMI2iSAT iSAT3 annotate with coverage goal cone of influence reduction Scripts resolve loops and functions flatten data types static single assignment form BMC problem FMCAD 2016 Karsten Scheibler – Accurate ICP-based FP Reasoning 5 / 67

  6. Context of this Work (4) C SMI HYS BTC-Toolchain SMI2iSAT iSAT3 This presentation: Scripts accurate reasoning for floating-point arithmetic support for bitwise integer operations FMCAD 2016 Karsten Scheibler – Accurate ICP-based FP Reasoning 6 / 67

  7. How does iSAT3 Work FMCAD 2016 Karsten Scheibler – Accurate ICP-based FP Reasoning 7 / 67

  8. iSAT3 = CDCL + ICP CDCL: conflict-driven clause learning ICP: interval constaint propagation FMCAD 2016 Karsten Scheibler – Accurate ICP-based FP Reasoning 8 / 67

  9. CDCL (1) CNF ( ¬ b ∨¬ h 1 ) ∧ ( c ∨¬ h 1 ) ∧ ( b ∨¬ c ∨ h 1 ) ∧ ( a ∨ h 1 ∨¬ h 2 ) ∧ ( a ∨¬ h 1 ∨ h 2 ) ∧ ( ¬ a ∨ h 1 ∨ h 2 ) ∧ ( ¬ a ∨¬ h 1 ∨¬ h 2 ) ∧ ( h 2 ) FMCAD 2016 Karsten Scheibler – Accurate ICP-based FP Reasoning 9 / 67

  10. CDCL (1) CNF ( ¬ b ∨¬ h 1 ) ∧ Tseitin- ( c ∨¬ h 1 ) ∧ Boolean Formula Transformation ( b ∨¬ c ∨ h 1 ) ∧ ( a ∨ h 1 ∨¬ h 2 ) ∧ ( a ⊕ ( ¬ b ∧ c )) ( h 1 ⇔ ( ¬ b ∧ c )) ( a ∨¬ h 1 ∨ h 2 ) ∧ ( h 2 ⇔ ( a ⊕ h 1 )) ( ¬ a ∨ h 1 ∨ h 2 ) ∧ ( ¬ a ∨¬ h 1 ∨¬ h 2 ) ∧ ( h 2 ) FMCAD 2016 Karsten Scheibler – Accurate ICP-based FP Reasoning 10 / 67

  11. CDCL (2) CNF ( ¬ b ∨¬ h 1 ) ∧ ( c ∨¬ h 1 ) ∧ ( b ∨¬ c ∨ h 1 ) ∧ ( a ∨ h 1 ∨¬ h 2 ) ∧ ( a ∨¬ h 1 ∨ h 2 ) ∧ ( ¬ a ∨ h 1 ∨ h 2 ) ∧ ( ¬ a ∨¬ h 1 ∨¬ h 2 ) ∧ ( h 2 ) FMCAD 2016 Karsten Scheibler – Accurate ICP-based FP Reasoning 11 / 67

  12. CDCL (3) CNF BCP ( ¬ b ∨¬ h 1 ) ∧ ( c ∨¬ h 1 ) ∧ ( b ∨¬ c ∨ h 1 ) ∧ ( a ∨ h 1 ∨¬ h 2 ) ∧ ( a ∨¬ h 1 ∨ h 2 ) ∧ ( ¬ a ∨ h 1 ∨ h 2 ) ∧ ( ¬ a ∨¬ h 1 ∨¬ h 2 ) ∧ ( h 2 ) FMCAD 2016 Karsten Scheibler – Accurate ICP-based FP Reasoning 12 / 67

  13. CDCL (4) CNF BCP ( ¬ b ∨¬ h 1 ) ∧ ( c ∨¬ h 1 ) ∧ no conflict ( b ∨¬ c ∨ h 1 ) ∧ ( a ∨ h 1 ∨¬ h 2 ) ∧ ( a ∨¬ h 1 ∨ h 2 ) ∧ ( ¬ a ∨ h 1 ∨ h 2 ) ∧ ( ¬ a ∨¬ h 1 ∨¬ h 2 ) ∧ ( h 2 ) FMCAD 2016 Karsten Scheibler – Accurate ICP-based FP Reasoning 13 / 67

  14. CDCL (4) CNF BCP ( ¬ b ∨¬ h 1 ) ∧ ( c ∨¬ h 1 ) ∧ no conflict ( b ∨¬ c ∨ h 1 ) ∧ ( a ∨ h 1 ∨¬ h 2 ) ∧ ( a ∨¬ h 1 ∨ h 2 ) ∧ ( ¬ a ∨ h 1 ∨ h 2 ) ∧ ( ¬ a ∨¬ h 1 ∨¬ h 2 ) ∧ Decision ( h 2 ) FMCAD 2016 Karsten Scheibler – Accurate ICP-based FP Reasoning 14 / 67

  15. CDCL (4) CNF BCP ( ¬ b ∨¬ h 1 ) ∧ ( c ∨¬ h 1 ) ∧ no conflict ( b ∨¬ c ∨ h 1 ) ∧ ( a ∨ h 1 ∨¬ h 2 ) ∧ ( a ∨¬ h 1 ∨ h 2 ) ∧ ( ¬ a ∨ h 1 ∨ h 2 ) ∧ ( ¬ a ∨¬ h 1 ∨¬ h 2 ) ∧ Decision ( h 2 ) (or SAT) FMCAD 2016 Karsten Scheibler – Accurate ICP-based FP Reasoning 15 / 67

  16. CDCL (5) CNF BCP ( ¬ b ∨¬ h 1 ) ∧ ( c ∨¬ h 1 ) ∧ no conflict conflict ( b ∨¬ c ∨ h 1 ) ∧ ( a ∨ h 1 ∨¬ h 2 ) ∧ ( a ∨¬ h 1 ∨ h 2 ) ∧ ( ¬ a ∨ h 1 ∨ h 2 ) ∧ ( ¬ a ∨¬ h 1 ∨¬ h 2 ) ∧ Decision ( h 2 ) (or SAT) FMCAD 2016 Karsten Scheibler – Accurate ICP-based FP Reasoning 16 / 67

  17. CDCL (5) CNF BCP ( ¬ b ∨¬ h 1 ) ∧ ( c ∨¬ h 1 ) ∧ no conflict conflict ( b ∨¬ c ∨ h 1 ) ∧ ( a ∨ h 1 ∨¬ h 2 ) ∧ ( a ∨¬ h 1 ∨ h 2 ) ∧ ( ¬ a ∨ h 1 ∨ h 2 ) ∧ ( ¬ a ∨¬ h 1 ∨¬ h 2 ) ∧ Decision Conflict Analysis ( h 2 ) (or SAT) and Backtrack FMCAD 2016 Karsten Scheibler – Accurate ICP-based FP Reasoning 17 / 67

  18. CDCL (5) CNF BCP ( ¬ b ∨¬ h 1 ) ∧ ( c ∨¬ h 1 ) ∧ no conflict conflict ( b ∨¬ c ∨ h 1 ) ∧ ( a ∨ h 1 ∨¬ h 2 ) ∧ ( a ∨¬ h 1 ∨ h 2 ) ∧ ( ¬ a ∨ h 1 ∨ h 2 ) ∧ ( ¬ a ∨¬ h 1 ∨¬ h 2 ) ∧ Decision Conflict Analysis ( h 2 ) (SAT) and Backtrack (or UNSAT) FMCAD 2016 Karsten Scheibler – Accurate ICP-based FP Reasoning 18 / 67

  19. iSAT3 (1) PC + MAP + CNF ( h 1 = y 2 ) ∧ ( h 2 = x + h 1 ) ∧ ( h 3 ⇔ ( h 2 < 5)) ∧ ( a ∨ h 3 ∨¬ h 4 ) ∧ ( a ∨¬ h 3 ∨ h 4 ) ∧ ( ¬ a ∨ h 3 ∨ h 4 ) ∧ ( ¬ a ∨¬ h 3 ∨¬ h 4 ) ∧ ( h 4 ) FMCAD 2016 Karsten Scheibler – Accurate ICP-based FP Reasoning 19 / 67

  20. iSAT3 (1) PC + MAP + CNF ( h 1 = y 2 ) ∧ SMT Formula Tseitin-like ( h 2 = x + h 1 ) ∧ Transformation ( h 3 ⇔ ( h 2 < 5)) ∧ ( a ⊕ ( x + y 2 < 5)) ( a ∨ h 3 ∨¬ h 4 ) ∧ ( h 1 = y 2 ) ( a ∨¬ h 3 ∨ h 4 ) ∧ linear and nonlinear real arithmetic ( h 2 = x + h 1 ) ( ¬ a ∨ h 3 ∨ h 4 ) ∧ with transcendental functions ( h 3 ⇔ ( h 2 < 5)) ( ¬ a ∨¬ h 3 ∨¬ h 4 ) ∧ ( h 4 ⇔ ( a ⊕ h 3 )) ( h 4 ) • maintain interval for every real- or integer-valued variable • PC: primitive constraints: ( h 1 = y 2 ), ( h 2 = x + h 1 ) • MAP: map literals to simple bounds: ( h 3 ⇔ ( h 2 < 5)) FMCAD 2016 Karsten Scheibler – Accurate ICP-based FP Reasoning 20 / 67

  21. iSAT3 (1) PC + MAP + CNF Assignment Variable Type Value ( h 1 = y 2 ) ∧ SMT Formula a bool false Tseitin-like ( h 2 = x + h 1 ) ∧ x real ... Transformation ( h 3 ⇔ ( h 2 < 5)) ∧ ( a ⊕ ( x + y 2 < 5)) y real ... ( a ∨ h 3 ∨¬ h 4 ) ∧ ( h 1 = y 2 ) h 1 real ... ( a ∨¬ h 3 ∨ h 4 ) ∧ linear and nonlinear real arithmetic ( h 2 = x + h 1 ) h 2 real h 3 ( ¬ a ∨ h 3 ∨ h 4 ) ∧ with transcendental functions ( h 3 ⇔ ( h 2 < 5)) h 3 bool true ( ¬ a ∨¬ h 3 ∨¬ h 4 ) ∧ ( h 4 ⇔ ( a ⊕ h 3 )) simple bound ( h 4 ) ( h 2 < 5) • maintain interval for every real- or integer-valued variable h 4 bool true • PC: primitive constraints: ( h 1 = y 2 ), ( h 2 = x + h 1 ) • MAP: map literals to simple bounds: ( h 3 ⇔ ( h 2 < 5)) FMCAD 2016 Karsten Scheibler – Accurate ICP-based FP Reasoning 21 / 67

  22. iSAT3 (2) PC + MAP + CNF ( h 1 = y 2 ) ∧ ( h 2 = x + h 1 ) ∧ ( h 3 ⇔ ( h 2 < 5)) ∧ ( a ∨ h 3 ∨¬ h 4 ) ∧ ( a ∨¬ h 3 ∨ h 4 ) ∧ ( ¬ a ∨ h 3 ∨ h 4 ) ∧ ( ¬ a ∨¬ h 3 ∨¬ h 4 ) ∧ ( h 4 ) FMCAD 2016 Karsten Scheibler – Accurate ICP-based FP Reasoning 22 / 67

  23. iSAT3 (3) PC + MAP + CNF BCP, ICP ( h 1 = y 2 ) ∧ ( h 2 = x + h 1 ) ∧ ( h 3 ⇔ ( h 2 < 5)) ∧ ( a ∨ h 3 ∨¬ h 4 ) ∧ ( a ∨¬ h 3 ∨ h 4 ) ∧ ( ¬ a ∨ h 3 ∨ h 4 ) ∧ ( ¬ a ∨¬ h 3 ∨¬ h 4 ) ∧ ( h 4 ) FMCAD 2016 Karsten Scheibler – Accurate ICP-based FP Reasoning 23 / 67

  24. iSAT3 (4) PC + MAP + CNF BCP, ICP ( h 1 = y 2 ) ∧ ( h 2 = x + h 1 ) ∧ no conflict ( h 3 ⇔ ( h 2 < 5)) ∧ ( a ∨ h 3 ∨¬ h 4 ) ∧ ( a ∨¬ h 3 ∨ h 4 ) ∧ ( ¬ a ∨ h 3 ∨ h 4 ) ∧ ( ¬ a ∨¬ h 3 ∨¬ h 4 ) ∧ Decision, ( h 4 ) Split (or SAT) FMCAD 2016 Karsten Scheibler – Accurate ICP-based FP Reasoning 24 / 67

  25. iSAT3 (5) PC + MAP + CNF BCP, ICP ( h 1 = y 2 ) ∧ ( h 2 = x + h 1 ) ∧ no conflict conflict ( h 3 ⇔ ( h 2 < 5)) ∧ ( a ∨ h 3 ∨¬ h 4 ) ∧ ( a ∨¬ h 3 ∨ h 4 ) ∧ ( ¬ a ∨ h 3 ∨ h 4 ) ∧ ( ¬ a ∨¬ h 3 ∨¬ h 4 ) ∧ Decision, Conflict Analysis ( h 4 ) Split and Backtrack (or SAT) (or UNSAT) FMCAD 2016 Karsten Scheibler – Accurate ICP-based FP Reasoning 25 / 67

  26. iSAT3 (6) SAT iSAT3 Deductions • BCP for clauses • BCP for clauses evaluate simple bound literals � implication clauses • ICP for PC � arithmetic clauses Decisions • decide literals • decide literals • generate new simple bound literals and decide them Conflict Analyses • traverse implication • traverse implication graph (1UIP) graph (1UIP) � conflict clauses � conflict clauses FMCAD 2016 Karsten Scheibler – Accurate ICP-based FP Reasoning 26 / 67

  27. iSAT3 (6) SAT iSAT3 Deductions • BCP for clauses • BCP for clauses evaluate simple bound literals � implication clauses • ICP for PC � arithmetic clauses Decisions • decide literals • decide literals • generate new simple bound literals and decide them Conflict Analyses • traverse implication • traverse implication graph (1UIP) graph (1UIP) � conflict clauses � conflict clauses FMCAD 2016 Karsten Scheibler – Accurate ICP-based FP Reasoning 27 / 67

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

ACCURATE FLOATING-POINT SUMMATION IN CUB URI VERNER Summer intern OUTLINE Who needs accurate

ACCURATE FLOATING-POINT SUMMATION IN CUB URI VERNER Summer intern OUTLINE Who needs accurate

ACCURATE FLOATING-POINT SUMMATION IN CUB URI VERNER Summer intern OUTLINE Who needs accurate floating-point summation? ! Round-off error: source and recovery A new method for accurate FP summation on a GPU Added as a function to the open-source

619 views • 28 slides
Lecture 3 Floating Point Representations 1 Floating-point arithmetic We often incur

Lecture 3 Floating Point Representations 1 Floating-point arithmetic We often incur

ECE 0142 Computer Organization Lecture 3 Floating Point Representations 1 Floating-point arithmetic We often incur floating-point programming. Floating point greatly simplifies working with large (e.g., 2 70 ) and small (e.g., 2 -17 )

638 views • 30 slides
Accurate Complex Multiplication in Floating-Point Arithmetic Vincent Lefvre Jean-Michel

Accurate Complex Multiplication in Floating-Point Arithmetic Vincent Lefvre Jean-Michel

Accurate Complex Multiplication in Floating-Point Arithmetic Vincent Lefvre Jean-Michel Muller. Universit de Lyon, CNRS, Inria, France. Arith26, Kyoto, June 2019 1 Accurate complex multiplication in FP arithmetic x , emphasis

401 views • 26 slides
Reasoning about floating-point arithmetic with ACDCL Unifying Abstract Interpretation and

Reasoning about floating-point arithmetic with ACDCL Unifying Abstract Interpretation and

Reasoning about floating-point arithmetic with ACDCL Unifying Abstract Interpretation and Decision Procedures Daniel Kroening (joint work with Leopold Haller, Vijay DSilva, Michael Tautschnig, Martin Brain) 9 January 2013 1 Thursday, 17

775 views • 66 slides
Floating-point numbers Fractional binary numbers IEEE floating-point standard Floating-point

Floating-point numbers Fractional binary numbers IEEE floating-point standard Floating-point

Floating-point numbers Fractional binary numbers IEEE floating-point standard Floating-point operations and rounding Lessons for programmers Many more details we will skip (its a 58-page standard) See CSAPP 2.4 for more detail. 1

381 views • 15 slides
Towards SMT-Style Reasoning about Floating-Point Arithmetic Aleksandar Zelji c Uppsala

Towards SMT-Style Reasoning about Floating-Point Arithmetic Aleksandar Zelji c Uppsala

Towards SMT-Style Reasoning about Floating-Point Arithmetic Aleksandar Zelji c Uppsala University Philipp Rmmer Christoph Wintersteiger Uppsala University MSR Cambridge Workshop Progress in Decision Procedures Belgrade March 30 th 2013

546 views • 9 slides
15-213 The course that gives CMU its Zip! Floating Point Sept 6, 2006 Topics Topics

15-213 The course that gives CMU its Zip! Floating Point Sept 6, 2006 Topics Topics

15-213 The course that gives CMU its Zip! Floating Point Sept 6, 2006 Topics Topics IEEE Floating Point Standard Rounding Floating Point Operations Mathematical properties class03.ppt 15-213, F06 Floating Point

1.03k views • 34 slides
Exploiting Community Structure for Floating-Point Precision Tuning Hui Guo Cindy Rubio-Gonzlez

Exploiting Community Structure for Floating-Point Precision Tuning Hui Guo Cindy Rubio-Gonzlez

Exploiting Community Structure for Floating-Point Precision Tuning Hui Guo Cindy Rubio-Gonzlez ISSTA18 Amsterdam, Netherlands, July 2018 Background Floating-point (FP) arithmetic used in many domains Reasoning about FP programs

573 views • 26 slides
Floating point Today ! IEEE Floating Point Standard ! Rounding ! Floating Point Operations !

Floating point Today ! IEEE Floating Point Standard ! Rounding ! Floating Point Operations !

Floating point Today ! IEEE Floating Point Standard ! Rounding ! Floating Point Operations ! Mathematical properties Next time ! The machine model Chris Riesbeck, Fall 2011 Monday, October 3, 2011 Checkpoint Monday, October 3, 2011 IEEE

1.07k views • 28 slides
2/10/2020 Today: Floating Point Background: Fractional binary numbers IEEE floating point

2/10/2020 Today: Floating Point Background: Fractional binary numbers IEEE floating point

2/10/2020 Today: Floating Point Background: Fractional binary numbers IEEE floating point standard: Definition Floating Point Example and properties Rounding, addition, multiplication CSci 2021: Machine Architecture and

411 views • 7 slides
9/20/2018 Today: Floating Point Background: Fractional binary numbers IEEE floating point

9/20/2018 Today: Floating Point Background: Fractional binary numbers IEEE floating point

9/20/2018 Today: Floating Point Background: Fractional binary numbers IEEE floating point standard: Definition Floating Point Example and properties Rounding, addition, multiplication CSci 2021: Machine Architecture and

339 views • 7 slides
CS 356 Unit 3 IEEE 754 Floating Point Representation 3.2 Floating Point Used to represent

CS 356 Unit 3 IEEE 754 Floating Point Representation 3.2 Floating Point Used to represent

3.1 CS 356 Unit 3 IEEE 754 Floating Point Representation 3.2 Floating Point Used to represent very small numbers (fractions) and very large numbers Avogadros Number: +6.0247 * 10 23 Plancks Constant: +6.6254 * 10 -27

789 views • 33 slides
Machine numbers: how floating point numbers are stored? Floating-point number representation

Machine numbers: how floating point numbers are stored? Floating-point number representation

Machine numbers: how floating point numbers are stored? Floating-point number representation What do we need to store when representing floating point numbers in a computer? ! = 1. &amp; 2 ! Initially, different floating-point

379 views • 18 slides
Floating point How arithmetic operations mathematics involving floating point numbers

Floating point How arithmetic operations mathematics involving floating point numbers

Numerical and Scientific Computing with Applications David F . Gleich CS 314, Purdue September 7, 2016 In this class: Floating point How arithmetic operations mathematics involving floating point numbers work. Next class IEEE

812 views • 11 slides
Unit 3 IEEE 754 Floating Point Representation 3.2 Floating Point Used to represent very

Unit 3 IEEE 754 Floating Point Representation 3.2 Floating Point Used to represent very

3.1 Unit 3 IEEE 754 Floating Point Representation 3.2 Floating Point Used to represent very small numbers (fractions) and very large numbers Avogadros Number: +6.022 10 23 Boltzmanns Constant: +1.38 10 -23 32 or

1.13k views • 38 slides
Floating Point Data CSCI 125 &amp; 161 / ENGR 144 Floating point numbers are not exact

Floating Point Data CSCI 125 &amp; 161 / ENGR 144 Floating point numbers are not exact

Floating Point Data CSCI 125 &amp; 161 / ENGR 144 Floating point numbers are not exact Value 0.1 is very close to 1/10, but not Lecture 13 precisely equal to it 0.1 10 = 0.000110011001100110011... 2 Cannot rely on accuracy of

313 views • 3 slides
Peer-to-Peer Networks 10 Fast Download Christian Schindelhauer Technical Faculty

Peer-to-Peer Networks 10 Fast Download Christian Schindelhauer Technical Faculty

Peer-to-Peer Networks 10 Fast Download Christian Schindelhauer Technical Faculty Computer-Networks and Telematics University of Freiburg IP Multicast Motivation - Transmission of a data stream to many receivers Unicast - For each

389 views • 24 slides
Publish your SKOS vocabulary with Skosmos Osma Suominen and Henri Ylikotila SWIB14, Bonn,

Publish your SKOS vocabulary with Skosmos Osma Suominen and Henri Ylikotila SWIB14, Bonn,

Publish your SKOS vocabulary with Skosmos Osma Suominen and Henri Ylikotila SWIB14, Bonn, December 3, 2014 How do you put a thesaurus * on the web? * or any KOS: classification, authority file, term list, lightweight ontology... LCSH MeSH STW

760 views • 34 slides
Transfer Learning for Improving Model Predictions in Highly Configurable Software Pooyan

Transfer Learning for Improving Model Predictions in Highly Configurable Software Pooyan

Transfer Learning for Improving Model Predictions in Highly Configurable Software Pooyan Jamshidi, Miguel Velez , Christian Kstner, Norbert Siegmund, Prasad Kawthekar Highly Configurable Systems In Dynamic Environments [Credit to CMU

911 views • 60 slides
FINITE STATE MORPHOLOGY 24.05.19 Statistical Natural Language Processing 1 Morphology with FSAs

FINITE STATE MORPHOLOGY 24.05.19 Statistical Natural Language Processing 1 Morphology with FSAs

Jurafsky, D. and Martin, J. H. (2009): Speech and Language Processing. An Introduction to Natural Language Processing, Computational Linguistics and Speech Recognition . Second Edition. Pearson: New Jersey: Chapter 3 Transducers, Compact

902 views • 39 slides
Informatik I Course at BAUG department of ETH Z urich 1. Introduction Hermann Lehner, Felix

Informatik I Course at BAUG department of ETH Z urich 1. Introduction Hermann Lehner, Felix

Informatik I Course at BAUG department of ETH Z urich 1. Introduction Hermann Lehner, Felix Friedrich Welcome to the Lecture Series! ETH Z urich HS 2018 1 2 Material The Team Lecturers Hermann Lehner Felix Friedrich Chief

419 views • 21 slides
Reexamination of the theoretical basis of Tolmans law Martin Horsch, 1, 2 Jadran Vrabec, 3

Reexamination of the theoretical basis of Tolmans law Martin Horsch, 1, 2 Jadran Vrabec, 3

Reexamination of the theoretical basis of Tolmans law Martin Horsch, 1, 2 Jadran Vrabec, 3 Stefan Becker, 1 Felix Diewald, 1 Michaela Heier, 1 Geoge Jackson, 3 Jayant Singh, 2 Ralf Mller, 1 Hans Hasse 1 1 University of Kaiserslautern, Germany,

440 views • 14 slides
SCALASCA: Sc alable performance a nalysis of la rge- sc ale parallel a pplications Brian J. N.

SCALASCA: Sc alable performance a nalysis of la rge- sc ale parallel a pplications Brian J. N.

SCALASCA: Sc alable performance a nalysis of la rge- sc ale parallel a pplications Brian J. N. Wylie John von Neumann Institute for Computing Forschungszentrum Jlich B.Wylie@fz-juelich.de Outline KOJAK automated event tracing &amp;

889 views • 40 slides
Using Dynatrace Monitoring Data for Generating Performance Models of Java EE Applications Tool

Using Dynatrace Monitoring Data for Generating Performance Models of Java EE Applications Tool

Austin, TX, USA, 2015-02-02 Using Dynatrace Monitoring Data for Generating Performance Models of Java EE Applications Tool Paper International Conference on Performance Engineering (ICPE) 2015 Felix Willnecker 1 , Andreas Brunnert 1 , Wolfgang

211 views • 8 slides

More recommend