Difference between revisions of "Publications"

From vecolib
Jump to: navigation, search
Line 1: Line 1:
 +
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 +
 
<html>
 
<html>
  
 
<head>
 
<head>
 
<title>ref</title>
 
<title>ref</title>
 +
<meta http-equiv="content-type" content="text/html; charset=ANSI_X3.4-1968">
 +
<meta name="generator" content="bibtex2html">
 
</head>
 
</head>
  
 
<body>
 
<body>
  
<body>
+
<!-- This document was automatically generated with bibtex2html 1.98
 
+
     (see http://www.lri.fr/~filliatr/bibtex2html/),
<!-- This document was automatically generated with bibtex2html 1.98                                    
+
     with the following command:
     (see http://www.lri.fr/~filliatr/bibtex2html/),                                                    
+
     with the following command:                                                                        
+
 
     /usr/bin/bibtex2html ref.bib  -->
 
     /usr/bin/bibtex2html ref.bib  -->
  
Line 25: Line 27:
 
  On automated lemma generation for separation logic with inductive
 
  On automated lemma generation for separation logic with inductive
 
   definitions.
 
   definitions.
  In <em>Automated Technology for Verification and Analysis - 13th                                      
+
  In <em>Automated Technology for Verification and Analysis - 13th
   International Symposium, ATVA 2015, Shanghai, China, October 12-15, 2015,                            
+
   International Symposium, ATVA 2015, Shanghai, China, October 12-15, 2015,
 
   Proceedings</em>, volume 9364 of <em>Lecture Notes in Computer Science</em>, pages
 
   Proceedings</em>, volume 9364 of <em>Lecture Notes in Computer Science</em>, pages
 
   80--96. Springer, 2015.
 
   80--96. Springer, 2015.
[&nbsp;<a href="ref_bib.html#DBLP:conf/atva/EneaSW15">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-24953-7_7">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-24953-7_7">http</a>&nbsp;]
 
<a href="http://dx.doi.org/10.1007/978-3-319-24953-7_7">http</a>&nbsp;]
  
 
</td>
 
</td>
 
</tr>
 
</tr>
 +
  
 
<tr valign="top">
 
<tr valign="top">
Line 47: Line 50:
 
   II</em>, volume 9135 of <em>Lecture Notes in Computer Science</em>, pages 95--107.
 
   II</em>, volume 9135 of <em>Lecture Notes in Computer Science</em>, pages 95--107.
 
   Springer, 2015.
 
   Springer, 2015.
[&nbsp;<a href="ref_bib.html#DBLP:conf/icalp/BouajjaniEEH15">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-662-47666-6_8">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-662-47666-6_8">http</a>&nbsp;]
 
<a href="http://dx.doi.org/10.1007/978-3-662-47666-6_8">http</a>&nbsp;]
  
 
</td>
 
</td>
 
</tr>
 
</tr>
 +
  
 
<tr valign="top">
 
<tr valign="top">
Line 61: Line 65:
 
Michael Emmi, Constantin Enea, and Jad Hamza.
 
Michael Emmi, Constantin Enea, and Jad Hamza.
 
  Monitoring refinement via symbolic reasoning.
 
  Monitoring refinement via symbolic reasoning.
  In <em>Proceedings of the 36th ACM SIGPLAN Conference on                                              
+
  In <em>Proceedings of the 36th ACM SIGPLAN Conference on
   Programming Language Design and Implementation, Portland, OR, USA, June                              
+
   Programming Language Design and Implementation, Portland, OR, USA, June
 
   15-17, 2015</em>, pages 260--269. ACM, 2015.
 
   15-17, 2015</em>, pages 260--269. ACM, 2015.
[&nbsp;<a href="ref_bib.html#DBLP:conf/pldi/EmmiEH15">bib</a>&nbsp;|
+
[&nbsp;<a href="ref_bib.html#DBLP:conf/pldi/EmmiEH15">bib</a>&nbsp;|  
<a href="http://dx.doi.org/10.1145/2737924.2737983">DOI</a>&nbsp;|
+
<a href="http://dx.doi.org/10.1145/2737924.2737983">DOI</a>&nbsp;|  
 
<a href="http://doi.acm.org/10.1145/2737924.2737983">http</a>&nbsp;]
 
<a href="http://doi.acm.org/10.1145/2737924.2737983">http</a>&nbsp;]
  
 
</td>
 
</td>
 
</tr>
 
</tr>
 +
  
 
<tr valign="top">
 
<tr valign="top">
Line 79: Line 84:
 
   Vojnar.
 
   Vojnar.
 
  Compositional entailment checking for a fragment of separation logic.
 
  Compositional entailment checking for a fragment of separation logic.
  In <em>Programming Languages and Systems - 12th Asian Symposium,                                      
+
  In <em>Programming Languages and Systems - 12th Asian Symposium,
 
   APLAS 2014, Singapore, November 17-19, 2014, Proceedings</em>, pages 314--333,
 
   APLAS 2014, Singapore, November 17-19, 2014, Proceedings</em>, pages 314--333,
 
   2014.
 
   2014.
[&nbsp;<a href="ref_bib.html#DBLP:conf/aplas/EneaLSV14">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-319-12736-1_17">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-319-12736-1_17">http</a>&nbsp;]
 
<a href="http://dx.doi.org/10.1007/978-3-319-12736-1_17">http</a>&nbsp;]
  
 
</td>
 
</td>
 
</tr>
 
</tr>
 +
  
 
<tr valign="top">
 
<tr valign="top">
Line 97: Line 103:
 
  Deciding entailments in inductive separation logic with tree
 
  Deciding entailments in inductive separation logic with tree
 
   automata.
 
   automata.
  In <em>Automated Technology for Verification and Analysis - 12th                                      
+
  In <em>Automated Technology for Verification and Analysis - 12th
   International Symposium, ATVA 2014, Sydney, NSW, Australia, November 3-7,                            
+
   International Symposium, ATVA 2014, Sydney, NSW, Australia, November 3-7,
 
   2014, Proceedings</em>, pages 201--218, 2014.
 
   2014, Proceedings</em>, pages 201--218, 2014.
[&nbsp;<a href="ref_bib.html#DBLP:conf/atva/IosifRV14">bib</a>&nbsp;|
+
[&nbsp;<a href="ref_bib.html#DBLP:conf/atva/IosifRV14">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-11936-6_15">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-11936-6_15">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:journals/corr/IosifRV14a">6</a>]
+
[<a name="DBLP:conf/tacas/IosifRV16">6</a>]
 
</td>
 
</td>
 
<td class="bibtexitem">
 
<td class="bibtexitem">
 
Radu Iosif, Adam Rogalewicz, and Tom&aacute;s Vojnar.
 
Radu Iosif, Adam Rogalewicz, and Tom&aacute;s Vojnar.
  Abstraction refinement for trace inclusion of data automata.
+
  Abstraction refinement and antichains for trace inclusion of infinite
  <em>CoRR</em>, abs/1410.5056, 2014.
+
  state systems.
[&nbsp;<a href="ref_bib.html#DBLP:journals/corr/IosifRV14a">bib</a>&nbsp;|
+
In <em>Tools and Algorithms for the Construction and Analysis of
<a href="http://arxiv.org/abs/1410.5056">http</a>&nbsp;]
+
  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</em>, pages 71--89,
 +
  2016.
 +
[&nbsp;<a href="ref_bib.html#DBLP:conf/tacas/IosifRV16">bib</a>&nbsp;]
 +
 
 +
</td>
 +
</tr>
 +
 
 +
 
 +
<tr valign="top">
 +
<td align="right" class="bibtexnumber">
 +
[<a name="dross2016rssr">7</a>]
 +
</td>
 +
<td class="bibtexitem">
 +
Claire Dross and Yannick Moy.
 +
Abstract software specifications and automatic proof of refinement.
 +
In <em>1st International Conference on Reliability, Safety and
 +
  Security of Railway Systems (RSSR)</em>, 2016.
 +
[&nbsp;<a href="ref_bib.html#dross2016rssr">bib</a>&nbsp;]
 +
 
 +
</td>
 +
</tr>
 +
 
 +
 
 +
<tr valign="top">
 +
<td align="right" class="bibtexnumber">
 +
[<a name="DBLP:journals/corr/ReynoldsI016">8</a>]
 +
</td>
 +
<td class="bibtexitem">
 +
Andrew Reynolds, Radu Iosif, and Tim King.
 +
A decision procedure for separation logic in SMT.
 +
  <em>CoRR</em>, abs/1603.06844, 2016.
 +
[&nbsp;<a href="ref_bib.html#DBLP:journals/corr/ReynoldsI016">bib</a>&nbsp;|  
 +
<a href="http://arxiv.org/abs/1603.06844">http</a>&nbsp;]
  
 
</td>
 
</td>
Line 122: Line 163:
 
</table><hr><p><em>This file was generated by
 
</table><hr><p><em>This file was generated by
 
<a href="http://www.lri.fr/~filliatr/bibtex2html/">bibtex2html</a> 1.98.</em></p>
 
<a href="http://www.lri.fr/~filliatr/bibtex2html/">bibtex2html</a> 1.98.</em></p>
 
 
</body>
 
</body>
 
</html>
 
</html>

Revision as of 10:56, 6 June 2016

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">

ref

[1] 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 ]
[2] 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 ]
[3] 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 ]
[4] 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 ]
[5] 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 ]
[6] 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 ]
[7] 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 ]
[8] Andrew Reynolds, Radu Iosif, and Tim King. A decision procedure for separation logic in SMT. CoRR, abs/1603.06844, 2016. [ bib | http ]

This file was generated by bibtex2html 1.98.