Stéphane Demri

2.6k total citations
63 papers, 611 citations indexed

About

Stéphane Demri is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Software. According to data from OpenAlex, Stéphane Demri has authored 63 papers receiving a total of 611 indexed citations (citations by other indexed papers that have themselves been cited), including 56 papers in Artificial Intelligence, 56 papers in Computational Theory and Mathematics and 6 papers in Software. Recurrent topics in Stéphane Demri's work include Logic, programming, and type systems (41 papers), Formal Methods in Verification (41 papers) and Logic, Reasoning, and Knowledge (37 papers). Stéphane Demri is often cited by papers focused on Logic, programming, and type systems (41 papers), Formal Methods in Verification (41 papers) and Logic, Reasoning, and Knowledge (37 papers). Stéphane Demri collaborates with scholars based in France, Germany and United Kingdom. Stéphane Demri's co-authors include Ranko Lazić, Philippe Schnoebelen, Ewa Orłowska, Deepak Cyril D’Souza, Hans de Nivelle, Étienne Lozes, Denis Lugiez, Morgan Deters, David Nowak and Valentin Goranko and has published in prestigious journals such as Artificial Intelligence, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Stéphane Demri

57 papers receiving 583 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Stéphane Demri France	12	512	466	91	70	57	63	611
Silvio Ghilardi Italy	19	921 1.8×	711 1.5×	60 0.7×	114 1.6×	91 1.6×	82	1.0k
Philippe Schnoebelen France	7	233 0.5×	267 0.6×	108 1.2×	50 0.7×	40 0.7×	20	385
Bard Bloom United States	12	615 1.2×	512 1.1×	123 1.4×	79 1.1×	83 1.5×	27	713
Andrzej Tarlecki Poland	17	829 1.6×	624 1.3×	182 2.0×	92 1.3×	121 2.1×	57	947
Igor Walukiewicz France	15	602 1.2×	699 1.5×	109 1.2×	64 0.9×	18 0.3×	46	804
Richard Mayr United Kingdom	11	316 0.6×	408 0.9×	113 1.2×	93 1.3×	20 0.4×	44	505
Marcin Jurdziński United Kingdom	13	435 0.8×	502 1.1×	91 1.0×	65 0.9×	15 0.3×	32	635
Colin Stirling United Kingdom	17	649 1.3×	718 1.5×	179 2.0×	134 1.9×	69 1.2×	29	898
Nicolas Markey France	14	254 0.5×	338 0.7×	119 1.3×	38 0.5×	37 0.6×	54	454
Luı́s Caires Portugal	13	518 1.0×	344 0.7×	39 0.4×	221 3.2×	92 1.6×	34	603

Countries citing papers authored by Stéphane Demri

Since Specialization

Citations

This map shows the geographic impact of Stéphane Demri's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Stéphane Demri with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Stéphane Demri more than expected).

Fields of papers citing papers by Stéphane Demri

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Stéphane Demri. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Stéphane Demri. The network helps show where Stéphane Demri may publish in the future.

Co-authorship network of co-authors of Stéphane Demri

This figure shows the co-authorship network connecting the top 25 collaborators of Stéphane Demri. A scholar is included among the top collaborators of Stéphane Demri based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Stéphane Demri. Stéphane Demri is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Demri, Stéphane, et al.. (2018). The Effects of Adding Reachability Predicates in Quantifier-Free\n Separation Logic. arXiv (Cornell University). 1 indexed citations

Demri, Stéphane, et al.. (2017). Equivalence between model-checking flat counter systems and Presburger arithmetic. Theoretical Computer Science. 735. 2–23. 1 indexed citations

Demri, Stéphane & Morgan Deters. (2016). Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction. ACM Transactions on Computational Logic. 17(2). 1–44. 5 indexed citations

Demri, Stéphane, et al.. (2016). Reasoning about Data Repetitions with Counter Systems. Logical Methods in Computer Science. Volume 12, Issue 3. 5 indexed citations

Demri, Stéphane, et al.. (2015). Taming past LTL and flat counter systems. Information and Computation. 242. 306–339. 3 indexed citations

Demri, Stéphane, et al.. (2014). Automated Reasoning. Lecture notes in computer science. 4 indexed citations

Demri, Stéphane. (2013). On selective unboundedness of VASS. Journal of Computer and System Sciences. 79(5). 689–713. 5 indexed citations

Demri, Stéphane, et al.. (2012). Beyond Regularity for Presburger Modal Logic.. 161–182. 1 indexed citations

Darondeau, Philippe, et al.. (2012). Petri Net Reachability Graphs: Decidability Status of First Order Properties. Logical Methods in Computer Science. Volume 8, Issue 4. 5 indexed citations

10.

Demri, Stéphane, et al.. (2010). Model-checking CTL* over flat Presburger counter systems. Journal of Applied Non-Classical Logics. 20(4). 313–344. 9 indexed citations

11.

Demri, Stéphane & Denis Lugiez. (2010). Complexity of modal logics with Presburger constraints. Journal of Applied Logic. 8(3). 233–252. 17 indexed citations

12.

Demri, Stéphane, et al.. (2008). Verification of qualitativeZconstraints. Theoretical Computer Science. 409(1). 24–40. 7 indexed citations

13.

Demri, Stéphane & Deepak Cyril D’Souza. (2006). An automata-theoretic approach to constraint LTL. Information and Computation. 205(3). 380–415. 47 indexed citations

14.

Demri, Stéphane. (2006). LTL over integer periodicity constraints. Theoretical Computer Science. 360(1-3). 96–123. 13 indexed citations

15.

Demri, Stéphane. (2004). LTL over Integer Periodicity Constraints (Extended Abstract). HAL (Le Centre pour la Communication Scientifique Directe). 121–135. 5 indexed citations

16.

Demri, Stéphane. (2003). A polynomial space construction of tree-like models for logics with local chains of modal connectives. Theoretical Computer Science. 300(1-3). 235–258. 3 indexed citations

17.

Demri, Stéphane & Ulrike Sattler. (2002). Automata-Theoretic Decision Procedures for Information Logics. Fundamenta Informaticae. 53(1). 1–22. 1 indexed citations

18.

Demri, Stéphane & Philippe Schnoebelen. (2002). The Complexity of Propositional Linear Temporal Logics in Simple Cases. Information and Computation. 174(1). 84–103. 65 indexed citations

19.

Demri, Stéphane & Jarosław Stepaniuk. (2000). Computational Complexity of Multimodal Logics \newline Based on Rough Sets. Fundamenta Informaticae. 44(4). 373–396. 2 indexed citations

20.

Demri, Stéphane. (1998). A class of decidable information logics. Theoretical Computer Science. 195(1). 33–60. 5 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact