---
_id: '10905'
abstract:
- lang: eng
text: "Energy games belong to a class of turn-based two-player infinite-duration
games played on a weighted directed graph. It is one of the rare and intriguing
combinatorial problems that lie in NP ∩ co−NP, but are not known to be in P. While
the existence of polynomial-time algorithms has been a major open problem for
decades, there is no algorithm that solves any non-trivial subclass in polynomial
time.\r\nIn this paper, we give several results based on the weight structures
of the graph. First, we identify a notion of penalty and present a polynomial-time
algorithm when the penalty is large. Our algorithm is the first polynomial-time
algorithm on a large class of weighted graphs. It includes several counter examples
that show that many previous algorithms, such as value iteration and random facet
algorithms, require at least sub-exponential time. Our main technique is developing
the first non-trivial approximation algorithm and showing how to convert it to
an exact algorithm. Moreover, we show that in a practical case in verification
where weights are clustered around a constant number of values, the energy game
problem can be solved in polynomial time. We also show that the problem is still
as hard as in general when the clique-width is bounded or the graph is strongly
ergodic, suggesting that restricting graph structures need not help."
acknowledgement: 'Supported by the Austrian Science Fund (FWF): P23499-N23, the Austrian
Science Fund (FWF): S11407-N23 (RiSE), an ERC Start Grant (279307: Graph Games),
and a Microsoft Faculty Fellows Award'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Sebastian
full_name: Krinninger, Sebastian
last_name: Krinninger
- first_name: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
citation:
ama: 'Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. Polynomial-time algorithms
for energy games with special weight structures. In: Algorithms – ESA 2012.
Vol 7501. Springer; 2012:301-312. doi:10.1007/978-3-642-33090-2_27'
apa: 'Chatterjee, K., Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2012).
Polynomial-time algorithms for energy games with special weight structures. In
Algorithms – ESA 2012 (Vol. 7501, pp. 301–312). Ljubljana, Slovenia: Springer.
https://doi.org/10.1007/978-3-642-33090-2_27'
chicago: Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, and Danupon
Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.”
In Algorithms – ESA 2012, 7501:301–12. Springer, 2012. https://doi.org/10.1007/978-3-642-33090-2_27.
ieee: K. Chatterjee, M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time
algorithms for energy games with special weight structures,” in Algorithms
– ESA 2012, Ljubljana, Slovenia, 2012, vol. 7501, pp. 301–312.
ista: 'Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. 2012. Polynomial-time
algorithms for energy games with special weight structures. Algorithms – ESA 2012.
ESA: European Symposium on Algorithms, LNCS, vol. 7501, 301–312.'
mla: Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games
with Special Weight Structures.” Algorithms – ESA 2012, vol. 7501, Springer,
2012, pp. 301–12, doi:10.1007/978-3-642-33090-2_27.
short: K. Chatterjee, M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, Algorithms
– ESA 2012, Springer, 2012, pp. 301–312.
conference:
end_date: 2012-09-12
location: Ljubljana, Slovenia
name: 'ESA: European Symposium on Algorithms'
start_date: 2012-09-10
date_created: 2022-03-21T08:01:45Z
date_published: 2012-10-01T00:00:00Z
date_updated: 2023-09-05T14:09:30Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-642-33090-2_27
ec_funded: 1
external_id:
arxiv:
- '1604.08234'
intvolume: ' 7501'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1604.08234
month: '10'
oa: 1
oa_version: Preprint
page: 301-312
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Algorithms – ESA 2012
publication_identifier:
eisbn:
- '9783642330902'
eissn:
- 1611-3349
isbn:
- '9783642330896'
issn:
- 0302-9743
publication_status: published
publisher: Springer
quality_controlled: '1'
related_material:
record:
- id: '535'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Polynomial-time algorithms for energy games with special weight structures
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 7501
year: '2012'
...
---
_id: '10906'
abstract:
- lang: eng
text: HSF(C) is a tool that automates verification of safety and liveness properties
for C programs. This paper describes the verification approach taken by HSF(C)
and provides instructions on how to install and use the tool.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Sergey
full_name: Grebenshchikov, Sergey
last_name: Grebenshchikov
- first_name: Ashutosh
full_name: Gupta, Ashutosh
id: 335E5684-F248-11E8-B48F-1D18A9856A87
last_name: Gupta
- first_name: Nuno P.
full_name: Lopes, Nuno P.
last_name: Lopes
- first_name: Corneliu
full_name: Popeea, Corneliu
last_name: Popeea
- first_name: Andrey
full_name: Rybalchenko, Andrey
last_name: Rybalchenko
citation:
ama: 'Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. HSF(C): A software
verifier based on Horn clauses. In: Flanagan C, König B, eds. Tools and Algorithms
for the Construction and Analysis of Systems. Vol 7214. LNCS. Berlin, Heidelberg:
Springer; 2012:549-551. doi:10.1007/978-3-642-28756-5_46'
apa: 'Grebenshchikov, S., Gupta, A., Lopes, N. P., Popeea, C., & Rybalchenko,
A. (2012). HSF(C): A software verifier based on Horn clauses. In C. Flanagan &
B. König (Eds.), Tools and Algorithms for the Construction and Analysis of
Systems (Vol. 7214, pp. 549–551). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-28756-5_46'
chicago: 'Grebenshchikov, Sergey, Ashutosh Gupta, Nuno P. Lopes, Corneliu Popeea,
and Andrey Rybalchenko. “HSF(C): A Software Verifier Based on Horn Clauses.” In
Tools and Algorithms for the Construction and Analysis of Systems, edited
by Cormac Flanagan and Barbara König, 7214:549–51. LNCS. Berlin, Heidelberg: Springer,
2012. https://doi.org/10.1007/978-3-642-28756-5_46.'
ieee: 'S. Grebenshchikov, A. Gupta, N. P. Lopes, C. Popeea, and A. Rybalchenko,
“HSF(C): A software verifier based on Horn clauses,” in Tools and Algorithms
for the Construction and Analysis of Systems, Tallinn, Estonia, 2012, vol.
7214, pp. 549–551.'
ista: 'Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. 2012. HSF(C):
A software verifier based on Horn clauses. Tools and Algorithms for the Construction
and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and
Analysis of SystemsLNCS, LNCS, vol. 7214, 549–551.'
mla: 'Grebenshchikov, Sergey, et al. “HSF(C): A Software Verifier Based on Horn
Clauses.” Tools and Algorithms for the Construction and Analysis of Systems,
edited by Cormac Flanagan and Barbara König, vol. 7214, Springer, 2012, pp. 549–51,
doi:10.1007/978-3-642-28756-5_46.'
short: S. Grebenshchikov, A. Gupta, N.P. Lopes, C. Popeea, A. Rybalchenko, in:,
C. Flanagan, B. König (Eds.), Tools and Algorithms for the Construction and Analysis
of Systems, Springer, Berlin, Heidelberg, 2012, pp. 549–551.
conference:
end_date: 2012-04-01
location: Tallinn, Estonia
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2012-03-24
date_created: 2022-03-21T08:03:30Z
date_published: 2012-04-01T00:00:00Z
date_updated: 2023-09-05T14:09:54Z
day: '01'
department:
- _id: ToHe
doi: 10.1007/978-3-642-28756-5_46
editor:
- first_name: Cormac
full_name: Flanagan, Cormac
last_name: Flanagan
- first_name: Barbara
full_name: König, Barbara
last_name: König
intvolume: ' 7214'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1007/978-3-642-28756-5_46
month: '04'
oa: 1
oa_version: Published Version
page: 549-551
place: Berlin, Heidelberg
publication: Tools and Algorithms for the Construction and Analysis of Systems
publication_identifier:
eisbn:
- '9783642287565'
eissn:
- 1611-3349
isbn:
- '9783642287558'
issn:
- 0302-9743
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
series_title: LNCS
status: public
title: 'HSF(C): A software verifier based on Horn clauses'
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 7214
year: '2012'
...
---
_id: '5745'
article_processing_charge: No
author:
- first_name: Ashutosh
full_name: Gupta, Ashutosh
last_name: Gupta
citation:
ama: 'Gupta A. Improved Single Pass Algorithms for Resolution Proof Reduction. In:
Automated Technology for Verification and Analysis. Vol 7561. LNCS. Berlin,
Heidelberg: Springer Berlin Heidelberg; 2012:107-121. doi:10.1007/978-3-642-33386-6_10'
apa: 'Gupta, A. (2012). Improved Single Pass Algorithms for Resolution Proof Reduction.
In Automated Technology for Verification and Analysis (Vol. 7561, pp. 107–121).
Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-33386-6_10'
chicago: 'Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof
Reduction.” In Automated Technology for Verification and Analysis, 7561:107–21.
LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. https://doi.org/10.1007/978-3-642-33386-6_10.'
ieee: 'A. Gupta, “Improved Single Pass Algorithms for Resolution Proof Reduction,”
in Automated Technology for Verification and Analysis, vol. 7561, Berlin,
Heidelberg: Springer Berlin Heidelberg, 2012, pp. 107–121.'
ista: 'Gupta A. 2012.Improved Single Pass Algorithms for Resolution Proof Reduction.
In: Automated Technology for Verification and Analysis. vol. 7561, 107–121.'
mla: Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof Reduction.”
Automated Technology for Verification and Analysis, vol. 7561, Springer
Berlin Heidelberg, 2012, pp. 107–21, doi:10.1007/978-3-642-33386-6_10.
short: A. Gupta, in:, Automated Technology for Verification and Analysis, Springer
Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 107–121.
conference:
end_date: 2012-10-06
location: Thiruvananthapuram, Kerala, India
name: ATVA 2012
start_date: 2012-10-03
date_created: 2018-12-18T13:01:46Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2023-09-05T14:15:29Z
ddc:
- '005'
department:
- _id: ToHe
doi: 10.1007/978-3-642-33386-6_10
ec_funded: 1
file:
- access_level: open_access
checksum: 68415837a315de3cc4d120f6019d752c
content_type: application/pdf
creator: dernst
date_created: 2018-12-18T13:07:35Z
date_updated: 2020-07-14T12:47:10Z
file_id: '5746'
file_name: 2012_ATVA_Gupta.pdf
file_size: 465502
relation: main_file
file_date_updated: 2020-07-14T12:47:10Z
has_accepted_license: '1'
intvolume: ' 7561'
language:
- iso: eng
oa: 1
oa_version: None
page: 107-121
place: Berlin, Heidelberg
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication: Automated Technology for Verification and Analysis
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783642333859'
- '9783642333866'
issn:
- 0302-9743
publication_status: published
publisher: Springer Berlin Heidelberg
pubrep_id: '180'
quality_controlled: '1'
series_title: LNCS
status: public
title: Improved Single Pass Algorithms for Resolution Proof Reduction
type: book_chapter
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 7561
year: '2012'
...
---
_id: '3251'
abstract:
- lang: eng
text: Many infinite state systems can be seen as well-structured transition systems
(WSTS), i.e., systems equipped with a well-quasi-ordering on states that is also
a simulation relation. WSTS are an attractive target for formal analysis because
there exist generic algorithms that decide interesting verification problems for
this class. Among the most popular algorithms are acceleration-based forward analyses
for computing the covering set. Termination of these algorithms can only be guaranteed
for flattable WSTS. Yet, many WSTS of practical interest are not flattable and
the question whether any given WSTS is flattable is itself undecidable. We therefore
propose an analysis that computes the covering set and captures the essence of
acceleration-based algorithms, but sacrifices precision for guaranteed termination.
Our analysis is an abstract interpretation whose abstract domain builds on the
ideal completion of the well-quasi-ordered state space, and a widening operator
that mimics acceleration and controls the loss of precision of the analysis. We
present instances of our framework for various classes of WSTS. Our experience
with a prototype implementation indicates that, despite the inherent precision
loss, our analysis often computes the precise covering set of the analyzed system.
acknowledgement: This research was supported in part by the European Research Council
(ERC) Advanced Investigator Grant QUAREM and by the Austrian Science Fund (FWF)
project S11402-N23.
alternative_title:
- LNCS
author:
- first_name: Damien
full_name: Zufferey, Damien
id: 4397AC76-F248-11E8-B48F-1D18A9856A87
last_name: Zufferey
orcid: 0000-0002-3197-8736
- first_name: Thomas
full_name: Wies, Thomas
id: 447BFB88-F248-11E8-B48F-1D18A9856A87
last_name: Wies
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Zufferey D, Wies T, Henzinger TA. Ideal abstractions for well structured transition
systems. In: Vol 7148. Springer; 2012:445-460. doi:10.1007/978-3-642-27940-9_29'
apa: 'Zufferey, D., Wies, T., & Henzinger, T. A. (2012). Ideal abstractions
for well structured transition systems (Vol. 7148, pp. 445–460). Presented at
the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia,
PA, USA: Springer. https://doi.org/10.1007/978-3-642-27940-9_29'
chicago: Zufferey, Damien, Thomas Wies, and Thomas A Henzinger. “Ideal Abstractions
for Well Structured Transition Systems,” 7148:445–60. Springer, 2012. https://doi.org/10.1007/978-3-642-27940-9_29.
ieee: 'D. Zufferey, T. Wies, and T. A. Henzinger, “Ideal abstractions for well structured
transition systems,” presented at the VMCAI: Verification, Model Checking and
Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 445–460.'
ista: 'Zufferey D, Wies T, Henzinger TA. 2012. Ideal abstractions for well structured
transition systems. VMCAI: Verification, Model Checking and Abstract Interpretation,
LNCS, vol. 7148, 445–460.'
mla: Zufferey, Damien, et al. Ideal Abstractions for Well Structured Transition
Systems. Vol. 7148, Springer, 2012, pp. 445–60, doi:10.1007/978-3-642-27940-9_29.
short: D. Zufferey, T. Wies, T.A. Henzinger, in:, Springer, 2012, pp. 445–460.
conference:
end_date: 2012-01-24
location: Philadelphia, PA, USA
name: 'VMCAI: Verification, Model Checking and Abstract Interpretation'
start_date: 2012-01-22
date_created: 2018-12-11T12:02:16Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2023-09-07T11:36:36Z
day: '01'
ddc:
- '000'
- '005'
department:
- _id: ToHe
doi: 10.1007/978-3-642-27940-9_29
ec_funded: 1
file:
- access_level: open_access
checksum: f2f0d55efa32309ad1fe65a5fcaad90c
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:35Z
date_updated: 2020-07-14T12:46:05Z
file_id: '4759'
file_name: IST-2012-100-v1+1_Ideal_abstractions_for_well-structured_transition_systems.pdf
file_size: 217104
relation: main_file
file_date_updated: 2020-07-14T12:46:05Z
has_accepted_license: '1'
intvolume: ' 7148'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 445 - 460
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: Springer
publist_id: '3406'
pubrep_id: '100'
quality_controlled: '1'
related_material:
record:
- id: '1405'
relation: dissertation_contains
status: public
status: public
title: Ideal abstractions for well structured transition systems
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7148
year: '2012'
...
---
_id: '3157'
abstract:
- lang: eng
text: Colorectal tumours that are wild type for KRAS are often sensitive to EGFR
blockade, but almost always develop resistance within several months of initiating
therapy. The mechanisms underlying this acquired resistance to anti-EGFR antibodies
are largely unknown. This situation is in marked contrast to that of small-molecule
targeted agents, such as inhibitors of ABL, EGFR, BRAF and MEK, in which mutations
in the genes encoding the protein targets render the tumours resistant to the
effects of the drugs. The simplest hypothesis to account for the development of
resistance to EGFR blockade is that rare cells with KRAS mutations pre-exist at
low levels in tumours with ostensibly wild-type KRAS genes. Although this hypothesis
would seem readily testable, there is no evidence in pre-clinical models to support
it, nor is there data from patients. To test this hypothesis, we determined whether
mutant KRAS DNA could be detected in the circulation of 28 patients receiving
monotherapy with panitumumab, a therapeutic anti-EGFR antibody. We found that
9 out of 24 (38%) patients whose tumours were initially KRAS wild type developed
detectable mutations in KRAS in their sera, three of which developed multiple
different KRAS mutations. The appearance of these mutations was very consistent,
generally occurring between 5 and 6months following treatment. Mathematical modelling
indicated that the mutations were present in expanded subclones before the initiation
of panitumumab treatment. These results suggest that the emergence of KRAS mutations
is a mediator of acquired resistance to EGFR blockade and that these mutations
can be detected in a non-invasive manner. They explain why solid tumours develop
resistance to targeted therapies in a highly reproducible fashion.
author:
- first_name: Luis
full_name: Diaz Jr, Luis
last_name: Diaz Jr
- first_name: Richard
full_name: Williams, Richard
last_name: Williams
- first_name: Jian
full_name: Wu, Jian
last_name: Wu
- first_name: Isaac
full_name: Kinde, Isaac
last_name: Kinde
- first_name: Joel
full_name: Hecht, Joel
last_name: Hecht
- first_name: Jordan
full_name: Berlin, Jordan
last_name: Berlin
- first_name: Benjamin
full_name: Allen, Benjamin
last_name: Allen
- first_name: Ivana
full_name: Božić, Ivana
last_name: Božić
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
- first_name: Kenneth
full_name: Kinzler, Kenneth
last_name: Kinzler
- first_name: Kelly
full_name: Oliner, Kelly
last_name: Oliner
- first_name: Bert
full_name: Vogelstein, Bert
last_name: Vogelstein
citation:
ama: Diaz Jr L, Williams R, Wu J, et al. The molecular evolution of acquired resistance
to targeted EGFR blockade in colorectal cancers. Nature. 2012;486(7404):537-540.
doi:10.1038/nature11219
apa: Diaz Jr, L., Williams, R., Wu, J., Kinde, I., Hecht, J., Berlin, J., … Vogelstein,
B. (2012). The molecular evolution of acquired resistance to targeted EGFR blockade
in colorectal cancers. Nature. Nature Publishing Group. https://doi.org/10.1038/nature11219
chicago: Diaz Jr, Luis, Richard Williams, Jian Wu, Isaac Kinde, Joel Hecht, Jordan
Berlin, Benjamin Allen, et al. “The Molecular Evolution of Acquired Resistance
to Targeted EGFR Blockade in Colorectal Cancers.” Nature. Nature Publishing
Group, 2012. https://doi.org/10.1038/nature11219.
ieee: L. Diaz Jr et al., “The molecular evolution of acquired resistance
to targeted EGFR blockade in colorectal cancers,” Nature, vol. 486, no.
7404. Nature Publishing Group, pp. 537–540, 2012.
ista: Diaz Jr L, Williams R, Wu J, Kinde I, Hecht J, Berlin J, Allen B, Božić I,
Reiter J, Nowak M, Kinzler K, Oliner K, Vogelstein B. 2012. The molecular evolution
of acquired resistance to targeted EGFR blockade in colorectal cancers. Nature.
486(7404), 537–540.
mla: Diaz Jr, Luis, et al. “The Molecular Evolution of Acquired Resistance to Targeted
EGFR Blockade in Colorectal Cancers.” Nature, vol. 486, no. 7404, Nature
Publishing Group, 2012, pp. 537–40, doi:10.1038/nature11219.
short: L. Diaz Jr, R. Williams, J. Wu, I. Kinde, J. Hecht, J. Berlin, B. Allen,
I. Božić, J. Reiter, M. Nowak, K. Kinzler, K. Oliner, B. Vogelstein, Nature 486
(2012) 537–540.
date_created: 2018-12-11T12:01:43Z
date_published: 2012-06-28T00:00:00Z
date_updated: 2023-09-07T11:40:43Z
day: '28'
department:
- _id: KrCh
doi: 10.1038/nature11219
ec_funded: 1
external_id:
pmid:
- '22722843'
intvolume: ' 486'
issue: '7404'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3436069/
month: '06'
oa: 1
oa_version: Submitted Version
page: 537 - 540
pmid: 1
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: Nature
publication_status: published
publisher: Nature Publishing Group
publist_id: '3537'
quality_controlled: '1'
related_material:
record:
- id: '1400'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: The molecular evolution of acquired resistance to targeted EGFR blockade in
colorectal cancers
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 486
year: '2012'
...