default search action
Mihaela Sighireanu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Julien Simonnet
, Matthieu Lemerre
A Dependent Nominal Physical Type System for Static Analysis of Memory in Low Level Code. Proc. ACM Program. Lang. 8(OOPSLA2): 30-59 (2024) - [c35]Tanguy Bozec, Nicolas Peltier
What Is Decidable in Separation Logic Beyond Progress, Connectivity and Establishment? IJCAR (2) 2024: 157-175 - [i4]Wanyun Su, Zhilin Wu, Mihaela Sighireanu:
Deciding Separation Logic with Pointer Arithmetic and Inductive Definitions. CoRR abs/2403.01867 (2024) - 2022
- [j9]Benedikt F. H. Becker
The CoLiS platform for the analysis of maintainer scripts in Debian software packages. Int. J. Softw. Tools Technol. Transf. 24(5): 717-733 (2022) - 2021
- [j8]Mihaela Sighireanu:
SL-COMP: competition of solvers for separation logic. Int. J. Softw. Tools Technol. Transf. 23(6): 895-903 (2021) - 2020
- [c34]Benedikt F. H. Becker
Analysing installation scenarios of Debian packages. TACAS (2) 2020: 235-253 - [e1]David Pichardie
Static Analysis - 27th International Symposium, SAS 2020, Virtual Event, November 18-20, 2020, Proceedings. Lecture Notes in Computer Science 12389, Springer 2020, ISBN 978-3-030-65473-3 [contents]
2010 – 2019
- 2019
- [c33]Ezio Bartocci
TOOLympics 2019: An Overview of Competitions in Formal Methods. TACAS (3) 2019: 3-24 - [c32]Mihaela Sighireanu, Juan Antonio Navarro Pérez, Andrey Rybalchenko, Nikos Gorogiannis, Radu Iosif, Andrew Reynolds, Cristina Serban, Jens Katelaan
SL-COMP: Competition of Solvers for Separation Logic. TACAS (3) 2019: 116-132 - [c31]Quentin Bouillaguet, François Bobot, Mihaela Sighireanu
Exploiting Pointer Analysis in Memory Models for Deductive Verification. VMCAI 2019: 160-182 - 2018
- [j7]Bin Fang, Mihaela Sighireanu, Geguang Pu, Wen Su, Jean-Raymond Abrial, Mengfei Yang, Lei Qiao:
Formal modelling of list based dynamic memory allocators. Sci. China Inf. Sci. 61(12): 122103:1-122103:16 (2018) - [j6]David Pichardie, Mihaela Sighireanu:
Preface. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 76 (2018) - [c30]Raphaël Cauderlier, Mihaela Sighireanu
A Verified Implementation of the Bounded List Container. TACAS (1) 2018: 172-189 - [i3]Quentin Bouillaguet, François Bobot, Mihaela Sighireanu, Boris Yakobowski:
Exploiting Pointer Analysis in Memory Models for Deductive Verification. CoRR abs/1811.12515 (2018) - 2017
- [j5]Constantin Enea, Ondrej Lengál
Compositional entailment checking for a fragment of separation logic. Formal Methods Syst. Des. 51(3): 575-607 (2017) - [c29]Bin Fang, Mihaela Sighireanu:
A refinement hierarchy for free list memory allocators. ISMM 2017: 104-114 - [c28]Constantin Enea, Ondrej Lengál
SPEN: A Solver for Separation Logic. NFM 2017: 302-309 - 2016
- [c27]Bin Fang, Mihaela Sighireanu:
Hierarchical Shape Abstraction for Analysis of Free List Memory Allocators. LOPSTR 2016: 151-167 - [i2]Bin Fang, Mihaela Sighireanu:
Hierarchical Shape Abstraction for Analysis of Free-List Memory Allocators. CoRR abs/1608.05676 (2016) - 2015
- [c26]Constantin Enea, Mihaela Sighireanu, Zhilin Wu:
On Automated Lemma Generation for Separation Logic with Inductive Definitions. ATVA 2015: 80-96 - [i1]Constantin Enea, Mihaela Sighireanu, Zhilin Wu:
On Automated Lemma Generation for Separation Logic with Inductive Definitions. CoRR abs/1507.05581 (2015) - 2014
- [j4]Mihaela Sighireanu, David R. Cok:
Report on SL-COMP 2014. J. Satisf. Boolean Model. Comput. 9(1): 173-186 (2014) - [c25]Constantin Enea, Ondrej Lengál, Mihaela Sighireanu, Tomás Vojnar:
Compositional Entailment Checking for a Fragment of Separation Logic. APLAS 2014: 314-333 - 2013
- [c24]Constantin Enea, Vlad Saveluc, Mihaela Sighireanu:
Compositional Invariant Checking for Overlaid and Nested Linked Lists. ESOP 2013: 129-148 - [c23]Cezara Dragoi, Constantin Enea, Mihaela Sighireanu:
Local Shape Analysis for Overlaid Data Structures. SAS 2013: 150-171 - 2012
- [c22]Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Mihaela Sighireanu:
Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data. ATVA 2012: 167-182 - [c21]Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Mihaela Sighireanu:
Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data. VMCAI 2012: 1-22 - 2011
- [c20]Julien Clément, Carole Delporte-Gallet, Hugues Fauconnier, Mihaela Sighireanu:
Guidelines for the Verification of Population Protocols. ICDCS 2011: 215-224 - [c19]Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Mihaela Sighireanu:
On inter-procedural analysis of programs with lists and data. PLDI 2011: 578-589 - 2010
- [c18]Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Ahmed Rezine, Mihaela Sighireanu:
Invariant Synthesis for Programs Manipulating Lists with Unbounded Data. CAV 2010: 72-88
2000 – 2009
- 2009
- [j3]Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Yan Jurski, Mihaela Sighireanu:
A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes. Log. Methods Comput. Sci. 5(2) (2009) - [c17]Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Mihaela Sighireanu:
A Logic-Based Framework for Reasoning about Composite Data Structures. CONCUR 2009: 178-195 - [c16]Ahmed Bouajjani, Cezara Dragoi, Yan Jurski, Mihaela Sighireanu:
Rewriting Systems over Nested Data Words. MEMICS 2009 - [c15]Yasmina Abdeddaïm, Eugene Asarin
Simple Algorithm for Simple Timed Games. TIME 2009: 99-106 - [c14]Mihaela Sighireanu, Tayssir Touili:
Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism. INFINITY 2009: 43-56 - 2007
- [c13]Yasmina Abdeddaïm, Eugene Asarin, Matthieu Gallien, Félix Ingrand, Charles Lesire, Mihaela Sighireanu:
Planning Robust Temporal Plans: A Comparison Between CBTP and TGA Approaches. ICAPS 2007: 2-9 - [c12]Gaël Patin, Mihaela Sighireanu, Tayssir Touili:
Spade: Verification of Multithreaded Dynamic and Recursive Programs. CAV 2007: 254-257 - [c11]Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Mihaela Sighireanu:
Rewriting Systems with Data. FCT 2007: 1-22 - [c10]Ahmed Bouajjani, Yan Jurski, Mihaela Sighireanu:
A Generic Framework for Reasoning About Dynamic Networks of Infinite-State Processes. TACAS 2007: 690-705 - 2003
- [j2]Radu Mateescu, Mihaela Sighireanu:
Efficient on-the-fly model-checking for regular alternation-free mu-calculus. Sci. Comput. Program. 46(3): 255-281 (2003) - [c9]Alain Girault, Hamoudi Kalla, Mihaela Sighireanu, Yves Sorel:
An Algorithm for Automatically Obtaining Distributed and Fault-Tolerant Static Schedules. DSN 2003: 159-168 - [c8]Marc Boyer
Synthesis and Verification of Constraints in the PGM Protocol. FME 2003: 264-281 - 2001
- [c7]Aurore Annichini, Ahmed Bouajjani, Mihaela Sighireanu:
TReX: A Tool for Reachability Analysis of Complex Systems. CAV 2001: 368-372 - [c6]Alain Girault, Christophe Lavarenne, Yves Sorel, Mihaela Sighireanu:
Fault-Tolerant Static Scheduling for Real-Time Distributed Embedded Systems. ICDCS 2001: 695-698 - [c5]Alain Girault, Christophe Lavarenne, Mihaela Sighireanu, Yves Sorel:
Generation of Fault-Tolerant Static Scheduling for Real-Time Distributed Embedded Systems with Multi-Point Links. IPDPS 2001: 125 - [c4]Ahmed Bouajjani, Aurore Collomb-Annichini, Yassine Lakhnech, Mihaela Sighireanu:
Analyzing Fair Parametric Extended Automata. SAS 2001: 335-355
1990 – 1999
- 1999
- [c3]Hubert Garavel, Mihaela Sighireanu:
A Graphical Parallel Composition Operator for Process Algebras. FORTE 1999: 185-202 - 1998
- [j1]Mihaela Sighireanu, Radu Mateescu:
Verification of the Link Layer Protocol of the IEEE-1394 Serial Bus (FireWire): An Experiment with E-LOTOS. Int. J. Softw. Tools Technol. Transf. 2(1): 68-88 (1998) - 1996
- [c2]Jean-Claude Fernandez, Hubert Garavel, Alain Kerbrat, Laurent Mounier, Radu Mateescu, Mihaela Sighireanu:
CADP - A Protocol Validation and Verification Toolbox. CAV 1996: 437-440 - [c1]Hubert Garavel, Mihaela Sighireanu:
On the Introduction of Exceptions in E-LOTOS. FORTE 1996: 469-484
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 22:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: