GLORIA

GEOMAR Library Ocean Research Information Access

X

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Intracellular Localization Map of Human Herpesvirus 8 Proteins
    American Society for Microbiology ; 2008
    In:  Journal of Virology Vol. 82, No. 4 ( 2008-02-15), p. 1908-1922
    Details
    In: Journal of Virology, American Society for Microbiology, Vol. 82, No. 4 ( 2008-02-15), p. 1908-1922
    Abstract: Human herpesvirus 8 (HHV-8) is the etiological agent of Kaposi's sarcoma. We present a localization map of 85 HHV-8-encoded proteins in mammalian cells. Viral open reading frames were cloned with a Myc tag in expression plasmids, confirmed by full-length sequencing, and expressed in HeLa cells. Protein localizations were analyzed by immunofluorescence microscopy. Fifty-one percent of all proteins were localized in the cytoplasm, 22% were in the nucleus, and 27% were found in both compartments. Surprisingly, we detected viral FLIP (v-FLIP) in the nucleus and in the cytoplasm, whereas cellular FLIPs are generally localized exclusively in the cytoplasm. This suggested that v-FLIP may exert additional or alternative functions compared to cellular FLIPs. In addition, it has been shown recently that the K10 protein can bind to at least 15 different HHV-8 proteins. We noticed that K10 and only five of its 15 putative binding factors were localized in the nucleus when the proteins were expressed in HeLa cells individually. Interestingly, in coexpression experiments K10 colocalized with 87% (13 of 15) of its putative binding partners. Colocalization was induced by translocation of either K10 alone or both proteins. These results indicate active intracellular translocation processes in virus-infected cells. Specifically in this framework, the localization map may provide a useful reference to further elucidate the function of HHV-8-encoded genes in human diseases.
    Type of Medium: Online Resource
    ISSN: 0022-538X , 1098-5514
    URL: Article
    DOI: 10.1128/JVI.01716-07
    Language: English
    Publisher: American Society for Microbiology
    Publication Date: 2008
    detail.hit.zdb_id: 1495529-5
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 2
    Online Resource
    Online Resource
    Complete instantiation-based interpolation
    Association for Computing Machinery (ACM) ; 2013
    In:  ACM SIGPLAN Notices Vol. 48, No. 1 ( 2013-01-23), p. 537-548
    Details
    In: ACM SIGPLAN Notices, Association for Computing Machinery (ACM), Vol. 48, No. 1 ( 2013-01-23), p. 537-548
    Abstract: Craig interpolation has been a valuable tool for formal methods with interesting applications in program analysis and verification. Modern SMT solvers implement interpolation procedures for the theories that are most commonly used in these applications. However, many application-specific theories remain unsupported, which limits the class of problems to which interpolation-based techniques apply. In this paper, we present a generic framework to build new interpolation procedures via reduction to existing interpolation procedures. We consider the case where an application-specific theory can be formalized as an extension of a base theory with additional symbols and axioms. Our technique uses finite instantiation of the extension axioms to reduce an interpolation problem in the theory extension to one in the base theory. We identify a model-theoretic criterion that allows us to detect the cases where our technique is complete. We discuss specific theories that are relevant in program verification and that satisfy this criterion. In particular, we obtain complete interpolation procedures for theories of arrays and linked lists. The latter is the first complete interpolation procedure for a theory that supports reasoning about complex shape properties of heap-allocated data structures. We have implemented this procedure in a prototype on top of existing SMT solvers and used it to automatically infer loop invariants of list-manipulating programs.
    Type of Medium: Online Resource
    ISSN: 0362-1340 , 1558-1160
    URL: Article
    DOI: 10.1145/2480359.2429132
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2013
    detail.hit.zdb_id: 2079194-X
    detail.hit.zdb_id: 282422-X
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 3
    Online Resource
    Online Resource
    Complete Instantiation-Based Interpolation
    Springer Science and Business Media LLC ; 2016
    In:  Journal of Automated Reasoning Vol. 57, No. 1 ( 2016-6), p. 37-65
    Details
    In: Journal of Automated Reasoning, Springer Science and Business Media LLC, Vol. 57, No. 1 ( 2016-6), p. 37-65
    Type of Medium: Online Resource
    ISSN: 0168-7433 , 1573-0670
    URL: Article
    DOI: 10.1007/s10817-016-9371-7
    RVK:
    EQ 1000
    Language: English
    Publisher: Springer Science and Business Media LLC
    Publication Date: 2016
    detail.hit.zdb_id: 1479376-3
    SSG: 7,11
    SSG: 17,1
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 4
    Online Resource
    Online Resource
    Tire technology in target conflict of rolling resistance and wet grip
    Springer Science and Business Media LLC ; 2010
    In:  ATZ worldwide Vol. 112, No. 7-8 ( 2010-7), p. 26-32
    Details
    In: ATZ worldwide, Springer Science and Business Media LLC, Vol. 112, No. 7-8 ( 2010-7), p. 26-32
    Type of Medium: Online Resource
    ISSN: 2192-9076
    URL: Article
    DOI: 10.1007/BF03225250
    Language: English
    Publisher: Springer Science and Business Media LLC
    Publication Date: 2010
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 5
    Online Resource
    Online Resource
    Modern Metal-on-metal Hip Resurfacing
    Ovid Technologies (Wolters Kluwer Health) ; 2010
    In:  American Academy of Orthopaedic Surgeon Vol. 18, No. 5 ( 2010-05), p. 306-314
    Details
    In: American Academy of Orthopaedic Surgeon, Ovid Technologies (Wolters Kluwer Health), Vol. 18, No. 5 ( 2010-05), p. 306-314
    Type of Medium: Online Resource
    ISSN: 1067-151X
    URL: Article
    DOI: 10.5435/00124635-201005000-00007
    Language: English
    Publisher: Ovid Technologies (Wolters Kluwer Health)
    Publication Date: 2010
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 6
    Online Resource
    Online Resource
    Verifying concurrent multicopy search structures
    Association for Computing Machinery (ACM) ; 2021
    In:  Proceedings of the ACM on Programming Languages Vol. 5, No. OOPSLA ( 2021-10-20), p. 1-32
    Details
    In: Proceedings of the ACM on Programming Languages, Association for Computing Machinery (ACM), Vol. 5, No. OOPSLA ( 2021-10-20), p. 1-32
    Abstract: Multicopy search structures such as log-structured merge (LSM) trees are optimized for high insert/update/delete (collectively known as upsert) performance. In such data structures, an upsert on key k , which adds ( k , v ) where v can be a value or a tombstone, is added to the root node even if k is already present in other nodes. Thus there may be multiple copies of k in the search structure. A search on k aims to return the value associated with the most recent upsert. We present a general framework for verifying linearizability of concurrent multicopy search structures that abstracts from the underlying representation of the data structure in memory, enabling proof-reuse across diverse implementations. Based on our framework, we propose template algorithms for (a) LSM structures forming arbitrary directed acyclic graphs and (b) differential file structures, and formally verify these templates in the concurrent separation logic Iris. We also instantiate the LSM template to obtain the first verified concurrent in-memory LSM tree implementation.
    Type of Medium: Online Resource
    ISSN: 2475-1421
    URL: Article
    DOI: 10.1145/3485490
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2021
    detail.hit.zdb_id: 2924207-1
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 7
    Online Resource
    Online Resource
    A concurrent program logic with a future and history
    Association for Computing Machinery (ACM) ; 2022
    In:  Proceedings of the ACM on Programming Languages Vol. 6, No. OOPSLA2 ( 2022-10-31), p. 1378-1407
    Details
    In: Proceedings of the ACM on Programming Languages, Association for Computing Machinery (ACM), Vol. 6, No. OOPSLA2 ( 2022-10-31), p. 1378-1407
    Abstract: Verifying fine-grained optimistic concurrent programs remains an open problem. Modern program logics provide abstraction mechanisms and compositional reasoning principles to deal with the inherent complexity. However, their use is mostly confined to pencil-and-paper or mechanized proofs. We devise a new separation logic geared towards the lacking automation. While local reasoning is known to be crucial for automation, we are the first to show how to retain this locality for (i) reasoning about inductive properties without the need for ghost code, and (ii) reasoning about computation histories in hindsight. We implemented our new logic in a tool and used it to automatically verify challenging concurrent search structures that require inductive properties and hindsight reasoning, such as the Harris set.
    Type of Medium: Online Resource
    ISSN: 2475-1421
    URL: Article
    DOI: 10.1145/3563337
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2022
    detail.hit.zdb_id: 2924207-1
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 8
    Online Resource
    Online Resource
    Embedding Hindsight Reasoning in Separation Logic
    Association for Computing Machinery (ACM) ; 2023
    In:  Proceedings of the ACM on Programming Languages Vol. 7, No. PLDI ( 2023-06-06), p. 1848-1871
    Details
    In: Proceedings of the ACM on Programming Languages, Association for Computing Machinery (ACM), Vol. 7, No. PLDI ( 2023-06-06), p. 1848-1871
    Abstract: Automatically proving linearizability of concurrent data structures remains a key challenge for verification. We present temporal interpolation as a new proof principle to guide automated proof search using hindsight arguments within concurrent separation logic. Temporal interpolation offers an easy-to-automate alternative to prophecy variables and has the advantage of structuring proofs into easy-to-discharge hypotheses. Additionally, we advance hindsight theory by integrating it into a program logic, bringing formal rigor and complementary proof machinery. We substantiate the usefulness of temporal interpolation by implementing it in a tool and using it to automatically verify the Logical Ordering tree. The proof is challenging due to future-dependent linearization points and complex structure overlays. It is the first formal proof of this data structure. Interestingly, our formalization revealed an unknown bug and an existing informal proof as erroneous.
    Type of Medium: Online Resource
    ISSN: 2475-1421
    URL: Article
    DOI: 10.1145/3591296
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2023
    detail.hit.zdb_id: 2924207-1
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 9
    Online Resource
    Online Resource
    American Academy of Orthopaedic Surgeons Clinical Practice Guideline on : The Diagnosis of Periprosthetic Joint Infections of the Hip and Knee
    Ovid Technologies (Wolters Kluwer Health) ; 2011
    In:  Journal of Bone and Joint Surgery Vol. 93, No. 14 ( 2011-7-20), p. 1355-1357
    Details
    In: Journal of Bone and Joint Surgery, Ovid Technologies (Wolters Kluwer Health), Vol. 93, No. 14 ( 2011-7-20), p. 1355-1357
    Type of Medium: Online Resource
    ISSN: 0021-9355 , 1535-1386
    URL: Article
    DOI: 10.2106/JBJS.9314ebo
    RVK:
    XA 52200.A
    Language: English
    Publisher: Ovid Technologies (Wolters Kluwer Health)
    Publication Date: 2011
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 10
    Online Resource
    Online Resource
    A Systems Biology Approach To Identify the Combination Effects of Human Herpesvirus 8 Genes on NF-κB Activation
    American Society for Microbiology ; 2009
    In:  Journal of Virology Vol. 83, No. 6 ( 2009-03-15), p. 2563-2574
    Details
    In: Journal of Virology, American Society for Microbiology, Vol. 83, No. 6 ( 2009-03-15), p. 2563-2574
    Abstract: Human herpesvirus 8 (HHV-8) is the etiologic agent of Kaposi's sarcoma and primary effusion lymphoma. Activation of the cellular transcription factor nuclear factor-kappa B (NF-κB) is essential for latent persistence of HHV-8, survival of HHV-8-infected cells, and disease progression. We used reverse-transfected cell microarrays (RTCM) as an unbiased systems biology approach to systematically analyze the effects of HHV-8 genes on the NF-κB signaling pathway. All HHV-8 genes individually ( n = 86) and, additionally, all K and latent genes in pairwise combinations ( n = 231) were investigated. Statistical analyses of more than 14,000 transfections identified ORF75 as a novel and confirmed K13 as a known HHV-8 activator of NF-κB. K13 and ORF75 showed cooperative NF-κB activation. Small interfering RNA-mediated knockdown of ORF75 expression demonstrated that this gene contributes significantly to NF-κB activation in HHV-8-infected cells. Furthermore, our approach confirmed K10.5 as an NF-κB inhibitor and newly identified K1 as an inhibitor of both K13- and ORF75-mediated NF-κB activation. All results obtained with RTCM were confirmed with classical transfection experiments. Our work describes the first successful application of RTCM for the systematic analysis of pathofunctions of genes of an infectious agent. With this approach, ORF75 and K1 were identified as novel HHV-8 regulatory molecules on the NF-κB signal transduction pathway. The genes identified may be involved in fine-tuning of the balance between latency and lytic replication, since this depends critically on the state of NF-κB activity.
    Type of Medium: Online Resource
    ISSN: 0022-538X , 1098-5514
    URL: Article
    DOI: 10.1128/JVI.01512-08
    Language: English
    Publisher: American Society for Microbiology
    Publication Date: 2009
    detail.hit.zdb_id: 1495529-5
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...