default search action
Constantin Enea
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j21]Constantin Enea, Eric Koskinen
:
Scenario-Based Proofs for Concurrent Objects. Proc. ACM Program. Lang. 8(OOPSLA1): 1294-1323 (2024) - [j20]Constantin Enea
Model Checking Distributed Protocols in Must. Proc. ACM Program. Lang. 8(OOPSLA2): 1900-1927 (2024) - [j19]Andrea Borgarelli
Reward Augmentation in Reinforcement Learning for Testing Distributed Systems. Proc. ACM Program. Lang. 8(OOPSLA2): 1928-1954 (2024) - [c62]Hünkar Can Tunç
CSSTs: A Dynamic Data Structure for Partial Orders in Concurrent Execution Analysis. ASPLOS (3) 2024: 223-238 - [c61]Hagit Attiya
Strong Linearizability using Primitives with Consensus Number 2. PODC 2024: 432-442 - [e5]Armando Castañeda, Constantin Enea, Nirupam Gupta:
Networked Systems - 12th International Conference, NETYS 2024, Rabat, Morocco, May 29-31, 2024, Proceedings. Lecture Notes in Computer Science 14783, Springer 2024, ISBN 978-3-031-67320-7 [contents] - [i35]Hagit Attiya, Armando Castañeda, Constantin Enea:
Strong Linearizability using Primitives with Consensus Number 2. CoRR abs/2402.13618 (2024) - [i34]Hünkar Can Tunç, Ameya Prashant Deshmukh, Berk Çirisci, Constantin Enea, Andreas Pavlogiannis:
CSSTs: A Dynamic Data Structure for Partial Orders in Concurrent Execution Analysis. CoRR abs/2403.17818 (2024) - [i33]Andrea Borgarelli, Constantin Enea, Rupak Majumdar, Srinidhi Nagendra:
Reward Augmentation in Reinforcement Learning for Testing Distributed Systems. CoRR abs/2409.02137 (2024) - 2023
- [j18]Ahmed Bouajjani
Dynamic Partial Order Reduction for Checking Correctness against Transaction Isolation Levels. Proc. ACM Program. Lang. 7(PLDI): 565-590 (2023) - [c60]Hagit Attiya, Constantin Enea, Shafik Nassar:
Faithful Simulation of Randomized BFT Protocols on Block DAGs. CONCUR 2023: 27:1-27:17 - [c59]Berk Çirisci
Quorum Tree Abstractions of Consensus Protocols. ESOP 2023: 337-362 - [c58]Sidi Mohamed Beillahi, Ahmed Bouajjani, Constantin Enea:
Comparing Causal Convergence Consistency Models. NETYS 2023: 62-77 - [c57]Berk Çirisci
A Pragmatic Approach to Stateful Partial Order Reduction. VMCAI 2023: 129-154 - [e4]Constantin Enea
Computer Aided Verification - 35th International Conference, CAV 2023, Paris, France, July 17-22, 2023, Proceedings, Part I. Lecture Notes in Computer Science 13964, Springer 2023, ISBN 978-3-031-37705-1 [contents] - [e3]Constantin Enea
Computer Aided Verification - 35th International Conference, CAV 2023, Paris, France, July 17-22, 2023, Proceedings, Part II. Lecture Notes in Computer Science 13965, Springer 2023, ISBN 978-3-031-37702-0 [contents] - [e2]Constantin Enea
Computer Aided Verification - 35th International Conference, CAV 2023, Paris, France, July 17-22, 2023, Proceedings, Part III. Lecture Notes in Computer Science 13966, Springer 2023, ISBN 978-3-031-37708-2 [contents] - [i32]Constantin Enea, Parisa Fathololumi, Eric Koskinen:
The Commutativity Quotients of Concurrent Objects. CoRR abs/2301.05740 (2023) - [i31]Berk Çirisci, Constantin Enea, Suha Orhun Mutluergil:
Quorum Tree Abstractions of Consensus Protocols. CoRR abs/2301.09946 (2023) - [i30]Cezara Dragoi, Constantin Enea, Srinidhi Nagendra, Mandayam Srivas:
A Domain Specific Language for Testing Consensus Implementations. CoRR abs/2303.05893 (2023) - [i29]Ahmed Bouajjani, Constantin Enea, Enrique Román-Calvo:
Dynamic Partial Order Reduction for Checking Correctness Against Transaction Isolation Levels. CoRR abs/2303.12606 (2023) - [i28]Hagit Attiya, Constantin Enea, Shafik Nassar:
Faithful Simulation of Randomized BFT Protocols on Block DAGs. IACR Cryptol. ePrint Arch. 2023: 192 (2023) - 2022
- [j17]Rachid Zennou
Checking causal consistency of distributed databases. Computing 104(10): 2181-2201 (2022) - [c56]Hagit Attiya, Constantin Enea, Jennifer L. Welch:
Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations. PODC 2022: 209-219 - [c55]Sidi Mohamed Beillahi, Ahmed Bouajjani, Constantin Enea, Shuvendu K. Lahiri:
Automated Synthesis of Asynchronizations. SAS 2022: 135-159 - [i27]Sidi Mohamed Beillahi, Ahmed Bouajjani, Constantin Enea, Shuvendu K. Lahiri:
Automated Synthesis of Asynchronizations. CoRR abs/2209.06648 (2022) - [i26]Berk Çirisci, Constantin Enea, Azadeh Farzan, Suha Orhun Mutluergil:
A Pragmatic Approach to Stateful Partial Order Reduction. CoRR abs/2211.11942 (2022) - [i25]Hagit Attiya, Constantin Enea, Sergio Rajsbaum, Ana Sokolova:
Formal Methods and Distributed Computing: Stronger Together (Dagstuhl Seminar 22492). Dagstuhl Reports 12(12): 27-53 (2022) - 2021
- [j16]Sidi Mohamed Beillahi, Ahmed Bouajjani, Constantin Enea:
Robustness Against Transactional Causal Consistency. Log. Methods Comput. Sci. 17(1) (2021) - [j15]Ranadeep Biswas, Diptanshu Kakwani, Jyothi Vedurada, Constantin Enea, Akash Lal:
MonkeyDB: effectively testing correctness under weak isolation levels. Proc. ACM Program. Lang. 5(OOPSLA): 1-27 (2021) - [c54]Sidi Mohamed Beillahi, Ahmed Bouajjani, Constantin Enea:
Checking Robustness Between Weak Transactional Consistency Models. ESOP 2021: 87-117 - [c53]Hagit Attiya
Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers. DISC 2021: 7:1-7:18 - [i24]Sidi Mohamed Beillahi, Ahmed Bouajjani, Constantin Enea:
Checking Robustness Between Weak Transactional Consistency Models. CoRR abs/2101.09032 (2021) - [i23]Ranadeep Biswas, Diptanshu Kakwani, Jyothi Vedurada, Constantin Enea, Akash Lal:
MonkeyDB: Effectively Testing Correctness against Weak Isolation Levels. CoRR abs/2103.02830 (2021) - [i22]Hagit Attiya, Constantin Enea, Jennifer L. Welch:
Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers. CoRR abs/2105.06614 (2021) - [i21]Hagit Attiya, Constantin Enea, Jennifer L. Welch:
Linearizable Implementations Suffice for Termination of Randomized Concurrent Programs. CoRR abs/2106.15554 (2021) - 2020
- [j14]Yotam M. Y. Feldman
Proving highly-concurrent traversals correct. Proc. ACM Program. Lang. 4(OOPSLA): 128:1-128:29 (2020) - [j13]Cezara Dragoi, Constantin Enea, Burcu Kulahcioglu Ozkan
Testing consensus implementations using communication closure. Proc. ACM Program. Lang. 4(OOPSLA): 210:1-210:29 (2020) - [c52]Rachid Zennou
Boosting Sequential Consistency Checking Using Saturation. ATVA 2020: 360-376 - [c51]Berk Çirisci, Constantin Enea, Azadeh Farzan, Suha Orhun Mutluergil:
Root Causing Linearizability Violations. CAV (1) 2020: 350-375 - [c50]Siddharth Krishna, Michael Emmi, Constantin Enea, Dejan Jovanovic:
Verifying Visibility-Based Weak Consistency. ESOP 2020: 280-307 - [c49]Bernhard Kragl
Inductive sequentialization of asynchronous programs. PLDI 2020: 227-242 - [c48]Sidi Mohamed Beillahi, Gabriela F. Ciocarlie, Michael Emmi, Constantin Enea:
Behavioral simulation for smart contracts. PLDI 2020: 470-486 - [c47]Ahmed Bouajjani, Constantin Enea, Madhavan Mukund, Ranjal Gautham Shenoy, S. P. Suresh:
Formalizing and Checking Multilevel Consistency. VMCAI 2020: 379-400 - [d1]Bernhard Kragl
Inductive Sequentialization of Asynchronous Programs (Evaluated Artifact). Zenodo, 2020 - [i20]Yotam M. Y. Feldman, Artem Khyzha, Constantin Enea, Adam Morrison, Aleksandar Nanevski, Noam Rinetzky, Sharon Shoham:
Proving Highly-Concurrent Traversals Correct. CoRR abs/2010.00911 (2020) - [i19]Rachid Zennou
Checking Causal Consistency of Distributed Databases. CoRR abs/2011.09753 (2020)
2010 – 2019
- 2019
- [j12]Ahmed Bouajjani, Constantin Enea
Abstract semantic diffing of evolving concurrent programs. Formal Methods Syst. Des. 54(1): 4-26 (2019) - [j11]Ranadeep Biswas, Constantin Enea:
On the complexity of checking transactional consistency. Proc. ACM Program. Lang. 3(OOPSLA): 165:1-165:28 (2019) - [j10]Michael Emmi, Constantin Enea:
Weak-consistency specification via visibility relaxation. Proc. ACM Program. Lang. 3(POPL): 60:1-60:28 (2019) - [c46]Rachid Zennou
Gradual Consistency Checking. CAV (2) 2019: 267-285 - [c45]Sidi Mohamed Beillahi, Ahmed Bouajjani, Constantin Enea:
Checking Robustness Against Snapshot Isolation. CAV (2) 2019: 286-304 - [c44]Ranadeep Biswas, Michael Emmi, Constantin Enea:
On the Complexity of Checking Consistency for Replicated Data Types. CAV (2) 2019: 324-343 - [c43]Michael Emmi, Constantin Enea:
Violat: Generating Tests of Observational Refinement for Concurrent Objects. CAV (2) 2019: 534-546 - [c42]Sidi Mohamed Beillahi, Ahmed Bouajjani, Constantin Enea:
Robustness Against Transactional Causal Consistency. CONCUR 2019: 30:1-30:18 - [c41]Rachid Zennou
Checking Causal Consistency of Distributed Databases. NETYS 2019: 35-51 - [c40]Chao Wang, Constantin Enea, Suha Orhun Mutluergil, Gustavo Petri:
Replication-aware linearizability. PLDI 2019: 980-993 - [c39]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 - [c38]Hagit Attiya
Putting Strong Linearizability in Context: Preserving Hyperproperties in Programsthat Use Concurrent Objects. DISC 2019: 2:1-2:17 - [e1]Constantin Enea, Ruzica Piskac:
Verification, Model Checking, and Abstract Interpretation - 20th International Conference, VMCAI 2019, Cascais, Portugal, January 13-15, 2019, Proceedings. Lecture Notes in Computer Science 11388, Springer 2019, ISBN 978-3-030-11244-8 [contents] - [i18]Constantin Enea, Suha Orhun Mutluergil, Gustavo Petri, Chao Wang:
Replication-Aware Linearizability. CoRR abs/1903.06560 (2019) - [i17]Sidi Mohamed Beillahi, Ahmed Bouajjani, Constantin Enea:
Checking Robustness Against Snapshot Isolation. CoRR abs/1905.08406 (2019) - [i16]Hagit Attiya, Constantin Enea:
Putting Strong Linearizability in Context: Preserving Hyperproperties in Programs that Use Concurrent Objects. CoRR abs/1905.12063 (2019) - [i15]Sidi Mohamed Beillahi, Ahmed Bouajjani, Constantin Enea:
Robustness Against Transactional Causal Consistency. CoRR abs/1906.12095 (2019) - [i14]Ranadeep Biswas, Constantin Enea:
On the Complexity of Checking Transactional Consistency. CoRR abs/1908.04509 (2019) - [i13]Siddharth Krishna, Michael Emmi, Constantin Enea, Dejan Jovanovic:
Verifying Visibility-Based Weak Consistency. CoRR abs/1911.01508 (2019) - 2018
- [j9]Ahmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza:
On reducing linearizability to state reachability. Inf. Comput. 261: 383-400 (2018) - [j8]Michael Emmi, Constantin Enea:
Sound, complete, and tractable linearizability monitoring for concurrent collections. Proc. ACM Program. Lang. 2(POPL): 25:1-25:27 (2018) - [c37]Ahmed Bouajjani, Constantin Enea, Suha Orhun Mutluergil, Serdar Tasiran:
Reasoning About TSO Programs Using Reduction and Abstraction. CAV (2) 2018: 336-353 - [c36]Ahmed Bouajjani, Constantin Enea, Kailiang Ji, Shaz Qadeer:
On the Completeness of Verifying Message Passing Programs Under Bounded Asynchrony. CAV (2) 2018: 372-391 - [c35]Michael Emmi, Constantin Enea:
Monitoring Weak Consistency. CAV (1) 2018: 487-506 - [c34]Chungha Sung
Datalog-based scalable semantic diffing of concurrent programs. ASE 2018: 656-666 - [c33]Ahmed Bouajjani, Constantin Enea, Madhavan Mukund, Rajarshi Roy:
On Verifying TSO Robustness for Event-Driven Asynchronous Programs. NETYS 2018: 225-239 - [c32]Yotam M. Y. Feldman
Order out of Chaos: Proving Linearizability Using Local Views. DISC 2018: 23:1-23:21 - [i12]Ahmed Bouajjani, Constantin Enea, Suha Orhun Mutluergil, Serdar Tasiran:
Reasoning About TSO Programs Using Reduction and Abstraction. CoRR abs/1804.05196 (2018) - [i11]Ahmed Bouajjani, Constantin Enea, Kailiang Ji, Shaz Qadeer:
On the Completeness of Verifying Message Passing Programs under Bounded Asynchrony. CoRR abs/1804.06612 (2018) - [i10]Yotam M. Y. Feldman, Constantin Enea, Adam Morrison, Noam Rinetzky, Sharon Shoham:
Order out of Chaos: Proving Linearizability Using Local Views. CoRR abs/1805.03992 (2018) - [i9]Chungha Sung, Shuvendu K. Lahiri, Constantin Enea, Chao Wang:
Datalog-based Scalable Semantic Diffing of Concurrent Programs. CoRR abs/1807.03777 (2018) - 2017
- [j7]Constantin Enea, Ondrej Lengál
Compositional entailment checking for a fragment of separation logic. Formal Methods Syst. Des. 51(3): 575-607 (2017) - [j6]Constantin Enea, Peter Habermehl, Omar Inverso
On the path-width of integer linear programming. Inf. Comput. 253: 257-271 (2017) - [c31]Ahmed Bouajjani, Michael Emmi, Constantin Enea, Suha Orhun Mutluergil:
Proving Linearizability Using Forward Simulations. CAV (2) 2017: 542-563 - [c30]Ahmed Bouajjani, Constantin Enea, Chao Wang:
Checking Linearizability of Concurrent Priority Queues. CONCUR 2017: 16:1-16:16 - [c29]Ahmed Bouajjani, Michael Emmi, Constantin Enea, Burcu Kulahcioglu Ozkan
Verifying Robustness of Event-Driven Asynchronous Programs Against Concurrency. ESOP 2017: 170-200 - [c28]Constantin Enea, Ondrej Lengál
SPEN: A Solver for Separation Logic. NFM 2017: 302-309 - [c27]Ahmed Bouajjani, Constantin Enea, Rachid Guerraoui
On verifying causal consistency. POPL 2017: 626-638 - [c26]Ahmed Bouajjani, Constantin Enea, Shuvendu K. Lahiri:
Abstract Semantic Diffing of Evolving Concurrent Programs. SAS 2017: 46-65 - [i8]Ahmed Bouajjani, Michael Emmi, Constantin Enea, Suha Orhun Mutluergil:
Proving linearizability using forward simulations. CoRR abs/1702.02705 (2017) - [i7]Michael Emmi, Constantin Enea:
Exposing Non-Atomic Methods of Concurrent Objects. CoRR abs/1706.09305 (2017) - [i6]Ahmed Bouajjani, Constantin Enea, Chao Wang:
Checking Linearizability of Concurrent Priority Queues. CoRR abs/1707.00639 (2017) - 2016
- [c25]Michael Emmi, Constantin Enea:
Symbolic abstract data type inference. POPL 2016: 513-525 - [c24]Constantin Enea, Azadeh Farzan:
On Atomicity in Presence of Non-atomic Writes. TACAS 2016: 497-514 - [i5]Ahmed Bouajjani, Constantin Enea, Rachid Guerraoui, Jad Hamza:
On Verifying Causal Consistency. CoRR abs/1611.00580 (2016) - 2015
- [c23]Constantin Enea, Mihaela Sighireanu, Zhilin Wu:
On Automated Lemma Generation for Separation Logic with Inductive Definitions. ATVA 2015: 80-96 - [c22]Ahmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza:
Checking Correctness of Concurrent Objects: Tractable Reductions to Reachability (Invited Talk). FSTTCS 2015: 2-4 - [c21]Ahmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza:
On Reducing Linearizability to State Reachability. ICALP (2) 2015: 95-107 - [c20]Michael Emmi, Constantin Enea, Jad Hamza:
Monitoring refinement via symbolic reasoning. PLDI 2015: 260-269 - [c19]Ahmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza:
Tractable Refinement Checking for Concurrent Objects. POPL 2015: 651-662 - [i4]Ahmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza:
On Reducing Linearizability to State Reachability. CoRR abs/1502.06882 (2015) - [i3]Constantin Enea, Mihaela Sighireanu, Zhilin Wu:
On Automated Lemma Generation for Separation Logic with Inductive Definitions. CoRR abs/1507.05581 (2015) - 2014
- [c18]Constantin Enea, Ondrej Lengál, Mihaela Sighireanu, Tomás Vojnar:
Compositional Entailment Checking for a Fragment of Separation Logic. APLAS 2014: 314-333 - [c17]Ahmed Bouajjani, Constantin Enea, Jad Hamza:
Verifying eventual consistency of optimistic replication systems. POPL 2014: 285-296 - [c16]Constantin Enea, Peter Habermehl, Omar Inverso
On the Path-Width of Integer Linear Programming. GandALF 2014: 74-87 - 2013
- [c15]Constantin Enea, Vlad Saveluc, Mihaela Sighireanu:
Compositional Invariant Checking for Overlaid and Nested Linked Lists. ESOP 2013: 129-148 - [c14]Ahmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza:
Verifying Concurrent Programs against Sequential Specifications. ESOP 2013: 290-309 - [c13]Cezara Dragoi, Constantin Enea, Mihaela Sighireanu:
Local Shape Analysis for Overlaid Data Structures. SAS 2013: 150-171 - [c12]Rodica Bozianu, Catalin Dima, Constantin Enea:
Model checking an Epistemic mu-calculus with Synchronous and Perfect Recall Semantics. TARK 2013 - [i2]Rodica Bozianu, Catalin Dima, Constantin Enea:
Model Checking an Epistemic mu-calculus with Synchronous and Perfect Recall Semantics. CoRR abs/1310.6434 (2013) - 2012
- [c11]Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Mihaela Sighireanu:
Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data. ATVA 2012: 167-182 - [c10]Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Mihaela Sighireanu:
Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data. VMCAI 2012: 1-22 - [i1]Rodica Bozianu, Catalin Dima, Constantin Enea:
Model-checking an Epistemic μ-calculus with Synchronous and Perfect Recall Semantics. CoRR abs/1204.2087 (2012) - 2011
- [j5]Dimitar P. Guelev, Catalin Dima
An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking. J. Appl. Non Class. Logics 21(1): 93-131 (2011) - [c9]Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Mihaela Sighireanu:
On inter-procedural analysis of programs with lists and data. PLDI 2011: 578-589 - 2010
- [c8]Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Ahmed Rezine, Mihaela Sighireanu:
Invariant Synthesis for Programs Manipulating Lists with Unbounded Data. CAV 2010: 72-88 - [c7]Catalin Dima
Model-Checking an Alternating-time Temporal Logic with Knowledge, Imperfect Information, Perfect Recall and Communicating Coalitions. GANDALF 2010: 103-117
2000 – 2009
- 2009
- [j4]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) - [c6]Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Mihaela Sighireanu:
A Logic-Based Framework for Reasoning about Composite Data Structures. CONCUR 2009: 178-195 - 2008
- [b1]Constantin Enea:
Abstraction techniques for verification of concurrent systems. (Techniques d'abstraction dans la verification des systèmes concurrents). University of Paris-Est, France, 2008 - [j3]Ferucio Laurentiu Tiplea, Catalin V. Bîrjoveanu, Constantin Enea, Ioana Boureanu:
Secrecy for bounded security protocols with freshness check is NEXPTIME-complete. J. Comput. Secur. 16(6): 689-712 (2008) - [c5]Constantin Enea:
Counterexample Guided Abstraction Refinement is Better under Equational Abstraction. ECBS 2008: 126-135 - 2007
- [c4]Constantin Enea, Catalin Dima
Abstractions of Multi-agent Systems. CEEMAS 2007: 11-21 - [c3]Catalin Dima
Strategy-Based and Knowledge-Based Models of Information Flow: Equivalence and Decidability. SYNASC 2007: 33-40 - 2006
- [j2]Ferucio Laurentiu Tiplea, Constantin Enea:
Abstractions of data types. Acta Informatica 42(8-9): 639-671 (2006) - 2005
- [c2]Constantin Enea:
Unifying Decidability Results on Protection Systems Using Simulations. Formal Aspects in Security and Trust 2005: 96-111 - [c1]Ferucio Laurentiu Tiplea, Constantin Enea, Catalin V. Bîrjoveanu:
Decidability and Complexity Results for Security Protocols. VISSAS 2005: 185-211 - 2002
- [j1]Ferucio Laurentiu Tiplea, Erkki Mäkinen
SE-Systems, Timing Mechanisms, and Time-Varying Codes. Int. J. Comput. Math. 79(10): 1083-1091 (2002)
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:27 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: