Zobrazeno 1 - 10 of 64 pro vyhledávání: '"Sighireanu, Mihaela"'
1
Report
Deciding Separation Logic with Pointer Arithmetic and Inductive Definitions
Autor: Su, Wanyun, Wu, Zhilin, Sighireanu, Mihaela
Pointer arithmetic is widely used in low-level programs, e.g. memory allocators. The specification of such programs usually requires using pointer arithmetic inside inductive definitions to define the common data structures, e.g. heap lists in memory
Externí odkaz: http://arxiv.org/abs/2403.01867
Zobrazit plný text záznamu
2
Report
Hierarchical Shape Abstraction for Analysis of Free-List Memory Allocators
Autor: Fang, Bin, Sighireanu, Mihaela
We propose a hierarchical abstract domain for the analysis of free-list memory allocators that tracks shape and numerical properties about both the heap and the free lists. Our domain is based on Separation Logic extended with predicates that capture
Externí odkaz: http://arxiv.org/abs/1608.05676
Zobrazit plný text záznamu
3
Report
On Automated Lemma Generation for Separation Logic with Inductive Definitions
Autor: Enea, Constantin, Sighireanu, Mihaela, Wu, Zhilin
Separation Logic with inductive definitions is a well-known approach for deductive verification of programs that manipulate dynamic data structures. Deciding verification conditions in this context is usually based on user-provided lemmas relating th
Externí odkaz: http://arxiv.org/abs/1507.05581
Zobrazit plný text záznamu
4
Report
A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes
Autor: Bouajjani, Ahmed, Dragoi, Cezara, Enea, Constantin, Jurski, Yan, Sighireanu, Mihaela
Publikováno v: Logical Methods in Computer Science, Volume 5, Issue 2 (April 22, 2009) lmcs:991
We propose a framework for reasoning about unbounded dynamic networks of infinite-state processes. We propose Constrained Petri Nets (CPN) as generic models for these networks. They can be seen as Petri nets where tokens (representing occurrences of
Externí odkaz: http://arxiv.org/abs/0903.3126
Zobrazit plný text záznamu
5
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
6
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
8
Preface
Autor: Pichardie, David, Sighireanu, Mihaela
Preface
Electronic Communications of the EASST, Volume 76: Automated Verification of Critical Systems 2018 (AVoCS 2018)
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::8d3e2a7a6bcd34ad464ea228cc89daca
Zobrazit plný text záznamu
9
A Value-based Memory Model for Deductive Verification
Autor: Bouillaguet, Quentin, Bobot, François, Sighireanu, Mihaela, Yakobowski, Boris
Publikováno v: Les vingt-neuvièmes Journées Francophones des Langages Applicatifs (The 29th Francophone Days of Application Languages-JFLA 2018)
Les vingt-neuvièmes Journées Francophones des Langages Applicatifs (The 29th Francophone Days of Application Languages-JFLA 2018), Jan 2018, Banyuls-sur-mer, France
International audience; Collaboration of verification methods is crucial to tackle the challenging problem of software verification. This paper formalizes the collaboration between Eva, a static ana-lyzer, and WP, a deductive verification tool, both
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::e39b6c04a8e17f10da7eede9df2d62d2
https://hal-cea.archives-ouvertes.fr/cea-01809497
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje