Gotowe bibliografie tematyczne / Separation logic

Spis treści

Artykuły w czasopismach
Rozprawy doktorskie
Książki
Części książek
Streszczenia konferencji
Raporty organizacyjne

Gotowa bibliografia na temat „Separation logic”

Autor: Grafiati

Data publikacji: 4 czerwca 2021

Data aktualizacji: 25 maja 2024

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Separation logic”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Separation logic"

Demri, Stéphane, and Raul Fervari. "The power of modal separation logics." Journal of Logic and Computation 29, no. 8 (December 2019): 1139–84. http://dx.doi.org/10.1093/logcom/exz019.

Pełny tekst źródła

Streszczenie:

Abstract We introduce a modal separation logic MSL whose models are memory states from separation logic and the logical connectives include modal operators as well as separating conjunction and implication from separation logic. With such a combination of operators, some fragments of MSL can be seen as genuine modal logics whereas some others capture standard separation logics, leading to an original language to speak about memory states. We analyse the decidability status and the computational complexity of several fragments of MSL, obtaining surprising results by design of proof methods that

Style APA, Harvard, Vancouver, ISO itp.

O'Hearn, Peter. "Separation logic." Communications of the ACM 62, no. 2 (January 28, 2019): 86–95. http://dx.doi.org/10.1145/3211968.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Dardinier, Thibault, Peter Müller, and Alexander J. Summers. "Fractional resources in unbounded separation logic." Proceedings of the ACM on Programming Languages 6, OOPSLA2 (October 31, 2022): 1066–92. http://dx.doi.org/10.1145/3563326.

Pełny tekst źródła

Streszczenie:

Many separation logics support fractional permissions to distinguish between read and write access to a heap location, for instance, to allow concurrent reads while enforcing exclusive writes. Fractional permissions extend to composite assertions such as (co)inductive predicates and magic wands by allowing those to be multiplied by a fraction. Typical separation logic proofs require that this multiplication has three key properties: it needs to distribute over assertions, it should permit fractions to be factored out from assertions, and two fractions of the same assertion should be combinable

Style APA, Harvard, Vancouver, ISO itp.

Brookes, Stephen, and Peter W. O'Hearn. "Concurrent separation logic." ACM SIGLOG News 3, no. 3 (August 8, 2016): 47–65. http://dx.doi.org/10.1145/2984450.2984457.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Vafeiadis, Viktor, and Chinmay Narayan. "Relaxed separation logic." ACM SIGPLAN Notices 48, no. 10 (November 12, 2013): 867–84. http://dx.doi.org/10.1145/2544173.2509532.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Yang, Hongseok. "Relational separation logic." Theoretical Computer Science 375, no. 1-3 (May 2007): 308–34. http://dx.doi.org/10.1016/j.tcs.2006.12.036.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Dang, H. H., P. Höfner, and B. Möller. "Algebraic separation logic." Journal of Logic and Algebraic Programming 80, no. 6 (August 2011): 221–47. http://dx.doi.org/10.1016/j.jlap.2011.04.003.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Courtault, J. R., H. van Ditmarsch, and D. Galmiche. "A public announcement separation logic." Mathematical Structures in Computer Science 29, no. 06 (April 15, 2019): 828–71. http://dx.doi.org/10.1017/s0960129518000348.

Pełny tekst źródła

Streszczenie:

AbstractWe define a Public Announcement Separation Logic (PASL) that allows us to consider epistemic possible worlds as resources that can be shared or separated, in the spirit of separation logics. After studying its semantics and illustrating its interest for modelling systems, we provide a sound and complete tableau calculus that deals with resource, agent and announcement constraints and give also a countermodel extraction method.

Style APA, Harvard, Vancouver, ISO itp.

Demri, Stéphane, Etienne Lozes, and Alessio Mansutti. "The Effects of Adding Reachability Predicates in Quantifier-Free Separation Logic." ACM Transactions on Computational Logic 22, no. 2 (June 21, 2021): 1–56. http://dx.doi.org/10.1145/3448269.

Pełny tekst źródła

Streszczenie:

The list segment predicate ls used in separation logic for verifying programs with pointers is well suited to express properties on singly-linked lists. We study the effects of adding ls to the full quantifier-free separation logic with the separating conjunction and implication, which is motivated by the recent design of new fragments in which all these ingredients are used indifferently and verification tools start to handle the magic wand connective. This is a very natural extension that has not been studied so far. We show that the restriction without the separating implication can be solv

Style APA, Harvard, Vancouver, ISO itp.

