Foundations for decision problems in separation logic with general inductive predicates, Foundations of Software Science and Computation Structures: 17th International Conference, FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, pp.411-425, 2014. ,
Shape analysis for composite data structures, Proc. CAV'07, vol.4144, pp.517-531, 2006. ,
, Computer Aided Verification (CAV), 2011.
Symbolic execution with separation logic, Proceedings of the Third Asian Conference on Programming Languages and Systems, APLAS'05, pp.52-68, 2005. ,
On the almighty wand. Information and Computation, vol.211, pp.106-137, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-01905158
Automated cyclic entailment proofs in separation logic, Automated Deduction -CADE-23: 23rd International Conference on Automated Deduction, pp.131-146, 2011. ,
The Classical Decision Problem, Perspectives in Mathematical Logic, 1997. ,
A generic cyclic theorem prover, APLAS, pp.350-367, 2012. ,
Systematic design of program analysis frameworks, POPL, pp.269-282, 1979. ,
Infer: An automatic program verifier for memory safety of c programs, Proc. of NASA Formal Methods'11, vol.6617, 2011. ,
Footprint analysis: A shape analysis that discovers preconditions, Static Analysis, pp.402-418, 2007. ,
Compositional shape analysis by means of bi-abduction, J. ACM, vol.58, issue.6, pp.1-26, 2011. ,
From separation logic to first-order logic, Foundations of Software Science and Computational Structures, pp.395-409, 2005. ,
Automatic induction proofs of data-structures in imperative programs, Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp.457-466, 2015. ,
The monadic second-order logic of graphs. i. recognizable sets of finite graphs. Information and Computation, vol.85, pp.12-75, 1990. ,
URL : https://hal.archives-ouvertes.fr/hal-00334050
Computability and complexity results for a spatial assertion language for data structures, FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, pp.108-119, 2001. ,
The complexity of prenex separation logic with one selector, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01946528
On the expressive completeness of bernays-schönfinkel-ramsey separation logic, 2018. ,
Assigning meanings to programs, Proceedings of Symposia in Applied Mathematics, vol.19, pp.19-32, 1967. ,
Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-101, 1987. ,
URL : https://hal.archives-ouvertes.fr/inria-00075966
An axiomatic basis for computer programming, Commun. ACM, vol.12, issue.10, pp.576-580, 1969. ,
Bi as an assertion language for mutable data structures, ACM SIGPLAN Notices, vol.36, pp.14-26, 2001. ,
Deciding entailments in inductive separation logic with tree automata, Automated Technology for Verification and Analysis: 12th International Symposium, pp.201-218, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01418889
Shape analysis via second-order bi-abduction, Computer Aided Verification -26th International Conference, pp.52-68, 2014. ,
The logic of bunched implications, The Bulletin of Symbolic Logic, vol.5, issue.2, pp.215-244, 1999. ,
Local reasoning about programs that alter data structures, Proceedings of the 15th International Workshop on Computer Science Logic, CSL '01, pp.1-19, 2001. ,
Separation and information hiding, SIGPLAN Not, vol.39, issue.1, pp.268-280, 2004. ,
Separation logic: A logic for shared mutable data structures, Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science, LICS '02, pp.55-74, 2002. ,
Reasoning in the bernaysschönfinkel-ramsey fragment of separation logic, Verification, Model Checking, and Abstract Interpretation, pp.462-482, 2017. ,
A decision procedure for separation logic in smt, Automated Technology for Verification and Analysis, pp.244-261, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01418883
Report on sl-comp, Boolean Modeling and Computation, vol.1, 2014. ,
Inductor: an entailment checker for inductive systems, 2017. ,