compositional shape analysis by means of bi abduction
play

Compositional Shape Analysis by means of Bi-Abduction Dino - PowerPoint PPT Presentation

Dec 25, 2022 •184 likes •1.53k views

Compositional Shape Analysis by means of Bi-Abduction Dino Distefano Queen Mary University of London and Monoidics Ltd MOVEP 2010, Aachen 29/06/2010 Monday, 28 June 2010 A lot of real code out there uses pointer manipulation... Is this

  1. Semantics of Assertions → ( s, h ) | = P s, h | = E �→ F h ) = { [ ] s } and h ([ iffdom( [ E ] [ E ] ] s ) = [ [ F ] ] s s, h | h ) = ∅ = emp iffdom( s, h | = P ∗ Q iff ∃ h 0 , h 1 . dom( h 0 ) ∩ dom( h 1 ) = ∅ and h 0 · h 1 = h and s, h 0 | = P and s, h 1 | = Q s, h | = P ∧ Q s, h | = P and s, h | = Q i ff where meaning of expressions [ [ E ] ] : Stacks → Vals Monday, 28 June 2010

  2. Example x y Stack x Heap y 3 3 y y+1 x x+1 Abbreviation: E points to a record of several fields: E �→ E 1 , . . . , E n � E �→ E 1 ∗ · · · ∗ E + n − 1 �→ E n Monday, 28 June 2010

  3. Example x �→ 3 , y x y Stack x Heap y 3 3 y y+1 x x+1 Abbreviation: E points to a record of several fields: E �→ E 1 , . . . , E n � E �→ E 1 ∗ · · · ∗ E + n − 1 �→ E n Monday, 28 June 2010

  4. Example x �→ 3 , y x y Stack x Heap y 3 3 y y+1 x x+1 Abbreviation: E points to a record of several fields: E �→ E 1 , . . . , E n � E �→ E 1 ∗ · · · ∗ E + n − 1 �→ E n Monday, 28 June 2010

  5. Example x �→ 3 , y x y y �→ 3 , x Stack x Heap y 3 3 y y+1 x x+1 Abbreviation: E points to a record of several fields: E �→ E 1 , . . . , E n � E �→ E 1 ∗ · · · ∗ E + n − 1 �→ E n Monday, 28 June 2010

  6. Example x �→ 3 , y x y y �→ 3 , x Stack x Heap y 3 3 y y+1 x x+1 Abbreviation: E points to a record of several fields: E �→ E 1 , . . . , E n � E �→ E 1 ∗ · · · ∗ E + n − 1 �→ E n Monday, 28 June 2010

  7. Example x �→ 3 , y x y y �→ 3 , x Stack x �→ 3 , y ∗ y �→ 3 , x x Heap y 3 3 y y+1 x x+1 Abbreviation: E points to a record of several fields: E �→ E 1 , . . . , E n � E �→ E 1 ∗ · · · ∗ E + n − 1 �→ E n Monday, 28 June 2010

  8. Example x �→ 3 , y x y y �→ 3 , x Stack x �→ 3 , y ∗ y �→ 3 , x x Heap y 3 3 y y+1 x x+1 Abbreviation: E points to a record of several fields: E �→ E 1 , . . . , E n � E �→ E 1 ∗ · · · ∗ E + n − 1 �→ E n Monday, 28 June 2010

  9. Example x �→ 3 , y x y y �→ 3 , x Stack x �→ 3 , y ∗ y �→ 3 , x x Heap y 3 x �→ 3 , y ∧ y �→ 3 , x 3 y y+1 x x+1 Abbreviation: E points to a record of several fields: E �→ E 1 , . . . , E n � E �→ E 1 ∗ · · · ∗ E + n − 1 �→ E n Monday, 28 June 2010

  10. Example x �→ 3 , y x y y �→ 3 , x Stack x �→ 3 , y ∗ y �→ 3 , x x Heap 3 x �→ 3 , y ∧ y �→ 3 , x 3 y y+1 x x+1 Abbreviation: E points to a record of several fields: E �→ E 1 , . . . , E n � E �→ E 1 ∗ · · · ∗ E + n − 1 �→ E n Monday, 28 June 2010

  11. An inconsistency What’ s wrong with the following formula? 10|->3 * 10|->3 Monday, 28 June 2010

  12. An inconsistency What’ s wrong with the following formula? 10|->3 * 10|->3 Try to be in two places at the same time 10 10 Monday, 28 June 2010

  13. ...back to the real stuff: Compositional Shape Analysis by means of Bi-Abduction Monday, 28 June 2010

  14. Literature C. Calcagno, D. Distefano, P . O’Hearn and H. Yang. Compositional Shape Analysis by Means of Bi- Abduction. POPL 2009. D. Distefano. Attacking Large Industrial Code with Bi-Abductive Inference. FMICS 2009 Monday, 28 June 2010

  15. A lot of real code out there uses pointer manipulation... Is this correct? Or at least: does it basic properties like it won’t crash or leak memory? We want to build tool that automatically answer such questions Monday, 28 June 2010

  16. Space Invader analyzer: overview Shape analyses discover deep properties about the heap: e.g., a variable points to a cyclic/acyclic doubly linked list,... Space Invader is Inter-procedural shape analysis for C programs Based on Separation Logic and Abstract interpretation to infer invariants Builds proofs or reports possible memory faults or memory leaks Monday, 28 June 2010

  17. Shape Analysis and Real Code So far shape analysis mostly applied to toy programs Monday, 28 June 2010

  18. Shape Analysis and Real Code So far shape analysis mostly applied to toy programs analysis running months/weeks/days days/hours/min. push button get results Monday, 28 June 2010

  19. Shape Analysis and Real Code So far shape analysis mostly applied to toy programs change code, analysis running write model, etc . months/weeks/days days/hours/min. get code push button get results Monday, 28 June 2010

  20. Fiction: “no worries, device drivers use moslty lists” Monday, 28 June 2010

  21. typedef struct ASYNC_ADDRESS_DATA { struct ASYNC_ADDRESS_DATA* Flink1; typedef struct { struct ASYNC_ADDRESS_DATA* Blink1; PDEVICE_OBJECT StackDeviceObject; _PDEVICE_EXTENSION DeviceExtension; PDEVICE_OBJECT PortDeviceObject; PVOID Buffer; PDEVICE_OBJECT PhysicalDeviceObject; ULONG nLength; ULONG nAddressesReturned; UNICODE_STRING SymbolicLinkName; PADDRESS_RANGE AddressRange; KSPIN_LOCK ResetSpinLock; HANDLE hAddressRange; KSPIN_LOCK CromSpinLock; PMDL pMdl; KSPIN_LOCK AsyncSpinLock; } ASYNC_ADDRESS_DATA, *PASYNC_ADDRESS_DATA; KSPIN_LOCK IsochSpinLock; KSPIN_LOCK IsochResourceSpinLock; typedef struct BUS_RESET_IRP { struct BUS_RESET_IRP *Flink2; struct BUS_RESET_IRP *Blink2; BOOLEAN bShutdown; PIRP Irp; DEVICE_POWER_STATE CurrentDevicePowerState; } BUS_RESET_IRP, *PBUS_RESET_IRP; SYSTEM_POWER_STATE CurrentSystemPowerState; typedef struct CROM_DATA { ULONG GenerationCount; struct CROM_DATA *Flink3; PASYNC_ADDRESS_DATA Flink1; struct CROM_DATA *Blink3; PASYNC_ADDRESS_DATA Blink1; HANDLE hCromData; PBUS_RESET_IRP Flink2; PVOID Buffer; PBUS_RESET_IRP Blink2; PMDL pMdl; PCROM_DATA Flink3; } CROM_DATA, *PCROM_DATA; PCROM_DATA Blink3; _PISOCH_DETACH_DATA Flink4; typedef struct ISOCH_RESOURCE_DATA { _PISOCH_DETACH_DATA Blink4; struct ISOCH_RESOURCE_DATA *Flink5; PISOCH_RESOURCE_DATA Flink5; struct ISOCH_RESOURCE_DATA *Blink5; PISOCH_RESOURCE_DATA Blink5; HANDLE hResource; } DEVICE_EXTENSION, *PDEVICE_EXTENSION; } ISOCH_RESOURCE_DATA, *PISOCH_RESOURCE_DATA; Monday, 28 June 2010

  22. typedef struct ASYNC_ADDRESS_DATA { struct ASYNC_ADDRESS_DATA* Flink1; typedef struct { struct ASYNC_ADDRESS_DATA* Blink1; PDEVICE_OBJECT StackDeviceObject; _PDEVICE_EXTENSION DeviceExtension; PDEVICE_OBJECT PortDeviceObject; PVOID Buffer; PDEVICE_OBJECT PhysicalDeviceObject; around 600 loc struct definitions ULONG nLength; ULONG nAddressesReturned; UNICODE_STRING SymbolicLinkName; PADDRESS_RANGE AddressRange; KSPIN_LOCK ResetSpinLock; HANDLE hAddressRange; KSPIN_LOCK CromSpinLock; PMDL pMdl; KSPIN_LOCK AsyncSpinLock; } ASYNC_ADDRESS_DATA, *PASYNC_ADDRESS_DATA; KSPIN_LOCK IsochSpinLock; KSPIN_LOCK IsochResourceSpinLock; typedef struct BUS_RESET_IRP { struct BUS_RESET_IRP *Flink2; struct BUS_RESET_IRP *Blink2; BOOLEAN bShutdown; PIRP Irp; DEVICE_POWER_STATE CurrentDevicePowerState; } BUS_RESET_IRP, *PBUS_RESET_IRP; SYSTEM_POWER_STATE CurrentSystemPowerState; typedef struct CROM_DATA { ULONG GenerationCount; struct CROM_DATA *Flink3; PASYNC_ADDRESS_DATA Flink1; struct CROM_DATA *Blink3; PASYNC_ADDRESS_DATA Blink1; HANDLE hCromData; PBUS_RESET_IRP Flink2; PVOID Buffer; PBUS_RESET_IRP Blink2; PMDL pMdl; PCROM_DATA Flink3; } CROM_DATA, *PCROM_DATA; PCROM_DATA Blink3; _PISOCH_DETACH_DATA Flink4; typedef struct ISOCH_RESOURCE_DATA { _PISOCH_DETACH_DATA Blink4; struct ISOCH_RESOURCE_DATA *Flink5; PISOCH_RESOURCE_DATA Flink5; struct ISOCH_RESOURCE_DATA *Blink5; PISOCH_RESOURCE_DATA Blink5; HANDLE hResource; } DEVICE_EXTENSION, *PDEVICE_EXTENSION; } ISOCH_RESOURCE_DATA, *PISOCH_RESOURCE_DATA; Monday, 28 June 2010

  23. typedef struct ASYNC_ADDRESS_DATA { struct ASYNC_ADDRESS_DATA* Flink1; typedef struct { struct ASYNC_ADDRESS_DATA* Blink1; PDEVICE_OBJECT StackDeviceObject; _PDEVICE_EXTENSION DeviceExtension; PDEVICE_OBJECT PortDeviceObject; PVOID Buffer; PDEVICE_OBJECT PhysicalDeviceObject; around 600 loc struct definitions ULONG nLength; ULONG nAddressesReturned; UNICODE_STRING SymbolicLinkName; PADDRESS_RANGE AddressRange; KSPIN_LOCK ResetSpinLock; HANDLE hAddressRange; KSPIN_LOCK CromSpinLock; PMDL pMdl; KSPIN_LOCK AsyncSpinLock; } ASYNC_ADDRESS_DATA, *PASYNC_ADDRESS_DATA; KSPIN_LOCK IsochSpinLock; KSPIN_LOCK IsochResourceSpinLock; many big structs (around 20 fields) mutually typedef struct BUS_RESET_IRP { struct BUS_RESET_IRP *Flink2; struct BUS_RESET_IRP *Blink2; BOOLEAN bShutdown; pointing to aeach other in several way with PIRP Irp; DEVICE_POWER_STATE CurrentDevicePowerState; } BUS_RESET_IRP, *PBUS_RESET_IRP; SYSTEM_POWER_STATE CurrentSystemPowerState; several fields typedef struct CROM_DATA { ULONG GenerationCount; struct CROM_DATA *Flink3; PASYNC_ADDRESS_DATA Flink1; struct CROM_DATA *Blink3; PASYNC_ADDRESS_DATA Blink1; HANDLE hCromData; PBUS_RESET_IRP Flink2; PVOID Buffer; PBUS_RESET_IRP Blink2; PMDL pMdl; PCROM_DATA Flink3; } CROM_DATA, *PCROM_DATA; PCROM_DATA Blink3; _PISOCH_DETACH_DATA Flink4; typedef struct ISOCH_RESOURCE_DATA { _PISOCH_DETACH_DATA Blink4; struct ISOCH_RESOURCE_DATA *Flink5; PISOCH_RESOURCE_DATA Flink5; struct ISOCH_RESOURCE_DATA *Blink5; PISOCH_RESOURCE_DATA Blink5; HANDLE hResource; } DEVICE_EXTENSION, *PDEVICE_EXTENSION; } ISOCH_RESOURCE_DATA, *PISOCH_RESOURCE_DATA; Monday, 28 June 2010

  24. AsynchAddressData_Flink DeviceExtension DeviceExtension DeviceExtension AsynchAddressData_Blink ASYNCH_ADDRESS_DATA ASYNCH_ADDRESS_DATA ASYNCH_ADDRESS_DATA pMdl pMdl pMdl MDL MDL NULL MDL MDL MDL NULL NULL BusResetIrp_Flink DEVICE_E XTENSION BUS_RESET_IRPS BUS_RESET_IRPS BUS_RESET_IRPS BUS_RESET_IRPS BusResetIrp_Blink IsochDetachData_Blink IsochDetachData_Flink DeviceExtension DeviceExtension DeviceExtension ISOCH_DETACH_DATA ISOCH_DETACH_DATA ISOCH_DETACH_DATA DeviceExtension IsochDetachData_Mdl IsochDetachData_Mdl IsochDetachData_Mdl DEVICE_OBJECT NULL MDL MDL MDL MDL MDL MDL NULL NULL devObj Monday, 28 June 2010

  25. Fact: Real device drivers use lists in combination, resulting in more complicated data structures than those found in previous papers on shape analysis Monday, 28 June 2010

  26. Shape Analysis and Real Code Monday, 28 June 2010

  27. Shape Analysis and Real Code change code, write model, etc . analysis running months/weeks/days days/hours/min. get code push button get results Monday, 28 June 2010

  28. Shape Analysis and Real Code change code, write model, etc . analysis running months/weeks/days days/hours/min. get code push button get results Need to handle incomplete code Monday, 28 June 2010

  29. Shape Analysis and Real Code Need very high modularity change code, write model, etc . analysis running months/weeks/days days/hours/min. get code push button get results Need to handle incomplete code Monday, 28 June 2010

  30. Shape Analysis and Real Code Need very high Start with something modularity partial change code, write model, etc . analysis running months/weeks/days days/hours/min. get code push button get results Need to handle incomplete code Monday, 28 June 2010

  31. Our response: compositional Space Invader ✓ Handles incomplete code ✓ Admits partial results ✓ Modular Monday, 28 June 2010

  32. Our response: compositional Space Invader ✓ Handles incomplete code ✓ Admits partial results ✓ Modular ...demo! Monday, 28 June 2010

  33. Basics Monday, 28 June 2010

  34. Notation Separation Logic’s formulae to represent program states Some useful predicates: The empty heap: emp An allocated cell: E �→ F A “complete” list: list ( E ) P*Q means P and Q hold for disjoint portion of memory Monday, 28 June 2010

  35. Notation Separation Logic’s formulae to represent program states Some useful predicates: The empty heap: emp nil E An allocated cell: E �→ F A “complete” list: list ( E ) P*Q means P and Q hold for disjoint portion of memory Monday, 28 June 2010

  36. Notation Separation Logic’s formulae to represent program states Some useful predicates: The empty heap: emp An allocated cell: E �→ F A “complete” list: list ( E ) P*Q means P and Q hold for disjoint portion of memory Monday, 28 June 2010

  37. Small specs Small specs encourage local reasoning and help to get small proofs When proving code involving procedures we use only their footprint Monday, 28 June 2010

  38. Example: use of small specs in proofs {list(l1)*list(l2)} Dispose(l1); Dispose(l2); Spec: {list(l)} Dispose(l) {emp} {P} C {Q} Frame Rule {P*R} C {Q*R} Monday, 28 June 2010

  39. Example: use of small specs in proofs {list(l1)*list(l2)} Dispose(l1); Dispose(l2); Spec: {list(l)} Dispose(l) {emp} {P} C {Q} Frame Rule {P*R} C {Q*R} Monday, 28 June 2010

  40. Example: use of small specs in proofs {list(l1)*list(l2)} Dispose(l1); {emp*list(l2)} Dispose(l2); Spec: {list(l)} Dispose(l) {emp} {P} C {Q} Frame Rule {P*R} C {Q*R} Monday, 28 June 2010

  41. Example: use of small specs in proofs {list(l1)*list(l2)} Dispose(l1); {list(l2)} Dispose(l2); Spec: {list(l)} Dispose(l) {emp} {P} C {Q} Frame Rule {P*R} C {Q*R} Monday, 28 June 2010

  42. Example: use of small specs in proofs {list(l1)*list(l2)} Dispose(l1); {list(l2)} Dispose(l2); {emp} Spec: {list(l)} Dispose(l) {emp} {P} C {Q} Frame Rule {P*R} C {Q*R} Monday, 28 June 2010

  43. Novelties Monday, 28 June 2010

  44. Frame Inference {P} C {Q} Frame Rule {list(l1)*list(l2)} {P*R} C {Q*R} Dispose(l1); Spec: {list(l)} Dispose(l) {emp} Dispose(l2); Monday, 28 June 2010

  45. Frame Inference {P} C {Q} Frame Rule {list(l1)*list(l2)} {P*R} C {Q*R} Dispose(l1); Spec: {list(l)} Dispose(l) {emp} Dispose(l2); In analysis to use the Frame Rule we need to compute R Frame inference problem: given A and B compute X such that A ⊢ B ∗ X Monday, 28 June 2010

  46. Frame Inference {P} C {Q} Frame Rule {list(l1)*list(l2)} {P*R} C {Q*R} Dispose(l1); Spec: {list(l)} Dispose(l) {emp} Dispose(l2); In analysis to use the Frame Rule we need to compute R Frame inference problem: given A and B compute X such that A ⊢ B ∗ X Example: ⊢ list(l1)*list(l2) list(l1)* X Monday, 28 June 2010

  47. Frame Inference {P} C {Q} Frame Rule {list(l1)*list(l2)} {P*R} C {Q*R} Dispose(l1); Spec: {list(l)} Dispose(l) {emp} Dispose(l2); In analysis to use the Frame Rule we need to compute R Frame inference problem: given A and B compute X such that A ⊢ B ∗ X Example: ⊢ list(l1)*list(l2) list(l1)* list(l2) Monday, 28 June 2010

  48. Frame Inference {P} C {Q} Frame Rule {list(l1)*list(l2)} {P*R} C {Q*R} Dispose(l1); Spec: {list(l)} Dispose(l) {emp} Dispose(l2); In analysis to use the Frame Rule we need to compute R Frame inference problem: given A and B compute X such that A ⊢ B ∗ X Example: ⊢ list(l1)*list(l2) list(l1)* list(l2) Monday, 28 June 2010

  49. Frame Inference {P} C {Q} Frame Rule {list(l1)*list(l2)} {P*R} C {Q*R} Dispose(l1); {emp*list(l2)} Spec: {list(l)} Dispose(l) {emp} Dispose(l2); In analysis to use the Frame Rule we need to compute R Frame inference problem: given A and B compute X such that A ⊢ B ∗ X Example: ⊢ list(l1)*list(l2) list(l1)* list(l2) Monday, 28 June 2010

  50. Abduction Monday, 28 June 2010

  51. Monday, 28 June 2010

  52. Abduction for Space Invader Monday, 28 June 2010

  53. Abduction for Space Invader Monday, 28 June 2010

  54. Abduction for Space Invader Abduction Inference: given A and B compute X such that A ∗ X ⊢ B Monday, 28 June 2010

  55. Abduction for Space Invader Abduction Inference: given A and B compute X such that A ∗ X ⊢ B Example: Spec: {list(l1)*list(l2)} Dispose_Two_Lists(l1,l2) {emp} list(l1) Monday, 28 June 2010

  56. Abduction for Space Invader Abduction Inference: given A and B compute X such that A ∗ X ⊢ B Example: Spec: {list(l1)*list(l2)} Dispose_Two_Lists(l1,l2) {emp} list(l1)*X ⊢ list(l1)*list(l2) Monday, 28 June 2010

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

Abduction and Induction Deduction, Abduction and Induction Abduction Mathematical

Abduction and Induction Deduction, Abduction and Induction Abduction Mathematical

Abduction and Induction Deduction, Abduction and Induction Abduction Mathematical Induction Steffen H olldobler Abduction and Induction (5th January 2009) 1 An Introductory Example: Abduction K | = G . We use the following

694 views • 34 slides
Computer Vision Statistical Shape Analysis Shape Shape is the geometric information that

Computer Vision Statistical Shape Analysis Shape Shape is the geometric information that

Computer Vision Statistical Shape Analysis Shape Shape is the geometric information that remains when translation, rotation, and scale are factored out. Landmark points. D'Arcy Thompson. David George Kendall Fred Bookstein.

248 views • 9 slides
Abduction Abduction is an assumption-based reasoning strategy where H is a set of assumptions

Abduction Abduction is an assumption-based reasoning strategy where H is a set of assumptions

Abduction Abduction is an assumption-based reasoning strategy where H is a set of assumptions about what could be happening in a system F axiomatizes how a system works g to be explained is an observation or a design goal Example: in

647 views • 20 slides
The Complexity of Abduction for Separated Heap Abstractions Nikos Gorogiannis Max Kanovich

The Complexity of Abduction for Separated Heap Abstractions Nikos Gorogiannis Max Kanovich

Complexity of Abduction in SL The Complexity of Abduction for Separated Heap Abstractions Nikos Gorogiannis Max Kanovich Peter OHearn Queen Mary University of London July 13th, 2011 Complexity of Abduction in SL Motivation Complexity of

1.14k views • 82 slides
Compositional Recurrence Analysis Azadeh Farzan Zachary Kincaid University of Toronto September

Compositional Recurrence Analysis Azadeh Farzan Zachary Kincaid University of Toronto September

Compositional Recurrence Analysis Azadeh Farzan Zachary Kincaid University of Toronto September 28, 2015 Compositional program analysis P P Break program into parts P P Analyze each part P P Compose the results Incremental analysis

787 views • 62 slides
Bi-abduction and Abstraction In the last lecture, we saw how frame inference lets us verify that

Bi-abduction and Abstraction In the last lecture, we saw how frame inference lets us verify that

8 Bi-Abduction Bi-Abduction Bi-abduction and Abstraction In the last lecture, we saw how frame inference lets us verify that the pre- and post-conditions and loop invariants of a given program are correct. Abstraction lets us infer loop

460 views • 9 slides
1 K-means clustering The K-means clustering algorithm can be seen as applying the EM algorithm to

1 K-means clustering The K-means clustering algorithm can be seen as applying the EM algorithm to

Statistical Modeling and Analysis of Neural Data (NEU 560) Princeton University, Spring 2018 Jonathan Pillow Lecture 18 notes: K-means and Factor Analysis Tues, 4.17 1 K-means clustering The K-means clustering algorithm can be seen as

547 views • 3 slides
Transient Analysis Lightning Phenomena HV Transient Analysis Classes and shape of overvoltages

Transient Analysis Lightning Phenomena HV Transient Analysis Classes and shape of overvoltages

Chapter 8 Overvoltage Phenomenon & HV Transient Analysis Lightning Phenomena HV Transient Analysis Classes and shape of overvoltages and standard voltage shape Analysis of overvoltages in power system includes a study of their:

1.04k views • 35 slides
Signatures in Shape Analysis Nikolas Tapia (WIAS/TU Berlin) joint with E. Celledoni & P . E.

Signatures in Shape Analysis Nikolas Tapia (WIAS/TU Berlin) joint with E. Celledoni & P . E.

Signatures in Shape Analysis Nikolas Tapia (WIAS/TU Berlin) joint with E. Celledoni & P . E. Lystad FG6 (NTNU) Weierstra-Institut fr angewandte Analysis und Stochastik August 27, 2019 Shape Analysis: Practical Setup The problem is to

481 views • 20 slides
Semantics and Pragmatics of NLP Interpretation as Abduction Alex Lascarides School of

Semantics and Pragmatics of NLP Interpretation as Abduction Alex Lascarides School of

Inferences in Discourse Use abduction Semantics and Pragmatics of NLP Interpretation as Abduction Alex Lascarides School of Informatics University of Edinburgh university-logo Alex Lascarides SPNLP: Abduction Inferences in Discourse Use

507 views • 36 slides
Shape Co-analysis and constrained clustering Daniel Cohen-Or Tel-Aviv University 1 High-level

Shape Co-analysis and constrained clustering Daniel Cohen-Or Tel-Aviv University 1 High-level

Shape Co-analysis and constrained clustering Daniel Cohen-Or Tel-Aviv University 1 High-level Shape analysis [Mehra et al. 08] [Fu et al. 08] [Kalograkis et al. 10] Shape abstraction Upright orientation Learning segmentation [Kim et al.

1.03k views • 81 slides
Pulse Shape Analysis A/E for GERDA experiment Outline : Motivation Pulse Shape

Pulse Shape Analysis A/E for GERDA experiment Outline : Motivation Pulse Shape

Pulse Shape Analysis A/E for GERDA experiment Outline : Motivation Pulse Shape Discrimination for GERDA BEGes Systematic uncertainty on PSA Outlook & Summary Heng-Ye Liao photo o by *EvrWccn Wccn for the GERDA collaboration

188 views • 18 slides
Numerical Invariants via Abstract Machines Compositional Recurrence Analysis (CRA) Azadeh Farzan,

Numerical Invariants via Abstract Machines Compositional Recurrence Analysis (CRA) Azadeh Farzan,

Princeton University Zachary Kincaid Static Analysis Symposium August 31, 2018 Numerical Invariants via Abstract Machines Compositional Recurrence Analysis (CRA) Azadeh Farzan, Thomas Reps. Todays agenda: A recipe for building abstract

1.16k views • 78 slides
CS711 Advanced Programming Languages Shape Analysis With Tracked Locations Radu Rugina 22 Sep

CS711 Advanced Programming Languages Shape Analysis With Tracked Locations Radu Rugina 22 Sep

CS711 Advanced Programming Languages Shape Analysis With Tracked Locations Radu Rugina 22 Sep 2005 Shape Analysis with Local Reasoning All previous abstractions: Describe the entire heap at once Makes inter-procedural analysis

544 views • 30 slides
Safety Criticality Analysis of Air Traffic Management Systems: A Compositional Bisimulation

Safety Criticality Analysis of Air Traffic Management Systems: A Compositional Bisimulation

Third SESAR Innovation Days 26 28 November 2013, KTH, Stockholm, Sweden Safety Criticality Analysis of Air Traffic Management Systems: A Compositional Bisimulation Approach Elena De Santis, Maria Domenica Di Benedetto, Mariken Everdij,

664 views • 32 slides
Compositional Real-Time Scheduling Framework Insik Shin 1 , Insup Lee 1 1 University of

Compositional Real-Time Scheduling Framework Insik Shin 1 , Insup Lee 1 1 University of

Compositional Framework Bounded Delay Resource Model Schedulability Analysis Utilization Bounds Component Abstraction Conclusion Compositional Real-Time Scheduling Framework Insik Shin 1 , Insup Lee 1 1 University of Pennsylvania 15 November

362 views • 33 slides
Combining Axiom Injection and Knowledge Base Completion for Efficient Natural Language Inference

Combining Axiom Injection and Knowledge Base Completion for Efficient Natural Language Inference

Combining Axiom Injection and Knowledge Base Completion for Efficient Natural Language Inference Masashi Yoshikawa, Koji Mineshima, Hiroshi Noji, Daisuke Bekki Nara Institute of Science and Technology Ochanomizu University Artificial

549 views • 35 slides
PSYC 001 General Psychology I understand the confidence-rating system that will be used on exams.

PSYC 001 General Psychology I understand the confidence-rating system that will be used on exams.

PSYC 001 General Psychology I understand the confidence-rating system that will be used on exams. A. I strongly agree B. I agree C. I dont know D. I disagree E. I strongly disagree Next week Monday: No homework J J Tuesday: Exam

214 views • 8 slides
Transformational Priors The Big Concept Over Grammars Want to parse (or build a syntactic

Transformational Priors The Big Concept Over Grammars Want to parse (or build a syntactic

Transformational Priors The Big Concept Over Grammars Want to parse (or build a syntactic language model). Must estimate rule probabilities. Problem: Too many possible rules! Especially with lexicalization and flattening (which

790 views • 10 slides
CSCE 625: Artificial Intelligence Dr. Dylan Shell 1 Shell CSCE 625 TAMU Charles Sanders Peirce:

CSCE 625: Artificial Intelligence Dr. Dylan Shell 1 Shell CSCE 625 TAMU Charles Sanders Peirce:

Shell CSCE 625 TAMU CSCE 625: Artificial Intelligence Dr. Dylan Shell 1 Shell CSCE 625 TAMU Charles Sanders Peirce: "Looking out my window this lovely spring morning, I see an azalea in full bloom. No, no! I don't see that; though that

287 views • 9 slides
Lethe: Saturation-Based Reasoning for Non-Standard Reasoning Tasks Patrick Koopmann, Renate A.

Lethe: Saturation-Based Reasoning for Non-Standard Reasoning Tasks Patrick Koopmann, Renate A.

ormal ethods roup Lethe: Saturation-Based Reasoning for Non-Standard Reasoning Tasks Patrick Koopmann, Renate A. Schmidt ormal ethods roup Lethe River of Forgetfulness Usage from command line, as Java library, or

235 views • 19 slides
Quel type de modlisation pour des interactions entre composants biologiques ? Andrei Doncescu

Quel type de modlisation pour des interactions entre composants biologiques ? Andrei Doncescu

Quel type de modlisation pour des interactions entre composants biologiques ? Andrei Doncescu LAAS-UPR8001/Universit Paul Sabatier Pierre Siegel LIF Marseille Why a biological system is complex ? Contains many interacting parts

882 views • 47 slides
Types of ---------------------------------- Arguments So, you should go to bed. Conclusion An

Types of ---------------------------------- Arguments So, you should go to bed. Conclusion An

An argument is a set of claims (called premises) offered in support of a conclusion. I said you should go to bed. Premises Im your mother. Types of ---------------------------------- Arguments So, you should go to bed. Conclusion

356 views • 13 slides
the muscles p o w e r finesse image credit: CFCF on wikimedia commons

the muscles p o w e r finesse image credit: CFCF on wikimedia commons

the muscles p o w e r finesse image credit: CFCF on wikimedia commons https://en.wikipedia.org/wiki/File:1121_Intrinsic_Muscles_of_the_Hand_Deep_LD.png the intrinsic muscles of the hand are innervated by the ulnar nerve except the

350 views • 16 slides

More recommend