Timany, Amin, Simon Oddershede Gregersen, Léo Stefanesco, Jonas Kastberg Hinrichsen, Léon Gondelman, Abel Nieto, and Lars Birkedal. "Trillium: Higher-Order Concurrent and Distributed Separation Logic for Intensional Refinement." Proceedings of the ACM on Programming Languages 8, POPL (January 5, 2024): 241–72. http://dx.doi.org/10.1145/3632851.

Pełny tekst źródła

Streszczenie:

Expressive state-of-the-art separation logics rely on step-indexing to model semantically complex features and to support modular reasoning about imperative higher-order concurrent and distributed programs. Step- indexing comes, however, with an inherent cost: it restricts the adequacy theorem of program logics to a fairly simple class of safety properties. In this paper, we explore if and how intensional refinement is a viable methodology for strengthening higher-order concurrent (and distributed) separation logic to prove non-trivial safety and liveness properties. Specifically, we introduce

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Rozprawy doktorskie na temat "Separation logic"

Wright, Adam. "Structural separation logic." Thesis, Imperial College London, 2013. http://hdl.handle.net/10044/1/17838.

Pełny tekst źródła

Streszczenie:

This thesis presents structural separation logic, a novel program reasoning approach for software that manipulates both standard heaps and structured data such as lists and trees. Structural separation logic builds upon existing work in both separation logic and context logic. It considers data abstractly, much as it is exposed by library interfaces, ignoring implementation details. We provide a programming language that works over structural heaps, which are similar to standard heaps but allow data to be stored in an abstract form. We introduce abstract heaps, which extend structural heaps to

Style APA, Harvard, Vancouver, ISO itp.

Coughlin, Devin. "Type-Intertwined Separation Logic." Thesis, University of Colorado at Boulder, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=3704668.

Pełny tekst źródła

Streszczenie:

<p>Static program analysis can improve programmer productivity and software reliability by definitively ruling out entire classes of programmer mistakes. For mainstream imperative languages such as C, C++, and Java, static analysis about the heap---memory that is dynamically allocated at run time---is particularly challenging because heap memory acts as global, mutable state. This dissertation describes how to soundly combine two static analyses that each take vastly different approaches to reasoning about the heap: type systems and separation logic. Traditional type systems take an alias-agno

Style APA, Harvard, Vancouver, ISO itp.

Sims, Elodie-Jane. "Pointer analysis and separation logic." Diss., Manhattan, Kan. : Kansas State University, 2007. http://hdl.handle.net/2097/506.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Raza, Mohammad. "Resource Reasoning and Labelled Separation Logic." Thesis, Imperial College London, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.523755.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Tuerk, Thomas. "A separation logic framework for HOL." Thesis, University of Cambridge, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.609585.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Winterstein, Felix. "Separation logic for high-level synthesis." Thesis, Imperial College London, 2016. http://hdl.handle.net/10044/1/33371.

Pełny tekst źródła

Streszczenie:

High-level synthesis (HLS) promises a significant shortening of the digital hardware design cycle by raising the abstraction level of the design entry to high-level languages such as C/C++. However, applications using dynamic, pointer-based data structures remain difficult to implement well, yet such constructs are widely used in software. Automated optimisations that leverage the memory bandwidth of dedicated hardware implementations by distributing the application data over separate on-chip memories and parallelise the implementation are often ineffective in the presence of dynamic data stru

Style APA, Harvard, Vancouver, ISO itp.

Brochenin, Rémi. "Separation logic : expressiveness, complexity, temporal extension." Phd thesis, École normale supérieure de Cachan - ENS Cachan, 2013. http://tel.archives-ouvertes.fr/tel-00956587.

Pełny tekst źródła

Streszczenie:

This thesis studies logics which express properties on programs. These logics were originally intended for the formal verification of programs with pointers. Overall, no automated verification method will be proved tractable here- rather, we give a new insight on separation logic. The complexity and decidability of some essential fragments of this logic for Hoare triples were not known before this work. Also, its combination with some other verification methods was little studied. Firstly, in this work we isolate the operator of separation logic which makes it undecidable. We describe the expr

Style APA, Harvard, Vancouver, ISO itp.

Long, Byron L. "Validity in a variant of separation logic." [Bloomington, Ind.] : Indiana University, 2009. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3378369.

Pełny tekst źródła

Streszczenie:

Thesis (Ph.D.)--Indiana University, Dept. of Computer Science, 2009.<br>Title from PDF t.p. (viewed on Jul 9, 2010). Source: Dissertation Abstracts International, Volume: 70-10, Section: B, page: 6348. Adviser: Daniel Leivant.

Style APA, Harvard, Vancouver, ISO itp.

Hussain, Akbar. "Session types, concurrent separation logic & algebra." Thesis, Queen Mary, University of London, 2013. http://qmro.qmul.ac.uk/xmlui/handle/123456789/8503.

Pełny tekst źródła

