Gotowe bibliografie tematyczne / Separation logic

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:

Spis treści

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"

1

Demri, Stéphane, i Raul Fervari. "The power of modal separation logics". Journal of Logic and Computation 29, nr 8 (grudzień 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 take into account the modal and separation features of MSL. For example, the satisfiability problem for the fragment of MSL with $\Diamond $, the difference modality $\langle \neq \rangle $ and separating conjunction $\ast $ is shown Tower-complete whereas the restriction either to $\Diamond $ and $\ast $ or to $\langle \neq \rangle $ and $\ast $ is only NP-complete. We establish that the full logic MSL admits an undecidable satisfiability problem. Furthermore, we investigate variants of MSL with alternative semantics and we build bridges with interval temporal logics and with logics equipped with sabotage operators.
Style APA, Harvard, Vancouver, ISO itp.
2

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Dardinier, Thibault, Peter Müller i Alexander J. Summers. "Fractional resources in unbounded separation logic". Proceedings of the ACM on Programming Languages 6, OOPSLA2 (31.10.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 into one larger fraction. Existing formal semantics incorporating fractional assertions into a separation logic define multiplication semantically (via models), resulting in a semantics in which distributivity and combinability do not hold for key resource assertions such as magic wands, and fractions cannot be factored out from a separating conjunction. By contrast, existing automatic separation logic verifiers define multiplication syntactically, resulting in a different semantics for which it is unknown whether distributivity and combinability hold for all assertions. In this paper, we present a novel semantics for separation logic assertions that allows states to hold more than a full permission to a heap location during the evaluation of an assertion. By reimposing upper bounds on the permissions held per location at statement boundaries, we retain key properties of separation logic, in particular, the frame rule. Our assertion semantics unifies semantic and syntactic multiplication and thereby reconciles the discrepancy between separation logic theory and tools and enjoys distributivity, factorisability, and combinability. We have formalised our semantics and proved its properties in Isabelle/HOL.
Style APA, Harvard, Vancouver, ISO itp.
4

Brookes, Stephen, i Peter W. O'Hearn. "Concurrent separation logic". ACM SIGLOG News 3, nr 3 (8.08.2016): 47–65. http://dx.doi.org/10.1145/2984450.2984457.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Vafeiadis, Viktor, i Chinmay Narayan. "Relaxed separation logic". ACM SIGPLAN Notices 48, nr 10 (12.11.2013): 867–84. http://dx.doi.org/10.1145/2544173.2509532.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Yang, Hongseok. "Relational separation logic". Theoretical Computer Science 375, nr 1-3 (maj 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.
7

Dang, H. H., P. Höfner i B. Möller. "Algebraic separation logic". Journal of Logic and Algebraic Programming 80, nr 6 (sierpień 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.
8

Courtault, J. R., H. van Ditmarsch i D. Galmiche. "A public announcement separation logic". Mathematical Structures in Computer Science 29, nr 06 (15.04.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.
9

Demri, Stéphane, Etienne Lozes i Alessio Mansutti. "The Effects of Adding Reachability Predicates in Quantifier-Free Separation Logic". ACM Transactions on Computational Logic 22, nr 2 (21.06.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 solved in polynomial space by using an appropriate abstraction for memory states, whereas the full extension is shown undecidable by reduction from first-order separation logic. Many variants of the logic and fragments are also investigated from the computational point of view when ls is added, providing numerous results about adding reachability predicates to quantifier-free separation logic.
Style APA, Harvard, Vancouver, ISO itp.
10

Timany, Amin, Simon Oddershede Gregersen, Léo Stefanesco, Jonas Kastberg Hinrichsen, Léon Gondelman, Abel Nieto i Lars Birkedal. "Trillium: Higher-Order Concurrent and Distributed Separation Logic for Intensional Refinement". Proceedings of the ACM on Programming Languages 8, POPL (5.01.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 Trillium, a language-agnostic separation logic framework for showing intensional refinement relations between traces of a program and a model. We instantiate Trillium with a concurrent language and develop Fairis, a concurrent separation logic, that we use to show liveness properties of concurrent programs under fair scheduling assumptions through a fair liveness-preserving refinement of a model. We also instantiate Trillium with a distributed language and obtain an extension of Aneris, a distributed separation logic, which we use to show refinement relations between distributed systems and TLA+ models.
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Rozprawy doktorskie na temat "Separation logic"

1

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 enable local reasoning about abstract data. Such data can be split up with structural addresses. Structural addresses allow sub-data (e.g. a sub-tree within a tree) to be abstractly allocated, promoting the sub-data to an abstract heap cell. This cell can be analysed in isolation, then re-joined with the original data. We show how the tight footprints this allows can be refined further with promises, which enable abstract heap cells to retain information about the context from which they were allocated. We prove that our approach is sound with respect to a standard Hoare logic. We study two large examples. Firstly, we present an axiomatic semantics for the Docu- ment Object Model in structural separation logic. We demonstrate how structural separa- tion logic allows abstract reasoning about the DOM tree using tighter footprints than were possible in previous work. Secondly, we give a novel presentation of the POSIX file system library. We identify a subset of the large POSIX standard that focuses on the file system, including commands that manipulate both the file heap and the directory structure. Axioms for this system are given using structural separation logic. As file system resources are typically identified by paths, we use promises to give tight footprints to commands, so that that they do not require all the resource needed to explain paths being used. We demonstrate our reasoning using a software installer example.
Style APA, Harvard, Vancouver, ISO itp.
2

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:

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-agnostic, global view of the heap that affords both fast verification and light-weight annotation of invariants holding over the entire program. Separation logic, in contrast, provides an alias-aware, local view of the heap in which invariants can vary at each program point. In this work, I show how type systems and separation logic can be safely and efficiently combined. The result is type-intertwined separation logic, an analysis that applies traditional type-based reasoning to some regions of the program and separation logic to others---converting between analysis representations at region boundaries---and summarizes some portions of the heap with coarse type invariants and others with precise separation logic invariants. The key challenge that this dissertation addresses is the communication and preservation of heap invariants between analyses. I tackle this challenge with two core contributions. The first is type-consistent summarization and materialization, which enables type-intertwined separation logic to both leverage and selectively violate the global type invariant. This mechanism allows the analysis to efficiently and precisely verify invariants that hold almost everywhere. Second, I describe gated separating conjunction, a non-commutative strengthening of standard separating conjunction that expresses local dis-pointing relationships between sub-heaps. Gated separation enables local heap reasoning by permitting the separation logic to frame out portions of memory and prevent the type system from interfering with its contents---an operation that would be unsound in type-intertwined analysis with only standard separating conjunction. With these two contributions, type-intertwined separation logic combines the benefits of both type-like global reasoning and separation-logic-style local reasoning in a single analysis.

Style APA, Harvard, Vancouver, ISO itp.
3

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.
4

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.
5

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.
6

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 structures, due to the lack of an automated analysis that disambiguates pointer-based memory accesses. This thesis takes a step towards closing this gap. We explore recent advances in separation logic, a rigorous mathematical framework that enables formal reasoning about the memory access of heap-manipulating programs. We develop a static analysis that automatically splits heap-allocated data structures into provably disjoint regions. Our algorithm focuses on dynamic data structures accessed in loops and is accompanied by automated source-to-source transformations which enable loop parallelisation and physical memory partitioning by off-the-shelf HLS tools. We then extend the scope of our technique to pointer-based memory-intensive implementations that require access to an off-chip memory. The extended HLS design aid generates parallel on-chip multi-cache architectures. It uses the disjointness property of memory accesses to support non-overlapping memory regions by private caches. It also identifies regions which are shared after parallelisation and which are supported by parallel caches with a coherency mechanism and synchronisation, resulting in automatically specialised memory systems. We show up to 15x acceleration from heap partitioning, parallelisation and the insertion of the custom cache system in demonstrably practical applications.
Style APA, Harvard, Vancouver, ISO itp.
7

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 expressive power of this logic, comparing it to second-order logics. Secondly, we try to extend decidable subsets of separation logic with a temporal logic, and with the ability to describe data. This allows us to give boundaries to the use of separation logic. In particular, we give boundaries to the creation of decidable logics using this logic combined with a temporal logic or with the ability to describe data.
Style APA, Harvard, Vancouver, ISO itp.
8

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.
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.
9

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, which exhibits some of the structure of a Concurrent Kleene Algebra, an algebra where operators for parallel and sequential composition are linked by a version of the exchange law from category theory. The model connects the algebraic notions to locality concepts that underlie Separation Logic. We then move on to provide a more general construction of an algebra model of BCSL, which can be built from (Baby) Session Types. Thus, we end up with a model that brings together concepts from all of Session Types, Separation Logic, and Concurrent Kleene Algebra. Thus, the model links diverse models of concurrency. In addition to this it suggests alterations of the algebraic axioms as well as the foundational models underlying Separation Logic. It is hoped that, apart from these specific results, this dissertation can in some modest way contribute to unification in concurrency theory, a theory (or theories) based presently on diverse models.
Style APA, Harvard, Vancouver, ISO itp.
10

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 the union-find disjoint set algorithm.
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Książki na temat "Separation logic"

1

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.
2

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.
3

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.
4

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.
5

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.
6

Andrichenko, Lyudmila, A. Postnikov, L. Vasil'eva, Zh Gaunova, E. Nikitina i 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 are identified, the trends of constitutional transformations in the spheres of federal relations and local self-government, ensuring the fulfillment by public authorities of international obligations of the Russian Federation are investigated. Particular attention is paid to the development of the legal mechanism of interaction between public authorities and civil society. The authors of the book take into account the results of legislative support for the reform of public power in 2020-2021, a forecast assessment of the implementation of the relevant constitutional and legislative novelties is given, including taking into account the existing legal risks. Solutions are proposed to a number of legal issues of legislative regulation of public power, which can increase the efficiency of its functioning. For researchers, teachers, students and postgraduates, deputies of representative authorities, state and municipal employees, as well as anyone interested in constitutional law issues.
Style APA, Harvard, Vancouver, ISO itp.
7

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

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

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

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

de Figueiredo, Rui J. P., Tonja Jacobi i Barry R. Weingast. The New Separation‐of‐Powers Approach to American Politics. Redaktorzy Donald A. Wittman i 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.
10

Westphal, James, i 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 leaders and groups of constituents. There is even a separation between appearances and reality at the level of the governance system. Symbolic management comprises the agentic practices by which decoupling is maintained at different levels of the system, including internal and external communications by firm leaders that conform to prevailing cultural values. The symbolic management perspective not only provides an integrative, behavioral alternative to economic theories of governance such as agency theory, but it subsumes economic theory. Agency theory is reconceived as a historically contingent, institutional logic, or a set of cultural values, assumptions, and prescriptions that became taken for granted among key stakeholders for a period of time. We reveal a gradual shift in institutional logics of governance, away from the traditional agency logic, and toward an alternative “neo-corporate” logic that reinterprets agency prescriptions and drops fundamental economic assumptions of agency theory. Our theory and research ultimately demonstrate how the symbolic management activities of firm leaders have contributed to this historical shift in prevailing logics of governance.
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

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

1

Pagel, Jens, i Florian Zuleger. "Strong-Separation Logic". W 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.
2

O’Hearn, Peter. "Separation Logic Tutorial". W 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.
3

Dang, Han-Hing, i Bernhard Möller. "Transitive Separation Logic". W 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.
4

Jensen, Jonas Braband, i Lars Birkedal. "Fictional Separation Logic". W 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.
5

Courtault, Jean-René, Hans van Ditmarsch i Didier Galmiche. "An Epistemic Separation Logic". W 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.
6

Dang, Han-Hing, i Bernhard Möller. "Erratum: Transitive Separation Logic". W 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.
7

Nordio, Martin, Cristiano Calcagno i Bertrand Meyer. "Certificates and Separation Logic". W 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.
8

Dang, Han-Hing, Peter Höfner i Bernhard Möller. "Towards Algebraic Separation Logic". W 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.
9

Navarro Pérez, Juan Antonio, i Andrey Rybalchenko. "Separation Logic Modulo Theories". W 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.
10

Bornat, Richard. "Separation Logic and Concurrency". W 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"

1

Vafeiadis, Viktor, i Chinmay Narayan. "Relaxed separation logic". W 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.
2

Lu, Xu, Cong Tian i Zhenhua Duan. "Temporalising Separation Logic for Planning with Search Control Knowledge". W 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 AI planning. We show that PPTL^SL is decidable and present a decision procedure. With this basis, a planner namely S-TSolver for computing plans based on the spatio-temporal SCK expressed in PPTL^SL formulas is developed. Evaluation on some selected benchmark domains shows the effectiveness of S-TSolver.
Style APA, Harvard, Vancouver, ISO itp.
3

Appel, Andrew W. "Session details: Separation logic". W 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.
4

Parkinson, Matthew, i Gavin Bierman. "Separation logic and abstraction". W 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.
5

Yang, Hongseok. "Session details: Separation logic". W 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.
6

Walker, David. "Session details: Separation logic". W 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.
7

Krishnaswami, Neelakantan R., Jonathan Aldrich, Lars Birkedal, Kasper Svendsen i Alexandre Buisse. "Design patterns in separation logic". W 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.
8

Bengtson, Jesper. "Session Types Meet Separation Logic". W 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.
9

Tuch, Harvey, Gerwin Klein i Michael Norrish. "Types, bytes, and separation logic". W 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.
10

Bornat, Richard, Cristiano Calcagno, Peter O'Hearn i Matthew Parkinson. "Permission accounting in separation logic". W 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"

1

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Separation logic” dla poszczególnych typów źródeł:
Artykuły w czasopismach Rozprawy doktorskie Książki
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!

Do bibliografii