blank Quick help
blank Maintenance news

Scheduled maintenance

Regular maintenance outages:
between 05.00 and 05.15 hrs CET (Monday to Sunday).

Other outages
Availability
Register Forum

2022.02.11

More...
blank News flashes

News Flashes

New version of the European Patent Register – SPC proceedings information in the Unitary Patent Register.

2024-07-24

More...
blank Related links

Release notes
European Patent Register Assistant
European Patent Register Resource Book
European Patent Register – pocket guide
FAQ - European Patent Register
FAQ - Register Alert
Federated Register (Flyer)
Global Dossier (Flyer)
Register events
Deep link coverage
Federated Register content
The Patent Information Tour
Fair use charter

Extract from the Register of European Patents

EP About this file: EP3152658

EP3152658 - DATA-DEPENDENT CONTROL FLOW REDUCTION [Right-click to bookmark this link]
StatusNo opposition filed within time limit
Status updated on  09.10.2020
Database last updated on 22.08.2024
FormerThe patent has been granted
Status updated on  01.11.2019
FormerGrant of patent is intended
Status updated on  03.07.2019
FormerRequest for examination was made
Status updated on  10.03.2017
FormerThe international publication has been made
Status updated on  04.11.2016
Most recent event   Tooltip08.07.2022Lapse of the patent in a contracting state
New state(s): MK		published on 10.08.2022  [2022/32]
Applicant(s)For all designated states
Microsoft Technology Licensing, LLC
One Microsoft Way
Redmond, WA 98052-6399 / US
[2017/15]
Inventor(s)01 / HE, Wenlei
c/o Microsoft Technology Licensing, LLC
LCA - International Patents (8/1172)
One Microsoft Way
Redmond, Washington 98052-6399 / US
02 / TZEN, Ten
c/o Microsoft Technology Licensing, LLC
LCA - International Patents (8/1172)
One Microsoft Way
Redmond, Washington 98052-6399 / US
 [2019/31]
