Difference between revisions of "Publications"

From vecolib
Jump to: navigation, search
Line 12: Line 12:
 
     (see http://www.lri.fr/~filliatr/bibtex2html/),
 
     (see http://www.lri.fr/~filliatr/bibtex2html/),
 
     with the following command:
 
     with the following command:
     /usr/bin/bibtex2html ref.bib  -->
+
     /usr/bin/bibtex2html -d ref.bib  -->
  
  
Line 19: Line 19:
 
<tr valign="top">
 
<tr valign="top">
 
<td align="right" class="bibtexnumber">
 
<td align="right" class="bibtexnumber">
[<a name="DBLP:conf/popl/EmmiE16">1</a>]
+
[<a name="SighireanuC14">1</a>]
 
</td>
 
</td>
 
<td class="bibtexitem">
 
<td class="bibtexitem">
Michael Emmi and Constantin Enea.
+
Mihaela Sighireanu and David&nbsp;R. Cok.
  Symbolic abstract data type inference.
+
  Report on sl-comp 2014.
  In <em>Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT                                                             
+
  <em>Journal on Satisfiability, Boolean Modeling and Computation</em>,
  Symposium on Principles of Programming Languages, POPL 2016, St.                                                     
+
  2014.
  Petersburg, FL, USA, January 20 - 22, 2016</em>, pages 513--525. ACM, 2016.
+
[&nbsp;<a href="ref_bib.html#SighireanuC14">bib</a>&nbsp;]
[&nbsp;<a href="ref_bib.html#DBLP:conf/popl/EmmiE16">bib</a>&nbsp;|
+
<a href="http://doi.acm.org/10.1145/2837614.2837645">http</a>&nbsp;]
+
  
 
</td>
 
</td>
 
</tr>
 
</tr>
 +
  
 
<tr valign="top">
 
<tr valign="top">
 
<td align="right" class="bibtexnumber">
 
<td align="right" class="bibtexnumber">
[<a name="DBLP:conf/atva/EneaSW15">1</a>]
+
[<a name="DBLP:conf/atva/IosifRV14">2</a>]
 
</td>
 
</td>
 
<td class="bibtexitem">
 
<td class="bibtexitem">
Constantin Enea, Mihaela Sighireanu, and Zhilin Wu.
+
Radu Iosif, Adam Rogalewicz, and Tom&aacute;s Vojnar.
  On automated lemma generation for separation logic with inductive
+
  Deciding entailments in inductive separation logic with tree
   definitions.
+
   automata.
  In <em>Automated Technology for Verification and Analysis - 13th
+
  In <em>Automated Technology for Verification and Analysis - 12th
   International Symposium, ATVA 2015, Shanghai, China, October 12-15, 2015,
+
   International Symposium, ATVA 2014, Sydney, NSW, Australia, November 3-7,
   Proceedings</em>, volume 9364 of <em>Lecture Notes in Computer Science</em>, pages
+
   2014, Proceedings</em>, pages 201--218, 2014.
  80--96. Springer, 2015.
+
[&nbsp;<a href="ref_bib.html#DBLP:conf/atva/IosifRV14">bib</a>&nbsp;|  
[&nbsp;<a href="ref_bib.html#DBLP:conf/atva/EneaSW15">bib</a>&nbsp;|  
+
<a href="http://dx.doi.org/10.1007/978-3-319-11936-6_15">DOI</a>&nbsp;|  
<a href="http://dx.doi.org/10.1007/978-3-319-24953-7_7">DOI</a>&nbsp;|  
+
<a href="http://dx.doi.org/10.1007/978-3-319-11936-6_15">http</a>&nbsp;]
<a href="http://dx.doi.org/10.1007/978-3-319-24953-7_7">http</a>&nbsp;]
+
  
 
</td>
 
</td>
Line 55: Line 53:
 
<tr valign="top">
 
<tr valign="top">
 
<td align="right" class="bibtexnumber">
 
<td align="right" class="bibtexnumber">
[<a name="DBLP:conf/icalp/BouajjaniEEH15">2</a>]
+
[<a name="DBLP:conf/aplas/EneaLSV14">3</a>]
 
</td>
 
</td>
 
<td class="bibtexitem">
 
<td class="bibtexitem">
Ahmed Bouajjani, Michael Emmi, Constantin Enea, and Jad Hamza.
+
Constantin Enea, Ondrej Leng&aacute;l, Mihaela Sighireanu, and Tom&aacute;s
  On reducing linearizability to state reachability.
+
  Vojnar.
  In <em>Automata, Languages, and Programming - 42nd International
+
  Compositional entailment checking for a fragment of separation logic.
   Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part
+
  In <em>Programming Languages and Systems - 12th Asian Symposium,
  II</em>, volume 9135 of <em>Lecture Notes in Computer Science</em>, pages 95--107.
+
   APLAS 2014, Singapore, November 17-19, 2014, Proceedings</em>, pages 314--333,
   Springer, 2015.
+
   2014.
[&nbsp;<a href="ref_bib.html#DBLP:conf/icalp/BouajjaniEEH15">bib</a>&nbsp;|  
+
[&nbsp;<a href="ref_bib.html#DBLP:conf/aplas/EneaLSV14">bib</a>&nbsp;|  
<a href="http://dx.doi.org/10.1007/978-3-662-47666-6_8">DOI</a>&nbsp;|  
+
<a href="http://dx.doi.org/10.1007/978-3-319-12736-1_17">DOI</a>&nbsp;|  
<a href="http://dx.doi.org/10.1007/978-3-662-47666-6_8">http</a>&nbsp;]
+
<a href="http://dx.doi.org/10.1007/978-3-319-12736-1_17">http</a>&nbsp;]
  
 
</td>
 
</td>
Line 74: Line 72:
 
<tr valign="top">
 
<tr valign="top">
 
<td align="right" class="bibtexnumber">
 
<td align="right" class="bibtexnumber">
[<a name="DBLP:conf/pldi/EmmiEH15">3</a>]
+
[<a name="DBLP:conf/pldi/EmmiEH15">4</a>]
 
</td>
 
</td>
 
<td class="bibtexitem">
 
<td class="bibtexitem">
Line 92: Line 90:
 
<tr valign="top">
 
<tr valign="top">
 
<td align="right" class="bibtexnumber">
 
<td align="right" class="bibtexnumber">
[<a name="DBLP:conf/aplas/EneaLSV14">4</a>]
+
[<a name="DBLP:conf/icalp/BouajjaniEEH15">5</a>]
 
</td>
 
</td>
 
<td class="bibtexitem">
 
<td class="bibtexitem">
Constantin Enea, Ondrej Leng&aacute;l, Mihaela Sighireanu, and Tom&aacute;s
+
Ahmed Bouajjani, Michael Emmi, Constantin Enea, and Jad Hamza.
  Vojnar.
+
  On reducing linearizability to state reachability.
  Compositional entailment checking for a fragment of separation logic.
+
  In <em>Automata, Languages, and Programming - 42nd International
  In <em>Programming Languages and Systems - 12th Asian Symposium,
+
   Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part
   APLAS 2014, Singapore, November 17-19, 2014, Proceedings</em>, pages 314--333,
+
  II</em>, volume 9135 of <em>Lecture Notes in Computer Science</em>, pages 95--107.
   2014.
+
   Springer, 2015.
[&nbsp;<a href="ref_bib.html#DBLP:conf/aplas/EneaLSV14">bib</a>&nbsp;|  
+
[&nbsp;<a href="ref_bib.html#DBLP:conf/icalp/BouajjaniEEH15">bib</a>&nbsp;|  
<a href="http://dx.doi.org/10.1007/978-3-319-12736-1_17">DOI</a>&nbsp;|  
+
<a href="http://dx.doi.org/10.1007/978-3-662-47666-6_8">DOI</a>&nbsp;|  
<a href="http://dx.doi.org/10.1007/978-3-319-12736-1_17">http</a>&nbsp;]
+
<a href="http://dx.doi.org/10.1007/978-3-662-47666-6_8">http</a>&nbsp;]
  
 
</td>
 
</td>
Line 111: Line 109:
 
<tr valign="top">
 
<tr valign="top">
 
<td align="right" class="bibtexnumber">
 
<td align="right" class="bibtexnumber">
[<a name="DBLP:conf/atva/IosifRV14">5</a>]
+
[<a name="DBLP:conf/atva/EneaSW15">6</a>]
 
</td>
 
</td>
 
<td class="bibtexitem">
 
<td class="bibtexitem">
Radu Iosif, Adam Rogalewicz, and Tom&aacute;s Vojnar.
+
Constantin Enea, Mihaela Sighireanu, and Zhilin Wu.
  Deciding entailments in inductive separation logic with tree
+
  On automated lemma generation for separation logic with inductive
   automata.
+
   definitions.
  In <em>Automated Technology for Verification and Analysis - 12th
+
  In <em>Automated Technology for Verification and Analysis - 13th
   International Symposium, ATVA 2014, Sydney, NSW, Australia, November 3-7,
+
   International Symposium, ATVA 2015, Shanghai, China, October 12-15, 2015,
   2014, Proceedings</em>, pages 201--218, 2014.
+
   Proceedings</em>, volume 9364 of <em>Lecture Notes in Computer Science</em>, pages
[&nbsp;<a href="ref_bib.html#DBLP:conf/atva/IosifRV14">bib</a>&nbsp;|  
+
  80--96. Springer, 2015.
<a href="http://dx.doi.org/10.1007/978-3-319-11936-6_15">DOI</a>&nbsp;|  
+
[&nbsp;<a href="ref_bib.html#DBLP:conf/atva/EneaSW15">bib</a>&nbsp;|  
<a href="http://dx.doi.org/10.1007/978-3-319-11936-6_15">http</a>&nbsp;]
+
<a href="http://dx.doi.org/10.1007/978-3-319-24953-7_7">DOI</a>&nbsp;|  
 +
<a href="http://dx.doi.org/10.1007/978-3-319-24953-7_7">http</a>&nbsp;]
  
 
</td>
 
</td>
Line 130: Line 129:
 
<tr valign="top">
 
<tr valign="top">
 
<td align="right" class="bibtexnumber">
 
<td align="right" class="bibtexnumber">
[<a name="DBLP:conf/tacas/IosifRV16">6</a>]
+
[<a name="blazy:hal-01242077">7</a>]
 
</td>
 
</td>
 
<td class="bibtexitem">
 
<td class="bibtexitem">
Radu Iosif, Adam Rogalewicz, and Tom&aacute;s Vojnar.
+
Sandrine Blazy, David B&uuml;hler, and Boris Yakobowski.
  Abstraction refinement and antichains for trace inclusion of infinite
+
  Improving static analyses of C programs with conditional
   state systems.
+
   predicates.
  In <em>Tools and Algorithms for the Construction and Analysis of
+
  <em>Science of Computer Programming</em>, January 2016.
  Systems - 22nd International Conference, TACAS 2016, Held as Part of the
+
Accepted manuscript. Available online 30 November 2015.Extended
  European Joint Conferences on Theory and Practice of Software, ETAPS 2016,
+
   version of the FMICS 2014 paper.
  Eindhoven, The Netherlands, April 2-8, 2016, Proceedings</em>, pages 71--89,
+
[&nbsp;<a href="ref_bib.html#blazy:hal-01242077">bib</a>&nbsp;|
   2016.
+
<a href="https://hal.inria.fr/hal-01242077">http</a>&nbsp;]
[&nbsp;<a href="ref_bib.html#DBLP:conf/tacas/IosifRV16">bib</a>&nbsp;]
+
<blockquote><font size="-1">
 +
Keywords: Static analysis ;  Abstract interpretation ;  Dataflow analysis ;  Path sensitivity
 +
</font></blockquote>
  
 
</td>
 
</td>
Line 149: Line 150:
 
<tr valign="top">
 
<tr valign="top">
 
<td align="right" class="bibtexnumber">
 
<td align="right" class="bibtexnumber">
[<a name="dross2016rssr">7</a>]
+
[<a name="DBLP:journals/corr/ReynoldsI016">8</a>]
 
</td>
 
</td>
 
<td class="bibtexitem">
 
<td class="bibtexitem">
Claire Dross and Yannick Moy.
+
Andrew Reynolds, Radu Iosif, and Tim King.
  Abstract software specifications and automatic proof of refinement.
+
  A decision procedure for separation logic in SMT.
  In <em>1st International Conference on Reliability, Safety and
+
  <em>CoRR</em>, abs/1603.06844, 2016.
  Security of Railway Systems (RSSR)</em>, 2016.
+
[&nbsp;<a href="ref_bib.html#DBLP:journals/corr/ReynoldsI016">bib</a>&nbsp;|
[&nbsp;<a href="ref_bib.html#dross2016rssr">bib</a>&nbsp;]
+
<a href="http://arxiv.org/abs/1603.06844">http</a>&nbsp;]
  
 
</td>
 
</td>
Line 164: Line 165:
 
<tr valign="top">
 
<tr valign="top">
 
<td align="right" class="bibtexnumber">
 
<td align="right" class="bibtexnumber">
[<a name="DBLP:journals/corr/ReynoldsI016">8</a>]
+
[<a name="dross2016rssr">9</a>]
 
</td>
 
</td>
 
<td class="bibtexitem">
 
<td class="bibtexitem">
Andrew Reynolds, Radu Iosif, and Tim King.
+
Claire Dross and Yannick Moy.
  A decision procedure for separation logic in SMT.
+
  Abstract software specifications and automatic proof of refinement.
  <em>CoRR</em>, abs/1603.06844, 2016.
+
  In <em>1st International Conference on Reliability, Safety and
[&nbsp;<a href="ref_bib.html#DBLP:journals/corr/ReynoldsI016">bib</a>&nbsp;|
+
  Security of Railway Systems (RSSR)</em>, 2016.
<a href="http://arxiv.org/abs/1603.06844">http</a>&nbsp;]
+
[&nbsp;<a href="ref_bib.html#dross2016rssr">bib</a>&nbsp;]
  
 
</td>
 
</td>
Line 179: Line 180:
 
<tr valign="top">
 
<tr valign="top">
 
<td align="right" class="bibtexnumber">
 
<td align="right" class="bibtexnumber">
[<a name="blazy:hal-01242077">9</a>]
+
[<a name="DBLP:conf/tacas/IosifRV16">10</a>]
 
</td>
 
</td>
 
<td class="bibtexitem">
 
<td class="bibtexitem">
Sandrine Blazy, David B&uuml;hler, and Boris Yakobowski.
+
Radu Iosif, Adam Rogalewicz, and Tom&aacute;s Vojnar.
  Improving static analyses of C programs with conditional
+
  Abstraction refinement and antichains for trace inclusion of infinite
   predicates.
+
   state systems.
  <em>Science of Computer Programming</em>, January 2016.
+
  In <em>Tools and Algorithms for the Construction and Analysis of
Accepted manuscript. Available online 30 November 2015.Extended
+
  Systems - 22nd International Conference, TACAS 2016, Held as Part of the
   version of the FMICS 2014 paper.
+
  European Joint Conferences on Theory and Practice of Software, ETAPS 2016,
[&nbsp;<a href="ref_bib.html#blazy:hal-01242077">bib</a>&nbsp;|
+
  Eindhoven, The Netherlands, April 2-8, 2016, Proceedings</em>, pages 71--89,
<a href="https://hal.inria.fr/hal-01242077">http</a>&nbsp;]
+
   2016.
 +
[&nbsp;<a href="ref_bib.html#DBLP:conf/tacas/IosifRV16">bib</a>&nbsp;]
 +
 
 
</td>
 
</td>
 +
</tr>
 +
  
 
<tr valign="top">
 
<tr valign="top">
 
<td align="right" class="bibtexnumber">
 
<td align="right" class="bibtexnumber">
[<a name="SighireanuC14">10</a>]
+
[<a name="DBLP:conf/popl/EmmiE16">11</a>]
 
</td>
 
</td>
 
<td class="bibtexitem">
 
<td class="bibtexitem">
Mihaela Sighireanu and David&nbsp;R. Cok.
+
Michael Emmi and Constantin Enea.
  Report on sl-comp 2014.
+
  Symbolic abstract data type inference.
  <em>Journal on Satisfiability, Boolean Modeling and Computation</em>,
+
  In <em>Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT
  2014.
+
  Symposium on Principles of Programming Languages, POPL 2016, St.
[&nbsp;<a href="ref_bib.html#SighireanuC14">bib</a>&nbsp;]
+
  Petersburg, FL, USA, January 20 - 22, 2016</em>, pages 513--525. ACM, 2016.
 
+
[&nbsp;<a href="ref_bib.html#DBLP:conf/popl/EmmiE16">bib</a>&nbsp;|
 +
<a href="http://doi.acm.org/10.1145/2837614.2837645">http</a>&nbsp;]
  
 +
</td>
 
</tr>
 
</tr>
 
</table><hr><p><em>This file was generated by
 
</table><hr><p><em>This file was generated by

Revision as of 11:05, 17 June 2016

ref

[1] Mihaela Sighireanu and David R. Cok. Report on sl-comp 2014. Journal on Satisfiability, Boolean Modeling and Computation, 2014. [ bib ]
[2] Radu Iosif, Adam Rogalewicz, and Tomás Vojnar. Deciding entailments in inductive separation logic with tree automata. In Automated Technology for Verification and Analysis - 12th International Symposium, ATVA 2014, Sydney, NSW, Australia, November 3-7, 2014, Proceedings, pages 201--218, 2014. [ bib | DOI | http ]
[3] Constantin Enea, Ondrej Lengál, Mihaela Sighireanu, and Tomás Vojnar. Compositional entailment checking for a fragment of separation logic. In Programming Languages and Systems - 12th Asian Symposium, APLAS 2014, Singapore, November 17-19, 2014, Proceedings, pages 314--333, 2014. [ bib | DOI | http ]
[4] Michael Emmi, Constantin Enea, and Jad Hamza. Monitoring refinement via symbolic reasoning. In Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, Portland, OR, USA, June 15-17, 2015, pages 260--269. ACM, 2015. [ bib | DOI | http ]
[5] Ahmed Bouajjani, Michael Emmi, Constantin Enea, and Jad Hamza. On reducing linearizability to state reachability. In Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, volume 9135 of Lecture Notes in Computer Science, pages 95--107. Springer, 2015. [ bib | DOI | http ]
[6] Constantin Enea, Mihaela Sighireanu, and Zhilin Wu. On automated lemma generation for separation logic with inductive definitions. In Automated Technology for Verification and Analysis - 13th International Symposium, ATVA 2015, Shanghai, China, October 12-15, 2015, Proceedings, volume 9364 of Lecture Notes in Computer Science, pages 80--96. Springer, 2015. [ bib | DOI | http ]
[7] Sandrine Blazy, David Bühler, and Boris Yakobowski. Improving static analyses of C programs with conditional predicates. Science of Computer Programming, January 2016. Accepted manuscript. Available online 30 November 2015.Extended version of the FMICS 2014 paper. [ bib | http ]
Keywords: Static analysis ; Abstract interpretation ; Dataflow analysis ; Path sensitivity
[8] Andrew Reynolds, Radu Iosif, and Tim King. A decision procedure for separation logic in SMT. CoRR, abs/1603.06844, 2016. [ bib | http ]
[9] Claire Dross and Yannick Moy. Abstract software specifications and automatic proof of refinement. In 1st International Conference on Reliability, Safety and Security of Railway Systems (RSSR), 2016. [ bib ]
[10] Radu Iosif, Adam Rogalewicz, and Tomás Vojnar. Abstraction refinement and antichains for trace inclusion of infinite state systems. In Tools and Algorithms for the Construction and Analysis of Systems - 22nd International Conference, TACAS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings, pages 71--89, 2016. [ bib ]
[11] Michael Emmi and Constantin Enea. Symbolic abstract data type inference. In Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2016, St. Petersburg, FL, USA, January 20 - 22, 2016, pages 513--525. ACM, 2016. [ bib | http ]

This file was generated by bibtex2html 1.98.