Streszczenie:

This dissertion explores the relation between two formalisms and one algebraic framework for concurrency. Session Types and Concurrent Separation Logic are formalisms that support independent reasoning about concurrent processes, and our motivating question is whether their modularity springs from the same source despite the distance between their models. We first translate a small language we call Baby Session Types (BST), into a ‘basic’ version of Concurrent Separation Logic (BCSL), and we show that the translation is sound. We then describe a model for Separation Logic (SL) based on Actions

Style APA, Harvard, Vancouver, ISO itp.

Krishnaswami, Neelakantan R. "Verifying Higher-Order Imperative Programs with Higher-Order Separation Logic." Research Showcase @ CMU, 2012. http://repository.cmu.edu/dissertations/164.

Pełny tekst źródła

Streszczenie:

In this thesis I show is that it is possible to give modular correctness proofs of interesting higher-order imperative programs using higher-order separation logic. To do this, I develop a model higher-order imperative programming language, and develop a program logic for it. I demonstrate the power of my program logic by verifying a series of examples. This includes both realistic patterns of higher-order imperative programming such as the subject-observer pattern, as well as examples demonstrating the use of higher-order logic to reason modularly about highly aliased data structures such as

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Książki na temat "Separation logic"

Winterstein, Felix. Separation Logic for High-level Synthesis. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-53222-6.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Feldman, Daniel L. The logic of American government: Applying the Constitution to the contemporary world. New York: Morrow, 1990.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Logics of separation: Exile and transcendence in aesthetic modernity. New York: Peter Lang, 2010.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Stone-Richards, Michael. Logics of separation: Exile and transcendence in aesthetic modernity. New York: Peter Lang, 2010.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Masella, Maria Grazia. Dall'altare al tribunale: Per una nuova logica della separazione. Milano: Feltrinelli, 2003.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Andrichenko, Lyudmila, A. Postnikov, L. Vasil'eva, Zh Gaunova, E. Nikitina, and Inna Plyugina. Reform of the organization of public power: the main directions of implementation. ru: INFRA-M Academic Publishing LLC., 2021. http://dx.doi.org/10.12737/1839416.

Pełny tekst źródła

Streszczenie:

The monograph examines topical issues of reforming the organization of public power in our country in connection with the adoption in 2020 of the Law on Amendments to the Constitution of the Russian Federation. The logic of changes in the organization of public power and the directions of concretization of constitutional values, taking into account the laws of the development of the constitutional system of Russia, are revealed. The most significant characteristics of the updated model of interaction of federal public authorities in accordance with the principle of separation of powers a

Style APA, Harvard, Vancouver, ISO itp.

Winterstein, Felix. Separation Logic for High-level Synthesis. Springer, 2018.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Winterstein, Felix. Separation Logic for High-level Synthesis. Springer, 2017.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

de Figueiredo, Rui J. P., Tonja Jacobi, and Barry R. Weingast. The New Separation‐of‐Powers Approach to American Politics. Edited by Donald A. Wittman and Barry R. Weingast. Oxford University Press, 2009. http://dx.doi.org/10.1093/oxfordhb/9780199548477.003.0011.

Pełny tekst źródła

Streszczenie:

This article aims to elaborate on the logic of the new separation-of-powers approach and draw its implications for American politics. The first three sections in the article discuss the new separation of powers as it applies to the bureaucracy, the courts, and the presidency. A survey of a series of works that emphasize the new separation-of-powers approach to American politics is provided in the article as well.

Style APA, Harvard, Vancouver, ISO itp.

Westphal, James, and Sun Hyun Park. Symbolic Management. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780198792055.001.0001.

Pełny tekst źródła

Streszczenie:

This book presents the symbolic management perspective as a comprehensive, behavioral theory of corporate governance. It describes a pervasive pattern of symbolic decoupling, or separation between appearances and reality, at each level of the governance system. The processes of governance are less efficient or effective than they appear, at every level: from interpersonal relations within organizations, such as relations between chief executive officers and directors and between top managers and lower-level employees, between firm leaders and external stakeholders, and between communities of l

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Części książek na temat "Separation logic"

Pagel, Jens, and Florian Zuleger. "Strong-Separation Logic." In Programming Languages and Systems, 664–92. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72019-3_24.

Pełny tekst źródła

Streszczenie:

AbstractMost automated verifiers for separation logic are based on the symbolic-heap fragment, which disallows both the magic-wand operator and the application of classical Boolean operators to spatial formulas. This is not surprising, as support for the magic wand quickly leads to undecidability, especially when combined with inductive predicates for reasoning about data structures. To circumvent these undecidability results, we propose assigning a more restrictive semantics to the separating conjunction. We argue that the resulting logic, strong-separation logic, can be used for symbolic execution and abductive reasoning just like “standard” separation logic, while remaining decidable even in the presence of both the magic wand and the list-segment predicate—a combination of features that leads to undecidability for the standard semantics.

