Constantin Enea

According to our database1, Constantin Enea
  • authored at least 45 papers between 2002 and 2017.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
On the path-width of integer linear programming.
Inf. Comput., 2017

Exposing Non-Atomic Methods of Concurrent Objects.
CoRR, 2017

Checking Linearizability of Concurrent Priority Queues.
CoRR, 2017

Proving linearizability using forward simulations.
CoRR, 2017

Abstract Semantic Diffing of Evolving Concurrent Programs.
Proceedings of the Static Analysis - 24th International Symposium, 2017

On verifying causal consistency.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

SPEN: A Solver for Separation Logic.
Proceedings of the NASA Formal Methods - 9th International Symposium, 2017

Verifying Robustness of Event-Driven Asynchronous Programs Against Concurrency.
Proceedings of the Programming Languages and Systems, 2017

Proving Linearizability Using Forward Simulations.
Proceedings of the Computer Aided Verification - 29th International Conference, 2017

2016
On Verifying Causal Consistency.
CoRR, 2016

On Atomicity in Presence of Non-atomic Writes.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

Symbolic abstract data type inference.
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

2015
On Automated Lemma Generation for Separation Logic with Inductive Definitions.
CoRR, 2015

On Reducing Linearizability to State Reachability.
CoRR, 2015

Tractable Refinement Checking for Concurrent Objects.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

Monitoring refinement via symbolic reasoning.
Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2015

On Reducing Linearizability to State Reachability.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Checking Correctness of Concurrent Objects: Tractable Reductions to Reachability (Invited Talk).
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

On Automated Lemma Generation for Separation Logic with Inductive Definitions.
Proceedings of the Automated Technology for Verification and Analysis, 2015

2014
On the Path-Width of Integer Linear Programming.
Proceedings of the Proceedings Fifth International Symposium on Games, 2014

Verifying eventual consistency of optimistic replication systems.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

Compositional Entailment Checking for a Fragment of Separation Logic.
Proceedings of the Programming Languages and Systems - 12th Asian Symposium, 2014

2013
Model Checking an Epistemic mu-calculus with Synchronous and Perfect Recall Semantics.
CoRR, 2013

Model checking an Epistemic mu-calculus with Synchronous and Perfect Recall Semantics.
Proceedings of the 14th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2013), 2013

Local Shape Analysis for Overlaid Data Structures.
Proceedings of the Static Analysis - 20th International Symposium, 2013

Compositional Invariant Checking for Overlaid and Nested Linked Lists.
Proceedings of the Programming Languages and Systems, 2013

Verifying Concurrent Programs against Sequential Specifications.
Proceedings of the Programming Languages and Systems, 2013

2012
Model-checking an Epistemic μ-calculus with Synchronous and Perfect Recall Semantics
CoRR, 2012

Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2012

Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data.
Proceedings of the Automated Technology for Verification and Analysis, 2012

2011
An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking.
Journal of Applied Non-Classical Logics, 2011

On inter-procedural analysis of programs with lists and data.
Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, 2011

2010
Model-Checking an Alternating-time Temporal Logic with Knowledge, Imperfect Information, Perfect Recall and Communicating Coalitions
Proceedings of the Proceedings First Symposium on Games, 2010

Invariant Synthesis for Programs Manipulating Lists with Unbounded Data.
Proceedings of the Computer Aided Verification, 22nd International Conference, 2010

2009
A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes
Logical Methods in Computer Science, 2009

A Logic-Based Framework for Reasoning about Composite Data Structures.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008
Abstraction techniques for verification of concurrent systems. (Techniques d'abstraction dans la verification des systèmes concurrents).
PhD thesis, 2008

Secrecy for bounded security protocols with freshness check is NEXPTIME-complete.
Journal of Computer Security, 2008

Counterexample Guided Abstraction Refinement is Better under Equational Abstraction.
Proceedings of the 15th Annual IEEE International Conference and Workshop on Engineering of Computer Based Systems (ECBS 2008), 31 March, 2008

2007
Strategy-Based and Knowledge-Based Models of Information Flow: Equivalence and Decidability.
Proceedings of the Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2007

Abstractions of Multi-agent Systems.
Proceedings of the Multi-Agent Systems and Applications V, 2007

2006
Abstractions of data types.
Acta Inf., 2006

2005
Decidability and Complexity Results for Security Protocols.
Proceedings of the Verification of Infinite-State Systems with Applications to Security, 2005

Unifying Decidability Results on Protection Systems Using Simulations.
Proceedings of the Formal Aspects in Security and Trust, Third International Workshop, 2005

2002
SE-Systems, Timing Mechanisms, and Time-Varying Codes.
Int. J. Comput. Math., 2002


  Loading...