Former [2017/15]01 / HE, Wenlei
c/o Microsoft Technology Licensing LLC
LCA - International Patents (8/1172)
One Microsoft Way
Redmond, Washington 98052-6399 / US
02 / TZEN, Ten
c/o Microsoft Technology Licensing LLC
LCA - International Patents (8/1172)
One Microsoft Way
Redmond, Washington 98052-6399 / US
Representative(s)Grünecker Patent- und Rechtsanwälte PartG mbB
Leopoldstraße 4
80802 München / DE
[2017/15]
Application number, filing date15732107.605.06.2015
[2017/15]
WO2015US34319
Priority number, dateUS20141429860506.06.2014         Original published format: US201414298605
[2017/15]
Filing languageEN
Procedural languageEN
PublicationType: A1 Application with search report
No.:WO2015188026
Date:10.12.2015
Language:EN
[2015/49]
Type: A1 Application with search report 
No.:EP3152658
Date:12.04.2017
Language:EN
The application published by WIPO in one of the EPO official languages on 10.12.2015 takes the place of the publication of the European patent application.
[2017/15]
Type: B1 Patent specification 
No.:EP3152658
Date:04.12.2019
Language:EN
[2019/49]
Search report(s)International search report - published on:EP10.12.2015
ClassificationIPC:G06F8/41
[2019/24]
CPC:
G06F8/433 (EP,CN,US); G06F8/4435 (EP,CN,US)
Former IPC [2017/15]G06F9/45
Designated contracting statesAL,   AT,   BE,   BG,   CH,   CY,   CZ,   DE,   DK,   EE,   ES,   FI,   FR,   GB,   GR,   HR,   HU,   IE,   IS,   IT,   LI,   LT,   LU,   LV,   MC,   MK,   MT,   NL,   NO,   PL,   PT,   RO,   RS,   SE,   SI,   SK,   SM,   TR [2017/15]
Extension statesBANot yet paid
MENot yet paid
Validation statesMANot yet paid
TitleGerman:DATENABHÄNGIGE ÄNDERUNG EINES STEUERFLUSS[2019/24]
English:DATA-DEPENDENT CONTROL FLOW REDUCTION[2017/15]
French:RÉDUCTION DU DÉBIT DE COMMANDE DÉPENDANT DES DONNÉES[2017/15]
Former [2017/15]DATENABHÄNGIGE STEUERFLUSSVERMINDERUNG
Entry into regional phase03.11.2016National basic fee paid 
03.11.2016Designation fee(s) paid 
03.11.2016Examination fee paid 
Examination procedure03.11.2016Examination requested  [2017/15]
03.11.2016Date on which the examining division has become responsible
08.02.2017Amendment by applicant (claims and/or description)
04.07.2019Communication of intention to grant the patent
24.10.2019Fee for grant paid
24.10.2019Fee for publishing/printing paid
24.10.2019Receipt of the translation of the claim(s)
Opposition(s)07.09.2020No opposition filed within time limit [2020/46]
Fees paidRenewal fee
16.06.2017Renewal fee patent year 03
12.06.2018Renewal fee patent year 04
13.06.2019Renewal fee patent year 05
Opt-out from the exclusive  Tooltip
competence of the Unified
Patent Court		 See the Register of the Unified Patent Court for opt-out data
Responsibility for the accuracy, completeness or quality of the data displayed under the link provided lies entirely with the Unified Patent Court.
Lapses during opposition  TooltipHU05.06.2015
AL04.12.2019
AT04.12.2019
CY04.12.2019
CZ04.12.2019
DK04.12.2019
EE04.12.2019
ES04.12.2019
FI04.12.2019
HR04.12.2019
IT04.12.2019
LT04.12.2019
LV04.12.2019
MC04.12.2019
MK04.12.2019
MT04.12.2019
NL04.12.2019
PL04.12.2019
RO04.12.2019
RS04.12.2019
SE04.12.2019
SI04.12.2019
SK04.12.2019
SM04.12.2019
TR04.12.2019
BG04.03.2020
NO04.03.2020
GR05.03.2020
IS04.04.2020
PT29.04.2020
IE05.06.2020
LU05.06.2020
BE30.06.2020
CH30.06.2020
LI30.06.2020
[2022/32]
Former [2022/27]HU05.06.2015
AL04.12.2019
AT04.12.2019
CY04.12.2019
CZ04.12.2019
DK04.12.2019
EE04.12.2019
ES04.12.2019
FI04.12.2019
HR04.12.2019
IT04.12.2019
LT04.12.2019
LV04.12.2019
MC04.12.2019
MT04.12.2019
NL04.12.2019
PL04.12.2019
RO04.12.2019
RS04.12.2019
SE04.12.2019
SI04.12.2019
SK04.12.2019
SM04.12.2019
TR04.12.2019
BG04.03.2020
NO04.03.2020
GR05.03.2020
IS04.04.2020
PT29.04.2020
IE05.06.2020
LU05.06.2020
BE30.06.2020
CH30.06.2020
LI30.06.2020
Former [2021/24]AL04.12.2019
AT04.12.2019
CZ04.12.2019
DK04.12.2019
EE04.12.2019
ES04.12.2019
FI04.12.2019
HR04.12.2019
IT04.12.2019
LT04.12.2019
LV04.12.2019
MC04.12.2019
NL04.12.2019
PL04.12.2019
RO04.12.2019
RS04.12.2019
SE04.12.2019
SI04.12.2019
SK04.12.2019
SM04.12.2019
BG04.03.2020
NO04.03.2020
GR05.03.2020
IS04.04.2020
PT29.04.2020
IE05.06.2020
LU05.06.2020
BE30.06.2020
CH30.06.2020
LI30.06.2020
Former [2021/20]AL04.12.2019
AT04.12.2019
CZ04.12.2019
DK04.12.2019
EE04.12.2019
ES04.12.2019
FI04.12.2019
HR04.12.2019
IT04.12.2019
LT04.12.2019
LV04.12.2019
MC04.12.2019
NL04.12.2019
PL04.12.2019
RO04.12.2019
RS04.12.2019
SE04.12.2019
SI04.12.2019
SK04.12.2019
SM04.12.2019
BG04.03.2020
NO04.03.2020
GR05.03.2020
IS04.04.2020
PT29.04.2020
IE05.06.2020
LU05.06.2020
CH30.06.2020
LI30.06.2020
Former [2021/15]AL04.12.2019
AT04.12.2019
CZ04.12.2019
DK04.12.2019
EE04.12.2019
ES04.12.2019
FI04.12.2019
HR04.12.2019
IT04.12.2019
LT04.12.2019
LV04.12.2019
MC04.12.2019
NL04.12.2019
PL04.12.2019
RO04.12.2019
RS04.12.2019
SE04.12.2019
SI04.12.2019
SK04.12.2019
SM04.12.2019
BG04.03.2020
NO04.03.2020
GR05.03.2020
IS04.04.2020
PT29.04.2020
LU05.06.2020
Former [2021/10]AL04.12.2019
AT04.12.2019
CZ04.12.2019
DK04.12.2019
EE04.12.2019
ES04.12.2019
FI04.12.2019
HR04.12.2019
IT04.12.2019
LT04.12.2019
LV04.12.2019
MC04.12.2019
NL04.12.2019
PL04.12.2019
RO04.12.2019
RS04.12.2019
SE04.12.2019
SI04.12.2019
SK04.12.2019
SM04.12.2019
BG04.03.2020
NO04.03.2020
GR05.03.2020
IS04.04.2020
PT29.04.2020
Former [2020/51]AL04.12.2019
AT04.12.2019
CZ04.12.2019
DK04.12.2019
EE04.12.2019
ES04.12.2019
FI04.12.2019
HR04.12.2019
LT04.12.2019
LV04.12.2019
NL04.12.2019
PL04.12.2019
RO04.12.2019
RS04.12.2019
SE04.12.2019
SI04.12.2019
SK04.12.2019
SM04.12.2019
BG04.03.2020
NO04.03.2020
GR05.03.2020
IS04.04.2020
PT29.04.2020
Former [2020/47]AL04.12.2019
CZ04.12.2019
DK04.12.2019
EE04.12.2019
ES04.12.2019
FI04.12.2019
HR04.12.2019
LT04.12.2019
LV04.12.2019
NL04.12.2019
RO04.12.2019
RS04.12.2019
SE04.12.2019
SK04.12.2019
SM04.12.2019
BG04.03.2020
NO04.03.2020
GR05.03.2020
IS04.04.2020
PT29.04.2020
Former [2020/40]AL04.12.2019
CZ04.12.2019
EE04.12.2019
ES04.12.2019
FI04.12.2019
HR04.12.2019
LT04.12.2019
LV04.12.2019
NL04.12.2019
RO04.12.2019
RS04.12.2019
SE04.12.2019
SK04.12.2019
SM04.12.2019
BG04.03.2020
NO04.03.2020
GR05.03.2020
IS04.04.2020
PT29.04.2020
Former [2020/37]AL04.12.2019
CZ04.12.2019
EE04.12.2019
ES04.12.2019
FI04.12.2019
HR04.12.2019
LT04.12.2019
LV04.12.2019
NL04.12.2019
RO04.12.2019
RS04.12.2019
SE04.12.2019
SK04.12.2019
SM04.12.2019
BG04.03.2020
NO04.03.2020
GR05.03.2020
PT29.04.2020
Former [2020/36]AL04.12.2019
CZ04.12.2019
EE04.12.2019
ES04.12.2019
FI04.12.2019
HR04.12.2019
LT04.12.2019
LV04.12.2019
NL04.12.2019
RO04.12.2019
RS04.12.2019
SE04.12.2019
BG04.03.2020
NO04.03.2020
GR05.03.2020
PT29.04.2020
Former [2020/35]AL04.12.2019
CZ04.12.2019
ES04.12.2019
FI04.12.2019
HR04.12.2019
LT04.12.2019
LV04.12.2019
NL04.12.2019
RO04.12.2019
RS04.12.2019
SE04.12.2019
BG04.03.2020
NO04.03.2020
GR05.03.2020
Former [2020/34]AL04.12.2019
ES04.12.2019
FI04.12.2019
HR04.12.2019
LT04.12.2019
LV04.12.2019
NL04.12.2019
RS04.12.2019
SE04.12.2019
BG04.03.2020
NO04.03.2020
GR05.03.2020
Former [2020/32]AL04.12.2019
FI04.12.2019
HR04.12.2019
LT04.12.2019
LV04.12.2019
NL04.12.2019
RS04.12.2019
SE04.12.2019
BG04.03.2020
NO04.03.2020
GR05.03.2020
Former [2020/26]FI04.12.2019
HR04.12.2019
LT04.12.2019
LV04.12.2019
RS04.12.2019
SE04.12.2019
BG04.03.2020
NO04.03.2020
GR05.03.2020
Former [2020/23]FI04.12.2019
LT04.12.2019
LV04.12.2019
SE04.12.2019
BG04.03.2020
NO04.03.2020
GR05.03.2020
Former [2020/22]FI04.12.2019
LT04.12.2019
SE04.12.2019
BG04.03.2020
NO04.03.2020
Former [2020/21]NO04.03.2020
Cited inInternational search[A]EP0844557  (HEWLETT PACKARD CO [US]) [A] 1-10 * abstract * * figures 2,5,6 * * column 2, lines 9-29 *;
 [A]  - DEBRAY S K ET AL, "COMPILER TECHNIQUES FOR CODE COMPACTION", ACM TRANSACTIONS ON PROGRAMMING LANGUAGE AND SYSTEMS, ACM, NEW YORK, NY, (20000301), vol. 22, no. 2, doi:10.1145/349214.349233, ISSN 0164-0925, pages 378 - 415, XP007900422 [A] 1-10 * page 381, section 2.1.1-page 383, section 2.1.4 * * page 383, section 2.2.1, 1st paragraph *

DOI:   http://dx.doi.org/10.1145/349214.349233
 [A]  - JOHNSON R ET AL, "Analysis techniques for predicated code", PROCEEDINGS OF THE 29TH. ANNUAL IEEE/ACM INTERNATIONAL SYMPOSIUM ON MICROARCHITECTURE. MICRO-29. PARIS, DEC. 2 - 4, 1996; [PROCEEDINGS OF THE ANNUAL IEEE/ACM INTERNATIONAL SYMPOSIUM ON MICROARCHITECTURE. (MICRO)], LOS ALAMITOS, IEEE COMP. SOC. PRESS,, (19961202), vol. SYMP. 29, doi:10.1109/MICRO.1996.566454, ISBN 978-0-8186-7641-3, pages 100 - 113, XP010206089 [A] 1-10 * abstract * * page 100, section 1.1 *

DOI:   http://dx.doi.org/10.1109/MICRO.1996.566454
 [A]  - WANG N ET AL, "Y-branches: when you come to a fork in the road, take it", PARALLEL ARCHITECTURES AND COMPILATION TECHNIQUES, 2003. PACT 2003. PR OCEEDINGS. 12TH INTERNATIONAL CONFERENCE ON 27 SEPT. - 1 OCT. 2003, PISCATAWAY, NJ, USA,IEEE, (20030927), doi:10.1109/PACT.2003.1238002, ISBN 978-0-7695-2021-6, pages 56 - 66, XP010662174 [A] 1-10 * section 4.3, 1st paragraph *

DOI:   http://dx.doi.org/10.1109/PACT.2003.1238002
The EPO accepts no responsibility for the accuracy of data originating from other authorities; in particular, it does not guarantee that it is complete, up to date or fit for specific purposes.