Style APA, Harvard, Vancouver, ISO itp.

O’Hearn, Peter. "Separation Logic Tutorial." In Logic Programming, 15–21. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-89982-2_6.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Dang, Han-Hing, and Bernhard Möller. "Transitive Separation Logic." In Relational and Algebraic Methods in Computer Science, 1–16. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33314-9_1.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Jensen, Jonas Braband, and Lars Birkedal. "Fictional Separation Logic." In Programming Languages and Systems, 377–96. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-28869-2_19.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Courtault, Jean-René, Hans van Ditmarsch, and Didier Galmiche. "An Epistemic Separation Logic." In Logic, Language, Information, and Computation, 156–73. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-47709-0_12.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Dang, Han-Hing, and Bernhard Möller. "Erratum: Transitive Separation Logic." In Relational and Algebraic Methods in Computer Science, E1—E3. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33314-9_24.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Nordio, Martin, Cristiano Calcagno, and Bertrand Meyer. "Certificates and Separation Logic." In Trustworthy Global Computing, 273–93. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-14128-2_16.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Dang, Han-Hing, Peter Höfner, and Bernhard Möller. "Towards Algebraic Separation Logic." In Relations and Kleene Algebra in Computer Science, 59–72. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04639-1_5.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Navarro Pérez, Juan Antonio, and Andrey Rybalchenko. "Separation Logic Modulo Theories." In Programming Languages and Systems, 90–106. Cham: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-03542-0_7.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Bornat, Richard. "Separation Logic and Concurrency." In Formal Methods: State of the Art and New Directions, 217–48. London: Springer London, 2009. http://dx.doi.org/10.1007/978-1-84882-736-3_7.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Separation logic"

Vafeiadis, Viktor, and Chinmay Narayan. "Relaxed separation logic." In SPLASH '13: Conference on Systems, Programming, and Applications: Software for Humanity. New York, NY, USA: ACM, 2013. http://dx.doi.org/10.1145/2509136.2509532.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Lu, Xu, Cong Tian, and Zhenhua Duan. "Temporalising Separation Logic for Planning with Search Control Knowledge." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/162.

Pełny tekst źródła

Streszczenie:

Temporal logics are widely adopted in Artificial Intelligence (AI) planning for specifying Search Control Knowledge (SCK). However, traditional temporal logics are limited in expressive power since they are unable to express spatial constraints which are as important as temporal ones in many planning domains. To this end, we propose a two-dimensional (spatial and temporal) logic namely PPTL^SL by temporalising separation logic with Propositional Projection Temporal Logic (PPTL). The new logic is well-suited for specifying SCK containing both spatial and temporal constraints which are useful in

Style APA, Harvard, Vancouver, ISO itp.

Appel, Andrew W. "Session details: Separation logic." In POPL '14: The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/3250020.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Parkinson, Matthew, and Gavin Bierman. "Separation logic and abstraction." In the 32nd ACM SIGPLAN-SIGACT sysposium. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1040305.1040326.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Yang, Hongseok. "Session details: Separation logic." In POPL '11: The 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. New York, NY, USA: ACM, 2011. http://dx.doi.org/10.1145/3252996.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Walker, David. "Session details: Separation logic." In POPL '13: The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. New York, NY, USA: ACM, 2013. http://dx.doi.org/10.1145/3260316.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Krishnaswami, Neelakantan R., Jonathan Aldrich, Lars Birkedal, Kasper Svendsen, and Alexandre Buisse. "Design patterns in separation logic." In the 4th international workshop. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1481861.1481874.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Bengtson, Jesper. "Session Types Meet Separation Logic." In the 2014 International Workshop. New York, New York, USA: ACM Press, 2014. http://dx.doi.org/10.1145/2631172.2631173.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Tuch, Harvey, Gerwin Klein, and Michael Norrish. "Types, bytes, and separation logic." In the 34th annual ACM SIGPLAN-SIGACT symposium. New York, New York, USA: ACM Press, 2007. http://dx.doi.org/10.1145/1190216.1190234.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Bornat, Richard, Cristiano Calcagno, Peter O'Hearn, and Matthew Parkinson. "Permission accounting in separation logic." In the 32nd ACM SIGPLAN-SIGACT sysposium. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1040305.1040327.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "Separation logic"

Strichman, Ofer, Sanjit A. Seshia, and Randal E. Bryant. Reducing Separation Formulas to Propositional Logic. Fort Belvoir, VA: Defense Technical Information Center, April 2003. http://dx.doi.org/10.21236/ada461197.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!