pl.xml

<?xml version="1.0" encoding="utf-8"?>

<!DOCTYPE cv [
<!ENTITY emdash "&#8212;">
]>

<cv xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:noNamespaceSchemaLocation="cvx/cvx.xsd">
  <news-list>
    <news date="2024.01.19" id="paper-toplas24">
      <news-snippet>
        Paper by
        <ref table="pub" key="demanded-summarization-toplas24" mode="authors" /> published in
        <ref table="journal" key="toplas" />.
      </news-snippet>
      <news-detail>
        CUPLV authors
        <ref table="person" key="bstein" /> and <ref table="person" key="bec" /> with collaborators
        has had a paper "<ref table="pub" key="demanded-summarization-toplas24" />" published in
        <ref table="journal" key="toplas" />.
      </news-detail>
    </news>
    <news date="2023.11.01" id="phd-call-2023">
      <news-snippet>
        Call for Ph.D. applicants for Fall 2024.  Application deadline
        is December 15, 2023.
      </news-snippet>
      <news-page header="Ph.D. Positions">
        <p>We are looking for enthusiastic students to join our diverse and
        dynamic group in programming languages and verification.  Our group has
        active projects in areas such as static and dynamic program analysis;
        verification, debugging, and programmer productivity tools; program synthesis;
        language-based security; type systems; language design; analysis of
        hybrid and embedded systems.  We have a track record of publishing in
        top venues, such as POPL, PLDI, and CAV.  <a
        href="https://www.colorado.edu/cs/apply/graduate-admissions"> CS
        Admissions</a> and <a
        href="http://www.colorado.edu/ecee/graduate-program/admissions">ECEE
        Admissions</a> (deadline December 15, 2023).</p>
      </news-page>
    </news>
    <news date="2023.07.01" id="paper-oopsla23">
      <news-snippet>
        Two papers with CUPLV authors accepted to <ref table="event" key="oopsla23"/>!
        [<ref table="pub" key="historia-oopsla23" text="1"/>,
        <ref table="pub" key="indistinguishability-oopsla23" text="2"/>]
      </news-snippet>
      <news-detail>
        CUPLV authors
        <author person="smeier"/>,
        <author person="klinvill"/>,
        <author person="smover"/>,
        <author person="gkaki"/>, and
        <author person="bec"/>
        have had papers accepted for presentation at <ref table="event" key="oopsla23"/> in October (<ref table="pub"
        key="historia-oopsla23" mode="authors"/> and <ref table="pub"
        key="indistinguishability-oopsla23" mode="authors"/>).
      </news-detail>
    </news>
    <news date="2023.06.29" id="paper-sas23">
      <news-snippet>
        Paper by
        <ref table="pub" key="ondemandcg-sas23" mode="authors" /> accepted to
        <ref table="event" key="sas23" />.
      </news-snippet>
      <news-detail>
        CUPLV author
        <ref table="person" key="bec" /> with collaborators
        has had a paper "<ref table="pub" key="ondemandcg-sas23" />" accepted for presentation at
        <ref table="event" key="sas23" /> in October.
      </news-detail>
    </news>
    <news date="2022.11.01" id="phd-call-2022">
      <news-snippet>
        Call for Ph.D. applicants for Fall 2023.  Application deadline
        is December 15, 2022.
      </news-snippet>
      <news-page header="Ph.D. Positions">
        <p>We are looking for enthusiastic students to join our diverse and
        dynamic group in programming languages and verification.  Our group has
        active projects in areas such as static and dynamic program analysis;
        verification, debugging, and programmer productivity tools; program synthesis;
        language-based security; type systems; language design; analysis of
        hybrid and embedded systems.  We have a track record of publishing in
        top venues, such as POPL, PLDI, and CAV.  <a
        href="https://www.colorado.edu/cs/apply/graduate-admissions"> CS
        Admissions</a> and <a
        href="http://www.colorado.edu/ecee/graduate-program/admissions">ECEE
        Admissions</a> (deadline December 15, 2022).</p>
      </news-page>
    </news>
    <news date="2022.02.25" id="paper-pldi22">
      <news-snippet>
        Two papers with CUPLV authors (conditionally) accepted to <ref table="event" key="pldi22"/>!
        [<ref table="pub" key="runtimeassisted-pldi22" text="1"/>,
        <ref table="pub" key="antipotentials-pldi22" text="2"/>]
      </news-snippet>
      <news-detail>
        CUPLV authors <ref table="person" key="gkaki"/>, <ref table="person" key="pprahladan"/>, and <ref table="person" key="nlewchenko"/>
        have had papers accepted for presentation at <ref table="event" key="pldi22"/> in June (<ref table="pub"
        key="runtimeassisted-pldi22" mode="authors"/> and <ref table="pub"
        key="antipotentials-pldi22" mode="authors"/>).
      </news-detail>
    </news>
    <news date="2021.11.01" id="phd-call-2021">
      <news-snippet>
        Call for Ph.D. applicants for Fall 2022.  Application deadline
        is December 15, 2021.
      </news-snippet>
      <news-page header="Ph.D. Positions">
        <p>We are looking for enthusiastic students to join our diverse and
        dynamic group in programming languages and verification.  Our group has
        active projects in areas such as static and dynamic program analysis;
        verification, debugging, and programmer productivity tools; program synthesis;
        language-based security; type systems; language design; analysis of
        hybrid and embedded systems.  We have a track record of publishing in
        top venues, such as POPL, PLDI, and CAV.  <a
        href="https://www.colorado.edu/cs/apply/graduate-admissions"> CS
        Admissions</a> and <a
        href="http://www.colorado.edu/ecee/graduate-program/admissions">ECEE
        Admissions</a> (deadline December 15, 2021).</p>
      </news-page>
    </news>
    <news date="2021.10.13" id="sas-cousot-award-2021">
      <news-snippet>
        CUPLV student <ref table="person" key="tlu"/> wins
        the Radhia Cousot Young Researcher Best Paper Award
        at <ref table="event" key="sas21"/>.
      </news-snippet>
      <news-detail>
        <ref table="person" key="tlu"/>
        wins
        the Radhia Cousot Young Researcher Best Paper Award
        at <ref table="event" key="sas21"/>
        for his paper
        "<ref table="pub" key="brbo-sas21"/>"
        co-authored with
        <ref table="person" key="bec"/>
        and
        <ref table="person" key="atrivedi"/>.
      </news-detail>
    </news>
    <news date="2021.09.29" id="slutz21">
      <news-snippet>
        CUPLV student <ref table="person" key="bstein"/>
        receives the 2021
        <a href="https://www.colorado.edu/cs/current-students/student-awards">Ralph J. Slutz Student Excellence Award</a>.
      </news-snippet>
    </news>
    <news date="2021.07.05" id="paper-sas21">
      <news-snippet>
        Paper by
        <ref table="pub" key="brbo-sas21" mode="authors" /> accepted to
        <ref table="event" key="sas21" />.
      </news-snippet>
      <news-detail>
        CUPLV authors
        <ref table="person" key="tlu" />,
        <ref table="person" key="bec" />, and
        <ref table="person" key="atrivedi" />,
        have had a paper "<ref table="pub" key="brbo-sas21" />" accepted for presentation at
        <ref table="event" key="sas21" /> in October.
      </news-detail>
    </news>
    <news date="2021.04.19" id="deptresearchaward21">
      <news-snippet>
        CUPLV student <ref table="person" key="bstein"/>
        receives the 2020-2021
        <a href="https://www.colorado.edu/cs/news-events/student-awards#outstanding_research-939">CU CS Outstanding Research Award</a>.
      </news-snippet>
    </news>
    <news date="2021.04.18" id="paper-cav21">
      <news-snippet>
        Paper by
        <ref table="pub" key="bmdp-cav21" mode="authors" /> accepted to
        <ref table="event" key="cav21" />.
      </news-snippet>
      <news-detail>
        CUPLV authors
        <ref table="person" key="mperez" />,
        <ref table="person" key="fabio" />, and
        <ref table="person" key="atrivedi" /> with collaborators,
        have had a paper "<ref table="pub" key="bmdp-cav21" />" accepted for presentation at
        <ref table="event" key="cav21" /> in July.
      </news-detail>
    </news>
    <news date="2021.02.25" id="paper-pldi21">
      <news-snippet>
        Paper by
        <ref table="pub" key="dai-pldi21" mode="authors" /> accepted to
        <ref table="event" key="pldi21" />.
      </news-snippet>
      <news-detail>
        CUPLV authors
        <ref table="person" key="bstein" /> and
        <ref table="person" key="bec" /> with collaborators
        have had a paper "<ref table="pub" key="dai-pldi21" />" accepted for presentation at
        <ref table="event" key="pldi21" /> in June.
      </news-detail>
    </news>
    <news date="2020.11.12" id="paper-fnt20">
      <news-snippet>
        Survey article
        "<ref table="pub" key="shapeanalysis-fnt20"/>"
        by
        <ref table="pub" key="shapeanalysis-fnt20" mode="authors"/> 
        published in
        <ref table="journal" key="fntpl" />.
      </news-snippet>
      <news-detail>
        CUPLV author
        <ref table="person" key="bec" /> with collaborators
        have had a survery paper "<ref table="pub" key="shapeanalysis-fnt20" />" published in
        <ref table="journal" key="fntpl" />.
      </news-detail>
    </news>
    <news date="2020.11.01" id="phd-call-2020">
      <news-snippet>
        Call for Ph.D. applicants for Fall 2021.  Application deadline
        is December 15, 2020.
      </news-snippet>
      <news-page header="Ph.D. Positions">
        <p>We are looking for enthusiastic students to join our diverse and
        dynamic group in programming languages and verification.  Our group has
        active projects in areas such as static and dynamic program analysis;
        verification, debugging, and programmer productivity tools; program synthesis;
        language-based security; type systems; language design; analysis of
        hybrid and embedded systems.  We have a track record of publishing in
        top venues, such as POPL, PLDI, and CAV.  <a
        href="https://www.colorado.edu/cs/apply/graduate-admissions"> CS
        Admissions</a> and <a
        href="http://www.colorado.edu/ecee/graduate-program/admissions">ECEE
        Admissions</a> (deadline December 15, 2020).</p>
      </news-page>
    </news>
    <news date="2020.04.05" id="paper-cav20">
      <news-snippet>
        Four papers with CUPLV authors accepted to <ref table="event" key="cav20"/>
        [<ref table="pub" key="reachability-cav20" text="1"/>,
        <ref table="pub" key="unboundedtime-cav20" text="2"/>,
        <ref table="pub" key="pirk-cav20" text="3"/>,
        <ref table="pub" key="amytiss-cav20" text="4"/>].
      </news-snippet>
      <news-detail>
        CUPLV authors
        <ref table="person" key="srirams"/>
        and
        <ref table="person" key="mzamani"/>
        with collaborators
        have had papers accepted for presentation at
        <ref table="event" key="cav20"/> in July
        (<ref table="pub" key="reachability-cav20" mode="authors"/>,
        <ref table="pub" key="unboundedtime-cav20" mode="authors"/>,
        <ref table="pub" key="pirk-cav20" mode="authors"/>,
        and
        <ref table="pub" key="amytiss-cav20" mode="authors"/>).
      </news-detail>
    </news>
    <news date="2019.11.01" id="faculty-2019">
      <news-snippet>
        <a href="news.html#faculty-2019">Tenure-track and instructor openings</a> in <a href="https://www.colorado.edu/cs/">CS</a>.
      </news-snippet>
      <news-detail>
        Please consider applying or encourage your students and postdocs to apply for positions in the <a href="https://www.colorado.edu/cs/">Department of Computer Science</a>.
        We have <a href="https://www.colorado.edu/cs/jobs">multiple openings</a> with one particular interest area being <a href="news.html#faculty-2019"><em>trustworthy software</em></a>.
        <a href="https://jobs.colorado.edu/jobs/JobDetail/21053/">Applications</a>
        will be evaluated beginning on December 1, 2019, although applications will continue to be evaluated until the position is filled.
      </news-detail>
      <news-page header="Tenure-Track and Instructor Positions">
        <p>
        <float img="pics/Preview_Winter_Panorama_CC141.jpg">
          The majestic, snow-covered Flatirons is a breathtaking backdrop with Old Main at the University of Colorado Boulder in the foreground. (Photo by Casey A. Cass/University of Colorado)
        </float>
        <a href="https://jobs.colorado.edu/jobs/JobDetail/21053/"><b>Apply for a Tenure-Track Position in Trustworthy Software</b></a>.
        <a href="http://www.colorado.edu/cs">The Department of Computer Science</a> at the University of Colorado Boulder is currently seeking applications for a tenure-track faculty position in the area of secure and reliable software. This includes, but is not limited to, a broad swath of topics, including programming language foundations (e.g., type systems, language design), large-scale distributed systems (e.g., cloud computing), secure software (e.g., language-based security), probabilistic programming (e.g., languages for machine learning), automated reasoning (e.g., program analysis, software verification), industrial-scale computing (e.g., software engineering), and computing education research. However, many promising candidates may not identify their work under any of the specific areas listed. Such candidates are encouraged to contact the search chair (see below).</p>
        <p>The position is open at all levels, with emphasis on applicants at the Assistant Professor level. Candidates whose expertise cuts across engineering and related disciplines are especially encouraged to apply.</p>
        <p>We are especially interested in qualified candidates who can contribute, through their research, teaching, and service, to the diversity and excellence of our academic community. Our university is also responsive to dual career situations.</p>
        <p>This position is part of the long-term growth plans for the College of Engineering and Applied Science (CEAS). CEAS is the highest ranked engineering college in the Rocky Mountain time zone and hosts several nationally ranked departments.  The Department of Computer Science has 2500 undergraduate students, 369 graduate students and 69 faculty.  The Department's research and education efforts interact broadly with many interdisciplinary programs and collaborators in the Boulder area, including national labs at NIST, NOAA, NREL, and NCAR, and CU Boulder research institutes including the ATLAS Institute, the BioFrontiers Institute, and the Institute for Cognitive Science.  More than 20 faculty members have joint affiliations with one of these labs. The Department also has a long-standing partnership with the National Center for Women and IT and has faculty active in increasing the broadening of participation in computer science via their research, teaching, and service. In addition, the Department has extensive ties with the thriving local tech community and inhabits a picturesque location in the foothills of the Rocky Mountains.</p>
        <p>Candidates will be expected to engage in undergraduate and graduate teaching, contribute professional service, and develop vigorous, externally funded research programs in their technical areas. Potential faculty members applying to the Department of Computer Science at the University of Colorado Boulder should describe their plans to develop a recognized research program based on scholarly work in their particular field, their ideas for interdisciplinary collaboration, their experience and interests in teaching undergraduates and graduates, and their future plans for inspiring diverse students to conduct research.</p>
        <p>The position will remain open until filled, though for full consideration applications should be received by December 1, 2019.</p>
        <p><a href="https://jobs.colorado.edu/jobs/JobDetail/21351/"><b>Apply for an Instructor Position</b></a>.
        The Department of Computer Science in the College of Engineering and Applied Science at the University of Colorado Boulder invites applications for a full-time Instructor position. This position will support the Department of Computer Science and fulfillment of the department’s educational mission through teaching Computer Science courses on the CU-Boulder campus.</p>
        <p>Candidates must demonstrate a strong commitment to high-quality undergraduate education. We are particularly interested in candidates with a background in the areas of algorithms, databases, software engineering, or programming languages.</p>
        <p>Applications will be accepted until the position is filled.</p>
      </news-page>
    </news>
    <news date="2019.11.01" id="phd-call-2019">
      <news-snippet>
        Call for Ph.D. applicants for Fall 2020.  Application deadline
        is December 15, 2019.
      </news-snippet>
      <news-page header="Ph.D. Positions">
        <p>We are looking for enthusiastic students to join our diverse and
        dynamic group in programming languages and verification.  Our group has
        active projects in areas such as static and dynamic program analysis;
        verification, debugging, and programmer productivity tools; program synthesis;
        language-based security; type systems; language design; analysis of
        hybrid and embedded systems.  We have a track record of publishing in
        top venues, such as POPL, PLDI, and CAV.  <a
        href="https://www.colorado.edu/cs/apply/graduate-admissions"> CS
        Admissions</a> and <a
        href="http://www.colorado.edu/ecee/graduate-program/admissions">ECEE
        Admissions</a> (deadline December 15, 2019).</p>
      </news-page>
    </news>
    <news date="2019.08.30" id="paper-oopsla19">
      <news-snippet>
        Paper by
        <ref table="pub" key="tajsvr-oopsla19" mode="authors" /> accepted to
        <ref table="event" key="oopsla19" />.
      </news-snippet>
      <news-detail>
        CUPLV authors
        <ref table="person" key="bstein" /> and
        <ref table="person" key="bec" /> with collaborators
        have had a paper "<ref table="pub" key="tajsvr-oopsla19" />" accepted for presentation at
        <ref table="event" key="oopsla19" /> in October.
      </news-detail>
    </news>
    <news date="2019.07.01" id="paper-rv19">
      <news-snippet>
        Three papers with CUPLV authors accepted to <ref table="event" key="rv19"/>
        [<ref table="pub" key="nn-rv19" text="1"/>,
        <ref table="pub" key="uav-rv19" text="2"/>,
        <ref table="pub" key="robustness-rv19" text="3"/>].
      </news-snippet>
      <news-detail>
        CUPLV authors
        <ref table="person" key="sniari"/>,
        <ref table="person" key="hyoon"/>,
        <ref table="person" key="ychou"/>,
        <ref table="person" key="cernyp"/>,
        <ref table="person" key="srirams"/>,
        and
        <ref table="person" key="atrivedi"/>
        with collaborators
        have had papers accepted for presentation at
        <ref table="event" key="rv19"/> in October
        (<ref table="pub" key="nn-rv19" mode="authors"/>,
        <ref table="pub" key="uav-rv19" mode="authors"/>,
        and
        <ref table="pub" key="robustness-rv19" mode="authors"/>).
      </news-detail>
    </news>
    <news date="2019.06.24" id="fixr-github19">
      <news-snippet>
        Fixr Team presents at GitHub.
      </news-snippet>
      <news-detail>
        CUPLV researchers
        <ref table="person" key="smover" /> and
        <ref table="person" key="srirams" />
        represents the Fixr Team
        at GitHub in San Francisco.
      </news-detail>
      <news-page header="Fixr Team at GitHub">
        <p>
        <float img="pics/fixr-github19.png">
          Fixr Team at GitHub.
        </float>
        </p>
      </news-page>
    </news>
    <news date="2019.06.14" id="paper-icfp19">
      <news-snippet>
        Paper by
        <ref table="pub" key="repstore-icfp19" mode="authors" /> accepted to
        <ref table="event" key="icfp19" />.
      </news-snippet>
      <news-detail>
        CUPLV authors
        <ref table="person" key="nlewchenko" />,
        <ref table="person" key="agaonkar" />, and
        <ref table="person" key="cernyp" /> with collaborators
        have had a paper "<ref table="pub" key="repstore-icfp19" />" accepted for presentation at
        <ref table="event" key="icfp19" /> in August.
      </news-detail>
    </news>
    <news date="2019.04.17" id="paper-cav19">
      <news-snippet>
        Paper by
        <ref table="pub" key="sidechannels-cav19" mode="authors" /> accepted to
        <ref table="event" key="cav19" />.
      </news-snippet>
      <news-detail>
        CUPLV authors
        <ref table="person" key="sniari" />,
        <ref table="person" key="cernyp" />, and
        <ref table="person" key="atrivedi" />
        have had a paper "<ref table="pub" key="sidechannels-cav19" />" accepted for presentation at
        <ref table="event" key="cav19" /> in July.
      </news-detail>      
    </news>
    <news date="2019.03.31" id="paper-ecoop19">
      <news-snippet>
        Paper by
        <ref table="pub" key="verivita-ecoop19" mode="authors" /> accepted to
        <ref table="event" key="ecoop19" />.
      </news-snippet>
      <news-detail>
        CUPLV authors
        <ref table="person" key="smeier" />,
        <ref table="person" key="smover" />, and
        <ref table="person" key="bec" />
        have had a paper "<ref table="pub" key="verivita-ecoop19" />" accepted for presentation at
        <ref table="event" key="ecoop19" /> in July.
      </news-detail>      
    </news>
    <news date="2018.11.23" id="paper-vmcai19">
      <news-snippet>
        Paper by
        <ref table="pub" key="bounding-vmcai19" mode="authors" /> accepted to
        <ref table="event" key="vmcai19" />.
      </news-snippet>
      <news-detail>
        CUPLV authors
        <ref table="person" key="tlu" />
        <ref table="person" key="cernyp" />,
        <ref table="person" key="bec" />, and
        <ref table="person" key="atrivedi" />
        have had a paper "<ref table="pub" key="bounding-vmcai19" />" accepted for presentation at
        <ref table="event" key="vmcai19" /> in January.
      </news-detail>      
    </news>
    <news date="2018.10.23" id="slutz18">
      <news-snippet>
        CUPLV student <ref table="person" key="tkushner"/>
        receives the 2018
        <a href="https://www.colorado.edu/cs/current-students/student-awards">Ralph J. Slutz Student Excellence Award</a>.
      </news-snippet>
    </news>
    <news date="2018.08.01" id="catalyzecu18">
      <news-snippet>
        CUPLV student <ref table="person" key="smeier"/>
        <a href="https://www.facebook.com/InnovateCUBldr/videos/2139011353088118/">pitched</a>
        at 
        <a href="https://www.colorado.edu/catalyzecu/2018-companies">Catalyze CU</a> Demo Day 2018.
      </news-snippet>
    </news>
    <news date="2018.07.03" id="paper-ase18">
      <news-snippet>
        Paper by
        <ref table="pub" key="streams-ase18" mode="authors" /> accepted to
        <ref table="event" key="ase18" />.
      </news-snippet>
      <news-detail>
        CUPLV authors
        <ref table="person" key="bstein" /> and
        <ref table="person" key="bec" /> with collaborators
        have had a paper "<ref table="pub" key="streams-ase18" />" accepted for presentation at
        <ref table="event" key="ase18" /> in September.
      </news-detail>
    </news>
    <news date="2018.06.19" id="paper-cmsb18">
      <news-snippet>
        Paper by
        <ref table="pub" key="robustmpc-cmsb18" mode="authors" /> accepted to
        <ref table="event" key="cmsb18" />.
      </news-snippet>
      <news-detail>
        CUPLV authors
        <ref table="person" key="sdutta" />
        <ref table="person" key="tkushner" />, and
        <ref table="person" key="srirams" />
        have had a paper "<ref table="pub" key="robustmpc-cmsb18" />" accepted for presentation at
        <ref table="event" key="cmsb18" /> in September.
      </news-detail>
    </news>
    <news date="2018.06.01" id="faculty-mover">
      <news-snippet>
        CUPLV Postdoctoral Scholar
        <ref table="person" key="smover" />
        accepts a faculty position 
        at <a href="https://www.lix.polytechnique.fr/">École Polytechnique</a>.
      </news-snippet>
      <news-detail>
        CUPLV Postdoctoral Scholar
        <ref table="person" key="smover" />
        accepts a position as a  
        Gaspard Monge Assistant Professor
        in Computer Science
        at <a href="https://www.lix.polytechnique.fr/">École Polytechnique</a>.
      </news-detail>
    </news>
    <news date="2018.05.07" id="faculty-mcclurg">
      <news-snippet>
        CUPLV PhD Student
        <ref table="person" key="mcclurg" />
        accepts a faculty position 
        at <a href="http://www.cs.unm.edu/">UNM</a>.
      </news-snippet>
      <news-detail>
        CUPLV PhD Student
        <ref table="person" key="mcclurg" />
        accepts a position as an assistant professor
        of comptuer science
        at the <a href="http://www.cs.unm.edu/">University of New Mexico</a>.
      </news-detail>
    </news>
    <news date="2018.04.06" id="eceeaward-sniari">
      <news-snippet>
        CUPLV PhD Student
        <ref table="person" key="sniari" />
        wins the 2018 Gold Research Award from
        <a href="http://ecee.colorado.edu/">ECEE</a>.
      </news-snippet>
      <news-page header="ECEE Research Award">
        <p>
        <float img="pics/niari-ecee-award-2018.jpg">
          Saeid Tizpaz Niari with his award!
        </float>
        Congratulations, Saeid!
        </p>
      </news-page>
    </news>     
    <news date="2018.03.23" id="award-saner18">
      <news-snippet>
        Paper by
        <ref table="pub" key="biggroum-saner18" mode="authors"/>
        wins the IEEE TCSE Distinguished Paper Award at
        <ref table="event" key="saner18" />.
      </news-snippet>
      <news-detail>
        CUPLV authors
        <ref table="person" key="smover" />,
        <ref table="person" key="srirams" />,
        <ref table="person" key="rolsen" />, and
        <ref table="person" key="bec" />
        win the IEEE TCSE Distinguished Paper Award at
        <ref table="event" key="saner18" />
        for "<ref table="pub" key="biggroum-saner18" />."
      </news-detail>
    </news>   
    <news date="2018.03.22" id="award-nvc10">
      <news-snippet>
        CUPLV team came in 3rd in the R&amp;D track of <a href="https://www.colorado.edu/nvc/">NVC</a>10.
      </news-snippet>
      <news-detail>
        CUPLV researchers
        <ref table="person" key="smeier" /> and
        <ref table="person" key="bec" /> with collaborators
        came in 3rd in the R&amp;D track of
        <a href="https://www.colorado.edu/nvc/">New Venture Challenge</a> 10, earning $1,000 for the venture.
      </news-detail>
      <news-page header="NVC10">
        <p>
        <float img="pics/meier-nvc10.jpg">
          Lambda Leaf with their award!
        </float>
        Congratulations, Shawn!
        </p>
      </news-page>
    </news>
    <news date="2018.02.14" id="phdvisit-2018">
      <news-snippet>
         Prospective Ph.D. students visit February 16. Welcome!
      </news-snippet>
    </news>
    <news date="2017.12.20" id="paper-hscc18">
      <news-snippet>
        Paper by
        <ref table="pub" key="almostsure-hscc18" mode="authors" /> accepted to
        <ref table="event" key="hscc18" />.
      </news-snippet>
      <news-detail>
        CUPLV authors
        <ref table="person" key="fabio" /> and
        <ref table="person" key="atrivedi" /> with collaborators
        have had a paper "<ref table="pub" key="almostsure-hscc18" />" accepted for presentation at
        <ref table="event" key="hscc18" /> in April.
      </news-detail>
    </news>
    <news date="2017.12.19" id="paper-iccps18">
      <news-snippet>
        Paper by
        <ref table="pub" key="data-driven-models-iccps18" mode="authors" /> accepted to
        <ref table="event" key="iccps18" />.
      </news-snippet>
      <news-detail>
        CUPLV authors
        <ref table="person" key="tkushner" /> and
        <ref table="person" key="srirams" /> with collaborators
        have had a paper "<ref table="pub" key="data-driven-models-iccps18" />" accepted for presentation at
        <ref table="event" key="iccps18" /> in April.
      </news-detail>
    </news>
    <news date="2017.12.17" id="paper-saner18">
      <news-snippet>
        Paper by
        <ref table="pub" key="biggroum-saner18" mode="authors" /> accepted to
        <ref table="event" key="saner18" />.
      </news-snippet>
      <news-detail>
        CUPLV authors
        <ref table="person" key="smover" />,
        <ref table="person" key="srirams" />,
        <ref table="person" key="rolsen" />, and
        <ref table="person" key="bec" />
        have had a paper "<ref table="pub" key="biggroum-saner18" />" accepted for presentation at
        <ref table="event" key="saner18" /> in March.
      </news-detail>
    </news>
    <news date="2017.12.13" id="paper-icse18">
      <news-snippet>
        Paper by
        <ref table="pub" key="droidstar-icse18" mode="authors" /> accepted to
        <ref table="event" key="icse18" />.
      </news-snippet>
      <news-detail>
        CUPLV authors
        <ref table="person" key="nlewchenko" />,
        <ref table="person" key="smeier" />,
        <ref table="person" key="smover" />,
        <ref table="person" key="bec" />, and
        <ref table="person" key="cernyp" /> with collaborators
        have had a paper "<ref table="pub" key="droidstar-icse18" />" accepted for presentation at
        <ref table="event" key="icse18" /> in May.
      </news-detail>
    </news>
    <news date="2017.12.11" id="award-emsoft17">
      <news-snippet>
        Paper by
        <ref table="pub" key="compositional-emsoft17" mode="authors"/>
        nominated for an ACM SIGBED EMSOFT Best Paper Award.
      </news-snippet>
      <news-detail>
        CUPLV authors
        <ref table="person" key="xinchen"/>,
        <ref table="person" key="smover"/>, and
        <ref table="person" key="srirams"/>
        nominated for an ACM SIGBED EMSOFT Best Paper Award
        for "<ref table="pub" key="compositional-emsoft17"/>."
      </news-detail>
    </news>      
    <news date="2017.11.28" id="paper-aaai18">
      <news-snippet>
        Paper by
        <ref table="pub" key="dpdebugger-aaai18" mode="authors" /> accepted to
        <ref table="event" key="aaai18" />.
      </news-snippet>
      <news-detail>
        CUPLV authors
        <ref table="person" key="sniari" />,
        <ref table="person" key="cernyp" />,
        <ref table="person" key="bec" />, and
        <ref table="person" key="atrivedi" />
        have had a paper "<ref table="pub" key="dpdebugger-aaai18" />" accepted for presentation at
        <ref table="event" key="aaai18" /> in February.
      </news-detail>
    </news> 
    <news date="2017.08.02" id="chimpcheck-onward17">
        <news-snippet>
          Paper by <ref table="pub" key="chimpcheck-onward17" mode="authors"/>
          accepted to <ref table="event" key="onward17"/>.
        </news-snippet>
        <news-detail>
          CUPLV authors
                  <ref table="person" key="elam"/>,
                  <ref table="person" key="pzhang"/>, and
                  <ref table="person" key="bec"/>
          have had a paper "<ref table="pub" key="chimpcheck-onward17"/>"
          officially accepted for presentation at <ref table="event" key="onward17"/> in October.
        </news-detail>
      </news>
      <news date="2017.06.30" id="paper-emsoft17">
        <news-snippet>
          Paper by
          <ref table="pub" key="compositional-emsoft17" mode="authors"/>
          accepted to
          <ref table="event" key="emsoft17"/>.
        </news-snippet>
        <news-detail>
          CUPLV authors
          <ref table="person" key="xinchen"/>,
          <ref table="person" key="smover"/>, and
          <ref table="person" key="srirams"/>
          have had a paper "<ref table="pub" key="compositional-emsoft17"/>" accepted for presentation at
          <ref table="event" key="emsoft17"/>
          in October.
        </news-detail>
      </news>    
      <news date="2017.06.22" id="bec-tenure">
        <news-snippet>
          <ref table="person" key="bec"/>
          promoted to Associate Professor
          and granted
          <a href="https://connections.cu.edu/stories/tenure-list-june-2017">tenure</a>.
        </news-snippet>
      </news>
      <news date="2017.06.21" id="pldisrc17">
        <news-snippet>
          <ref table="person" key="kheadley"/> awarded second place
          at the <a href="http://pldi17.sigplan.org/track/pldi-2017-student-research-competition">PLDI Student Research Competition (SRC)</a>.
        </news-snippet>
        <news-detail>
          Congratulations to <ref table="person" key="kheadley"/> for being awarded second place in the graduate student category
        at the <a href="http://pldi17.sigplan.org/track/pldi-2017-student-research-competition">PLDI Student Research Competition (SRC)</a>
        for his project, "Tuning Data and Control Structures for Incremental Computation."
        </news-detail>
      </news>
      <news date="2017.06.21" id="pldisrc17">
        <news-snippet>
          <ref table="person" key="pzhang"/> awarded first place
          at the <a href="http://pldi17.sigplan.org/track/pldi-2017-student-research-competition">PLDI Student Research Competition (SRC)</a>.
        </news-snippet>
        <news-detail>
          Congratulations to <ref table="person" key="pzhang"/> for being awarded first place in the undergraduate student category
        at the <a href="http://pldi17.sigplan.org/track/pldi-2017-student-research-competition">PLDI Student Research Competition (SRC)</a>
        for his project, "Property-based Randomized Test Generation for Android Applications."
        </news-detail>
      </news>
      <news date="2017.05.23" id="postdoc-call-2017-spring">
        <news-snippet>
    Call for postdoc <a href="news.html#postdoc-call-2017">applicants</a> for Summer or Fall 2017.
        </news-snippet>
        <news-detail>
    There is a postdoctoral research associate position open with the opportunity to work with Profs. <ref table="person" key="cernyp"/>, <ref table="person" key="bec"/>, <ref table="person" key="srirams"/>, and <ref table="person" key="atrivedi"/> on program analysis.
        </news-detail>
        <news-page header="Postdoc Position">
    <p>
    <float img="pics/Preview_Winter_Panorama_CC141.jpg">
      The majestic, snow-covered Flatirons is a breathtaking backdrop with Old Main at the University of Colorado Boulder in the foreground. (Photo by Casey A. Cass/University of Colorado)
    </float>
    The Programming Languages and Verification Group at the University of Colorado Boulder (CUPLV) is looking for exceptional candidates for a postdoctoral research associate in the area of program analysis.</p>
  <p>The ideal candidate has a background in the area of
  programming languages and verification,
    as well as an enthusiasm for mentoring junior researchers.</p>
  <p>
    The postdoctoral researcher would collaborate with Profs. <ref table="person" key="cernyp"/>, <ref table="person" key="bec"/>, <ref table="person" key="srirams"/>, and <ref table="person" key="atrivedi"/>.
    The researcher will have an opportunity to lead an ambitious project on
program analysis for security. To apply, please send an email to <ref table="person" key="cernyp"/>
with a CV and contact information for two or three references.</p>
    <p>Our group has active projects in areas such as the following:
  <ul>
    <li>program analysis</li>
    <li>program synthesis</li>
    <li>cyberphysical systems</li>
  </ul>
    </p>
  <p>The position is for one year, with a possible extension for additional years. Highly-qualified candidates may be considered for a research assistant professor position.  Teaching opportunities will be available. Compensation is highly competitive and commensurate with experience.</p>
  <p>Boulder, located at the base of the Rocky Mountains, is consistently awarded top-rankings for health, education, and quality of life.  It is also home to a concentration of high-tech industry and to a vibrant startup community. It is located 30 miles from downtown Denver.</p>
    </news-page>
    </news>
    <news date="2017.04.28" id="paper-rss17">
      <news-snippet>
  Paper by <ref table="pub" key="clf-learning-rss17" mode="authors"/>
  accepted to <ref table="event" key="rss17"/>.
      </news-snippet>
      <news-detail>
  CUPLV authors <ref table="person" key="hravanbakhsh"/> and <ref table="person" key="srirams"/>
  have had a paper "<ref table="pub" key="clf-learning-rss17"/>"
  accepted for presentation at <ref table="event" key="rss17"/> in October.
      </news-detail>
    </news>
    <news date="2016.12.22" id="paper-tacas17">
      <news-snippet>
        Paper by <ref table="pub" key="discriminator-tacas17" mode="authors"/>
        accepted to <ref table="event" key="tacas17"/>.
      </news-snippet>
      <news-detail>
        CUPLV authors
                <author person="sniari"/>
                <author person="cernyp"/>,
                <author person="bec"/>,
                <author person="srirams"/>, and
                <author person="atrivedi"/>
        have had a paper "<ref table="pub" key="discriminator-tacas17"/>"
        accepted for presentation at <ref table="event" key="tacas17"/> in April.
      </news-detail>
    </news>
    <news date="2016.10.26" id="bwu-seminar-2016">
      <news-snippet>
        <ref table="person" key="bwu"/> visits October 28.
      </news-snippet>
      <news-detail>
        <ref table="person" key="bwu"/> from Colorado School of Mines is
        visiting us on October 28, 2016. He is giving a CUPLV Seminar entitled
        "Compiler and Runtime Optimizations for GPU Memory Systems" at
        3:00pm in KOBL 230 on Friday, October 28, 2016.
      </news-detail>
      <talk-announcement>
        <speaker><ref table="person" key="bwu"/></speaker>
        <affiliation>Colorado School of Mines</affiliation>
        <when>10-28-2015 15:00</when>
        <where>KOBL 230</where>
        <title>Compiler and Runtime Optimizations for GPU Memory Systems</title>
        <abstract>
          <p>In recent year, we have seen a rapid rise of massive parallelism in
          modern processors, exemplified by GPUs, APUs and MIC processors. The
          emergence of massive parallelism in a single node brings growing
          demands for efficient data accesses. Optimizing memory throughput is
          hence critical for tapping into the full potential of the many-core
          systems. In the first half of the talk, I will present some
          theoretical and empirical results on optimizing memory coalescing for
          GPUs. In the second half of the talk, I will present our framework to
          automatically place data on GPUs for performance and portability.</p>
        </abstract>
        <bio>
          <p><ref table="person" key="bwu"/> is an Assistant Professor in
          the EECS department at Colorado School of Mines. He received his Ph.D.
          degree in computer science from the College of William and Mary for
          his dissertation on "Matching Non-Uniformity for Program Optimizations
          on Heterogeneous Manycore Systems”. He received his M.S. degree in
          computer science and B.S. degree in mathematics both from Central
          South University in China. His research interests lie in the broad
          field of compilers and programming systems, with an emphasis on
          program optimizations for heterogeneous computing and emerging
          architectures. Most of his research activities have centered around
          data locality enhancement for heterogeneous computing systems.</p>
        </bio>
        <host><ref table="person" key="bec"/></host>
      </talk-announcement>
    </news>
    <news date="2016.10.26" id="gfainekos-seminar-2016">
      <news-snippet>
        <ref table="person" key="gfainekos"/>
        visits October 27.
      </news-snippet>
      <news-detail>
        <ref table="person" key="gfainekos"/>
        from Arizona State University is visiting us on October 27, 2016. He is giving a Computer Science Colloquium entitled "Beyond Requirements Falsification : Semi-Formal Methods and Tools for the Analysis of Cyber-Physical Systems" at 3:30pm in ECCR 265
        on Thursday, October 27, 2016.
      </news-detail>
      <talk-announcement>
        <speaker><ref table="person" key="gfainekos"/></speaker>
        <affiliation>Arizona State University</affiliation>
        <when>10-27-2016 15:30</when>
        <where>ECCR 265</where>
        <title>
          Beyond Requirements Falsification: Semi-Formal Methods and Tools for the Analysis of Cyber-Physical Systems
        </title>
        <abstract>
          <p>Correct-by-design synthesis methods for Cyber-Physical Systems (CPS) are still in their infancy for CPS with complex physical dynamics. For that reason, a combination of design theories for simpler systems and/or ad-hoc design approaches are
            utilized. Hence, numerous design and implementation errors are discovered while CPS are operational in the field. Such errors can have catastrophic effects to human life and to the economy. Over the last few years, requirements guided falsification
            methods have proven to be a practical approach to the verification problem of industrial size CPS. However, requirements falsification is just one component of the necessary tools for the development of safe and reliable CPS. In this talk, Fainekos
            will provide an overview of his team's research in providing support for all the stages of the development for CPS, from formal requirements elicitation and mining to system conformance to on-line monitoring. Most of their methods have been
            implemented in a Matlab (TM) toolbox called S-TaLiRo (System's TemporAl LogIc Robustness). Finally, in this talk, he will demonstrate that S-TaLiRo can provide answers to challenge problems from the automotive industry.</p>
        </abstract>
        <bio>
          <p><ref table="person" key="gfainekos"/>
            is an associate professor at the School of Computing, Informatics and Decision Systems Engineering (SCIDSE) at Arizona State University (ASU). He is director of the Cyber-Physical Systems (CPS) Lab and he is currently affiliated with the NSF I/UCR
            Center for Embedded Systems (CES) at ASU. He received his PhD in Computer and Information Science in 2008 from the University of Pennsylvania, where he was affiliated with the GRASP laboratory. He holds a Diploma degree (BSc and MSc) in Mechanical
            Engineering from the National Technical University of Athens and an MSc degree in Computer and Information Science from the University of Pennsylvania. Before joining ASU, he held a postdoctoral researcher position at NEC Laboratories America in the
            System Analysis and Verification Group. He is currently working on Cyber-Physical Systems and robotics. In particular, his expertise is on formal methods, logic, artificial intelligence, optimization and control theory. His research has applications on
            automotive systems, medical devices, autonomous (ground and aerial) robots and human-robot interaction (HRI). In 2013, Fainekos received the NSF CAREER award. He was also recipient of the SCIDSE Best Researcher Junior Faculty award for 2013 and of
            the 2008 Frank Anger Memorial ACM SIGBED/SIGSOFT Student Award. Two of his conference papers have been nominated for student best paper awards.
          </p>
        </bio>
      </talk-announcement>
    </news>
    <news date="2016.10.26" id="phd-call-2016">
      <news-snippet>
        Call for Ph.D. applicants for Fall 2017.  Application deadline
        is December 15, 2016.
      </news-snippet>
      <news-detail>
       Call for Ph.D. applicants for Fall 2016.  Application deadline is December 15,
       2015. Check out our latest <a href="talks/openhouse15.pdf">recruiting talk</a>
       from February 20, 2015.
      </news-detail>
      <news-page header="Ph.D. Positions">
        <p>We are looking for enthusiastic students to join our diverse and
        dynamic group in programming languages and verification.  Our group has
        active projects in areas such as static and dynamic program analysis;
        verification, debugging, and programmer productivity tools; program synthesis;
        language-based security; type systems; language design; analysis of
        hybrid and embedded systems.  We have a track record of publishing in
        top venues, such as POPL and PLDI.  <a
        href="http://www.colorado.edu/cs/graduates/admissions"> CS
        Admissions</a> (deadline December 15, 2016) and <a
        href="http://www.colorado.edu/ecee/graduate-program/admissions">ECEE
        Admissions</a> (deadline January 15, 2016 but earlier for financial aid
        consideration).</p>
      </news-page>
    </news>
    <news date="2016.10.13" id="paper-popl17">
      <news-snippet>
        Two papers with CUPLV authors accepted to <ref table="event" key="popl17"/>!
        [<ref table="pub" key="clumping-popl17" text="1"/>,
        <ref table="pub" key="hazelnut-popl17" text="2"/>]
      </news-snippet>
      <news-detail>
        CUPLV authors <ref table="person" key="bec"/> and <ref table="person" key="hammer"/>
        with collaborators
        have had papers accepted for presentation at <ref table="event" key="popl17"/> in January (<ref table="pub"
        key="clumping-popl17" mode="authors"/> and <ref table="pub"
        key="hazelnut-clumping" mode="authors"/>).
      </news-detail>
    </news>
    <news date="2016.08.26" id="paper-gpce16">
      <news-snippet>
        Paper by <ref table="pub" key="vmf-gpce16" mode="authors"/>
        accepted to <ref table="event" key="gpce16"/>.
      </news-snippet>
      <news-detail>
        CUPLV authors <ref table="person" key="bec"/> and
        <ref table="person" key="hammer"/>
        have had a paper "<ref table="pub" key="vmf-gpce16"/>"
        accepted for presentation at <ref table="event" key="gpce16"/> in November.
      </news-detail>
    </news>
    <news date="2015.06.17" id="pldisrc16">
      <news-snippet>
        <ref table="person" key="bstein"/> awarded second place
        at the <a href="http://www.cs.ucsb.edu/~benh/pldi-2016/pldi-2016-SRC.html">PLDI Student Research Competition (SRC)</a>.
      </news-snippet>
      <news-detail>
        Congratulations to <ref table="person" key="bstein"/> for being awarded second place in the graduate student category
        at the <a href="http://www.cs.ucsb.edu/~benh/pldi-2016/pldi-2016-SRC.html">PLDI Student Research Competition (SRC)</a>
        for his project, "Goal-Directed Abstract Interpretation for JavaScript."
      </news-detail>
    </news>
    <news date="2016.06.14" id="paper-sas16">
      <news-snippet>
        Paper by <ref table="pub" key="sdp-sas16" mode="authors"/>
        accepted to <ref table="event" key="sas16"/>.
      </news-snippet>
      <news-detail>
        CUPLV authors <ref table="person" key="proux"/>,
        <ref table="person" key="yvoronin"/>, and
        <ref table="person" key="srirams"/>
        have had a paper "<ref table="pub" key="sdp-sas16"/>"
        accepted for presentation at <ref table="event" key="sas16"/> in September.
      </news-detail>
    </news>
    <news date="2016.05.20" id="paper-emsoft16">
      <news-snippet>
        Paper by <ref table="pub" key="switched-systems-emsoft16" mode="authors"/>
        accepted to <ref table="event" key="emsoft16"/>.
      </news-snippet>
      <news-detail>
        CUPLV authors <ref table="person" key="hravanbakhsh"/> and <ref table="person" key="srirams"/>
        have had a paper "<ref table="pub" key="switched-systems-emsoft16"/>"
        accepted for presentation at <ref table="event" key="emsoft16"/> in October.
      </news-detail>
    </news>
    <news date="2016.05.13" id="grant-ovv">
      <news-snippet>
        NSF grant
        "<a href="http://www.nsf.gov/awardsearch/showAward?AWD_ID=1619282">Online Verification-Validation</a>"
        awarded to <ref table="person" key="hammer"/> and <ref table="person" key="bec"/>.
      </news-snippet>
      <news-detail>
        CUPLV faculty <ref table="person" key="hammer"/> and <ref table="person" key="bec"/>
        have been awarded an NSF grant
        "<a href="http://www.nsf.gov/awardsearch/showAward?AWD_ID=1619282">Online Verification-Validation</a>"
        with collaborator <ref table="person" key="dvanhorn"/> at the University of Maryland.
      </news-detail>
    </news>
    <news date="2016.05.06" id="paper-cav16">
      <news-snippet>
        Two papers with CUPLV authors accepted to <ref table="event" key="cav16"/>!
        [<ref table="pub" key="clausal-cav16" text="1"/>,
        <ref table="pub" key="implicit-cav16" text="2"/>]
      </news-snippet>
      <news-detail>
        CUPLV authors <ref table="person" key="mdooley"/>, <ref table="person" key="fabio"/>, and <ref table="person" key="smover"/>
        have had papers accepted for presentation at <ref table="event" key="cav16"/> in July (<ref table="pub"
        key="clausal-cav16" mode="authors"/> and <ref table="pub"
        key="implicit-cav16" mode="authors"/>).
      </news-detail>
    </news>
    <news date="2016.04.19" id="microsoft-challenge-2016">
      <news-snippet>
        <ref table="person" key="sniari"/> wins
        Second Prize
        in the <a href="http://research.microsoft.com/en-us/projects/opensource/challenge.aspx">Microsoft Open Source Challenge</a>.
      </news-snippet>
      <news-detail>
        <ref table="person" key="sniari"/> wins
        Second Prize
        in the <a href="http://research.microsoft.com/en-us/projects/opensource/challenge.aspx">Microsoft Open Source Challenge</a>
        for his entry
        "CONfidentiality CERTifier: a Modeling and Verification Framework for Program Confidentiality using Z3".
      </news-detail>
    </news>
    <news date="2016.04.17" id="events-pldi16">
      <news-snippet>
  <ref table="pub" key="events-pldi16" mode="authors"/> paper accepted to <ref table="event" key="pldi16"/>!
      </news-snippet>
      <news-detail>
  CUPLV authors <ref table="person" key="mcclurg"/> and <ref table="person" key="cernyp"/>
  and collaborators at Cornell
  have had a paper accepted for presentation at <ref table="event" key="pldi16"/> in June (<ref table="pub"
  key="events-pldi16" mode="authors"/>).
      </news-detail>
    </news>
    <news date="2016.04.13" id="hscc-paper-award-2016">
      <news-snippet>
        <ref table="person" key="adityaz"/> wins
        the Best Student Paper Award
        at <ref table="event" key="hscc16"/>.
      </news-snippet>
      <news-detail>
        <ref table="person" key="adityaz"/>
        wins
        the Best Student Paper Award
        at <ref table="event" key="hscc16"/>
        for his paper
        "<ref table="pub" key="symbolic-numeric-reach-hscc16"/>"
        co-authored with
        <ref table="person" key="srirams"/>
        and collaborators.
      </news-detail>
      <news-page header="Best Student Paper Award at HSCC 2016">
        <p>
          <float img="pics/zutshi-hscc-award-2016.jpg">
            Aditya with his award!
          </float>
          Congratulations, Aditya!
        </p>
      </news-page>
    </news>
    <news date="2015.12.20" id="paper-hscc16">
      <news-snippet>
  Paper by <ref table="pub" key="symbolic-numeric-reach-hscc16" mode="authors"/>
  accepted to <ref table="event" key="hscc16"/>.
      </news-snippet>
      <news-detail>
  CUPLV authors <ref table="person" key="adityaz"/>, <ref table="person" key="srirams"/>, and <ref table="person" key=""/>
  with collaborators
  have had a paper "<ref table="pub" key="symbolic-numeric-reach-hscc16"/>"
  accepted for presentation at <ref table="event" key="hscc16"/> in April.
      </news-detail>
    </news>
    <news date="2015.12.18" id="paper-tacas16">
      <news-snippet>
  Two papers with CUPLV authors accepted to <ref table="event" key="tacas16"/>!
  [<ref table="pub" key="affine-forms-conc-measure-tacas16" text="1"/>,
   <ref table="pub" key="stochastic-persistence-tacas16" text="2"/>]
      </news-snippet>
      <news-detail>
  CUPLV authors <ref table="person" key="chakarov"/>, <ref table="person" key="yvoronin"/>, and <ref table="person" key="srirams"/>
  with collaborators
  have had papers accepted for presentation at <ref table="event" key="tacas16"/> in April (<ref table="pub"
  key="affine-forms-conc-measure-tacas16" mode="authors"/> and <ref table="pub"
  key="stochastic-persistence-tacas16" mode="authors"/>).
      </news-detail>
    </news>
    <news date="2015.11.01" id="faculty-2015">
      <news-snippet>
  Multiple <a href="news.html#faculty-2015">tenure-track openings</a> in <a href="https://www.cs.colorado.edu/~kena/2015CSFacultySearch/">CS</a>
  and <a href="http://ecee.colorado.edu/employ/faculty.html">ECEE</a>.
      </news-snippet>
      <news-detail>
        Please consider applying or encourage your students and postdocs to apply for a tenure-track position in the
  <a href="https://www.cs.colorado.edu/~kena/2015CSFacultySearch/">Department of Computer Science (CS)</a>
  and
  <a href="http://ecee.colorado.edu/employ/faculty.html">Department of Electrical, Computer, and Energy Engineering (ECEE)</a>
  at the University of Colorado Boulder. We have multiple openings with one particular interest area in Computer Science being <em>secure and reliable software systems</em>. Applications will be evaluated beginning on November 9, 2015 with priority given to applications received by December 7, 2015, although applications will continue to be evaluated until the position is filled.
  Apply at <a href="http://www.jobsatcu.com/postings/109940">http://www.jobsatcu.com/postings/109940</a> for CS
  and at <a href="https://www.jobsatcu.com/postings/107808">https://www.jobsatcu.com/postings/107808</a> for ECEE.
      </news-detail>
      <news-page header="Tenure-Track Position">
  <p><a href="http://www.colorado.edu/cs"><b>The Department of Computer Science (CS)</b></a> at the University of Colorado Boulder seeks applications for multiple tenure-track positions. The openings are targeted at the level of Assistant Professor, but experienced candidates may be considered for Associate or Full Professor. Research areas of particular interest include, but are not limited to, the areas of secure and reliable software systems (with an emphasis in software engineering and/or security), network science, scientific data analysis and visualization, computer systems as applied to autonomous and networked devices, and theoretical computer science. Our department values inclusive excellence and we seek candidates that understand the benefits that diversity brings to scientific innovation and who, through their work, develop technologies that impact a wide range of communities. Our department is also responsive to dual career situations.</p>
<p>Our vision of successful candidates are those who demonstrate the potential for excellence in both research and teaching, have a strong interest in interdisciplinary collaboration, and aim to lead a visible, externally funded research program. Candidates must have a Ph.D. in computer science or a related discipline and must show promise in their ability to develop an independent and internationally recognized research program. They must also display an ability, a record of excellence, and/or a commitment to teaching and working with undergraduate and graduate students of diverse backgrounds.</p>
<p>Applications will be evaluated beginning on November 9, 2015 with priority given to applications received by December 7, 2015, although applications will continue to be evaluated until the position is filled. Applications must include a cover letter specifying the applicant's areas of specialization and describing their interest in the Department of Computer Science at CU Boulder. Applications must also include a curriculum vita, statements of research and teaching interests, and names and contact information for three references. In their statements, candidates should describe and include specific examples of how their experience would contribute to the department's mission and values, including, but not limited to, their research record, pedagogical approaches, teaching content, mentoring and recruiting activities, community engagement, and experiences working with underrepresented communities.</p>
<p>The Department's research and education efforts interact broadly with many interdisciplinary programs and collaborators in the Boulder area, including national labs at NIST, NOAA, NREL, and NCAR, and CU Boulder research institutes including the ATLAS Institute, the BioFrontiers Institute, and the Institute for Cognitive Science. The Department has a long-standing partnership with the National Center for Women and IT and has faculty active in increasing the broadening of participation in computer science via their research, teaching, and service. The Department also has extensive ties with the thriving local tech community and inhabits a picturesque location in the foothills of the Rocky Mountains.</p>
  <p>
Applications are to be submitted on-line at <a href="http://www.jobsatcu.com/postings/109940">http://www.jobsatcu.com/postings/109940</a>.
  </p>
  <p><a href="http://ecee.colorado.edu"><b>The Department of Electrical, Computer, and Energy Engineering (ECEE)</b></a> at the University of Colorado Boulder seeks outstanding candidates for up to three tenure-track faculty positions beginning August 2016. The openings are targeted at the level of Assistant Professor, but experienced candidates with outstanding credentials may be considered at any rank.</p>
  <p>Hiring priority areas in ECEE include computer systems, next-generation networks, data analysis for complex systems, applied electromagnetics, RF/microwave engineering, power systems and electronics, integrated circuits, controls, nano-materials and systems, optics/photonics, and imaging. Exceptionally qualified candidates in other areas of electrical, computer, and energy engineering will be considered. Candidates involved in research bridging disciplines are highly encouraged to apply.</p>
<p>Candidates must have a Ph.D. in electrical engineering or related disciplines; they must have the ability to develop an independent research program, enthusiasm to work with other faculty in the department and dedication to teaching at all levels.</p>
<p>The department includes 2 University Distinguished Professors, 14 Full, 13 Associate, and 9 Assistant Professors. Faculty honors include 14 IEEE Fellows, 2 members of the US National Academy of Engineering, a Packard Fellow, a NSF Presidential Faculty Fellow and 10 NSF CAREER Award recipients. The ECEE program consists of about 350 undergraduate and 300 graduate students, and has averaged over $12.5 million in annual research grants. The department maintains close ties with local industry and national institutes/labs such as NIST, NREL, and NOAA.</p>
<p>Complete applications submitted by December 1, 2015 will receive full consideration, though applications received after this date will continue to be reviewed until the positions are filled. Applications must include a cover letter specifying the area of specialization, complete curriculum vitae, statement of research and teaching interests, and names and contact information of at least three references.</p>
  <p>
Applications are to be submitted on-line at <a href="https://www.jobsatcu.com/postings/107808">https://www.jobsatcu.com/postings/107808</a>.
  </p>

      </news-page>
    </news>
    <news date="2015.11.01" id="postdoc-call-2016-spring">
      <news-snippet>
  Call for postdoc <a href="news.html#postdoc-call-2016">applicants</a> for Spring or Summer 2016.
      </news-snippet>
      <news-detail>
  There is a postdoctoral research associate position open with the opportunity to work with Profs. <ref table="person" key="bec"/>, <ref table="person" key="srirams"/>, and <ref table="person" key="cernyp"/> on program analysis and program synthesis.
      </news-detail>
      <news-page header="Postdoc Position">
  <p>
  <float img="pics/Preview_Winter_Panorama_CC141.jpg">
    The majestic, snow-covered Flatirons is a breathtaking backdrop with Old Main at the University of Colorado Boulder in the foreground. (Photo by Casey A. Cass/University of Colorado)
  </float>
  The Programming Languages and Verification Group at the University of Colorado Boulder (CUPLV) is looking for candidates for a postdoctoral research associate in the area of program analysis and program synthesis.</p>
<p>The position is on the Fixr project, a large project examining approaches to automatically mine, understand, and transfer bug fixes in large application frameworks, such as Android.</p>
<p>The ideal candidate has a background in the area of programming languages, software engineering and/or formal methods, as well as an enthusiasm for mentoring junior researchers.</p>
<p>The postdoctoral researcher would
have the opportunity to lead this ambitious project that combines program analysis, probabilistic reasoning, and program synthesis. There will also be interactions with human-centered computing and big data engineering researchers on the interdisciplinary aspects of the project.</p>
<p>The position is for one to two years, with a possible extension for additional years. A transition plan to a research assistant professor position is possible for highly-qualified candidates. While not required, teaching opportunities will also be available. Compensation is highly competitive and commensurate with experience.</p>
<p>To apply, please send an email to <ref table="person" key="bec"/> with a CV and contact information for two to three references. Applications will be considered until the position is filled.</p>
  <p>Our group has active projects in areas such as the following:
<ul>
  <li>program analysis</li>
  <li>model checking</li>
  <li>verification and synthesis of hybrid and embedded systems</li>
  <li>program synthesis</li>
</ul>
  </p>
        <p>Boulder, located at the base of the Rocky Mountain foothills, is consistently awarded top-rankings for health, education, and quality of life.  It is also home to a concentration of high-tech industry and its vibrant startup community.  Located 30 miles from downtown Denver, there are convenient public transportation options between Boulder and the Denver metro area.</p>
      </news-page>
    </news>
    <news date="2015.11.01" id="phd-call-2015">
      <news-snippet>
  Call for Ph.D. applicants for Fall 2016.  Application deadline
  is December 15, 2015.
      </news-snippet>
      <news-detail>
  Call for Ph.D. applicants for Fall 2016.  Application deadline
  is December 15, 2015. Check out our latest <a
  href="talks/openhouse15.pdf">recruiting
  talk</a> from February 20, 2015.
      </news-detail>
      <news-page header="Ph.D. Positions">
  <p>
  We are looking for enthusiastic students to join our diverse and
  dynamic group in programming languages and verification.  Our
  group has active projects in areas such as static and dynamic
  program analysis; verification, debugging, and programmer
  productivity tools; language-based security; type systems;
  language design; analysis of hybrid and embedded systems.  We have a track
  record of publishing in top venues, such as POPL and PLDI.  <a
  href="http://www.colorado.edu/cs/graduates/admissions">
  CS Admissions</a> (deadline December 15, 2016) and <a
  href="http://ecee.colorado.edu/prospective/grad/intro.html">ECEE
  Admissions</a> (deadline January 15, 2016 but earlier for financial aid consideration).
  </p>
      </news-page>
    </news>
    <news date="2015.10.15" id="tball-seminar-2015">
      <news-snippet>
  <ref table="person" key="tball"/> visits October 19-20.
      </news-snippet>
      <news-detail>
  <ref table="person" key="tball"/> from
  Microsoft Research
  is visiting us on October 19-20, 2015. He is giving a
  CUPLV Seminar
  entitled
  "Recent Results in Automated Verification from Microsoft Research"
  at 9:30am
  in ECCR 150 on Tuesday, October 20, 2015.
      </news-detail>
      <talk-announcement>
  <speaker><ref table="person" key="tball"/></speaker>
  <affiliation>Microsoft Research</affiliation>
  <when>10-20-2015 9:30</when>
  <where>ECCR 150</where>
  <title>Recent Results in Automated Verification from Microsoft Research</title>
  <abstract>
    <p>In this talk, I’ll review recent results in automated verification from members of Microsoft Research, addressing problems such as: (1) whole program analysis using automated theorem provers; (2) analyzing open programs efficiently and precisely; (3) speeding up interprocedural verifiers through apriori program transformations.</p>
    <p>This work is by Ankush Das, Shuvendu Lahiri, Akash Lal and Shaz Qadeer of Microsoft Research, along with their interns.</p>
  </abstract>
  <bio>
    <p><ref table="person" key="tball"/> is a research manager in the area of software engineering. His research interests are in how combinations of static/dynamic program analysis, model checking and theorem proving techniques can help improve the correctness and reliability of programs.</p>
  </bio>
  <host><ref table="person" key="hammer"/></host>
      </talk-announcement>
    </news>
    <news date="2015.08.04" id="paper-oopsla15">
      <news-snippet>
  Two papers with CUPLV authors accepted to <ref table="event" key="oopsla15"/>!
  [<ref table="pub" key="controlfeasibility-oopsla15" text="1"/>,
   <ref table="pub" key="adaptonwithnames-oopsla15" text="2"/>]
      </news-snippet>
      <news-detail>
  CUPLV authors <ref table="person" key="blackshear"/>, <ref table="person" key="bec"/>,
  <ref table="person" key="hammer"/>, and <ref table="person" key="kheadley"/>
  have had papers accepted for presentation at <ref table="event" key="oopsla15"/> in October (<ref table="pub"
  key="controlfeasibility-oopsla15" mode="authors"/> and <ref table="pub"
  key="adaptonwithnames-oopsla15" mode="authors"/>).
      </news-detail>
    </news>
    <news date="2015.09.01" id="icfp-src-2015">
      <news-snippet>
  <ref table="person" key="kheadley"/>
        comes in second at <ref table="event" key="icfp-src15"/>
  in the undergraduate category.
      </news-snippet>
    </news>
    <news date="2015.06.01" id="paper-sas15">
      <news-snippet>
  Paper by <ref table="pub" key="sharing-sas15" mode="authors"/>
  accepted to <ref table="event" key="sas15"/>.
      </news-snippet>
      <news-detail>
  CUPLV author <ref table="person" key="bec"/>
  with collaborators
  has had a paper "<ref table="pub" key="sharing-sas15"/>"
  accepted for presentation at <ref table="event" key="sas15"/> in September.
      </news-detail>
    </news>
    <news date="2015.05.27" id="mnaik-seminar-2015">
      <news-snippet>
  <ref table="person" key="mnaik"/> visits May 28-29.
      </news-snippet>
      <news-detail>
  <ref table="person" key="mnaik"/> from
  Georgia Tech
  is visiting us on May 28-29, 2015. He is giving a
  CUPLV Seminar
  entitled
  "Petablox: Declarative Program Analysis for Big Code"
  at 10:30am
  in DLC 1B70 on Friday, May 29, 2015.
      </news-detail>
      <talk-announcement>
  <speaker><ref table="person" key="mnaik"/></speaker>
  <affiliation>Georgia Tech</affiliation>
  <when>05-29-2015 10:30</when>
  <where>DLC 1B70</where>
  <title>Petablox: Declarative Program Analysis for Big Code</title>
  <abstract>
    <p>Most software development today leverages the world's massive collection of open source software. There is significant room for program analyses to similarly leverage Big Code, the collective knowledge amassed from analyzing existing programs, to automatically infer or predict salient behaviors and vulnerabilities in new programs. We present Petablox, a framework for automatically synthesizing use-cases of arbitrary declarative program analyses for Big Code tasks such as efficiently finding good abstractions, transferring analysis results across programs, and adapting analyses to user feedback. Despite their diversity, all these tasks entail solving large instances of MaxSAT, the maximum satisfiability problem which comprises a mix of hard (inviolable, logical) constraints and soft (violable, probabilistic) constraints. We describe demand-driven, compositional, and learning-based MaxSAT optimizations in Petablox for scaling these tasks to large code bases.</p>
  </abstract>
  <bio>
    <p><ref table="person" key="mnaik"/> is an Assistant Professor in Computer Science at Georgia Tech since 2011. His research interests are in programming languages and software engineering, with a current emphasis on program analysis techniques and systems for improving software quality and programmer productivity on modern computing platforms such as parallel, mobile, and cloud computing. He holds a Ph.D. in Computer Science from Stanford University (2007) and was a research scientist at Intel Labs, Berkeley from 2008 to 2011.</p>
  </bio>
  <host><ref table="person" key="bec"/></host>
      </talk-announcement>
    </news>
    <news date="2015.05.27" id="blackshear-seminar-2015">
      <news-snippet>
  <ref table="person" key="blackshear"/> defends his PhD on May 28.
      </news-snippet>
      <news-detail>
  <ref table="person" key="blackshear"/> is
  defending his PhD on at 1:00pm in ECAE 199 on Thursday, May 28, 2015. His PhD is
  entitled
  "Flexible Goal-Directed Abstraction."
      </news-detail>
      <talk-announcement>
  <speaker><ref table="person" key="blackshear"/></speaker>
  <affiliation>University of Colorado Boulder</affiliation>
  <when>05-28-2015 13:00</when>
  <where>ECAE 199</where>
  <title>Flexible Goal-Directed Abstraction</title>
  <abstract>
    <p>Static program analysis is a powerful technique for bug-finding, verification, and program understanding. Yet static analyses remain conspicuously absent from the toolbox of the average developer because they must abstract away details about concrete program behavior. Designing effective abstractions is tricky business: imprecise abstractions are inexpensive, but can be useless because they lose too much information about the program, whereas conventional wisdom states that precise abstractions are too expensive to scale.</p>
<p>This dissertation considers the problem of goal-directed static analysis, an intriguing domain where there is hope for defying the conventional wisdom about precise and scalable abstractions. In contrast to more traditional whole-program approaches that must apply precise abstractions to the entire program, goal-directed approaches have the potential to be much more tractable because they can focus the effort of the analysis on a single goal query.</p>
<p>There are two fundamental challenges in goal-directed analysis: (A) designing abstractions that are as flexible as possible so they can be specialized to the needs of the query and (B) using this flexibility wisely to achieve a better precision/scalability tradeoff in practice. This dissertation addresses these challenges by introducing goal-directed abstraction coarsening, a new approach to goal-directed analysis. Our approach works backward from the goal query using an abstraction that is as precise as possible by default, but can be coarsened in order to narrow the focus of the analysis and improve scalability. We meet Challenge A by introducing flexible coarsening-based techniques for store abstraction and control-flow abstraction. Our store abstraction precisely represents a small view of the store relevant to the query by combining a separation logic-based representation with a flow-insensitive points-to analysis. We present a general framework for flexible control-flow abstraction that allows the framework to coarsen the control-flow abstraction by jumping over irrelevant code. Finally, we meet Challenge B by presenting goal-directed analyses incorporating our flexible abstractions. Our analyses use programmers’ invariant-based reasoning and the structure of event-driven programs to recognize opportunities for coarsening that are likely to enhance scalability without losing precision. We have implemented these analyses and shown that they can achieve precise and scalable results for a variety of client analyses than cannot be handled effectively by previous techniques.</p>
<p>Committee: <ref table="person" key="bec"/> (chair),
<ref table="person" key="cernyp"/>,
<ref table="person" key="mnaik"/>,
<ref table="person" key="srirams"/>, and
<ref table="person" key="msridhar"/>.</p>
  </abstract>
  <bio>
    <p><ref table="person" key="blackshear"/> earned a BA in Computer Science and Philosophy from Williams College in 2010. He is interested in static program analysis, verification, and type systems. He has interned at Microsoft Research India, Microsoft Research Redmond, and Facebook London. He is a recipient of the 2013-2014 CU CS Outstanding Research Award, the 2015 Ralph J. Slutz Excellence Award, and a 2014-2015 Facebook Fellowship. He will work on static analysis and developer tools at Facebook after graduating.</p>
  </bio>
      </talk-announcement>
    </news>
    <news date="2015.05.18" id="postdoc-call-2015">
      <news-snippet>
  Call for postdoc <a href="news.html#postdoc-call-2015">applicants</a> for Summer or Fall 2015.
      </news-snippet>
      <news-detail>
  There is a postdoctoral research associate position open with the opportunity to work with Profs. <ref table="person" key="bec"/>, <ref table="person" key="srirams"/>, and <ref table="person" key="cernyp"/> on program analysis and program synthesis.
      </news-detail>
      <news-page header="Postdoc Position">
  <p>
  <float img="pics/Preview_Winter_Panorama_CC141.jpg">
    The majestic, snow-covered Flatirons is a breathtaking backdrop with Old Main at the University of Colorado Boulder in the foreground. (Photo by Casey A. Cass/University of Colorado)
  </float>
  The Programming Languages and Verification Group at the University of Colorado Boulder (CUPLV) is looking for exceptional candidates for a postdoctoral research associate in the area of program analysis and program synthesis.</p>
<p>The position is on the Fixr project, a large project examining approaches to automatically mine, understand, and transfer bug fixes in large application frameworks, such as Android.</p>
<p>The ideal candidate has a strong background in the area of programming languages, software engineering and/or formal methods, as well as an enthusiasm for mentoring junior researchers.</p>
<p>The postdoctoral researcher would collaborate with Profs. <ref table="person" key="bec"/>, <ref table="person" key="srirams"/>, and <ref table="person" key="cernyp"/> and have the opportunity to lead this ambitious project that combines program analysis, probabilistic reasoning, and program synthesis. There will also be interactions with human-centered computing and big data engineering researchers on the interdisciplinary aspects of the project.</p>
<p>The position is for one to two years, with a possible extension for additional years. A transition plan to a research assistant professor position is possible for highly-qualified candidates. While not required, teaching opportunities will also be available. Compensation is highly competitive and commensurate with experience.</p>
<p>To apply, please send an email to <ref table="person" key="bec"/> with a CV and contact information for two to three references. Applications will be considered until the position is filled.</p>
  <p>Our group has active projects in areas such as the following:
<ul>
  <li>program analysis</li>
  <li>model checking</li>
  <li>verification and synthesis of hybrid and embedded systems</li>
  <li>program synthesis</li>
</ul>
  </p>
        <p>Boulder, located at the base of the Rocky Mountain foothills, is consistently awarded top-rankings for health, education, and quality of life.  It is also home to a concentration of high-tech industry and its vibrant startup community.  Located 30 miles from downtown Denver, there are convenient public transportation options between Boulder and the Denver metro area.</p>
        <p>
The University of Colorado is an Equal Opportunity Employer committed to building a diverse workforce. We encourage applications from women, minorities candidates, people with disabilities, and veterans.</p>
      </news-page>
    </news>
    <news date="2015.04.26" id="hammer-joins">
      <news-snippet>
  <ref table="person" key="hammer"/> is joining CUPLV!
      </news-snippet>
      <news-detail>
  <ref table="person" key="hammer"/> joins CUPLV as an assistant professor of computer science in Fall 2015. Welcome, Matt!
      </news-detail>
    </news>
    <news date="2015.04.25" id="paper-cav15">
      <news-snippet>
  Two papers with CUPLV authors accepted to <ref table="event" key="cav15"/>!
  [<ref table="pub" key="synunification-cav15" text="1"/>,
   <ref table="pub" key="scheduling-cav15" text="2"/>]
      </news-snippet>
      <news-detail>
  CUPLV author <ref table="person" key="cernyp"/>
  has had papers accepted for presentation at <ref table="event" key="cav15"/> in July (<ref table="pub"
  key="synunification-cav15" mode="authors"/> and <ref table="pub"
  key="scheduling-cav15" mode="authors"/>).
      </news-detail>
    </news>
    <news date="2015.04.25" id="paper-soap15">
      <news-snippet>
  Paper by <ref table="pub" key="droidel-soap15" mode="authors"/>
  accepted to <ref table="event" key="soap15"/>.
      </news-snippet>
      <news-detail>
  CUPLV authors <ref table="person" key="blackshear"/>, <ref table="person" key="agendreau"/>, and <ref table="person" key="bec"/>
  have had a paper "<ref table="pub" key="droidel-soap15"/>"
  accepted for presentation at <ref table="event" key="soap15"/> in June.
      </news-detail>
    </news>
    <news date="2015.04.21" id="grant-stac">
      <news-snippet>
      DARPA grant
      "<a href="http://www.darpa.mil/Our_Work/I2O/Programs/Space/Time_Analysis_for_Cybersecurity_%28STAC%29.aspx">STAC: Auditr: Securing Space/Time Defenses in Java Bytecode</a>"
      awarded.
      </news-snippet>
      <news-detail>
  CUPLV faculty <ref table="person" key="cernyp"/>, <ref table="person" key="bec"/>, <ref table="person" key="srirams"/>
  have been awarded a DARPA grant
  "<a href="http://www.darpa.mil/Our_Work/I2O/Programs/Space/Time_Analysis_for_Cybersecurity_%28STAC%29.aspx">STAC: Auditr: Securing Space/Time Defenses in Java Bytecode</a>"
  with collaborators <ref table="person" key="jblack"/> at CU, <ref table="person" key="idillig"/> and
  <ref table="person" key="mheule"/> at UT Austin, and <ref table="person" key="hsipma"/> at Kestrel Technology.
      </news-detail>
    </news>
    <news date="2015.04.21" id="paper-array15">
      <news-snippet>
  Paper by <ref table="pub" key="performance-array15" mode="authors"/>
  accepted to <ref table="event" key="array15"/>.
      </news-snippet>
      <news-detail>
  CUPLV authors <ref table="person" key="ykim"/> and <ref table="person" key="cernyp"/>
  with collaborators
  have had a paper "<ref table="pub" key="performance-array15"/>"
  accepted for presentation at <ref table="event" key="array15"/> in June.
      </news-detail>
    </news>
    <news date="2015.04.16" id="atrivedi-seminar-2015">
      <news-snippet>
  <ref table="person" key="atrivedi"/> visits April 17.
      </news-snippet>
      <news-detail>
  <ref table="person" key="atrivedi"/> from
  IIT Bombay
  is visiting us on April 17, 2015. He is giving a
  CUPLV Seminar
  entitled
  "Decidable Subclasses of Multi-Mode Systems"
  at 1:00pm
  in KOBL 235 on Friday, April 17, 2015.
      </news-detail>
      <talk-announcement>
  <speaker><ref table="person" key="atrivedi"/></speaker>
  <affiliation>Indian Institute of Technology Bombay</affiliation>
  <when>04-17-2015 13:00</when>
  <where>KOBL 235</where>
  <title>
    Decidable Subclasses of Multi-Mode Systems (Schedulability, Reachability, and Related Problems)
  </title>
  <abstract>
    <p>Hybrid automata are a natural and expressive formalism to model systems that exhibit both discrete and continuous behavior. However, the applications of hybrid automata in analyzing cyber-physical systems have been rather limited due to undecidability of simple verification problems such as reachability. This drawback of hybrid automata has fueled the investigation of the so-called compositional methodology to design complex system by sequentially composing well-understood lower-level components. This methodology has, for example, been used in the context of the motion planning problem for mobile robots, where the task is to move a robot along a pre-specified trajectory with arbitrary precision by sequentially composing a set of well-studied simple motion primitives, such as “move left”, “move right” and “go straight”.  In this talk, we summarize some of our recent results related to efficient solution of motion planning problem for systems whose motion primitives are given as constant-rate vectors with uncertainties.</p>
  </abstract>
  <host><ref table="person" key="srirams"/></host>
      </talk-announcement>
    </news>
    <news date="2015.02.16" id="phdvisit-2015">
      <news-snippet>
  Prospective Ph.D. students visit February 20. Welcome!
      </news-snippet>
    </news>
    <news date="2015.02.11" id="netsynth-pldi15">
      <news-snippet>
  <ref table="pub" key="netsynth-pldi15" mode="authors"/> paper accepted to <ref table="event" key="pldi15"/>!
      </news-snippet>
      <news-detail>
  CUPLV authors <ref table="person" key="mcclurg"/> and <ref table="person" key="cernyp"/>
  and collaborators at Cornell
  have had a paper accepted for presentation at <ref table="event" key="pldi15"/> in June (<ref table="pub"
  key="netsynth-pldi15" mode="authors"/>).
      </news-detail>
    </news>
    <news date="2015.01.29" id="soundiness-cacm15">
      <news-snippet>
  <ref table="pub" key="soundiness-cacm15" mode="authors"/> paper appeared in <ref table="journal" key="cacm"/>!
      </news-snippet>
      <news-detail>
  CUPLV author <ref table="person" key="bec"/>
  have a paper appearing in <ref table="journal" key="cacm"/> (<ref table="pub"
  key="soundiness-cacm15" mode="authors"/>).
      </news-detail>
    </news>
    <news date="2015.01.28" id="slutz15">
      <news-snippet>
        CUPLV student <ref table="person" key="blackshear"/>
        receives the 2015
        <a href="https://www.colorado.edu/cs/current-students/student-awards">Ralph J. Slutz Student Excellence Award</a>.
      </news-snippet>
    </news>
    <news date="2014.12.16" id="paper-esop15">
      <news-snippet>
  Two papers with CUPLV authors accepted to <ref table="event" key="esop15"/>!
  [<ref table="pub" key="desynchronized-esop15" text="1"/>,
   <ref table="pub" key="wcet-esop15" text="2"/>]
      </news-snippet>
      <news-detail>
  CUPLV authors <ref table="person" key="cox"/>, <ref table="person" key="bec"/>, and <ref table="person" key="cernyp"/>
  with collaborators
  have had papers accepted for presentation at <ref table="event" key="esop15"/> in April (<ref table="pub"
  key="desynchronized-esop15" mode="authors"/> and <ref table="pub"
  key="wcet-esop15" mode="authors"/>).
      </news-detail>
    </news>
    <news date="2014.11.30" id="lryzhyk-seminar-2014">
      <news-snippet>
  <ref table="person" key="lryzhyk"/> visits December 5.
      </news-snippet>
      <news-detail>
  <ref table="person" key="lryzhyk"/> from
  Carnegie Mellon University
  is visiting us on December 5, 2014. He is giving a
  CUPLV Seminar
  entitled
  "Automatic Device Driver Synthesis"
  at 4:00pm
  in ECOT 831 on Friday, December 5, 2014.
      </news-detail>
      <talk-announcement>
  <speaker><ref table="person" key="lryzhyk"/></speaker>
  <affiliation>Carnegie Mellon University</affiliation>
  <when>12-05-2014 16:00</when>
  <where>ECOT 831</where>
  <title>Automatic Device Driver Synthesis</title>
  <abstract>
    <p>Automatic device driver synthesis is a radical approach to
creating drivers faster and with fewer defects by generating them
automatically based on hardware device specifications. I will present
the design and implementation of a new driver synthesis toolkit, called
Termite. Termite is the first tool to combine the power of automation
with the flexibility of conventional development. It is also the first
practical synthesis tool based on abstraction refinement. Finally, it is
the first synthesis tool to support automated debugging of input
specifications. I will explain the main principles behind the tool and
give a brief demo of its capabilities.
    </p>
  </abstract>
  <bio>
    <p><ref table="person" key="lryzhyk"/> is a postdoctoral researcher in the Carnegie Mellon
University School of Computer Science.  Leonid's research focuses on
applying rigorous formal techniques to the design, implementation, and
verification of operating systems.  He received his PhD from the
University of New South Wales in 2010.  Prior to joining CMU, Leonid
worked as a researcher at NICTA and a postdoctoral fellow at the
University of Toronto.
    </p>
  </bio>
  <host><ref table="person" key="cernyp"/></host>
      </talk-announcement>
    </news>
    <news date="2014.11.30" id="msridhar-seminar-2014">
      <news-snippet>
  <ref table="person" key="msridhar"/> visits December 3.
      </news-snippet>
      <news-detail>
  <ref table="person" key="msridhar"/> from
  Samsung Research America
  is visiting us on December 3, 2014. He is giving a
  CUPLV Seminar
  entitled
  "MemInsight: Platform-Independent Memory Profiling for JavaScript"
  at 4:00pm
  in ECCR 116 on Wednesday, December 3, 2014.
      </news-detail>
      <talk-announcement>
  <speaker><ref table="person" key="msridhar"/></speaker>
  <affiliation>Samsung Research America</affiliation>
  <when>12-03-2014 16:00</when>
  <where>ECCR 116</where>
  <title>MemInsight: Platform-Independent Memory Profiling for JavaScript</title>
  <abstract>
    <p>JavaScript programs tend to suffer from memory issues that can either hurt performance, or worse, make programs crash due to slow exhaustion of memory. We present a new memory profiling tool MemInsight for JavaScript applications, including web applications. MemInsight is platform independent: it employs source-code instrumentation to generate a trace of memory allocations and accesses, and it uses standard browser features to track precise information for DOM (document object model) objects. The information thus collected enables detailed, time-varying analysis of memory behavior, including that of DOM objects.
    </p>
    <p>We describe several client analyses built into MemInsight. For instance, it points out situations in which there may be a memory leak, and it reports opportunities for replacing dynamic allocation with stack allocation. MemInsight is extensible to custom analyses as well. Our experimental evaluation showed that our client analyses found interesting memory issues in several publicly available apps, and that MemInsight had reasonable overhead.
    </p>
  </abstract>
  <bio>
    <p><ref table="person" key="msridhar"/> is a researcher at Samsung Research America in the area of programming languages and software engineering. He received his PhD from the University of California, Berkeley in 2007. His dissertation focused on refinement-based program analysis tools. Since then, he has done research on a variety of topics in static analysis, dynamic analysis, and software engineering. He worked at IBM Research from 2008–2013.  For further details, see <a href="http://manu.sridharan.net">http://manu.sridharan.net</a>.
    </p>
  </bio>
  <host><ref table="person" key="bec"/></host>
      </talk-announcement>
    </news>
    <news date="2014.11.30" id="nnarodytska-seminar-2014">
      <news-snippet>
  <ref table="person" key="nnarodytska"/> visits December 1.
      </news-snippet>
      <news-detail>
  <ref table="person" key="nnarodytska"/> from
  Carnegie Mellon University
  is visiting us on December 1, 2014. She is giving a
  CUPLV Seminar
  entitled
  "SAT-based Techniques for Reactive Synthesis"
  at 3:00pm
  in ECEE 1B55 on Monday, December 1, 2014.
      </news-detail>
      <talk-announcement>
  <speaker><ref table="person" key="nnarodytska"/></speaker>
  <affiliation>Carnegie Mellon University</affiliation>
  <when>12-01-2014 15:00</when>
  <where>ECEE 1B55</where>
  <title>SAT-based Techniques for Reactive Synthesis</title>
  <abstract>
    <p>Two-player games are a useful formalism for the synthesis of reactive
systems. The traditional approach to solving such games iteratively
computes the set of winning states for one of the players. This requires
keeping track of all discovered winning states and can lead to space
explosion even when using efficient symbolic representations.  I will
present a new game solving method that works by exploring a subset of
all possible concrete runs of the game and proving that these runs can
be generalised into a winning strategy on behalf of one of the players.
We use counterexample-guided backtracking search, inspired by the RaReQs
QBF solver, to identify a subset of runs  that are sufficient to
consider to solve the game. Our search procedure performs learning from
both players' failures, gradually shrinking winning regions for both
players.  In addition, it allows extracting compact winning/spoiling
strategies using interpolation procedures.  We evaluate our algorithm on
several families of benchmarks derived from real-world device driver
synthesis problems.  Our approach outperforms  state-of-the-art BDD
solvers on some families of benchmarks. We  demonstrated that our
strategy extraction procedure is efficient and introduces low overhead
on top of the main solver.
    </p>
  </abstract>
  <bio>
    <p><ref table="person" key="nnarodytska"/> is a visiting researcher in the Carnegie Mellon
University School of Computer Science.  She received her PhD from the
University of New South Wales in 2011.  Nina works on developing
efficient algorithms for decision and optimization problems.  She was
named one of "AI's 10 to Watch" young researches in the field of AI. She
also received an Outstanding Paper Award at AAAI 2011 and an outstanding
program committee member award at the Australasian Joint Conference on
Artificial Intelligence 2012. Her EvaMaxSAT Solver is a winner of the
Ninth Evaluation of Max-SAT Solvers in 2014.
    </p>
  </bio>
  <host><ref table="person" key="cernyp"/></host>
      </talk-announcement>
    </news>
    <news date="2014.10.24" id="splash-src-2014">
      <news-snippet>
  <ref table="person" key="coughlin"/>
        comes in second at the <ref table="event" key="splash-src14"/>.
      </news-snippet>
    </news>
    <news date="2014.10.16" id="emsoft-award-2014">
      <news-snippet>
  <ref table="person" key="adityaz"/> and <ref table="person" key="srirams"/>
  receive the best paper award at <ref table="event" key="emsoft14"/>.
      </news-snippet>
      <news-detail>
  <ref table="person" key="adityaz"/> and <ref table="person" key="srirams"/>
  receive the best paper award
  for their paper
  "<ref table="pub" key="shooting-emsoft14"/>"
  at <ref table="event" key="emsoft14"/>.
      </news-detail>
      <news-page header="EMSOFT 2014 Best Paper Award">
  <p>
  The conference on embedded software was held in New Delhi this year as part of a broader series of conferences called Embedded Systems week (ESWeek).
  120 papers were submitted, 29 were accepted, and one paper was given this award.
  More details at <a href="http://esweek.acm.org/bestpaper.shtml">http://esweek.acm.org/bestpaper.shtml</a>.
  </p>
      </news-page>
    </news>
    <news date="2014.10.15" id="faculty-2014">
      <news-snippet>
  Multiple <a href="news.html#faculty-2014">tenure-track openings</a> in CS, including in <em>secure and reliable software systems</em>.
      </news-snippet>
      <news-detail>
        Please consider applying or encourage your students and postdocs to apply for a tenure-track position in the Department of Computer Science at the University of Colorado Boulder. We have multiple openings with one particular interest area being <em>secure and reliable software systems</em>.
        Applications will be evaluated beginning on December 1, 2014, will continue until the position is filled, and are to be submitted on-line at <a href="http://www.jobsatcu.com/postings/89652">http://www.jobsatcu.com/postings/89652</a>.
      </news-detail>
      <news-page header="Tenure-Track Position">
  <p>
  The Department of Computer Science (CS) at the University of Colorado Boulder seeks outstanding candidates, for multiple tenure-track positions. The openings are targeted at the level of Assistant Professor, although exceptional candidates at higher ranks may be considered. Research areas of particular interest include the areas of secure and reliable software systems, numerical optimization and high-performance scientific computing, and network science and machine learning.
  </p>
  <p>
Candidates for these positions must demonstrate excellence in both research and teaching, have a strong interest in interdisciplinary collaboration, and aim to lead a highly visible, externally funded research program. Candidates must have a Ph.D. in computer science or a related discipline and must show promise in their ability to develop an independent and internationally recognized research program. They must also display a demonstrated commitment to teaching and working with both undergraduate and graduate students.
  </p>
  <p>
Applications will be evaluated beginning on December 1, 2014 and will continue until the position is filled. Applications must include a cover letter specifying the applicant’s areas of specialization and describing their interest in the Department of Computer Science at CU Boulder. Applications must also include a curriculum vitae, statements of research and teaching interests, and names and contact information for three references.
  </p>
  <p>
The Department’s research and education efforts interact broadly with many interdisciplinary programs and collaborators in the Boulder area, including national labs at NIST, NOAA, NREL, and NCAR, and CU Boulder research institutes including the BioFrontiers Institute and the Institute for Cognitive Science. The Department also has extensive ties with the thriving local tech community and inhabits a picturesque location in the foothills of the Rocky Mountains.
  </p>
  <p>
The University of Colorado Boulder is an Equal Opportunity Employer committed to building a diverse workforce. We encourage applications from women, racial and ethnic minorities, individuals with disabilities and veterans. Alternative formats of this ad can be provided upon request for individuals with disabilities by contacting the ADA Coordinator at <a href="mailto:hrada@colorado.edu">hrada@colorado.edu</a>.
  </p>
  <p>
The University of Colorado Boulder is committed to providing a safe and productive learning and living community. To achieve that goal, we conduct background investigations for all final applicants being considered for employment. Background investigations include reference checks, a criminal history record check, and when appropriate, a financial and/or motor vehicle history.
  </p>
  <p>
Applications must be submitted on-line at <a href="http://www.jobsatcu.com/postings/89652">http://www.jobsatcu.com/postings/89652</a>.
  </p>
      </news-page>
    </news>
    <news date="2014.10.02" id="dimoulas-seminar-2014">
      <news-snippet>
  <ref table="person" key="cdimoulas"/> visits October 7.
      </news-snippet>
      <news-detail>
  <ref table="person" key="cdimoulas"/> from
  Harvard
  is visiting us on October 7, 2014. He is giving a
  CUPLV Seminar
  entitled
  "Behavioral contracts and security"
  at 11:00am
  in ECCR	151 on Tuesday, October 7, 2014.
      </news-detail>
      <talk-announcement>
  <speaker><ref table="person" key="cdimoulas"/></speaker>
  <affiliation>Harvard University</affiliation>
  <when>10-07-2014 11:00</when>
  <where>ECCR 151</where>
  <title>
    Behavioral contracts and security
  </title>
  <abstract>
    <p>
    Behavioral contracts are a widely used specification tool for software components, which enrich interface information with logical assertions. The rigorous enforcement of contracts provides to programmers precise guarantees about a program's execution, and offers useful feedback for debugging upon contract violations. However, almost all of research on contracts focuses on contracts as a specification tool for partial correctness of programs and ignores another vital requirement of modern software; security.
    </p>
          <p>In this talk, I will demonstrate how contracts can specify and enforce security policies. Specifically, I will focus on two applications of contracts in capability-based security. First, I will describe Shill; a secure shell scripting language where contracts specify and enforce
policies about which OS resources scripts intend to use and how they use them. This way, Shill's contracts help script authors and users to adhere to the principle of least privilege. Second, I will present a contract system that complements the contract system of Shill by
describing and enforcing declarative policies for the flow of capabilities between components. This manner, components can specify not only what capabilities they require from their users, but also how they intend to share these capabilities with other components.
          </p>
  </abstract>
  <bio>
    <p><ref table="person" key="cdimoulas"/>
    is a Postdoctoral Fellow in Computer Science at the School of Engineering and Applied Sciences of Harvard University working with Stephen Chong and his group. Before coming to Harvard, Christos completed a PhD in Computer Science at the College of Computer and Information Science of Northeastern University under the supervision of Matthias Felleisen. Christos is interested in the design and semantics of programming languages. More specifically, his goal is to develop programming languages technology that facilitates the construction of secure and robust component-based software systems.
    </p>
  </bio>
      </talk-announcement>
    </news>
    <news date="2014.09.24" id="grant-muse">
      <news-snippet>
      DARPA grant
      "<a href="http://www.darpa.mil/Our_Work/I2O/Programs/Mining_and_Understanding_Software_Enclaves_%28MUSE%29.aspx">MUSE: Mining and Understanding Bug Fixes to Address Application-Framework Protocol Defects</a>"
      awarded.
      </news-snippet>
      <news-detail>
  CUPLV faculty <ref table="person" key="bec"/>, <ref table="person" key="cernyp"/>, <ref table="person" key="srirams"/>
  have been awarded a DARPA grant
      "<a href="http://www.darpa.mil/Our_Work/I2O/Programs/Mining_and_Understanding_Software_Enclaves_%28MUSE%29.aspx">MUSE: Mining and Understanding Bug Fixes to Address Application-Framework Protocol Defects</a>"
  with collaborators <ref table="person" key="kanderson"/> and <ref table="person" key="tyeh"/>.
      </news-detail>
    </news>
    <news date="2014.09.12" id="radhia-cousot-award-2014">
      <news-snippet>
  <ref table="person" key="chakarov"/> wins
  the Radhia Cousot Young Researcher Best Paper Award
  at <ref table="event" key="sas14"/>.
      </news-snippet>
      <news-detail>
  <ref table="person" key="chakarov"/>
  wins
  the Radhia Cousot Young Researcher Best Paper Award
  at <ref table="event" key="sas14"/>
  for his paper
  "<ref table="pub" key="expectation-sas14"/>"
  co-authored with
  <ref table="person" key="srirams"/>.
      </news-detail>
      <news-page header="Radhia Cousot Young Researcher Best Paper Award">
  <p>
  <float img="pics/chakarov-radhia-cousot-award-2014.jpg">
    Aleks Chakarov with his award!
  </float>
  Congratulations, Aleks!
  </p>
      </news-page>
    </news>
    <news date="2014.07.10" id="postdoc-call-2014">
      <news-snippet>
  Call for Postdoc <a href="news.html#postdoc-call-2014">applicants</a> for Fall 2014.
      </news-snippet>
      <news-detail>
  There is a postdoctoral research associate position open with the opportunity to work with Profs. <ref table="person" key="bec"/>, <ref table="person" key="srirams"/>, and <ref table="person" key="cernyp"/>. Highly-qualified candidates may be considered for a research assistant professor position.
      </news-detail>
      <news-page header="Postdoc Position">
  <p>
  <float img="pics/Preview_Winter_Panorama_CC141.jpg">
    The majestic, snow-covered Flatirons is a breathtaking backdrop with Old Main at the University of Colorado Boulder in the foreground. (Photo by Casey A. Cass/University of Colorado)
  </float>
The Programming Languages and Verification Group at the University of Colorado Boulder (CUPLV) is looking for exceptional candidates for a postdoctoral research associate in the area of program analysis and program synthesis.
  </p>
  <p>
The ideal candidate has a very strong background in the general area of programming languages and verification.
  </p>
  <p>
The postdoctoral researcher would collaborate with Profs. <ref table="person" key="bec"/>, <ref table="person" key="srirams"/>, and <ref table="person" key="cernyp"/>. To apply, please send an email to any of us with CV and contact information for two or three references.
  </p>
  <p>
Our group has active projects in areas such as the following:
<ul>
  <li>program analysis</li>
  <li>model checking</li>
  <li>verification and synthesis of hybrid and embedded systems</li>
  <li>program synthesis</li>
</ul>
  </p>
        <p>
The position is for one year, with a possible extension for additional years. Highly-qualified candidates may be considered for a research assistant professor position.  Compensation is highly competitive and commensurate with experience.
        </p>
        <p>
The University of Colorado is an Equal Opportunity Employer committed to building a diverse workforce. We encourage applications from women, minorities candidates, people with disabilities, and veterans.
        </p>
        <p>
Boulder, located at the base of the Rocky Mountain foothills, is consistently awarded top-rankings for health, education, and quality of life.  It is also home to a concentration of high-tech industry and its vibrant startup community.
        </p>
      </news-page>
    </news>
    <news date="2014.07.10" id="schkufza-seminar-2014">
      <news-snippet>
  <ref table="person" key="eschkufza"/> visits July 15.
      </news-snippet>
      <news-detail>
  <ref table="person" key="eschkufza"/> from
  Stanford
  is visiting us on July 15, 2014. He is giving a
  CUPLV Seminar
  entitled
  "Stochastic Optimization of x86_64 Binaries"
  at 11:00am
  in KOBL	300 on Tuesday, July 15, 2014.
      </news-detail>
      <talk-announcement>
  <speaker><ref table="person" key="eschkufza"/></speaker>
  <affiliation>Stanford University</affiliation>
  <when>07-15-2014 11:00</when>
  <where>KOBL 300</where>
  <title>
    Stochastic Optimization of x86_64 Binaries
  </title>
  <abstract>
    <p>The optimization of short sequences of loop-free fixed-point x86_64 code sequences is an important problem in high-performance computing. Unfortunately, the competing constraints of transformation correctness and performance improvement often force even special purpose compilers to produce sub-optimal code. We show that by encoding these constraints as terms in a cost function, and using a Markov Chain Monte Carlo sampler to rapidly explore the space of all possible programs, we are able to generate aggressively optimized versions of a given target program. Beginning from binaries compiled by gcc -O0, we are able to produce provably correct code sequences that either match or outperform the code produced by gcc -O3, and in some cases expert hand-written assembly.</p>
          <p>Because most high-performance applications contain floating-point computations, we extend our technique to this domain and show a novel approach to trading full floating-point precision for further increases in performance. We demonstrate the ability to generate reduced precision implementations of Intel's handwritten C numerics library that are up to six times faster than the original code, and achieve end-to-end speedups of over 30% on a direct numeric simulation and a ray tracer. Because optimizations that contain floating-point computations are not amenable to formal verification using the state of the art, we present a technique for characterizing maximum error and providing strong evidence for correctness.</p>
  </abstract>
  <bio>
    <p><ref table="person" key="eschkufza"/>
    is a PhD candidate at Stanford University (a few signatures away from graduating!) working with Professor Alex Aiken. He is interested in applying machine learning and stochastic search techniques to the design of optimizing compilers.</p>
  </bio>
      </talk-announcement>
    </news>
    <news date="2014.06.27" id="paper-emsoft">
        <news-snippet>
  Two papers with CUPLV authors accepted to <ref table="event" key="emsoft14"/>!
  [<ref table="pub" key="controller-emsoft14" text="1"/>,
   <ref table="pub" key="shooting-emsoft14" text="2"/>]
      </news-snippet>
      <news-detail>
  CUPLV authors
  <ref table="person" key="hravanbakhsh"/>, <ref table="person" key="adityaz"/>, and <ref table="person" key="srirams"/>
  with collaborators
  have had papers
  accepted for presentation at <ref table="event" key="emsoft14"/> in October (<ref table="pub" key="controller-emsoft14" mode="authors"/>,
  and <ref table="pub" key="shooting-emsoft14" mode="authors"/>).
      </news-detail>
    </news>
    <news date="2014.06.01" id="paper-sas14">
      <news-snippet>
  Three papers with CUPLV authors accepted to <ref table="event" key="sas14"/>!
  [<ref table="pub" key="expectation-sas14" text="1"/>,
   <ref table="pub" key="hoo-sas14" text="2"/>,
   <ref table="pub" key="sepdom-sas14" text="3"/>]
      </news-snippet>
      <news-detail>
  CUPLV authors
  <ref table="person" key="chakarov"/>, <ref table="person" key="cox"/>, <ref table="person" key="bec"/>, and <ref table="person" key="srirams"/>
  with collaborators
  have had papers
  accepted for presentation at <ref table="event" key="sas14"/> in September (<ref table="pub" key="expectation-sas14" mode="authors"/>,
  <ref table="pub" key="hoo-sas14" mode="authors"/>, and <ref table="pub"
  key="sepdom-sas14" mode="authors"/>).
      </news-detail>
    </news>
    <news date="2014.04.21" id="deptresearchaward14">
      <news-snippet>
        CUPLV student <ref table="person" key="blackshear"/>
        receives the 2013-2014
        <a href="https://www.colorado.edu/cs/news-events/student-awards#outstanding_research-939">CU CS Outstanding Research Award</a>.
      </news-snippet>
    </news>
    <news date="2014.04.18" id="paper-cav14">
      <news-snippet>
  Paper by <ref table="pub" key="quicr-cav14" mode="authors"/>
  accepted to <ref table="event" key="cav14"/>.
      </news-snippet>
      <news-detail>
  CUPLV authors <ref table="person" key="cox"/>, <ref table="person" key="bec"/>, and <ref table="person" key="srirams"/>
  have had a paper "<ref table="pub" key="quicr-cav14"/>"
  accepted for presentation at <ref table="event" key="cav14"/> in July.
      </news-detail>
    </news>
    <news date="2014.02.19" id="phdvisit-2014">
      <news-snippet>
  <a href="http://embedded-computing.com/articles/improving-system-effectiveness-model-based-development/">Press coverage</a> on S-Taliro in Embedded Computing Design.
      </news-snippet>
      <news-detail>
  S-Taliro developed by <ref table="person" key="srirams"/> and collaborators receives <a href="http://embedded-computing.com/articles/improving-system-effectiveness-model-based-development/">press coverage</a>
  in Embedded Computing Design.
      </news-detail>
    </news>
    <news date="2014.02.19" id="phdvisit-2014">
      <news-snippet>
  Prospective Ph.D. students visit February 21. Welcome!
      </news-snippet>
    </news>
    <news date="2014.02.03" id="blackshear-facebook14">
      <news-snippet>
  <ref table="person" key="blackshear"/> wins a
  <a href="https://www.facebook.com/notes/facebook-fellowship-program/announcing-the-facebook-graduate-fellowship-2014-2015-winners/1516002375292350">Facebook Graduate Fellowship</a>!
      </news-snippet>
      <news-detail>
  <ref table="person" key="blackshear"/> is one of only eleven winners of a
  <a href="https://www.facebook.com/notes/facebook-fellowship-program/announcing-the-facebook-graduate-fellowship-2014-2015-winners/1516002375292350">2014-2015 Facebook Graduate Fellowship</a>!
      </news-detail>
    </news>
    <news date="2014.02.05" id="paper-pldi14">
      <news-snippet>
  Paper by <ref table="pub" key="vmv-pldi14" mode="authors"/>
  accepted to <ref table="event" key="pldi14"/>.
      </news-snippet>
      <news-detail>
  CUPLV author <ref table="person" key="blackshear"/>
  with collaborators
  have had a paper "<ref table="pub" key="vmv-pldi14"/>"
  accepted for presentation at <ref table="event" key="pldi14"/> in June.
      </news-detail>
    </news>
    <news date="2014.01.22" id="coughlin-popl14">
      <news-snippet>
  <ref table="person" key="coughlin"/> presenting at
  <ref table="event" key="popl14"/> today.
      </news-snippet>
      <news-detail>
  <ref table="person" key="coughlin"/> presenting "<ref table="pub" key="fissile-popl14" mode="title"/>" at
  <ref table="event" key="popl14"/> today.
      </news-detail>
    </news>
    <news date="2013.12.01" id="slutz13">
      <news-snippet>
        CUPLV graduate student <ref table="person" key="chakarov"/>
        and undergraduate student <ref table="person" key="givens"/>
        receive the 2013
        <a href="https://www.colorado.edu/cs/current-students/student-awards">Ralph J. Slutz Student Excellence Award</a>.
      </news-snippet>
    </news>
    <news date="2013.10.01" id="papers-popl14">
      <news-snippet>
  Two papers with CUPLV authors accepted to <ref table="event" key="popl14"/>!
  [<ref table="pub" key="fissile-popl14" text="1"/>,
   <ref table="pub" key="acceleration-popl14" text="2"/>]
      </news-snippet>
      <news-detail>
  CUPLV authors <ref table="person" key="coughlin"/>, <ref table="person" key="bec"/>, and <ref table="person" key="srirams"/>
  with collaborators
  have had papers accepted for presentation at <ref
  table="event" key="popl14"/> in January (<ref table="pub"
  key="fissile-popl14" mode="authors"/>
  and <ref table="pub" key="acceleration-popl14" mode="authors"/>).
      </news-detail>
    </news>
    <news date="2013.06.08" id="cuplv-summer13">
      <news-snippet>
  Check out CUPLV at
  <ref table="event" key="pldi13"/>,
  <ref table="event" key="lics13"/>,
  <ref table="event" key="ecoop13"/>, and
  <ref table="event" key="cav13"/> this summer.
      </news-snippet>
      <news-detail>
  <float>
    <ref table="person" key="blackshear" mode="medium-face"/>
    <ref table="person" key="cox" mode="medium-face"/>
    <ref table="person" key="chakarov" mode="medium-face"/>
    <ref table="person" key="bec" mode="medium-face"/>
    <ref table="person" key="srirams" mode="medium-face"/>
    <ref table="person" key="cernyp" mode="medium-face"/>
  </float>
  Eight CUPLV papers are being presented this summer:
  <ref table="event" key="pldi13"/> June 16-22
  [<ref table="pub" key="thresher-pldi13" mode="authors"/>,
  <ref table="pub" key="probabilistic-pldi13" mode="authors"/>,
  <ref table="pub" key="acspec-pldi13" mode="authors"/>],
  <ref table="event" key="lics13"/> June 25-28
  [<ref table="pub" key="automata-lics13" mode="authors"/>],
  <ref table="event" key="ecoop13"/> July 1-5
  [<ref table="pub" key="quicgraphs-ecoop13" mode="authors"/>], and
  <ref table="event" key="cav13"/> July 13-19
  [<ref table="pub" key="concursyn-cav13" mode="authors"/>,
  <ref table="pub" key="martingales-cav13" mode="authors"/>,
  <ref table="pub" key="flowstar-cav13" mode="authors"/>].
      </news-detail>
    </news>
    <news date="2013.05.21" id="cox-chateaubriand13">
      <news-snippet>
  <ref table="person" key="cox"/> wins a
  <a href="http://france-science.org/Chateaubriand-Fellowship-2013.html">Chateaubriand Fellowship</a>!
      </news-snippet>
      <news-detail>
  <ref table="person" key="cox"/> wins a
  <a href="http://france-science.org/Chateaubriand-Fellowship-2013.html">Chateaubriand Fellowship</a>
  in Science, Technology, Engineering, and Mathematics
  from the Embassy of France in the United States to study and conduct research in France.
      </news-detail>
    </news>
    <news date="2013.05.07" id="artifact-ecoop13">
      <news-snippet>
  <ref table="pub" key="quicgraphs-ecoop13" mode="authors"/> wins <ref table="event" key="ecoop13"/> distinguished artifact award!
      </news-snippet>
      <news-detail>
  <float>
      <ref table="person" key="cox" mode="medium-face"/>
    <ref table="person" key="bec" mode="medium-face"/>
    <ref table="person" key="srirams" mode="medium-face"/>
  </float>
  The artifact supplementing "<ref table="pub" key="quicgraphs-ecoop13"/>" has been
  <a href="http://www.lirmm.fr/ecoop13/index.php/validated-artifacts">validated</a>
  and has received the distinguished artifact award at <ref table="event" key="ecoop13"/>!
      </news-detail>
    </news>
    <news date="2013.03.25" id="cox-facebook13">
      <news-snippet>
  <ref table="person" key="cox"/> named a <a href="https://www.facebook.com/notes/facebook-academics/announcing-the-2013-2014-facebook-graduate-fellows/514353405282738">2013-2014 Facebook Graduate Fellowship Finalist</a>.
      </news-snippet>
    </news>
    <news date="2013.03.06" id="papers-cav13">
      <news-snippet>
  Three papers with CUPLV authors accepted to <ref table="event" key="cav13"/>!
  [<ref table="pub" key="concursyn-cav13" text="1"/>,
   <ref table="pub" key="martingales-cav13" text="2"/>,
   <ref table="pub" key="flowstar-cav13" text="3"/>]
      </news-snippet>
      <news-detail>
  CUPLV authors <ref table="person" key="cernyp"/>, <ref table="person" key="chakarov"/>, and <ref table="person" key="srirams"/>
  with collaborators
  have had papers accepted for presentation at <ref
  table="event" key="cav13"/> in July (<ref table="pub"
  key="concursyn-cav13" mode="authors"/>, <ref
  table="pub" key="martingales-cav13" mode="authors"/>,
  and <ref table="pub" key="flowstar-cav13" mode="authors"/>).
      </news-detail>
    </news>
    <news date="2012.03.04" id="paper-ecoop13">
      <news-snippet>
  Paper by <ref table="pub" key="quicgraphs-ecoop13" mode="authors"/>
  accepted to <ref table="event" key="ecoop13"/>.
      </news-snippet>
      <news-detail>
  CUPLV authors <ref table="person" key="cox"/>, <ref table="person" key="bec"/>, and <ref table="person" key="srirams"/>
  have had a paper "<ref table="pub" key="quicgraphs-ecoop13"/>"
  accepted for presentation at <ref table="event" key="ecoop13"/> in July.
      </news-detail>
    </news>
    <news date="2013.03.04" id="tapascfp-2013">
      <news-snippet>
  Submit Analyzer Pearls to <ref table="event" key="tapas13" />!
      </news-snippet>
    </news>
    <news date="2013.02.21" id="phdvisit-2013">
      <news-snippet>
  Prospective Ph.D. students visit February 22. Welcome!
      </news-snippet>
    </news>
    <news date="2013.02.04" id="papers-pldi13">
      <news-snippet>
  Great showing for CUPLV authors at <ref table="event" key="pldi13"/>: 3 papers accepted! [<ref table="pub" key="thresher-pldi13" text="1"/>, <ref table="pub" key="probabilistic-pldi13" text="2"/>, <ref table="pub" key="acspec-pldi13" text="3"/>]
      </news-snippet>
      <news-detail>
  <float>
    <ref table="person" key="blackshear" mode="medium-face"/>
    <ref table="person" key="bec" mode="medium-face"/>
    <ref table="person" key="srirams" mode="medium-face"/>
    <ref table="person" key="chakarov" mode="medium-face"/>
  </float>
  CUPLV authors <ref table="person" key="blackshear"/>, <ref table="person" key="bec"/>, <ref table="person" key="srirams"/>, and <ref table="person" key="chakarov"/>
  with collaborators <ref table="person" key="msridhar"/>,
  <ref table="person" key="sumitg"/>, and
  <ref table="person" key="slahiri"/>
  have had papers accepted for presentation at <ref
  table="event" key="pldi13"/> in June (<ref table="pub"
  key="thresher-pldi13" mode="authors"/>, <ref
  table="pub" key="probabilistic-pldi13" mode="authors" />,
  and <ref table="pub" key="acspec-pldi13"
  mode="authors" />).
      </news-detail>
    </news>
    <news date="2013.01.31" id="sigcse2013src">
      <news-snippet>
  Poster accepted to <ref table="event" key="sigcse2013"/>
  Student Research Competition
  (by <ref table="person" key="lapinski"/> et al.).
      </news-snippet>
      <news-detail>
  <ref table="person" key="lapinski"/> and
  <ref table="person" key="srirams" />
  have had their poster accepted to the
   <ref table="event" key="sigcse2013"/>
  Student Research Competition.
      </news-detail>
    </news>
    <news date="2013.01.31" id="icse2013nier">
      <news-snippet>
  Paper accepted to <ref table="event" key="icse13"/> (New and
  Emerging Results Track) (by <ref table="pub" key="ui-icse-nier13" mode="authors"/>).
      </news-snippet>
      <news-detail>
  <ref table="person" key="givens"/>,
  <ref table="person" key="chakarov"/>,
  <ref table="person" key="srirams"/>, and
  <ref table="person" key="tyeh" />
  have had their paper accepted for presentation
  at <ref table="event" key="icse13"/>
  (New and Emerging Results Track) in May.
    </news-detail>
    </news>
    <news date="2013.01.23" id="jha-colloquium-2013">
      <news-snippet>
  <ref table="person" key="sumitjha"/> visits January 24.
      </news-snippet>
      <news-detail>
  <ref table="person" key="sumitjha"/> from University of Central Florida is visiting us
  on January 24, 2013. He is giving a Computer Science
  Colloquium entitled
  "Validation and Parameter Discovery for Stochastic Computational Models from Behavioral Specifications"
  at 3:30pm in ECCR
  265 on Thursday, January 24, 2013.
      </news-detail>
      <talk-announcement>
  <speaker><ref table="person" key="sumitjha"/></speaker>
  <affiliation>University of Central Florida</affiliation>
  <when>01-24-2013 15:30</when>
  <where>ECCR 265</where>
  <title>
    Validation and Parameter Discovery for Stochastic Computational Models from Behavioral Specifications
  </title>
  <abstract>
    <p>The success of high-performance computing has facilitated the rapid development of increasingly complex models of natural and engineered systems by biologists, physicists, chemists, and even financial engineers. While the development of such models requires considerable domain knowledge and arguably little knowledge of the science of computing itself, we survey a key problem in computational modeling that cuts across boundaries of scientific disciplines and motivates the development of new massively parallel high-performance algorithms: the validation and parameter discovery for stochastic computational models.</p>
  </abstract>
  <bio>
    <p><ref table="person" key="sumitjha"/>
    is an Assistant Professor and the Charles Millican Faculty Fellow with the Computer Science Department at the University of Central Florida, Orlando. He received his Ph.D. in Computer Science at Carnegie Mellon University. Before joining Carnegie Mellon, Dr. Jha graduated with B.Tech (Honors) in Computer Science and Engineering from the Indian Institute of Technology Kharagpur. His current research interests include automated verification and synthesis of stochastic and hybrid systems with emphasis on applications to computational finance and biochemical modeling. Dr. Jha has also worked on more traditional formal validation and machine learning problems at Microsoft Research, General Motors and INRIA, France. Dr. Jha also holds a Certificate in Quantitative Finance and is a member of the Alpha Quant Club - a network of academicians and industry leaders interested in mathematical finance.</p>
  </bio>
      </talk-announcement>
    </news>
    <news date="2012.11.13" id="sarnat-colloquium-2012">
      <news-snippet>
  <ref table="person" key="sarnat"/> visits November 15.
      </news-snippet>
      <news-detail>
  <ref table="person" key="sarnat"/> from Twitter is visiting us
  on November 13, 2012. He is giving a Computer Science
  Colloquium entitled "Getting Off the Monorail or: How Twitter
  Learned to Stop Worrying and Love Monads" at 3:30pm in ECCR
  265 on Thursday, November 13, 2012.
      </news-detail>
      <talk-announcement>
  <speaker><ref table="person" key="sarnat"/></speaker>
  <affiliation>Twitter</affiliation>
  <when>11-13-2012 15:30</when>
  <where>ECCR 265</where>
  <title>
    Getting Off the Monorail or: How Twitter Learned to Stop Worrying and Love Monads
  </title>
  <abstract>
    <p>Twitter is one of the most heavily trafficked sites on
    the internet, with over 140 million active users and serving
    over 400 million Tweets per day. Historically, nearly all of
    Twitter's traffic has been served by a monolithic
    application written in Ruby on Rails, referred to internally
    as "the monorail." Although Twitter has seen remarkable
    growth in its six years of existence, scaling this
    monolithic architecture has proved to be both error-prone
    and expensive, not only in terms of computational
    efficiency, but in terms of developer efficiency as well.</p>
    <p>More recently, Twitter has begun the process of replacing
    the monorail with a Services Oriented Architecture (SOA),
    where the services are JVM processes--mostly written in
    Scala--that communicate with one-another asynchronously over
    a network connection. Naively written, asynchronous code is
    often both tedious to write and difficult to reason about;
    at Twitter, the asynchronous code implementing Scala
    services is both simple and beautiful, thanks in large part
    to an internally-developed, open-source library called
    Finagle.</p>
    <p>In this talk, I will attempt to explain how Finagle's
    strong grounding in programming language theory has
    facilitated this transition to an SOA, and how Scala's
    advanced features allow for a library as expressive as
    Finagle to have been written in the first place.</p>
  </abstract>
  <bio>
    <p><ref table="person" key="sarnat"/> (B.S. in Computer
    Science., CMU 2002, Ph.D. in Computer Science, Yale 2010) is
    a former programming languages researcher who currently
    works for Twitter on a team that builds large scale
    distributed systems. He enjoys candlelit dinners and long
    walks on the beach. Follow him on Twitter as <a
    href="https://twitter.com/eigenvariable">@Eigenvariable</a>.</p>
  </bio>
      </talk-announcement>
    </news>
    <news date="2012.10.28" id="bolz-2012">
      <news-snippet>
  <ref table="person" key="bolz" /> visits October 29-November 2.
      </news-snippet>
    </news>
    <news date="2012.10.02" id="paper-popl13">
      <news-snippet>
  Paper by <ref table="pub" key="quantitative-popl13" mode="authors"/>
  accepted to <ref table="event" key="popl13"/>.
      </news-snippet>
      <news-detail>
  CUPLV author <ref table="person" key="cernyp"/>
  has had a paper "<ref table="pub" key="quantitative-popl13"/>"
  accepted for presentation at <ref table="event" key="popl13"/> in January.
      </news-detail>
    </news>
    <news date="2012.09.30" id="cernyp-joins">
      <news-snippet>
  <ref table="person" key="cernyp"/> joins <a
  href="http://www.colorado.edu">CU-Boulder</a> and <a
  href="http://pl.cs.colorado.edu">CUPLV</a> as an Assistant
  Professor of <a href="http://ecee.colorado.edu/">ECEE</a>
  in January 2013.
      </news-snippet>
      <news-detail>
  <ref table="person" key="cernyp"/> joins the <a
  href="http://www.colorado.edu">University of Colorado Boulder</a>
  (CU-Boulder) and <a href="http://pl.cs.colorado.edu">CU
  Programming Languages and Verification</a> (CUPLV) as an
  Assistant Professor of <a
  href="http://ecee.colorado.edu/">Electrical, Computer, and
  Energy Engineering</a> (ECEE) in January 2013.
      </news-detail>
    </news>
    <news date="2012.09.27" id="srirams-colloquium-2012">
      <news-snippet>
  <ref table="person" key="srirams"/> is speaking
  at the <ref table="event" key="cs-colloquium"/> September 27.
      </news-snippet>
      <news-detail>
  <ref table="person" key="srirams"/> is giving a Computer
  Science Colloquium entitled "Finding Falsifications in Complex
  Cyber-Physical Systems" at 3:30pm in ECCR 265 on Thursday,
  September 27, 2012.
      </news-detail>
      <talk-announcement>
  <speaker><ref table="person" key="srirams"/></speaker>
  <affiliation>University of Colorado Boulder</affiliation>
  <when>09-27-2012 15:30</when>
  <where>ECCR 265</where>
  <title>
    Finding Falsifications in Complex Cyber-Physical Systems
  </title>
  <abstract>
    <p>Cyber-Physical Systems (CPS) combine discretely evolving
    computational components with a continuously changing
    physical world. Examples of CPS include safety-critical
    systems that control airplanes, automobiles, power plants
    and implantable medical devices. Assuring the safety of
    these systems requires techniques that transcend the limited
    coverage provided by testing/simulation. Even though
    impressive progress has been achieved with symbolic formal
    verification techniques for linear systems, the verification
    of non-linear, industrial scale CPS designs remains a
    distant goal.</p> <p>In this talk, I present a simple yet
    effective approach to automatically searching for property
    violations in non-linear systems.  Our approach defines the
    notion of robustness metrics over traces that can be used to
    measure distances between simulation traces and properties
    expressed in temporal logics.  As a result, robustness
    metrics can naturally quantify how "close" a particular
    simulation of the system is to violating a property of
    interest.  By treating robustness metrics as an objective
    function to minimize over the simulation traces of the
    system, we can use many off-the-shelf global optimization
    techniques to effectively steer the simulations towards a
    falsification of the property being considered.</p>
    <p>Despite the lack of strong formal guarantees, we find
    that robustness-guided falsification is a promising approach
    to searching for property violations in complex systems.  We
    present the S-Taliro tool, an implementation of our approach
    to reason about properties of non-linear systems modeled as
    Simulink/Stateflow diagrams.  We present two interesting
    case studies using S-Taliro, including a risk analysis of
    insulin infusion pump usage by diabetic patients that models
    the software in the pump in conjunction with the dynamics of
    insulin/glucose regulatory system.</p>
    <p>Joint work with Georgios Fainekos (Arizona State).</p>
  </abstract>
  <bio>
    <p><ref table="person" key="srirams"/> is an Assistant
    Professor of Computer Science at the University of Colorado
    Boulder. His research interests include techniques for
    verifying programs and cyber-physical systems. Sriram
    obtained a Ph.D. in 2005 from Stanford
    University. Subsequently he worked as a research staff
    member at NEC research labs in Princeton, NJ. He has been on
    the faculty at CU-Boulder since 2009. Sriram has been the
    recipient of awards including the Siebel Scholarship (2005),
    the CAREER award from NSF (2009) and the Dean's award for
    outstanding junior faculty for the College of Engineering at
    CU-Boulder (2012).</p>
  </bio>
      </talk-announcement>
    </news>
    <news date="2012.09.25" id="phd-call-2013">
      <news-snippet>
  Call for Ph.D. applicants for Fall 2013.  Application deadline
  is December 15, 2012.
      </news-snippet>
      <news-detail>
  Call for Ph.D. applicants for Fall 2013.  Application deadline
  is December 15, 2012. Check out our latest <a
  href="http://www.cs.colorado.edu/~bec/talks/openhouse11.swf">recruiting
  talk</a> from February 25, 2011.
      </news-detail>
      <news-page header="Ph.D. Positions">
  <p>
  We are looking for strong students to join our diverse and
  dynamic group in programming languages and verification.  Our
  group has active projects in areas such as static and dynamic
  program analysis; verification, debugging, and programmer
  productivity tools; language-based security; type systems;
  language design, compilation, and analysis for dynamic, web
  languages; performance analysis of data center-scale systems;
  analysis of hybrid and embedded systems.  We have a track
  record of publishing in top venues, such as POPL and PLDI.  <a
  href="http://www.colorado.edu/cs/sites/default/files/Department%20of%20Computer%20Science%20Graduate%20Admissions.pdf">CS
  Admissions</a> (deadline December 15, 2012) and <a
  href="http://ecee.colorado.edu/prospective/grad/intro.html">ECEE
  Admissions</a> (deadline February 1, 2013 but earlier for financial aid consideration).
  </p>
      </news-page>
    </news>
    <news date="2012.09.19" id="mvd-2012">
      <news-snippet>
  CUPLV goes to <ref table="event" key="mvd12"/> September 20-21.
      </news-snippet>
    </news>
    <news date="2012.07.30" id="rival-2012">
      <news-snippet>
  <ref table="person" key="rival" /> visits July 30-August 16.
      </news-snippet>
    </news>
    <news date="2012.07.19" id="talk-issta12">
      <news-snippet>
  <ref table="person" key="coughlin"/> is presenting
  at <ref table="event" key="issta12"/> July 19.
      </news-snippet>
      <news-detail>
  <ref table="person" key="coughlin"/> is presenting
  the paper "<ref table="pub" key="enforcements-issta12"/>"
  at <ref table="event" key="issta12"/> on July 19.
      </news-detail>
    </news>
    <news date="2012.07.15" id="goubault-putot-2012">
      <news-snippet>
  <ref table="person" key="goubault"/> and
  <ref table="person" key="putot"/>
  visit July 16-20.
      </news-snippet>
    </news>
    <news date="2012.06.21" id="pldisrc12">
      <news-snippet>
        <ref table="person" key="vitousek"/> awarded third place at the <a href="http://pldi12.cs.purdue.edu/content/student-research-competition">PLDI Student Research Competition (SRC)</a>.
      </news-snippet>
      <news-detail>
        Congratulations to <ref table="person" key="vitousek"/> for being awarded third place at the <a href="http://pldi12.cs.purdue.edu/content/student-research-competition">Programming Language Design and Implementation (PLDI) Student Research Competition (SRC)</a> for his project: Gradual Typing with Efficient Object Casts.
      </news-detail>
    </news>
    <news date="2012.06.30" id="ivancic-2012">
      <news-snippet>
  <ref table="person" key="ivancic"/> visits July 2.
      </news-snippet>
      <news-detail>
  <ref table="person" key="ivancic"/>
  from NEC Laboratories in Princeton, New Jersey
  is visiting us on July 2, 2012.
  Franjo is giving a talk at 2:00pm in
  ECOT 832 on Monday, July 2, 2012.
      </news-detail>
      <talk-announcement>
  <speaker><ref table="person" key="ivancic"/></speaker>
  <affiliation>NEC Laboratories</affiliation>
  <when>07-02-2012 14:00</when>
  <where>ECOT 832</where>
  <title>
    Program Analysis for C++
  </title>
  <abstract>
    <p>Program analyzes have been successful in finding serious
    program defects such as NULL pointer accesses or buffer
    overflows in programs written in C. However, industry relies
    heavily on object-oriented languages, such as Java and C++.
    This talk presents our recent advances in static analysis
    for C++. It focuses on C++ specific difficulties such as
    multiple inheritance, conversion from C++ strings to C
    strings and vice versa, and C++ exception semantics.</p>
  </abstract>
  <bio>
    <p><ref table="person" key="ivancic"/> is currently a Senior
    Research Staff Member at NEC Laboratories America in
    Princeton, NJ. Prior to joining NEC, he received his
    Ph.D. and MSE degrees in Computer and Information Science
    from the University of Pennsylvania in Philadelphia,
    PA. Earlier, he received his diploma (Dipl.-Inform.) degree
    from the Rheinische Friedrich-Wilhelms-University in Bonn,
    Germany, for his research performed at the Fraunhofer
    Institute in St. Augustin, Germany. His areas of research
    include software verification, model checking, formal
    modeling and analysis of hybrid systems, and design
    automation for embedded software. He received the Morris and
    Dorothy Rubinoff dissertation award from the University of
    Pennsylvania.</p>
  </bio>
      </talk-announcement>
    </news>
    <news date="2012.06.11" id="chauduri-2012">
      <news-snippet>
  <ref table="person" key="swarat" /> visits June 12.
      </news-snippet>
    </news>
    <news date="2012.05.31" id="thiagarajan-2012">
      <news-snippet>
  <ref table="person" key="thiagu"/> visits June 4-5.
      </news-snippet>
      <news-detail>
  <ref table="person" key="thiagu"/>
  from National University of Singapore
  is visiting us on June 4-5, 2012.
  He is giving a talk at 2:00pm in
  ECOT 831 on Monday, June 4, 2012.
      </news-detail>
      <talk-announcement>
  <speaker><ref table="person" key="thiagu"/></speaker>
  <affiliation>National University of Singapore</affiliation>
  <when>06-04-2012 14:00</when>
  <where>ECOT 831</where>
  <title>
    Probabilistic Approximation and Analysis Bio-pathways Dynamics
  </title>
  <abstract>
    <p>A system of Ordinary Differential Equations (ODEs) is
    often used to model the dynamics of a bio-chemical
    network. Such systems are difficult to analyze. To get
    around this, we construct a discrete probabilistic
    approximation of the ODE dynamics as a dynamic Bayesian
    network.  Consequently, pathway properties can be analyzed
    using standard Bayesian inference techniques. Apart from
    testing our method on ODEs models drawn from the biomodels
    data base, we have used our technique in a combined
    computational and experimental study of the human complement
    system under inflammation conditions.  Our results are very
    encouraging in terms of accuracy and efficiency. Finally, we
    have extended the scalability of our approach via a GPU
    implementation.</p>
  </abstract>
  <bio>
    <p>P.S. Thiagarajan received his B.Tech (Electrical
    Engineering) from the Indian Institute of Technology (IIT),
    Madras (1970) and his Ph.D. in Computer Science from Rice
    university, Houston, Texas, USA (1973).  He is currently a
    Professor of Computer Science at the National University of
    Singapore.</p>
    <p>He has held appointments at the Project MAC (the
    predecessor of the current Laboratory for Computer Science),
    Massachusetts Institute of Technology (MIT) (1973-1975),
    Gesellschaft fuer Mathematik und Datenverarbeitung,
    St. Augustin, Germany (1975-83), Aarhus University, Denmark
    (1983-86), Indian Institute of Mathematical Sciences,
    Chennai, India (1986-89) and the Chennai Mathematical
    Institute (1989-).</p>
    <p>He has served as a member of the editorial boards of the
    journals Theoretical Computer Science and the International
    Journal on Foundations of Computing . He served two terms
    (1997 - 2003) as a member of the Governing Council of the
    European Association for Theoretical Computer Science
    (EATCS). He is a Fellow of the Indian Academy of Sciences
    and the Indian National Academy of Sciences.</p>
    <p>His current research interests are: System-level design
    and analysis methods for real time embedded systems and
    computational systems biology.</p>
  </bio>
      </talk-announcement>
    </news>
    <news date="2012.05.21" id="paper-sas12">
      <news-snippet>
  Paper accepted to <ref table="event" key="sas12"/>
  (by <ref table="pub" key="reflective-sas12" mode="authors" />).
      </news-snippet>
    </news>
    <news date="2012.04.20" id="paper-issta12">
      <news-snippet>
  Paper accepted to <ref table="event" key="issta12"/>
  (by <ref table="pub" key="enforcements-issta12" mode="authors" />).
      </news-snippet>
    </news>
    <news date="2012.03.27" id="talk-tacas12">
      <news-snippet>
  <ref table="person" key="cox"/> is presenting
  at <ref table="event" key="tacas12"/> March 27.
      </news-snippet>
      <news-detail>
  <ref table="person" key="cox"/> is presenting
  the paper "<ref table="pub" key="filters-tacas12"/>"
  at <ref table="event" key="tacas12"/> on March 27.
      </news-detail>
    </news>
    <news date="2012.03.23" id="papers-cav12">
      <news-snippet>
  3 papers with CUPLV authors accepted to <ref table="event" key="cav12"/>
  (by <ref table="pub" key="iictl-cav12" mode="authors" />, <ref table="pub" key="timed-relational-cav12" mode="authors" />, and <ref table="pub" key="sl-cav12" mode="authors" />)
      </news-snippet>
    </news>
    <news date="2012.02.23" id="phdvisit-2012">
      <news-snippet>
  Prospective Ph.D. students visit February 24.
      </news-snippet>
    </news>
    <news date="2012.02.02" id="jeannet-2012">
      <news-snippet>
  <ref table="person" key="bjeannet"/> and <ref table="person"
  key="schramme"/> visit February 6-17.
      </news-snippet>
      <news-detail>
  <ref table="person" key="bjeannet"/> and <ref table="person"
  key="schramme"/> from INRIA Rhône-Alpes in Grenoble, France
  are visiting us for two weeks from February 6, 2012 to
  February 17, 2012.  Bertrand is giving a talk at 3:30pm in
  ECOT 831 on Friday, February 10, 2012, and Peter is presenting
  at 3:30pm in ECOT 831 on Friday, February 17, 2012.
      </news-detail>
      <talk-announcement>
  <speaker><ref table="person" key="schramme"/></speaker>
  <affiliation>INRIA Rhône-Alpes</affiliation>
  <when>02-17-2012 15:30</when>
  <where>ECOT 831</where>
  <title>
    Towards the Verification of Hybrid Data-Flow Languages
  </title>
  <abstract>
    <p>Hybrid systems are used to model embedded computing
    systems interacting with their physical environment. There
    is a conceptual mismatch between high-level hybrid system
    languages, like Simulink, which are used for simulation, and
    hybrid automata, the most suitable representation for safety
    verification. Indeed, in simulation languages the
    interaction between discrete and continuous execution steps
    is specified using the concept of zero-crossings, whereas
    hybrid automata exploit the notion of staying conditions.
    In this talk we first briefly present Zelus, a synchronous
    data-flow language extended with ordinary differential
    equations.  Then we propose a sound translation from a
    Zelus-like hybrid data-flow formalism to logico-numerical
    hybrid automata discussing various zero-crossing semantics
    and the extent to which the original semantics is preserved.
    At last we sketch how existing continuous reachability
    analysis methods can be applied to logico-numerical hybrid
    automata.</p>
  </abstract>
      </talk-announcement>
      <talk-announcement>
  <speaker><ref table="person" key="bjeannet"/></speaker>
  <affiliation>INRIA Rhône-Alpes</affiliation>
  <when>02-10-2012 15:30</when>
  <where>ECOT 831</where>
  <title>
    The BDDAPRON Logico-Numerical Abstract Domain Library
  </title>
  <abstract>
    <p>We describe BDDAPRON, a freely available library
    dedicated to the static analysis of finite-type and
    numerical variables.</p>
    <p>BDDAPRON provides ready-to-use logico-numerical
    abstractions for combinations of finite-type and numerical
    variables, as well as powerful symbolic manipulations of
    expressions.</p>
    <p>Algorithmically, BDDAPRON combines BDD techniques (using
    the CUDD library) with numerical abstract domains provided
    by the APRON library. We describe the principles behind this
    combination and the various available options for the
    computation of abstract transfer functions.</p>
    <p>At last, we present some applications of the BDDAPRON
    abstract domain to program verification, including recursive
    program with pointers.</p>
  </abstract>
      </talk-announcement>
    </news>
    <news date="2012.01.25" id="students-popl12">
      <news-snippet>
  <ref table="person" key="agrawal"/>,
  <ref table="person" key="coughlin"/>,
  <ref table="person" key="cox"/>, and
  <ref table="person" key="silkensen"/> finalists
  at the <ref table="event" key="popl12"/>
  Student Lightning Talks.
      </news-snippet>
    </news>
    <news date="2011.11.04" id="best-paper-fmcad-2011">
      <news-snippet>
  Best paper at <ref table="event" key="fmcad11"/> goes to
  "<ref table="pub" key="fair-fmcad11"/>".
      </news-snippet>
    </news>
    <news date="2011.11.04" id="faculty-openings-2012">
      <news-snippet>
  Two tenure-track positions open.  Evaluation begins December 6, 2011.
      </news-snippet>
      <news-page header="Faculty Positions (Two Openings)">
  <p>
    University of Colorado Boulder: Department of Electrical,
    Computer, and Energy Engineering (ECEE) seeks outstanding
    candidates for two tenure-track positions in computer
    systems. The openings are targeted at the level of Assistant
    Professor, but experienced candidates with outstanding
    credentials may be considered for Associate or Full
    Professor.
  </p>
  <p>
    Candidates interested in rigorous and innovative approaches
    to the design and analysis of complex computing systems
    (from embedded and cyberphysical to large-scale distributed
    systems) should apply. We seek candidates with background in
    programming languages, concurrency, security, formal
    methods, verification, or system engineering. Preference
    will go to researchers whose work spans multiple areas.
  </p>
  <p>
    The positions will help shape the cooperation with the
    Department of Computer Science on computing systems.
  </p>
  <p>
    Candidates must have a Ph.D. in electrical engineering,
    computer engineering, computer science, or related
    discipline; they must have the ability to develop an
    independent research program, and enthusiasm for working
    with undergraduate and graduate students.
  </p>
  <p>
    The University of Colorado is an Equal Opportunity Employer
    committed to building a diverse workforce. We encourage
    applications from women, minorities candidates, people with
    disabilities, and veterans.
  </p>
  <p>
    Applications will be evaluated starting December 6, 2011 and
    until the positions are filled.
  </p>
  <p>
    Applications must include a letter of application specifying
    the desired position and area of specialization, complete
    curriculum vitae, statements of research and teaching
    interests, and names and contact information of three
    references. Applications must be submitted on-line at
    http://www.jobsatcu.com/ using posting number <a
    href="http://www.jobsatcu.com/applicants/Central?quickFind=66369">#815103</a>
    (computer systems). Additional information is available at
    that site.
  </p>
      </news-page>
    </news>
    <news date="2011.11.04" id="phd-call-2012">
      <news-snippet>
  Call for Ph.D. applicants for Fall 2012.  Application deadline
  is December 15, 2011.
      </news-snippet>
      <news-detail>
  Call for Ph.D. applicants for Fall 2012.  Application deadline
  is December 15, 2011. Check out our latest <a
  href="http://www.cs.colorado.edu/~bec/talks/openhouse11.swf">recruiting
  talk</a> from February 25, 2011.
      </news-detail>
      <news-page header="Ph.D. Positions">
  <p>
  We are looking for strong students to join our diverse and
  dynamic group in programming languages and verification.  Our
  group has active projects in areas such as static and dynamic
  program analysis; verification, debugging, and programmer
  productivity tools; language-based security; type systems;
  language design, compilation, and analysis for dynamic, web
  languages; performance analysis of data center-scale systems;
  analysis of hybrid and embedded systems.  We have a track
  record of publishing in top venues, such as POPL and PLDI.  <a
  href="http://www.cs.colorado.edu/grad/admission/">CS
  Admissions</a> (deadline December 15, 2011) and <a
  href="http://ecee.colorado.edu/prospective/grad/intro.html">ECEE
  Admissions</a> (deadline February 1, 2012 but earlier for financial aid consideration).
  </p>
      </news-page>
    </news>
    <news date="2011.09.09" id="talk-sas11">
      <news-snippet>
  <ref table="person" key="blackshear" /> presenting at
  <ref table="event" key="sas11" /> September 14.
      </news-snippet>
      <news-detail>
  <ref table="person" key="blackshear" /> is presenting
  the paper "<ref table="pub" key="ptaprecision-sas11" />" at
  <ref table="event" key="sas11" /> on September 14.
      </news-detail>
    </news>
    <news date="2011.07.11" id="summer-workshop-2011">
      <news-snippet>
  Summer workshop July 12.
      </news-snippet>
      <news-detail>
  We will have a workshop with visitors
  <ref table="person" key="swarat" /> (Rice University, USA),
  <ref table="person" key="goubault"/> (CEA, France),
  <ref table="person" key="putot"/> (CEA, France), and
  <ref table="person" key="cesar" /> (IMDEA, Spain)
  in ECOT 832 on July 12 10:00am-6:00pm.
      </news-detail>
    </news>
    <news date="2011.07.07" id="goubault-putot-2011">
      <news-snippet>
  <ref table="person" key="goubault"/> and
  <ref table="person" key="putot"/>
  visit July 11-12.
      </news-snippet>
    </news>
    <news date="2011.07.07" id="chauduri-2011">
      <news-snippet>
  <ref table="person" key="swarat" /> visits July 11-15.
      </news-snippet>
    </news>
    <news date="2011.07.01" id="sanchez-2011">
      <news-snippet>
  <ref table="person" key="cesar" /> visits July 5-August 12.
      </news-snippet>
    </news>
    <news date="2011.06.02" id="ivancic-2011">
      <news-snippet>
  <ref table="person" key="ivancic" /> visits June 4.
      </news-snippet>
    </news>
    <news date="2011.04.25" id="reichenbach-2011">
      <news-snippet>
  <ref table="person" key="creichen"/> visits April 25.
      </news-snippet>
      <news-detail>
  <ref table="person" key="creichen"/> from U of Massachusetts,
  Amherst and alumnus of this group is visiting us on Monday,
  April 25, 2011.  He is giving a talk at 10:00am in ECOT 832.
      </news-detail>
      <talk-announcement>
  <speaker><ref table="person" key="creichen"/></speaker>
  <affiliation>University of Massachusetts, Amherst</affiliation>
  <when>04-25-2011 10:00</when>
  <where>ECOT 832</where>
  <title>
    What can the Garbage Collector compute efficiently? A
    Language for Heap Assertions at Garbage Collection Time
  </title>
  <abstract>
    <p>Finding bugs is among the most challenging tasks in
    software development.  For this reason, modern software
    development methodologies encourage programmers to use
    assertions throughout their code to express the assumptions
    they are making.  At runtime, these assertions then detect
    whenever the assumptions do not match the program; in other
    words, they detect bugs early.  However, traditional
    assertion mechanisms in mainstream languages such as C or
    Java are limited in their expressivity.</p>
    <p>This talk presents DeAL, a rich heap assertion language
    for Java that extends over the expressive power of
    traditional assertions.  DeAL introduces additional
    primitives to reason over heap layout, allowing programmers
    to assert global invariants, ownership, and other properties
    that would be impossible to express in traditional
    assertions.</p>
    <p>By design, all DeAL assertions require only a single heap
    traversal and can execute as part of garbage collection.
    Consequently, DeAL is not only expressive, but also ensures
    a very low execution overhead.</p>
  </abstract>
      </talk-announcement>
    </news>
    <news date="2011.02.22" id="stump-2011">
      <news-snippet>
  <ref table="person" key="astump"/> visits February 24-25.
      </news-snippet>
      <news-detail>
  <ref table="person" key="astump"/> from U of Iowa is visiting
  us February 24-25, 2011.  He is giving a talk on Thursday,
  February 24 at 4:30pm in ECOT 832.
      </news-detail>
      <talk-announcement>
  <speaker><ref table="person" key="astump"/></speaker>
  <affiliation>University of Iowa</affiliation>
  <when>02-24-2011 16:30</when>
  <where>ECOT 832</where>
  <title>Building Verified Software with Dependent Types</title>
  <abstract>
    <p>Recent years have seen intensive interest among
    Programming Language (PL) researchers in connecting PL and
    Verification.  Static analyses which once were primarily
    intended for enabling optimizations in compilers are now
    used also for program verification and bug finding.  Type
    systems, which had been used to detect (either statically or
    dynamically) low-level bugs, are now pushed to express
    stronger and stronger semantic properties of code.  Arguably
    the most powerful such systems known are so-called dependent
    type systems, which combine programming and theorem proving,
    and use rich types to express general logical specifications
    of programs.</p>
    <p>In this talk, I will describe ongoing work in my group to
    design, prove, and implement dependently typed programming
    languages, and apply them for challenging case studies.  I
    will summarize the design of the Guru dependently typed
    programming language, and explain how it overcomes some
    traditional difficulties for dependently typed languages,
    concerning general recursion and also the treatment of
    equality.  For a case study, I will describe recent work of
    my doctoral student Duckki Oe to implement a statically
    verified modern SAT solver called versat in Guru. Versat
    uses the efficient low-level data structures and algorithms
    of modern solvers like Minisat, but has been statically
    verified to be sound: if versat reports "unsat", then the
    input formula is truly contradictory.  Versat can solve
    benchmarks on the modern scale, including some from the SAT
    Competition 2009.  I will conclude with a glimpse at a new
    dependently typed language called Trellys, being designed
    and implemented in a collaborative project with Stephanie
    Weirich at U. Pennsylvania and Tim Sheard at Portland
    State.</p>
  </abstract>
  <bio>
    Aaron Stump is an associate professor of Computer Science at
    The University of Iowa, where he co-leads the U. Iowa
    Computational Logic Center with Cesare Tinelli.  Aaron
    received his PhD in Computer Science in 2002 from Stanford
    University.  His research interests are in Computational
    Logic and Programming Languages, with current focus on
    dependently typed programming languages and high-performance
    proof checking.
  </bio>
      </talk-announcement>
    </news>
    <news date="2011.02.06" id="cook-2011">
      <news-snippet>
  <ref table="person" key="bycook"/> visits February 8.
      </news-snippet>
      <news-detail>
  <ref table="person" key="bycook"/> from MSR Cambridge and Queen
  Mary, University of London is visiting us Tuesday, February 8,
  2011.  He is giving a talk at 3:00pm in ECOT 831.
      </news-detail>
      <talk-announcement>
  <speaker><ref table="person" key="bycook"/></speaker>
  <affiliation>MSR Cambridge and Queen Mary, University of London</affiliation>
  <when>02-08-2011 15:00</when>
  <where>ECOT 831</where>
  <title>Proving stabilisation of biological models</title>
  <abstract>
    I will describe an efficient procedure for proving
    stabilisation of biological systems when modeled as
    qualitative networks or genetic regulatory networks. For
    scalability, we use modular proof techniques, where
    state-space exploration is applied only locally to small
    pieces of the system rather than the entire system as a
    whole. Our procedure exploits the observation that, in
    practice, the form of modular proofs can be restricted to a
    very limited set.  Using our new procedure, we have solved a
    number of challenging published examples, including: a 3-D
    model of the mammalian epidermis; a model of metabolic
    networks operating in type-2 diabetes; a model of fate
    determination of vulval precursor cells in the C. elegans
    worm; and a model of pair-rule regulation during
    segmentation in the Drosophila embryo. Our results show many
    orders of magnitude speedup in cases where previous
    stabilization proving techniques were known to succeed, and
    new results in cases where tools had previously failed.
  </abstract>
  <bio>
    Dr. Byron Cook is a principal researcher at Microsoft
    Research Cambridge, as well as Professor of Computer Science
    at Queen Mary, University of London.  Byron is one of the
    developers behind the Terminator program termination prover,
    as well as the SLAM symbolic software model checker which
    forms the basis of the Windows Static Driver Verifier tool.
  </bio>
      </talk-announcement>
    </news>
    <news date="2010.08.01" id="wang-2010">
      <news-snippet>
  <ref table="person" key="chaowang" /> visits August 26-27.
      </news-snippet>
      <news-detail>
  <ref table="person" key="chaowang" /> from NEC Laboratories
  and CU alumnus is visiting us August 26-27.  He is giving a
  talk in the CS Colloquium on Thursday, August 26 3:30pm-4:30pm
  in ECCR 150.
      </news-detail>
      <talk-announcement>
  <speaker><ref table="person" key="chaowang"/></speaker>
  <affiliation>NEC Laboratories</affiliation>
  <when>08-26-2010 15:30</when>
  <where>ECCR 150</where>
  <title>Symbolic Predictive Analysis for Concurrent Programs</title>
  <abstract>
    <p>Multi-core and multi-processor systems are becoming
    increasingly popular. However, our ability to effectively
    harness the power of parallelism is predicated upon advances
    in tools and algorithms for verifying concurrent
    programs. Concurrent programs are notoriously difficult to
    verify, and a key reason for this is the behavioral
    complexity resulting from the large number of interleavings
    of concurrent threads.</p>
    <p>In this talk, I will introduce a symbolic predictive
    analysis for runtime detection of concurrency errors, by
    monitoring and subsequently analyzing the execution traces
    of a program. In this analysis, we first derive a symbolic
    predictive model using the trace information collected at
    run time as well as the program source code. What this model
    captures are not just the given traces, but all possible
    interleavings of events of these traces. Then we use
    symbolic reasoning to check whether there are concurrency
    errors in any of these interleavings. This is done by
    capturing these interleavings and the error conditions using
    a set of first-order logic formulas, and then deciding the
    formulas using an off-the-shelf Satisfiability Modulo Theory
    (SMT) solver.</p>
  </abstract>
  <bio>
  </bio>
      </talk-announcement>
    </news>
    <news date="2010.07.27" id="rival-2010">
      <news-snippet>
  <ref table="person" key="rival" /> visits August 19-25.
      </news-snippet>
      <news-detail>
  <ref table="person" key="rival"/> from INRIA Roquencourt and
  ENS Paris is visiting us August 19-25.  He is giving a talk on
  the Astrée Static Analyzer on Tuesday, August 24 at 11:00am in
  ECOT 831, and he is also giving a more in-depth demonstration
  of Astrée on Wednesday, August 25 4:00pm-5:00pm in ECST 1B21.
      </news-detail>
      <talk-announcement>
  <speaker><ref table="person" key="rival"/></speaker>
  <affiliation>INRIA Roquencourt and ENS Paris</affiliation>
  <when>08-24-2010 11:00</when>
  <where>ECOT 831</where>
  <title>The Astrée Analyzer: Proving the absence of runtime
  errors automatically</title>
  <abstract>
    <p>Runtime errors in embedded softwares may have disastrous
    consequences, e.g. in transportation or energy production
    systems.</p>
    <p>The Astrée analyzer aims at proving the absence of
    runtime errors in C programs and was designed specifically
    for synchronous applications as found in fly-by-wire
    systems. The analysis process is conservative, that is, it
    may fail to establish the correctness of some safe programs,
    but it is sound, that is it will report any runtime error.</p>
    <p>Astrée performs Abstract Interpretation based static
    analysis, that is abstract execution, using families of
    predicates formed by abstract domains. Astrée relies on a
    library of numerical and symbolic abstract domains, which
    allow to capture salient properties of embedded softwares,
    so as to establish absence of runtime errors. The analysis
    process is fully automatic, and involves automatic
    parameterization of the abstract domains.</p>
    <p>We will present the underlying concepts of Astrée, and
    examplify the use of the analyzer on a few selected
    examples.</p>
    <p>The Astrée analyzer has allowed to prove the absence of
    runtime errors in industrial size avionics programs. As of
    today, Absint Angewandte Informatik provides commercial
    diffusion and support of Astrée.</p>
  </abstract>
      </talk-announcement>
    </news>
    <news date="2010.07.27" id="ivancic-2010">
      <news-snippet>
  <ref table="person" key="ivancic" /> visits August 2.
      </news-snippet>
    </news>
    <news date="2010.07.26" id="cook-2010">
      <news-snippet>
  <ref table="person" key="bycook"/> visits July 29.
      </news-snippet>
      <news-detail>
  <ref table="person" key="bycook"/> from MSR Cambridge and
  Queen Mary, University of London is visiting us Thursday, July
  29, 2010.  He is giving a talk in the CS Colloquium at 11:00am
  in ECOT 831.
      </news-detail>
      <talk-announcement>
  <speaker><ref table="person" key="bycook"/></speaker>
  <affiliation>MSR Cambridge and Queen Mary, University of London</affiliation>
  <when>07-29-2010 11:00</when>
  <where>ECOT 831</where>
  <title>New methods for proving temporal properties of infinite-state systems</title>
  <abstract>
    I will describe some new methods of proving temporal
    properties of infinite-state programs.  Our approach takes
    advantage of the fact that linear-temporal properties can
    often be proved more efficiently using proof techniques
    usually associated with the branching-time logic CTL.  The
    caveat is that, in certain instances, nondeterminism in the
    system's transition relation can cause CTL methods to report
    counterexamples that are spurious in LTL. To address this
    problem we describe an algorithm that, as it attempts to
    apply CTL proof methods, finds and then removes problematic
    nondeterminism via an analysis on the spurious
    counterexamples. We must also develop CTL symbolic model
    checking tools for infinite-state systems.
  </abstract>
  <bio>
    Dr. Byron Cook is a Principal Researcher at Microsoft
    Research in Cambridge, UK as well as Professor of Computer
    Science at Queen Mary, University of London.  He is one of
    the developers of the Terminator program termination proving
    tool, as well as the SLAM software model checker.  Before
    joining Microsoft Research he was a developer in the WIndows
    OS kernel group.  See research.microsoft.com/~bycook/ for
    more information.
  </bio>
      </talk-announcement>
    </news>
    <news date="2010.07.05" id="suryanarayanan-2010">
      <news-snippet>
  <ref table="person" key="ssuryana" /> visits July 19.
      </news-snippet>
      <news-detail>
  <ref table="person" key="ssuryana"/> from Colorado School of Mines
  is visiting us on Monday, July 19, 2010.  He is giving a talk in
  the CS Colloquium at 3:00pm in DLC 1B70.
      </news-detail>
      <talk-announcement>
  <speaker><ref table="person" key="ssuryana"/></speaker>
  <affiliation>Colorado School of Mines</affiliation>
  <when>07-19-2010 15:00</when>
  <where>DLC 1B70</where>
  <title>Realizing the Smart Grid through smart interfaces, microgrids, and active distribution networks</title>
  <abstract>
    <p>The electricity infrastructure in the US is poised to
    undergo unprecedented modernization aided by the "Smart Grid
    Initiative" for achieving high levels of reliability,
    efficiency, and interconnection of "green" resources. While
    the advantages of achieving the Smart Grid Initiative appear
    bountiful, there are concomitant challenges to realizing
    this transformation. This talk will describe the present
    state and future trends of the electricity infrastructure,
    and the need for Smart Grid legislation. The crux of the
    seminar will focus on how to realize the Smart Grid
    Initiative's full impact by innovative research and
    development on:</p>
    <ul>
      <li>Smart interfaces between renewable sources and the
      electricity grid,</li>
      <li>Energy efficient electric power microgrids, and</li>
      <li> Transformation from a passive to active electric
      distribution network.</li>
    </ul>
  </abstract>
  <bio>
    Sid Suryanarayanan is from Chennai, India. He received the
    Ph.D. in electrical engineering from Arizona State
    University (ASU) in May 2004. Since January 2008 he has held
    an Assistant Professor position in the Division of
    Engineering at Colorado School of Mines (CSM) in Golden,
    CO. From fall 2010, he will begin an Assistant Professorship
    in the Dept. of Electrical and Computer Engineering (ECE) at
    Colorado State University. Prior to that he held research
    appointments in the faculties of Florida State University
    and ASU. Sid currently performs sponsored research in the
    areas of electric power microgrids and the impact of the
    Smart Grid Initiative on electric power systems.
  </bio>
      </talk-announcement>
    </news>
    <news date="2010.03.15" id="pierce-2010">
      <news-snippet>
  <ref table="person" key="bcpierce"/> visits April 29.
      </news-snippet>
      <news-detail>
  <ref table="person" key="bcpierce"/> from UPenn
  is visiting Thursday, April 29, 2010.  He is giving
  a talk in the CS Colloquium at 3:30pm in ECCR 265.
      </news-detail>
      <talk-announcement>
  <speaker><ref table="person" key="bcpierce"/></speaker>
  <affiliation>University of Pennsylvania</affiliation>
  <when>04-29-2010 15:30</when>
  <where>ECCR 265</where>
  <title>How to Build Your Own Bidirectional Programming Language</title>
  <abstract>
    <p>Most programs get used in just one direction, from input
    to output. But sometimes, having computed an output, we need
    to be able to update this output and then "calculate
    backwards" to find a correspondingly updated input. The
    problem of writing such bidirectional transformations --
    often called lenses -- arises in applications across a
    multitude of domains and has been attacked from many
    perspectives. Potential applications include synchronization
    of replicated data, system configuration management tools
    (such as RedHat's Augeas system), bidirectional
    transformations between software models, and updatable
    "security views."</p>
    <p>The Harmony project at the University of Pennsylvania is
    exploring a linguistic approach to bidirectional
    programming, designing domain-specific languages in which
    every expression simultaneously describes both parts of a
    lens. When read from left to right, an expression denotes an
    ordinary function that maps inputs to outputs. When read
    from right to left, it denotes an "update translator" that
    takes an input together with an updated output and produces
    a new input that reflects the update. These languages share
    some common elements with modern functional languages -- in
    particular, they come with very expressive type systems. In
    other respects, they are rather novel and surprising.</p>
    <p>We have designed, implemented, and applied bi-directional
    languages in three quite different domains: a language for
    bidirectional transformations on trees (such as XML
    documents), based on a collection of primitive bidirectional
    tree transformation operations and
    "bidirectionality-preserving" combining forms; a language
    for bidirectional views of relational data, using
    bidirectionalized versions of the operators of relational
    algebra as primitives; and, most recently, a language for
    bidirectional string transformations, with primitives based
    on standard notations for finite-state transduction and a
    type system based on regular expressions. The string case is
    especially interesting, both in its own right and because it
    exposes a number of foundational issues common to all
    bidirectional programming languages in a simple and familiar
    setting. We are also exploring how lenses and their types
    can be enriched to embody privacy and integrity policies.</p>
    <p>This talk explores the design of bidirectional languages,
    starting from the very simplest imaginable variant
    (bijective languages) and then developing several
    refinements.</p>
  </abstract>
  <bio>
    Benjamin Pierce joined the CIS Department at Penn in
    1998. Previously, he was on the faculty at Indiana
    University and held research fellowships at Cambridge
    University, the University of Edinburgh, and
    INRIA-Roquencourt. He received his PhD in Computer Science
    at Carnegie Mellon University in 1991. His research centers
    on programming languages, static type systems, concurrent
    and distributed programming, and synchronization
    technologies. His books include the widely used graduate
    text Types and Programming Languages. He is also the lead
    designer of the popular Unison file synchronizer.
  </bio>
      </talk-announcement>
    </news>
    <news date="2010.03.12" id="burtscher-2010">
      <news-snippet>
  <ref table="person" key="burtscher"/> visits March 18.
      </news-snippet>
      <news-detail>
  <ref table="person" key="burtscher"/> from UT Austin and CU
  alumnus is visiting Thursday, March 18, 2010.  He is giving
  a talk in the CS Colloquium at 3:30pm in ECCR 265.
      </news-detail>
      <talk-announcement>
  <speaker><ref table="person" key="burtscher"/></speaker>
  <affiliation>The University of Texax at Austin</affiliation>
  <when>03-18-2010 15:30</when>
  <where>ECCR 265</where>
  <title>Towards a Science of Parallel Programming</title>
  <abstract>
    <p>When parallel programming started in the 70s and 80s, it
    was mostly art: languages such as functional and logic
    programming languages were designed and appreciated mainly
    for their elegance and beauty. More recently, parallel
    programming has become engineering: conventional languages
    like FORTRAN and C++ have been extended with constructs such
    as OpenMP, and we now spend our time benchmarking and
    tweaking large programs nobody understands to obtain
    performance improvements of 5-10%. In spite of all this
    activity, we have few insights into how to write parallel
    programs to exploit the performance potential of multicore
    processors.</p>
    <p>To break this impasse, we need a science of parallel
    programming. In this talk, I will introduce a concept called
    "amorphous data-parallelism" that provides a simple, unified
    picture of parallelism in a host of diverse applications
    ranging from mesh generation/refinement/partitioning to SAT
    solvers, maxflow algorithms, stencil computations, and
    event-driven simulation. Then I will present a natural
    classification that provides insight into the structure of
    parallelism and locality in these algorithms and into
    appropriate language and systems support for exploiting this
    parallelism.</p>
  </abstract>
  <bio>
    Martin Burtscher received the combined BS/MS degree in
    computer science from the Swiss Federal Institute of
    Technology (ETH) Zurich in 1996 and the PhD degree in
    computer science from the University of Colorado Boulder in
    2000. Since then, he has been an assistant professor in the
    School of Electrical and Computer Engineering at Cornell
    University and a Research Scientist in the Institute for
    Computational Engineering and Sciences at the University of
    Texas at Austin. His current research focuses on automatic
    parallelization of irregular programs for multicore and GPU
    architectures as well as on automatic performance assessment
    and optimization of HPC applications. He is an associate
    editor of the Journal of Instruction-Level Parallelism and a
    senior member of the IEEE, its Computer Society, and the
    ACM.
  </bio>
      </talk-announcement>
    </news>
    <news date="2010.02.22" id="chen-2010">
      <news-snippet>
  <ref table="person" key="bradchen"/> visits February 25.
      </news-snippet>
      <news-detail>
  <ref table="person" key="bradchen"/> from Google is visiting
  us Thursday, February 25, 2010.  He is giving a talk in the CS
  Colloquium at 3:30pm in ECCR 265.
      </news-detail>
      <talk-announcement>
  <speaker><ref table="person" key="bradchen"/></speaker>
  <affiliation>Google</affiliation>
  <when>02-25-2010 15:30</when>
  <where>ECCR 265</where>
  <title>The Desktop: Frontiers in Systems Research</title>
  <host person="diwan"/>
  <abstract>
    Desktop software, in the form of web browsers, browser
    features, and OS distributions, are a growing area of
    engineering activity at Google. This talk will give an
    overview of this work, looking in detail at Native Client as
    an example project in the space. Native Client is an
    open-source research technology for running x86 native code
    in web applications, with the goal of maintaining the
    browser neutrality, OS portability, and safety that people
    expect from web apps. It supports performance-oriented
    features generally absent from web application programming
    environments, such as thread support, instruction set
    extensions such as SSE, and use of compiler intrinsics and
    hand-coded assembler. We combine these properties in an open
    architecture designed to leverage existing web standards,
    and to encourage community review and third-party
    tools. Overall, Google's desktop efforts seek to enable new
    Web applications, improve end-user experience, and enable a
    more flexible balance between client and server
    computing. Google has open sourced many of our desktop
    efforts, in part to encourage collaboration and independent
    innovation.
  </abstract>
  <bio>
    J. Bradley Chen manages the Native Client project at Google,
    where he has also worked on cluster performance analysis
    projects. Prior to joining Google, he was Director of the
    Performance Tools Lab in Intel's Software Products
    Division. Chen served on the faculty of Harvard University
    from 1994-1998, conducting research in operating systems,
    computer architecture and distributed system, and teaching a
    variety of related graduate and undergraduate courses. He
    has published widely on the subjects of systems performance
    and computer architecture. Dr. Chen has bachelors and
    masters degrees from Stanford University and a PhD from
    Carnegie Mellon University.
  </bio>
      </talk-announcement>
    </news>
    <news date="2010.01.13" id="strout-2010">
      <news-snippet>
  <ref table="person" key="mstrout"/> visits January 28.
      </news-snippet>
      <news-detail>
  <ref table="person" key="mstrout"/> from Colorado State is
  visiting us Thursday, January 28, 2010.  She is giving a talk
  in the CS Colloquium at 3:30pm in ECCR 265.
      </news-detail>
      <talk-announcement>
  <speaker><ref table="person" key="mstrout"/></speaker>
  <affiliation>Colorado State University</affiliation>
  <when>01-28-2010 15:30</when>
  <where>ECCR 265</where>
  <title>Introducing the Sparse Polyhedral Framework</title>
  <abstract>
    <p>Loops often dominate the execution time of
    applications. Various transformation frameworks have been
    developed to enable the automatic compile-time
    transformation of loops. Many of the existing models fit
    within the polyhedral framework and although they are quite
    powerful, they are restricted to compile-time
    transformations and loop bounds and memory accesses that are
    affine or can be approximated as affine.</p>
    <p>In this talk, I will present the Sparse Polyhedral
    Framework (SPF). The SPF builds on the polyhedral
    programming model, but is also capable of expressing and
    supporting the code generation for run-time reordering
    transformations implemented with inspector/executor
    strategies. I will then discuss the idea of abstractions for
    exposing transformation frameworks in performance programmer
    models.</p>
  </abstract>
  <bio>
    Michelle Mills Strout is an assistant professor of computer
    science at Colorado State University. She obtained her PhD
    in Computer Science from the University of California, San
    Diego in June 2003. In 2008, Michelle received a CAREER
    Award from the National Science Foundation for her research
    in parallelization techniques for irregular applications,
    such as molecular dynamics simulations. Her main research
    area is high performance computing and her research
    interests include compilers and run-time systems, scientific
    computing, and software engineering.
  </bio>
      </talk-announcement>
    </news>
    <news date="2010.01.06" id="bodik-2010">
      <news-snippet>
  <ref table="person" key="bodik"/> visits January 11.
      </news-snippet>
      <news-detail>
  <ref table="person" key="bodik"/> from UC Berkeley is visiting
  us Tuesday, January 11, 2010.  He is giving a talk at 3:00pm
  in DLC 1B70.
      </news-detail>
      <talk-announcement>
  <speaker><ref table="person" key="bodik"/></speaker>
  <affiliation>University of California Berkeley</affiliation>
  <when>01-11-2010 15:00</when>
  <where>DLC 1B70</where>
  <title>Algorithmic Program Synthesis with Partial Programs</title>
  <abstract>
    <p>Why hasn't Moore's Law revolutionize programming?  In
    model checking, cycles fuel bug discovery, improving code
    quality, but programmers still write programs with their
    bare hands.  In fact, their work has not changed much since
    the CRT terminal, except that they think in better
    languages.</p>
    <p>Program synthesis might be a way to reduce
    the programmer's cognitive load.  Synthesizers have derived
    programs that were highly efficient, and sometimes even
    surprising.  Of course, they had to be first "programmed"
    with the human insights about the domain at hand.</p>
    <p>Which brings us to a key problem in program synthesis ---
    how to communicate human expertise to the synthesizer.  In
    deductive synthesis, this expertise is captured in a domain
    theory.  Often elusive even to formally trained experts, a
    domain theory is probably not a shortcut to programmer
    productivity.</p> <p>This talk will describe a growing
    family of synthesizers based on partial programs.  Their
    premise is that programs can be decomposed into insight and
    mechanics: if the programmer encodes her insight as a
    partial program, the mechanics can then be synthesized given
    a specification.  Partial programs lend themselves to
    algorithmic synthesis: rather than deducing a program with a
    theorem prover, algorithmic synthesis finds the program in a
    space of candidate implementations described by the partial
    program.</p>
    <p>Among five synthesizers, I will describe an algorithm for
    finding a candidate by constraint solving, rather than via
    generate-and-test, and a system for programming with angelic
    non-determinism which computes the insight into a
    programming problem.</p>
  </abstract>
  <bio>
    Ras Bodik is an Associate Professor of Computer Science at
    UC Berkeley.  He is interested in programming systems, from
    static and dynamic analysis to programmer tools.  He leads a
    project of program synthesis for high-performance programs
    based on the idea of program sketches.  He also leads a
    project on parallel web browsers for mobile devices, which
    develops parallel parsing and page layout algorithms, as
    well as a constraints-based scripting language.
  </bio>
      </talk-announcement>
    </news>
    <news date="2009.06.05" id="birkedal-2009">
      <news-snippet>
  <ref table="person" key="birkedal" /> visits July 3.
      </news-snippet>
    </news>
    <news date="2009.03.04" id="pfenning-2009">
      <news-snippet>
  <ref table="person" key="fp" /> visits March 6.
      </news-snippet>
    </news>
  </news-list>

  <projects>
    <project id="fixr">
        <name>Fixr</name>
        <url>http://plv.colorado.edu/projects/fixr</url>
        <authors>
            <author person="bec"/>
            <author person="kanderson"/>
            <author person="cernyp"/>
            <author person="srirams"/>
            <author person="tyeh"/>
            <author person="elam"/>
            <author person="smover"/>
        </authors>
        <title>Mining and Understanding Bug Fixes for App-Framework Protocol Defects</title>
        <snippet>
          <p>Developing program analysis, probabilistic inference, program synthesis, social data mining, and big-data engineering tools to cooperative repair Android framework protocol misuses.</p>
        </snippet>
        <references>
          <ref table="pub" key="biggroum-saner18" mode="abbrev" />
          <ref table="pub" key="droidstar-icse18" mode="abbrev" />
          <ref table="pub" key="chimpcheck-onward17" mode="abbrev" />
        </references>
    </project>
    <project id="droidel">
      <name>Droidel</name>
      <url>https://github.com/cuplv/droidel</url>
      <authors>
        <author person="blackshear"/>
        <author person="agendreau"/>
        <author person="bec"/>
      </authors>
      <title>A Framework Model for Static Analysis of Android Applications</title>
      <snippet>
        <p>A community-driven modeling of the Android framework for static analysis of Android applications. Droidel seeks to be a general purpose model for static analysis based on minimal explication of dynamism in the Android framework code.</p>
      </snippet>
      <references>
        <ref table="pub" key="droidel-soap15" mode="abbrev" />
      </references>
    </project>
    <project id="quicgraphs">
      <name>QUIC Graphs</name>
      <url>http://pl.cs.colorado.edu/projects/quicgraphs/</url>
      <authors>
  <author person="cox"/>
  <author person="bec"/>
  <author person="srirams"/>
      </authors>
      <title>Relational Invariant Generation for Containers</title>
      <snippet>
  <p>An abstract domain constructor for inferring invariants
  about sets and set properties of containers.</p>
      </snippet>
      <references>
  <ref table="pub" key="quicgraphs-ecoop13" mode="abbrev" />
      </references>
    </project>
    <project id="thresher">
      <name>Thresher</name>
      <url>http://pl.cs.colorado.edu/projects/thresher/</url>
      <icon>pics/thresherIcon.jpg</icon>
      <authors>
  <author person="blackshear"/>
  <author person="bec"/>
  <author person="msridhar"/>
      </authors>
      <title>Precise Refutations for Heap Reachability</title>
      <snippet>
  <p>A static analysis tool for Java programs that specializes
  in checking heap reachability properties and provides
  automated alarm triage assistance.</p>
      </snippet>
      <references>
  <ref table="pub" key="thresher-pldi13" mode="abbrev" />
      </references>
    </project>
    <project id="fissile-types">
      <name>Fissile Type Analysis</name>
      <url>http://pl.cs.colorado.edu/projects/fissile/</url>
      <authors>
    <author person="coughlin"/>
    <author person="bec"/>
      </authors>
      <title>Modular Checking of Almost-Everywhere Invariants</title>
      <snippet>
  <p>A static analysis tool for C and Objective-C that verifies
  invariants that hold almost everywhere, including the safety of
  reflective method calls.</p>
      </snippet>
      <references>
  <ref table="pub" key="fissile-popl14" mode="abbrev" />
      </references>
    </project>
  </projects>

  <publications>
    <pub id="demanded-summarization-toplas24">
      <title>Interactive Abstract Interpretation with Demanded Summarization</title>
      <authors>
        <author person="bstein"/>
        <author person="bec"/>
        <author person="msridhar"/>
      </authors>
      <urls>
        <url name="doi">https://doi.org/10.1145/3648441</url>
        <url name="pdf">papers/demanded-summarization-toplas24.pdf</url>
      </urls>
      <pages>4:1-4:40</pages>
      <date>2024</date>
      <volume>46</volume>
      <number>1</number>
      <doi>10.1145/3648441</doi>
      <ee>https://doi.org/10.1145/3648441</ee>
      <howpub>
        <issue journal="toplas" />
      </howpub>
      <abstract>
        <p>We consider the problem of making expressive, interactive static analyzers compositional. Such a technique could help bring the power of server-based static analyses to integrated development environments (IDEs), updating their results live as the code is modified. Compositionality is key for this scenario, as it enables reuse of already-computed analysis results for unmodified code. Previous techniques for interactive static analysis either lack compositionality, cannot express arbitrary abstract domains, or are not from-scratch consistent.</p>
        <p>We present demanded summarization, the first algorithm for incremental compositional analysis in arbitrary abstract domains which guarantees from-scratch consistency. Our approach analyzes individual procedures using a recent technique for demanded analysis, computing summaries on demand for procedure calls. A dynamically-updated summary dependency graph enables precise result invalidation after program edits, and the algorithm is carefully designed to guarantee from-scratch-consistent results after edits, even in the presence of recursion and in arbitrary abstract domains. We formalize our technique and prove soundness, termination, and from-scratch consistency. An experimental evaluation of a prototype implementation on synthetic and real-world program edits provides evidence for the feasibility of this theoretical framework, showing potential for major performance benefits over non-demanded compositional analyses.</p>
      </abstract>
    </pub>
    <pub id="historia-oopsla23">
      <title>Historia: Refuting Callback Reachability with Message-History Logics</title>
      <authors>
        <author person="smeier"/>
        <author person="smover"/>
        <author person="gkaki"/>
        <author person="bec"/>
      </authors>
      <urls>
        <url name="doi">https://doi.org/10.1145/3622865</url>
      </urls>
      <howpub>
        <proceedings event="oopsla23" />
      </howpub>
      <pages>1905-1934</pages>
      <year>2023</year>
      <abstract>
        <p>This paper considers the callback reachability problem — determining if a callback can be called by an event-driven framework in an unexpected state. Event-driven programming frameworks are pervasive for creating user-interactive applications (apps) on just about every modern platform. Control flow between callbacks is determined by the framework and largely opaque to the programmer. This opacity of the callback control flow not only causes difficulty for the programmer but is also difficult for those developing static analysis. Previous static analysis techniques address this opacity either by assuming an arbitrary framework implementation or attempting to eagerly specify all possible callback control flow, but this is either too coarse to prove properties requiring callback-ordering constraints or too burdensome and tricky to get right. Instead, we present a middle way where the callback control flow can be gradually refined in a targeted manner to prove assertions of interest. The key insight to get this middle way is by reasoning about the history of method invocations at the boundary between app and framework code — enabling a decoupling of the specification of callback control flow from the analysis of app code. We call the sequence of such boundary-method invocations message histories and develop message-history logics to do this reasoning. In particular, we define the notion of an application-only transition system with boundary transitions, a message-history program logic for programs with such transitions, and a temporal specification logic for capturing callback control flow in a targeted and compositional manner. Then to utilize the logics in a goal-directed verifier, we define a way to combine after-the-fact an assertion about message histories with a specification of callback control flow. We implemented a prototype message history-based verifier called Historia and provide evidence that our approach is uniquely capable of distinguishing between buggy and fixed versions on challenging examples drawn from real-world issues and that our targeted specification approach enables proving the absence of multi-callback bug patterns in real-world open-source Android apps.</p>
      </abstract>
    </pub>
    <pub id="indistinguishability-oopsla23">
      <title>Verifying Indistinguishability of Privacy-Preserving Protocols</title>
      <authors>
        <author person="klinvill"/>
        <author person="gkaki"/>
        <author person="ewustrow"/>
      </authors>
      <urls>
        <url name="doi">https://doi.org/10.1145/3622849</url>
      </urls>
      <howpub>
        <issue journal="pacmpl" event="oopsla23" />
        <!-- <proceedings event="oopsla23" /> -->
      </howpub>
      <pages>1442-1469</pages>
      <year>2023</year>
      <abstract>
        <p>Internet users rely on the protocols they use to protect their private
          information including their identity and the websites they visit. Formal
          verification of these protocols can detect subtle bugs that compromise these
          protections at design time, but is a challenging task as it involves
          probabilistic reasoning about random sampling, cryptographic primitives, and
          concurrent execution. Existing approaches either reason about symbolic
          models of the protocols that sacrifice precision for automation, or reason
          about more precise computational models that are harder to automate and
          require cryptographic expertise. In this paper we propose a novel approach
          to verifying privacy-preserving protocols that is more precise than symbolic
          models yet more accessible than computational models. Our approach permits
          <i>direct-style</i> proofs of privacy, as opposed to indirect game-based
          proofs in computational models, by formalizing privacy as
          <i>indistinguishability</i> of possible network traces induced by a
          protocol. We ease automation by leveraging insights from the distributed
          systems verification community to create sound synchronous models of
          concurrent protocols. Our verification framework is implemented in F* as a
          library we call Waldo. We describe two large case studies of using Waldo
          to verify indistinguishability; one on the <i>Encrypted Client Hello</i>
          (ECH) extension of the TLS protocol and another on a <i>Private
          Information Retrieval</i> (PIR) protocol. We uncover subtle flaws in the TLS
          ECH specification that were missed by other models.</p>
      </abstract>
    </pub>
    <pub id="ondemandcg-sas23">
      <title>Lifting On-Demand Analysis to Higher-Order Languages</title>
      <authors>
        <author person="schoeped"/>
        <author person="dseekatz" student="y"/>
        <author person="ilinas"/>
        <author person="sastucki"/>
        <author person="dtattersall"/>
        <author person="pln"/>
        <author person="frai"/>
        <author person="bec"/>
      </authors>
      <urls>
        <url name="doi">https://doi.org/10.1007/978-3-031-44245-2_21</url>
      </urls>
      <howpub>
        <proceedings event="sas23" />
      </howpub>
      <pages>460-484</pages>
      <year>2023</year>
      <abstract>
        <p>In this paper, we present an approach to lift on-demand analysis to higher-order languages. Specifically, our approach bootstraps an on-demand call graph construction by leveraging a pair of on-demand data flow analyses. Static analysis is increasingly applied to find subtle bugs or prove deep properties in large, industrial code bases. To effectively do this at scale, analyzers need to both resolve function calls in a precise manner (i.e., construct a precise call graph) and examine only the relevant portion of the program (i.e., be on-demand). A strawman strategy to this problem is to use fast, approximate, whole-program call graph construction algorithms. However, this strategy is generally not adequate for modern languages like JavaScript that rely heavily on higher-order features, such as callbacks and closures, where scalable approximations often introduce unacceptable imprecision. This strategy also limits increasingly sophisticated on-demand analyses, which scale by analyzing only parts of a program as needed: the scalability advantages of an on-demand analysis may be thwarted by the need to construct a whole-program call graph. The key insight of this paper is that existing on-demand data flow analyses can themselves be applied in a black-box manner to construct call graphs on demand. We propose a soundness condition for the existing on-demand analyses with respect to partial call graphs, formalize our algorithm as an abstract domain combinator, and prove it sound in Isabelle/HOL. Furthermore, we evaluate a prototype implementation of the resulting on-demand call graph construction algorithm for a subset of JavaScript (using the Synchronized Push-Down Systems framework as the underlying data flow analysis) on benchmarks making heavy use of higher-order functions.</p>
      </abstract>
    </pub>
    <pub id="runtimeassisted-pldi22">
      <title>RunTime-assisted convergence in replicated data types</title>
      <authors>
        <author person="gkaki"/>
        <author person="pprahladan"/>
        <author person="nlewchenko"/>
      </authors>
      <urls>
        <url name="pdf">papers/runtimeassisted-pldi22.pdf</url>
      </urls>
      <howpub>
        <proceedings event="pldi22" />
      </howpub>
      <pages>364-378</pages>
      <year>2022</year>
      <abstract>
        <p>We propose a runtime-assisted approach to enforce convergence in distributed executions of replicated data types. The key distinguishing aspect of our approach is that it guarantees convergence unconditionally – without requiring data type operations to satisfy algebraic laws such as commutativity and idempotence. Consequently, programmers are no longer obligated to prove convergence on a per-type basis. Moreover, our approach lets sequential data types be reused in a distributed setting by extending their implementations rather than refactoring them. The novel component of our approach is a distributed runtime that orchestrates well-formed executions that are guaranteed to converge. Despite the utilization of a runtime, our approach comes at no additional cost of latency and availability. Instead, we introduce a novel tradeoff against a metric called staleness, which roughly corresponds to the time taken for replicas to converge. We implement our approach in a system called Quark and conduct a thorough evaluation of its tradeoffs.</p>
      </abstract>
    </pub>
    <pub id="antipotentials-pldi22">
      <title>Differential Cost Analysis with Simultaneous Potentials and Anti-potentials</title>
      <authors>
        <author person="dzikelic" student="y"/>
        <author person="bec"/>
        <author person="pln"/>
        <author person="frai"/>
      </authors>
      <urls>
        <url name="pdf">papers/antipotentials-pldi22.pdf</url>
      </urls>
      <howpub>
        <proceedings event="pldi22" />
      </howpub>
      <pages>442-457</pages>
      <year>2022</year>
      <abstract>
        <p>We present a novel approach to differential cost analysis that, given a program revision, attempts to statically bound the difference in resource usage, or cost, between the two program versions. Differential cost analysis is particularly interesting because of the many compelling applications for it, such as detecting resource-use regressions at code-review time or proving the absence of certain side-channel vulnerabilities. One prior approach to differential cost analysis is to apply relational reasoning that conceptually constructs a product program on which one can over-approximate the difference in costs between the two program versions. However, a significant challenge in any relational approach is effectively aligning the program versions to get precise results. In this paper, our key insight is that we can avoid the need for and the limitations of program alignment if, instead, we bound the difference of two cost-bound summaries rather than directly bounding the concrete cost difference. In particular, our method computes a threshold value for the maximal difference in cost between two program versions simultaneously using two kinds of cost-bound summaries—a potential function that evaluates to an upper bound for the cost incurred in the first program and an anti-potential function that evaluates to a lower bound for the cost incurred in the second. Our method has a number of desirable properties: it can be fully automated, it allows optimizing the threshold value on relative cost, it is suitable for programs that are not syntactically similar, and it supports non-determinism. We have evaluated an implementation of our approach on a number of program pairs collected from the literature, and we find that our method computes tight threshold values on relative cost in most examples.</p>
      </abstract>
    </pub>
    <pub id="brbo-sas21">
      <title>Selectively-Amortized Resource Bounding</title>
      <authors>
        <author person="tlu" student="y"/>
        <author person="bec"/>
        <author person="atrivedi"/>
      </authors>
      <urls>
        <url name="pdf">papers/brbo-sas21.pdf</url>
      </urls>
      <howpub>
        <proceedings event="sas21" />
      </howpub>
      <pages>286-307</pages>
      <year>2021</year>
      <abstract>
        <p>We consider the problem of automatically proving resource bounds. That is, we study how to prove that an integer-valued resource variable is bounded by a given program expression. Automatic resource-bound analysis has recently received significant attention because of a number of important applications (e.g., detecting performance bugs, preventing algorithmic-complexity attacks, identifying side-channel vulnerabilities), where the focus has often been on developing precise amortized reasoning techniques to infer the most exact resource usage. While such innovations remain critical, we observe that fully precise amortization is not always necessary to prove a bound of interest. And in fact, by amortizing <em>selectively</em>, the needed supporting invariants can be simpler, making the invariant inference task more feasible and predictable. We present a framework for selectively-amortized analysis that mixes worst-case and amortized reasoning via a property decomposition and a program transformation. We show that proving bounds in any such decomposition yields a sound resource bound in the original program, and we give an algorithm for selecting a reasonable decomposition.</p>
      </abstract>
    </pub>
    <pub id="bmdp-cav21">
      <title>Model-Free Reinforcement Learning for Branching Markov Decision Processes.</title>
      <authors>
        <author person="ehahn"/>
        <author person="mperez"/>
        <author person="sschewe"/>
        <author person="fabio"/>
        <author person="atrivedi"/>
        <author person="dwojtczak"/>
      </authors>
      <urls>
        <url name="pdf">papers/bmdp-cav21.pdf</url>
      </urls>
      <howpub>
        <proceedings event="cav21" />
      </howpub>
      <pages>651-673</pages>
      <year>2021</year>
      <abstract>
        <p>We consider the problem of automatically proving resource bounds. That is, we study how to prove that an integer-valued resource variable is bounded by a given program expression. Automatic resource-bound analysis has recently received significant attention because of a number of important applications (e.g., detecting performance bugs, preventing algorithmic-complexity attacks, identifying side-channel vulnerabilities), where the focus has often been on developing precise amortized reasoning techniques to infer the most exact resource usage. While such innovations remain critical, we observe that fully precise amortization is not always necessary to prove a bound of interest. And in fact, by amortizing <em>selectively</em>, the needed supporting invariants can be simpler, making the invariant inference task more feasible and predictable. We present a framework for selectively-amortized analysis that mixes worst-case and amortized reasoning via a property decomposition and a program transformation. We show that proving bounds in any such decomposition yields a sound resource bound in the original program, and we give an algorithm for selecting a reasonable decomposition.</p>
      </abstract>
    </pub>
    <pub id="dai-pldi21">
      <title>Demanded Abstract Interpretation</title>
      <authors>
        <author person="bstein" student="y"/>
        <author person="bec"/>
        <author person="msridhar"/>
      </authors>
      <urls>
        <url name="pdf">papers/dai-pldi21.pdf</url>
      </urls>
      <howpub>
        <proceedings event="pldi21" />
      </howpub>
      <pages>282-295</pages>
      <year>2021</year>
      <abstract>
        <p>We consider the problem of making expressive static analyzers interactive. Formal static analysis is seeing increasingly widespread adoption as a tool for verification and bug-finding, but even with powerful cloud infrastructure it can take minutes or hours to get batch analysis results after a code change. While existing techniques offer some demand-driven or incremental aspects for certain classes of analysis, the fundamental challenge we tackle is doing both for arbitrary abstract interpreters. </p>
        <p>Our technique, demanded abstract interpretation, lifts program syntax and analysis state to a dynamically evolving graph structure, in which program edits, client-issued queries, and evaluation of abstract semantics are all treated uniformly. The key difficulty addressed by our approach is the application of general incremental computation techniques to the complex, cyclic dependency structure induced by abstract interpretation of loops with widening operators. We prove that desirable abstract interpretation meta-properties, including soundness and termination, are preserved in our approach, and that demanded analysis results are equal to those computed by a batch abstract interpretation. Experimental results suggest promise for a prototype demanded abstract interpretation framework: by combining incremental and demand-driven techniques, our framework consistently delivers analysis results at interactive speeds, answering 95% of queries within 1.2 seconds.</p>
      </abstract>
    </pub>
    <pub id="shapeanalysis-fnt20">
      <title>Shape Analysis</title>
      <authors>
        <author person="bec"/>
        <author person="cdragoi"/>
        <author person="rmanevich"/>
        <author person="nrinetzky"/>
        <author person="rival"/>
      </authors>
      <urls>
	      <url name="pdf">papers/shapeanalysis-fnt20.pdf</url>
      </urls>
      <pages>1-158</pages>
      <date>2020-10</date>
      <volume>6</volume>
      <number>1-2</number>
      <doi>10.1561/2500000037</doi>
      <ee>http://dx.doi.org/10.1561/2500000037</ee>
      <howpub>
        <issue journal="fntpl" />
      </howpub>
      <abstract>
        <p>The computation of semantic information about the behavior of pointer-manipulating programs has been a long standing issue, attacked with diverse and numerous techniques and tools for over 50 years. As usual in automatic verification of infinite-state programs, properties of interest are not computable. Thus, static analyses can only be conservative, leading different analyses to make different tradeoffs between the intricacies of the properties they detect, the precision of their inference procedure and analysis, and the scalability of the analysis.</p>
        <p>In this context, shape analyses focus on inferring highly complex properties of heap-manipulating programs. These programs utilize data structures which are implemented using an unbounded number of dynamically- (heap-) allocated memory cells interconnected via mutable pointer-links. Because shape analyses have to reason about data structures whose size is not bounded by a fixed, known value, they cannot track explicitly the particular properties of every concrete memory cell which the program uses, as done, e.g., by analysis of variable-manipulating non-recursive programs. Instead, shape analyses summarize memory regions by letting one piece of abstract information, called summary predicate, describe several concrete cells. The need to cope with data structures of unbounded sizes is a challenge shape analyses share with static analyzers of array-manipulating programs. However, while the size of an array may change in different executions, its layout (i.e., its dimensions and the way its contents are spread over the memory) is fixed. In contrast, the layout of a pointer-linked data structure, colloquially referred to as its shape, may evolve dynamically during the program execution and a memory cell can be part of different data structures at different points in time. As a result, shape analyses need to let the denotation of summary predicates in terms of the constituents and layouts of the memory regions which they represent evolve during the analysis as well.</p>
        <p>In this survey, we consider that shape analyses are characterized and defined by the presence of summary predicates describing a set of concrete memory cells that varies during the course of the analysis. We use this characterization as a means for distinguishing shape analyses as a particular class of pointer analyses. We show that many “standard” pointer analyses do not fit the aforementioned description, while many analyses relying on very different mathematical foundations, e.g., shape graphs, three-valued logic, and separation logic, do.</p>
        <p>The ambition of this survey is to provide a comprehensive introduction to the field of shape analysis, and to present the foundation of this topic, in a single document that is accessible to readers who are not familiar with it. To do so, we characterize the essence of shape analysis compared to more classical pointer analyses. We supply the intuition underlying the abstractions commonly used in shape analysis and the algorithms that allow to statically compute intricate semantic properties. Then, we cover the main families of shape analysis abstraction and algorithms, highlight the similarities between them, and also characterize the main differences between the most common approaches. Last, we review a few other static analysis works (such as array abstractions, dictionary abstractions and interprocedural analyses) that were influenced by the ideas of shape analysis, so as to demonstrate the impact of the field.</p>
      </abstract>
    </pub>
    <pub id="reachability-cav20">
      <title>Reachability Analysis using Message Passing over Tree Decompositions</title>
      <authors>
        <author person="srirams"/>
      </authors>
      <urls>
      </urls>
      <howpub>
        <proceedings event="cav20" />
      </howpub>
      <year>2020</year>
      <abstract>
        <p>In this paper, we study efficient approaches to reachability analysis for discrete-time nonlinear dynamical systems when the dependencies among the variables of the system have low treewidth. Reachability analysis over nonlinear dynamical systems asks if a given set of target states can be reached starting from an initial set of states. This is solved by computing conservative over approximations of the reachable set using abstract domains to represent these approximations. However, most approaches must tradeoff the level of conservatism against the cost of performing analysis, especially when the number of system variables increases. This makes reachability analysis challenging for nonlinear systems with a large number of state variables. Our approach works by constructing a dependency graph among the variables of the system. The tree decomposition of this graph builds a tree wherein each node of the tree is labeled with subsets of the state-variables of the system. Furthermore, the tree decomposition satisfies important structural properties. Using the tree decomposition, our approach abstracts a set of states of the high dimensional system into a tree of sets of lower dimensional projections of this state. We derive various interesting properties of this abstract domain, including conditions under which the original high dimensional set can be fully recovered from its low dimensional projections. Next, we use ideas from message passing developed originally for belief propagation over Bayesian networks to perform reachability analysis over the full statespace in an efficient manner. We illustrate our approach on some interesting nonlinear systems with low treewidth to demonstrate the advantages of our approach.</p>
      </abstract>
    </pub>
    <pub id="unboundedtime-cav20">
      <title>Unbounded-Time Safety Verification of Stochastic Differential Dynamics</title>
      <authors>
        <author person="sfeng"/>
        <author person="mchen"/>
        <author person="bxue"/>
        <author person="srirams"/>
        <author person="nzhan"/>
      </authors>
      <urls>
      </urls>
      <howpub>
        <proceedings event="cav20" />
      </howpub>
      <year>2020</year>
      <abstract>
        <p>In this paper, we propose a method for bounding the probability that a stochastic differential equation (SDE) system violates a safety specification over the infinite time horizon. SDEs are mathematical models of stochastic processes that capture how states evolve continuously in time. They are widely used in numerous applications such as engineered systems (e.g., modeling how pedestrians move in an intersection), computational finance (e.g., modeling stock option prices), and ecological processes (e.g., population change over time). Previously the safety verification problem has been tackled over finite and infinite time horizons using a diverse set of approaches. The approach in this paper attempts to connect the two views by first identifying a finite time bound, beyond which the probability of a safety violation can be bounded by a negligibly small number. This is achieved by discovering an exponential barrier certificate that proves exponentially converging bounds on the probability of safety violations over time. Once the finite time interval is found, a finite-time verification approach is used to bound the probability of violation over this interval. We demonstrate our approach over a collection of interesting examples from the literature, wherein our approach can be used to find tight bounds on the violation probability of safety properties over the infinite time horizon.</p>
      </abstract>
    </pub>
    <pub id="pirk-cav20">
      <title>PIRK: Scalable Interval Reachability Analysis for High-Dimensional Nonlinear Systems</title>
      <authors>
        <author person="adevonport"/>
        <author person="mkhaled"/>
        <author person="marcak"/>
        <author person="mzamani"/>
      </authors>
      <urls>
      </urls>
      <howpub>
        <proceedings event="cav20" />
      </howpub>
      <year>2020</year>
      <abstract>
        <p>Reachability analysis is a critical tool for the formal verification of dynamical systems and the synthesis of controllers for them. Due to their computational complexity, many reachability analysis methods are restricted to systems with relatively small dimensions. One significant reason for such limitation is that those approaches, and their implementations, are not designed to leverage parallelism. They use algorithms that are designed to run serially within one compute unit and they can not utilize widely-available high-performance computing (HPC) platforms such as many-core CPUs, GPUs and Cloud-computing services. This paper presents PIRK, a tool to efficiently compute reachable sets for general nonlinear systems of extremely high dimensions. PIRK can utilize HPC platforms for computing reachable sets for general high-dimensional non-linear systems. PIRK has been tested on several systems, with state dimensions up to 4 billion. The scalability of PIRK’s parallel implementations is found to be highly favorable.</p>
      </abstract>
    </pub>
    <pub id="amytiss-cav20">
      <title>AMYTISS: Parallelized Automated Controller Synthesis for Large-Scale Stochastic Systems</title>
      <authors>
        <author person="alavaei"/>
        <author person="mkhaled"/>
        <author person="ssoudjani"/>
        <author person="mzamani"/>
      </authors>
      <urls>
      </urls>
      <howpub>
        <proceedings event="cav20" />
      </howpub>
      <year>2020</year>
      <abstract>
        <p>Large-scale stochastic systems have recently received significant attentions due to their broad applications in various safety-critical systems such as traffic networks and self-driving cars. In this paper, we propose a software tool, called AMYTISS, implemented in C++/OpenCL, for designing correct-by-construction controllers for large-scale discrete-time stochastic systems. This tool is employed to (i) build finite Markov decision processes (MDPs) as finite abstractions of given original systems, and (ii) synthesize controllers for the constructed finite MDPs satisfying bounded-time safety and reach-avoid specifications. In AMYTISS, scalable parallel algorithms are designed such that they support parallel execution within CPUs, GPUs and hardware accelerators (HWAs). Unlike all existing tools for stochastic systems, AMYTISS can utilize high-performance computing (HPC) platforms and cloud-computing services to mitigate the effects of the state-explosion problem, which is always present in analyzing large-scale stochastic systems. We benchmark AMYTISS against the most recent tools in the literature using several physical case studies including robot examples, room temperature and road traffic networks. We also apply our algorithms to a 3-dimensional autonomous vehicle and 7-dimensional nonlinear model of a BMW 320i car by synthesizing an autonomous parking controller.</p>
      </abstract>
    </pub>
    <pub id="tajsvr-oopsla19">
      <title>Static Analysis with Demand-Driven Value Refinement</title>
      <authors>
        <author person="bstein" student="y"/>
        <author person="bnielsen" student="y"/>
        <author person="bec"/>
        <author person="amoeller"/>
      </authors>
      <urls>
        <url name="pdf">papers/value-refinement-oopsla19.pdf</url>
        <url name="artifact">https://www.brics.dk/TAJS/VR/</url>
      </urls>
      <howpub>
        <issue journal="pacmpl" event="oopsla19" />
        <!--<proceedings event="oopsla19" />-->
      </howpub>
      <pages>140:1-140:29</pages>
      <year>2019</year>
      <abstract>
        <p>Static analysis tools for JavaScript must strike a delicate balance, achieving the level of precision required by the most complex features of target programs without incurring prohibitively high analysis time. For example, reasoning about dynamic property accesses sometimes requires precise relational information connecting the object, the dynamically-computed property name, and the property value. Even a minor precision loss at such critical program locations can result in a proliferation of spurious dataflow that renders the analysis results useless.</p>
        <p>We present a technique by which a conventional non-relational static dataflow analysis can be combined soundly with a value refinement mechanism to increase precision on demand at critical locations. Crucially, our technique is able to incorporate relational information from the value refinement mechanism into the non-relational domain of the dataflow analysis.</p>
        <p>We demonstrate the feasibility of this approach by extending an existing JavaScript static analysis with a demand-driven value refinement mechanism that relies on backwards abstract interpretation. Our evaluation finds that precise analysis of widely used JavaScript utility libraries depends heavily on the precision at a small number of critical locations that can be identified heuristically, and that backwards abstract interpretation is an effective mechanism to provide that precision on demand.</p>
      </abstract>
    </pub>
    <pub id="nn-rv19">
      <title>Efficient Detection and Quantification of Timing Leaks with Neural Networks</title>
      <authors>
        <author person="sniari" student="y"/>
        <author person="cernyp"/>
        <author person="srirams"/>
        <author person="atrivedi"/>
      </authors>
      <urls>
      </urls>
      <howpub>
        <proceedings event="rv19" />
      </howpub>
      <pages></pages>
      <year>2019</year>
      <abstract></abstract>
    </pub>
    <pub id="uav-rv19">
      <title>Predictive Runtime Monitoring for Linear Stochastic Systems and Applications to Geofence Enforcement for UAVs</title>
      <authors>
        <author person="hyoon" student="y"/>
        <author person="ychou" student="y"/>
        <author person="xinchen"/>
        <author person="efrew"/>
        <author person="srirams"/>
      </authors>
      <urls>
      </urls>
      <howpub>
        <proceedings event="rv19" />
      </howpub>
      <pages></pages>
      <year>2019</year>
      <abstract></abstract>
    </pub>
    <pub id="robustness-rv19">
      <title>Robustness of Specifications and its Applications to Falsification, Parameter Mining, and Runtime Monitoring with S-TaLiRo</title>
      <authors>
        <author person="gfainekos"/>
        <author person="bhoxha"/>
        <author person="srirams"/>
      </authors>
      <urls>
      </urls>
      <howpub>
        <proceedings event="rv19" />
      </howpub>
      <pages></pages>
      <year>2019</year>
      <abstract></abstract>
    </pub>
    <pub id="repstore-icfp19">
      <title>Sequential Programming for Replicated Data Stores</title>
      <authors>
        <author person="nlewchenko" student="y"/>
        <author person="aradhakrishna"/>
        <author person="agaonkar" student="y"/>
        <author person="cernyp"/>
      </authors>
      <urls>
      </urls>
      <howpub>
        <proceedings event="icfp19" />
      </howpub>
      <pages></pages>
      <year>2019</year>
      <abstract></abstract>
    </pub>
    <pub id="sidechannels-cav19">
      <title>Quantitative Mitigation of Timing Side Channels</title>
      <authors>
        <author person="sniari" student="y"/>
        <author person="cernyp"/>
        <author person="atrivedi"/>
      </authors>
      <urls>
      </urls>
      <howpub>
        <proceedings event="cav19" />
      </howpub>
      <pages></pages>
      <year>2019</year>
      <abstract></abstract>
    </pub>
    <pub id="verivita-ecoop19">
      <title>Lifestate: Event-Driven Protocols and Callback Control Flow</title>
      <authors>
        <author person="smeier" student="y"/>
        <author person="smover"/>
        <author person="bec"/>
      </authors>
      <urls>
        <url name="pdf">papers/verivita-ecoop19.pdf</url>
      </urls>
      <howpub>
        <proceedings event="ecoop19" />
      </howpub>
      <pages>1:1-1:29</pages>
      <year>2019</year>
      <abstract>
        Developing interactive applications (apps) against event-driven software frameworks such as Android is notoriously difficult. To create apps that behave as expected, developers must follow complex and often implicit asynchronous programming protocols. Such protocols intertwine the proper registering of callbacks to receive control from the framework with appropriate application-programming interface (API) calls that in turn affect the set of possible future callbacks. An app violates the protocol when, for example, it calls a particular API method in a state of the framework where such a call is invalid. What makes automated reasoning hard in this domain is largely what makes programming apps against such frameworks hard: the specification of the protocol is unclear, and the control flow is complex, asynchronous, and higher-order. In this paper, we tackle the problem of specifying and modeling event-driven application-programming protocols. In particular, we formalize a core meta-model that captures the dialogue between event-driven frameworks and application callbacks. Based on this meta-model, we define a language called lifestate that permits precise and formal descriptions of application-programming protocols and the callback control flow imposed by the event-driven framework. Lifestate unifies modeling what app callbacks can expect of the framework with specifying rules the app must respect when calling into the framework. In this way, we effectively combine lifecycle constraints and typestate rules. To evaluate the effectiveness of lifestate modeling, we provide a dynamic verification algorithm that takes as input a trace of execution of an app and a lifestate protocol specification to either produce a trace witnessing a protocol violation or a proof that no such trace is realizable.
      </abstract>
    </pub>
    <pub id="bounding-vmcai19">
      <title>Type-directed Bounding of Collections in Reactive Programs</title>
      <authors>
        <author person="tlu" student="y"/>
        <author person="cernyp"/>
        <author person="bec"/>
        <author person="atrivedi"/>
      </authors>
      <urls>
        <url name="pdf">papers/bounding-vmcai19.pdf</url>
      </urls>
      <howpub>
        <proceedings event="vmcai19" />
      </howpub>
      <pages>275-296</pages>
      <year>2019</year>
      <abstract>
        Our aim is to statically verify that in a given reactive program, the length of collection variables does not grow beyond a given bound. We propose a scalable type-based technique that checks that each collection variable has a given refinement type that specifies constraints about its length. A novel feature of our refinement types is that the refinements can refer to AST counters that track how many times an AST node has been executed. This feature enables type refinements to track limited flow-sensitive information. We generate verification conditions that ensure that the AST counters are used consistently, and that the types imply the given bound. The verification conditions are discharged by an off-the-shelf SMT solver. Experimental results demonstrate that our technique is scalable, and effective at verifying reactive programs with respect to requirements on length of collections.
      </abstract>
    </pub>
    <pub id="streams-ase18">
      <title>Safe Stream-Based Programming with Refinement Types</title>
      <authors>
        <author person="bstein" student="y"/>
        <author person="lclapp"/>
        <author person="msridhar"/>
        <author person="bec"/>
      </authors>
      <urls>
        <url name="pdf">papers/streams-ase18.pdf</url>
      </urls>
      <howpub>
        <proceedings event="ase18" />
      </howpub>
      <pages>565-576</pages>
      <year>2018</year>
      <abstract>
      </abstract>
    </pub>
    <pub id="robustmpc-cmsb18">
      <title>Robust Data-Driven Control of Artificial Pancreas Systems using Neural Networks</title>
      <authors>
        <author person="sdutta" student="y"/>
        <author person="tkushner" student="y"/>
        <author person="srirams"/>
      </authors>
      <urls>
        <url name="pdf">papers/robustmpc-cmsb18.pdf</url>
      </urls>
      <howpub>
        <proceedings event="cmsb18" />
      </howpub>
      <abstract>
      </abstract>
    </pub>
    <pub id="almostsure-hscc18">
      <title>Almost-Sure Reachability in Stochastic Multi-Mode System</title>
      <authors>
        <author person="fabio"/>
        <author person="btouri"/>
        <author person="atrivedi"/>
      </authors>
      <urls>
      </urls>
      <howpub>
        <proceedings event="hscc18" />
      </howpub>
      <abstract>
      </abstract>
    </pub>
    <pub id="data-driven-models-iccps18">
      <title>A Data-Driven Approach to Artificial Pancreas Verification and Synthesis</title>
      <authors>
        <author person="tkushner" student="y"/>
        <author person="dbortz"/>
        <author person="dmaahs"/>
        <author person="srirams"/>
      </authors>
      <urls>
        <url name="pdf">papers/data-driven-models-iccps18.pdf</url>
      </urls>
      <howpub>
        <proceedings event="iccps18" />
      </howpub>
      <abstract>
      </abstract>
    </pub>
    <pub id="biggroum-saner18">
      <title>Mining Framework Usage Graphs from App Corpora</title>
      <authors>
        <author person="smover"/>
        <author person="srirams"/>
        <author person="rolsen" student="y"/>
        <author person="bec"/>
      </authors>
      <urls>
        <url name="pdf">papers/biggroum-saner18.pdf</url>
      </urls>
      <howpub>
        <proceedings event="saner18" />
      </howpub>
      <pages>277-289</pages>
      <year>2018</year>
      <abstract>
        <p>We investigate the problem of mining graph-based usage patterns for large, object-oriented frameworks like Android-revisiting previous approaches based on graph-based object usage models (groums). Groums are a promising approach to represent usage patterns for object-oriented libraries because they simultaneously describe control flow and data dependencies between methods of multiple interacting object types. However, this expressivity comes at a cost: mining groums requires solving a subgraph isomorphism problem that is well known to be expensive. This cost limits the applicability of groum mining to large API frameworks. In this paper, we employ groum mining to learn usage patterns for object-oriented frameworks from program corpora. The central challenge is to scale groum mining so that it is sensitive to usages horizontally across programs from arbitrarily many developers (as opposed to simply usages vertically within the program of a single developer). To address this challenge, we develop a novel groum mining algorithm that scales on a large corpus of programs. We first use frequent itemset mining to restrict the search for groums to smaller subsets of methods in the given corpus. Then, we pose the subgraph isomorphism as a SAT problem and apply efficient pre-processing algorithms to rule out fruitless comparisons ahead of time. Finally, we identify containment relationships between clusters of groums to characterize popular usage patterns in the corpus (as well as classify less popular patterns as possible anomalies). We find that our approach scales on a corpus of over five hundred open source Android applications, effectively mining obligatory and best-practice usage patterns.</p>
      </abstract>
      <bibnote>
        <b>IEEE TCSE Distinguished Paper Award</b>.
      </bibnote>
    </pub>
    <pub id="droidstar-icse18">
      <title>DroidStar: Callback Typestates for Android Classes</title>
      <authors>
        <author person="aradhakrishna"/>
        <author person="nlewchenko" student="y"/>
        <author person="smeier" student="y"/>
        <author person="smover"/>
        <author person="bec"/>
        <author person="cernyp"/>
      </authors>
      <urls>
        <url name="pdf">papers/droidstar-icse18.pdf</url>
      </urls>
      <howpub>
        <proceedings event="icse18" />
      </howpub>
      <pages>1160-1170</pages>
      <year>2018</year>
      <abstract>
        <p>Event-driven programming frameworks, such as Android, are based on components with asynchronous interfaces. The protocols for interacting with these components can often be described by finite-state machines we dub callback typestates. Callback typestates are akin to classical typestates, with the difference that their outputs (callbacks) are produced asynchronously. While useful, these specifications are not commonly available, because writing them is difficult and error-prone.</p>
        <p>Our goal is to make the task of producing callback typestates significantly easier. We present a callback typestate assistant tool, DroidStar, that requires only limited user interaction to produce a callback typestate. Our approach is based on an active learning algorithm, L*. We improved the scalability of equivalence queries (a key component of L*), thus making active learning tractable on the Android system.</p>
        <p>We use DroidStar to learn callback typestates for Android classes both for cases where one is already provided by the documentation, and for cases where the documentation is unclear. The results show that DROIDSTAR learns callback typestates accurately and efficiently. Moreover, in several cases, the synthesized callback typestates uncovered surprising and undocumented behaviors.</p>
      </abstract>
    </pub>
    <pub id="dpdebugger-aaai18">
      <title>Differential Performance Debugging with Discriminant Regression Trees</title>
      <authors>
        <author person="sniari" student="y"/>
        <author person="cernyp"/>
        <author person="bec"/>
        <author person="atrivedi"/>
      </authors>
      <urls>
        <url name="pdf">papers/dpdebugger-aaai18.pdf</url>
        <url name="arXiv">https://arxiv.org/abs/1711.04076</url>
      </urls>
      <howpub>
        <proceedings event="aaai18" />
      </howpub>
      <pages>2468-2475</pages>
      <year>2018</year>
      <abstract>
        <p>Differential performance debugging is a technique to find performance
        problems. It applies in situations where the performance of a program is
        (unexpectedly) different for different classes of inputs. The task is to
        explain the differences in asymptotic performance among various input
        classes in terms of program internals. We propose a data-driven
        technique based on <em>discriminant regression tree</em> (DRT) learning
        problem where the goal is to discriminate among different classes of
        inputs. We propose a new algorithm for DRT learning that first clusters
        the data into functional clusters, capturing different asymptotic
        performance classes, and then invokes off-the-shelf decision tree
        learning algorithms to explain these clusters. We focus on linear
        functional clusters and adapt classical clustering algorithms
        (<em>K</em>-means and spectral) to produce them. For the
        <em>K</em>-means algorithm, we generalize the notion of the cluster
        centroid from a point to a linear function. We adapt spectral clustering
        by defining a novel kernel function to capture the notion of "linear"
        similarity between two data points. We evaluate our approach on
        benchmarks consisting of Java programs where we are interested in
        debugging performance. We show that our algorithm significantly
        outperforms other well-known regression tree learning algorithms in
        terms of running time and accuracy of classification.</p>
      </abstract>
    </pub>
    <pub id="chimpcheck-onward17">
      <title>ChimpCheck: Property-Based Randomized Test Generation for Interactive Apps</title>
      <authors>
        <author person="elam"/>
        <author person="pzhang" student="y"/>
        <author person="bec"/>
      </authors>
      <urls>
        <url name="pdf">papers/chimpcheck-onward17.pdf</url>
        <url name="arXiv">https://arxiv.org/abs/1708.08613</url>
      </urls>
      <howpub>
        <proceedings event="onward17" />
      </howpub>
      <pages>58-77</pages>
      <year>2017</year>
      <abstract>
        <p>We consider the problem of generating <emph>relevant</emph> execution
        traces to test rich interactive applications. Rich interactive applications,
        such as apps on mobile platforms, are complex stateful and often distributed
        systems where sufficiently exercising the app with user-interaction (UI)
        event sequences to expose defects is both hard and time-consuming. In
        particular, there is a fundamental tension between brute-force random UI
        exercising tools, which are fully-automated but offer low relevance, and UI
        test scripts, which are manual but offer high relevance. In this paper, we
        consider a middle way---enabling a seamless fusion of scripted and randomized
        UI testing. This fusion is prototyped in a testing tool called ChimpCheck for
        programming, generating, and executing property-based randomized test cases
        for Android apps. Our approach realizes this fusion by offering a high-level,
        embedded domain-specific language for defining custom generators of simulated
        user-interaction event sequences. What follows is a combinator library built
        on industrial strength frameworks for property-based testing (ScalaCheck) and
        Android testing (Android JUnit and Espresso) to implement property-based
        randomized testing for Android development. Driven by real, reported issues
        in open source Android apps, we show, through case studies, how ChimpCheck
        enables expressing effective testing patterns in a compact manner.</p>
      </abstract>
    </pub>
    <pub id="compositional-emsoft17">
      <title>Compositional Relational Abstraction for Nonlinear Hybrid Systems</title>
      <authors>
        <author person="xinchen"/>
        <author person="smover"/>
        <author person="srirams"/>
      </authors>
      <urls>
        <url name="pdf">papers/compositional-emsoft17.pdf</url>
      </urls>
      <howpub>
        <proceedings event="emsoft17" />
      </howpub>
      <abstract>
      </abstract>
    </pub>
    <pub id="clf-learning-rss17">
      <title>Learning Lyapunov (Potential) Functions from Counterexamples and Demonstrations</title>
      <authors>
        <author person="hravanbakhsh"/>
        <author person="srirams"/>
      </authors>
      <urls>
        <url name="pdf">papers/clf-learning-rss17.pdf</url>
      </urls>
      <howpub>
        <proceedings event="rss17" />
      </howpub>
      <abstract>
        <p>We present a technique for learning control Lyapunov (potential) functions, which are used in turn to synthesize controllers for nonlinear dynamical systems. The learning framework uses a <em>demonstrator</em> that implements a black-box, untrusted strategy presumed to solve the problem of interest, a <em>learner</em> that poses finitely many queries to the demonstrator to infer a candidate function and a <em>verifier</em> that checks whether the current candidate is a valid control Lyapunov function. The overall learning framework is iterative, eliminating a set of candidates on each iteration using the counterexamples discovered by the verifier and the demonstrations over these counterexamples. We prove its convergence using ellipsoidal approximation techniques from convex optimization. We also implement this scheme using nonlinear MPC controllers to serve as demonstrators for a set of state and trajectory stabilization problems for nonlinear dynamical systems. Our approach is able to synthesize relatively simple polynomial control Lyapunov functions, and in that process replace the MPC using a guaranteed and computationally less expensive controller.</p>
      </abstract>
    </pub>  
    <pub id="discriminator-tacas17">
      <title>Discriminating Traces with Time</title>
      <authors>
        <author person="sniari" student="y"/>
        <author person="cernyp"/>
        <author person="bec"/>
        <author person="srirams"/>
        <author person="atrivedi"/>
      </authors>
      <urls>
        <url name="arXiv">https://arxiv.org/abs/1702.07103</url>
        <url name="pdf">papers/discriminator-tacas17.pdf</url>
      </urls>  
      <howpub>
        <proceedings event="tacas17" />
      </howpub>
      <pages>21-37</pages>
      <year>2017</year>
    </pub>
    <pub id="clumping-popl17">
      <title>Semantic-Directed Clumping of Disjunctive Abstract States</title>
      <authors>
        <author person="hli" student="y"/>
        <author person="fberenger"/>
        <author person="bec"/>
        <author person="rival"/>
      </authors>
      <urls>
        <url name="pdf">papers/clumping-popl17.pdf</url>
      </urls>  
      <howpub>
        <proceedings event="popl17" />
      </howpub>
      <pages>32-45</pages>
      <year>2017</year>
    </pub>
    <pub id="hazelnut-popl17">
      <title>Hazelnut: A Bidirectionally Typed Structure Editor Calculus</title>
      <authors>
        <author person="comar"/>
        <author person="ivoysey"/>
        <author person="mhilton"/>
        <author person="jaldrich"/>
        <author person="hammer"/>
      </authors>
      <urls>
        <url name="pdf">papers/hazelnut-popl17.pdf</url>
      </urls>  
      <howpub>
        <proceedings event="popl17" />
      </howpub>
      <year>2017</year>
    </pub>
    <pub id="vmf-gpce16">
      <title>A Vision for Online Verification-Validation</title>
      <authors>
        <author person="hammer"/>
        <author person="bec"/>
        <author person="dvanhorn"/>
      </authors>
      <howpub>
        <proceedings event="gpce16" />
      </howpub>
      <pages>190-201</pages>
      <year>2016</year>
    </pub>
    <pub id="switched-systems-emsoft16">
      <title>Robust Controller Synthesis of Switched Systems Using Counterexample Guided Framework</title>
      <authors>
        <author person="hravanbakhsh"/>
        <author person="srirams"/>
      </authors>
      <urls>
        <!--<url name="pdf">papers/switched-systems-emsoft16.pdf</url>-->
      </urls>
      <howpub>
        <proceedings event="emsoft16" />
      </howpub>
      <!--
      <abstract>
      <p></p>
      </abstract>
      -->
    </pub>
    <pub id="sdp-sas16">
      <title>Validating Numerical Semidefinite Programming Solvers for Polynomial Invariants</title>
      <authors>
        <author person="proux"/>
        <author person="yvoronin"/>
        <author person="srirams"/>
      </authors>
      <urls>
        <!--<url name="pdf">papers/switched-systems-emsoft16.pdf</url>-->
      </urls>
      <howpub>
        <proceedings event="sas16" />
      </howpub>
      <!--
      <abstract>
      <p></p>
      </abstract>
      -->
    </pub>
    <pub id="clausal-cav16">
      <title>Proving Parameterized Systems Safe by Generalizing Clausal Proofs of
Small Instances</title>
      <authors>
        <author person="mdooley"/>
        <author person="fabio"/>
      </authors>
      <urls>
        <!--<url name="pdf">papers/clausal-cav16.pdf</url>-->
      </urls>
      <howpub>
        <proceedings event="cav16" />
      </howpub>
      <!--
      <abstract>
        <p></p>
      </abstract>
      -->
    </pub>
    <pub id="implicit-cav16">
      <title>Infinite-state Liveness-to-Safety via Implicit Abstraction and
Well-founded Relations</title>
      <authors>
        <author person="jdaniel"/>
        <author person="acimatti"/>
        <author person="agriggio"/>
        <author person="stonetta"/>
        <author person="smover"/>
      </authors>
      <urls>
        <!--<url name="pdf">papers/implicit-cav16.pdf</url>-->
      </urls>
      <howpub>
        <proceedings event="cav16" />
      </howpub>
      <!--
      <abstract>
        <p></p>
      </abstract>
      -->
    </pub>
    <pub id="events-pldi16">
      <title>Event-Driven Network Programming</title>
      <authors>
  <author person="mcclurg" />
  <author person="hojjat" />
  <author person="jnfoster" />
  <author person="cernyp" />
      </authors>
      <urls>
  <url name="pdf">papers/events-pldi16.pdf</url>
      </urls>
      <howpub>
  <proceedings event="pldi16" />
      </howpub>
      <abstract>
  <p>Software-defined networking (SDN) programs must simultaneously describe static forwarding behavior and dynamic updates in response to events. Event-driven updates are critical to get right, but difficult to implement correctly due to the high degree of concurrency in networks. Existing SDN platforms offer weak guarantees that can break application invariants, leading to problems such as dropped packets, degraded performance, security violations, etc. This paper introduces EVENT-DRIVEN CONSISTENT UPDATES that are guaranteed to preserve well-defined behaviors when transitioning between configurations in response to events. We propose NETWORK EVENT STRUCTURES (NESs) to model constraints on updates, such as which events can be enabled simultaneously and causal dependencies between events. We define an extension of the NetKAT language with mutable state, give semantics to stateful programs using NESs, and discuss provably-correct strategies for implementing NESs in SDNs. Finally, we evaluate our approach empirically, demonstrating that it gives well-defined consistency guarantees while avoiding expensive synchronization and packet buffering.</p>
      </abstract>
    </pub>
    <pub id="symbolic-numeric-reach-hscc16">
      <title>Symbolic-Numeric Reachability Analysis of Closed-Loop Control Software</title>
      <authors>
  <author person="adityaz"/>
  <author person="srirams"/>
  <author person="jdeshmukh"/>
  <author person="xjin"/>
      </authors>
      <urls>
  <url name="pdf">papers/symbolic-numeric-reach-hscc16.pdf</url>
      </urls>
      <howpub>
  <proceedings event="hscc16" />
      </howpub>
      <abstract>
  <p>We study the problem of falsifying reachability properties of real-time control software acting in a closed-loop with a given model of the plant dynamics. Our approach employs numerical techniques to simulate a plant model, which may be highly nonlinear and hybrid, in combination with symbolic simulation of the controller software. The state-space and input-space of the plant are systematically searched using a plant abstraction that is implicitly defined by "quantization" of the plant state, but never explicitly constructed. Simultaneously, the controller behaviors are explored using a symbolic execution of the control software. On-the-fly exploration of the overall closed-loop abstraction results in abstract counterexamples, which are used to refine the plant abstraction iteratively until a concrete violation is found. Empirical evaluation of our approach shows its promise in treating controller software that has precise, formal semantics, using an exact method such as symbolic execution, while using numerical simulations to produce abstractions of the underlying plant model that is often an approximation of the actual plant. We also discuss a preliminary comparison of our approach with techniques that are primarily simulation-based.</p>
      </abstract>
    </pub>
    <pub id="affine-forms-conc-measure-tacas16">
      <title>Uncertainty Propagation using Probabilistic Affine Forms and Concentration of Measure Inequalities</title>
      <authors>
  <author person="obouissou"/>
  <author person="goubault"/>
  <author person="putot"/>
  <author person="chakarov"/>
  <author person="srirams"/>
      </authors>
      <urls>
  <url name="pdf">papers/affine-forms-conc-measure-tacas16.pdf</url>
      </urls>
      <howpub>
  <proceedings event="tacas16" />
      </howpub>
      <abstract>
  <p>We consider the problem of reasoning about the probability of assertion violations in straight-line, nonlinear computations involving uncertain quantities modeled as random variables. Such computations are quite common in many areas such as cyber-physical systems and numerical computation. Our approach extends probabilistic affine forms, an interval-based calculus for precisely tracking how the distribution of a given program variable depends on uncertain inputs modeled as noise symbols. We extend probabilistic affine forms using the precise tracking of dependencies between noise symbols combined with the expectations and higher order moments of the noise symbols. Next, we show how to prove bounds on the probabilities that program variables take on specific values by using concentration of measure inequalities. Thus, we enable a new approach to this problem that explicitly avoids subdividing the domain of inputs, as is commonly done in the related work. We illustrate the approach in this paper on a variety of challenging benchmark examples, and thus study its applicability to uncertainty propagation.</p>
      </abstract>
    </pub>
    <pub id="stochastic-persistence-tacas16">
      <title>Deductive Proofs of Almost Sure Persistence and Recurrence Properties</title>
      <authors>
  <author person="chakarov"/>
  <author person="yvoronin"/>
  <author person="srirams"/>
      </authors>
      <urls>
  <url name="pdf">papers/stochastic-persistence-tacas16.pdf</url>
      </urls>
      <howpub>
  <proceedings event="tacas16" />
      </howpub>
      <abstract>
  <p>Martingale theory yields a powerful set of tools that have recently been used to prove quantitative properties of stochastic systems such as stochastic safety and qualitative properties such as almost sure termination. In this paper, we examine proof techniques for establishing almost sure persistence and recurrence properties of infinite-state discrete time stochastic systems. A persistence property FG(P) specifies that almost all executions of the stochastic system eventually reach P and stay there forever. Likewise, a recurrence property GF(Q) specifies that a target set Q is visited infinitely often by almost all executions of the stochastic system. Our approach extends classic ideas on the use of Lyapunov-like functions to establish persistence and recurrence properties. Next, we extend known constraint-based invariant synthesis techniques to deduce the necessary supermartingale expressions to partly mechanize such proofs. We illustrate our techniques on a set of interesting examples.</p>
      </abstract>
    </pub>
    <pub id="setr-lpar15">
      <title>Abstract Domains and Solvers for Sets Reasoning</title>
      <authors>
  <author person="cox"/>
  <author person="bec"/>
  <author person="hli" student="y"/>
  <author person="rival"/>
      </authors>
      <urls>
        <url name="pdf">papers/setr-lpar15.pdf</url>
      </urls>
      <howpub>
        <proceedings event="lpar15" />
      </howpub>
      <pages>356-371</pages>
      <year>2015</year>
      <ee>http://dx.doi.org/10.1007/978-3-662-48899-7_25</ee>
      <abstract>
        <p>When constructing complex program analyses, it is often useful to
        reason about not just individual values, but collections of values.
        Symbolic set abstractions provide building blocks that can be used to
        partition elements, relate partitions to other partitions, and determine
        the provenance of multiple values, all without knowing any concrete
        values. To address the simultaneous challenges of scalability and
        precision, we formalize and implement an interface for symbolic set
        abstractions and construct multiple abstract domains relying on both
        specialized data structures and off-the-shelf theorem provers. We
        develop techniques for lifting existing domains to improve performance
        and precision. We evaluate these domains on real-world data structure
        analysis problems.</p>
      </abstract>
    </pub>
    <pub id="controlfeasibility-oopsla15">
      <title>Selective Control-Flow Abstraction via Jumping</title>
      <authors>
  <author person="blackshear"/>
  <author person="bec"/>
  <author person="msridhar"/>
      </authors>
      <urls>
  <url name="pdf">papers/controlfeasibility-oopsla15.pdf</url>
      </urls>
      <howpub>
  <proceedings event="oopsla15" />
      </howpub>
      <pages>163-182</pages>
      <year>2015</year>
      <booktitle>OOPSLA</booktitle>
      <ee>http://doi.acm.org/10.1145/2814270.2814293</ee>
      <abstract>
  <p>We present <em>jumping</em>, a form of selective control-flow abstraction useful for improving the scalability of goal-directed static analyses. Jumping is useful for analyzing programs with complex control-flow such as <em>event-driven</em> systems. In such systems, accounting for orderings between certain events is important for precision, yet analyzing the product graph of all possible event orderings is intractable. Jumping solves this problem by allowing the analysis to selectively abstract away control-flow between events irrelevant to a goal query while preserving information about the ordering of relevant events. We present a framework for designing sound jumping analyses and create an instantiation of the framework for performing precise inter-event analysis of Android applications. Our experimental evaluation showed that using jumping to augment a precise goal-directed analysis with inter-event reasoning enabled our analysis to prove 90--97\% of dereferences safe across our benchmarks.</p>
      </abstract>
    </pub>
    <pub id="adaptonwithnames-oopsla15">
      <title>Incremental Computation with Names</title>
      <authors>
  <author person="hammer"/>
  <author person="jdunfield"/>
  <author person="kheadley"/>
  <author person="nlabich"/>
  <author person="jfoster"/>
  <author person="mhicks"/>
  <author person="dvanhorn"/>
      </authors>
      <urls>
  <!--<url name="pdf">papers/adaptonwithnames-oopsla15.pdf</url>-->
      </urls>
      <howpub>
  <proceedings event="oopsla15" />
      </howpub>
      <abstract>
  <p>Over the past thirty years, there has been significant progress in developing general-purpose, language-based approaches to incremental computation, which aims to efficiently update the result of a computation when an input is changed. A key design challenge in such approaches is how to provide efficient incremental support for a broad range of programs. In this paper, we argue that first-class names are a critical linguistic feature for efficient incremental computation. Names identify computations to be reused across differing runs of a program, and making them first class gives programmers a high level of control over reuse. We demonstrate the benefits of names by presenting Nominal Adapton, an ML-like language for incremental computation with names. We describe how to use Nominal Adapton to efficiently incrementalize several standard programming patterns—including maps, folds, and unfolds—and show how to build efficient, incremental probabilistic trees and tries. Since Nominal Adapton's implementation is subtle, we formalize it as a core calculus and prove it is from-scratch consistent, meaning it always produces the same answer as simply re-running the computation. Finally, we demonstrate that Nominal Adapton can provide large speedups over both from-scratch computation and Adapton, a previous state-of-the-art incremental computation system.</p>
      </abstract>
    </pub>
    <pub id="sharing-sas15">
      <title>Shape Analysis for Unstructured Sharing</title>
      <authors>
  <author person="hli" student="y"/>
  <author person="bec"/>
  <author person="rival"/>
      </authors>
      <urls>
      <url name="pdf">papers/sharing-sas15.pdf</url>
      </urls>
      <howpub>
  <proceedings event="sas15" />
      </howpub>
      <pages>90-108</pages>
      <year>2015</year>
      <booktitle>SAS</booktitle>
      <ee>http://dx.doi.org/10.1007/978-3-662-48288-9_6</ee>
      <abstract>
    <p>Shape analysis aims to infer precise structural properties of
  imperative memory states and has been applied heavily to verify
  safety properties on imperative code over pointer-based data
  structures. Recent advances in shape analysis based on separation
  logic has leveraged summarization predicates that describe unbounded
  heap regions like lists or trees using inductive
  definitions. Unfortunately, data structures with <em>unstructured
    sharing</em>, such as graphs, are challenging to describe and reason
  about in such frameworks.
  In particular, when the sharing is unstructured, it cannot be described
  inductively in a local manner.
  In this paper, we propose a global
  abstraction of sharing based on set-valued variables that when
  integrated with inductive definitions enables the specification and
  shape analysis of structures with unstructured sharing.</p>
      </abstract>
    </pub>
    <pub id="synunification-cav15">
      <title>Synthesis through Unification</title>
      <authors>
  <author person="ralur"/>
  <author person="cernyp"/>
  <author person="aradhakrishna"/>
      </authors>
      <urls>
      <url name="pdf">papers/synunification-cav15.pdf</url>
      </urls>
      <howpub>
  <proceedings event="cav15" />
      </howpub>
      <!--
      <abstract>
  <p></p>
      </abstract>
      -->
    </pub>
    <pub id="scheduling-cav15">
      <title>From Non-preemptive to Preemptive Scheduling using Synchronization Synthesis</title>
      <authors>
  <author person="cernyp"/>
  <author person="eclarke"/>
  <author person="tah"/>
  <author person="aradhakrishna"/>
  <author person="lryzhyk"/>
  <author person="rsamanta"/>
  <author person="ttarrach"/>
      </authors>
      <urls>
      <url name="pdf">papers/scheduling-cav15.pdf</url>
      </urls>
      <howpub>
  <proceedings event="cav15" />
      </howpub>
      <!--
      <abstract>
  <p></p>
      </abstract>
      -->
    </pub>
    <pub id="droidel-soap15">
      <title>Droidel: A General Approach to Android Framework Modeling</title>
      <authors>
  <author person="blackshear"/>
  <author person="agendreau"/>
  <author person="bec"/>
      </authors>
      <urls>
  <url name="pdf">papers/droidel-soap15.pdf</url>
      </urls>
      <howpub>
  <proceedings event="soap15" />
      </howpub>
      <pages>19-25</pages>
      <year>2015</year>
      <ee>http://doi.acm.org/10.1145/2771284.2771288</ee>
      <abstract>
  <p>We present an approach and tool for general-purpose modeling of Android for static analysis.  Our approach is to explicate the reflective bridge between the Android framework and an application to make the framework source amenable to static analysis.  Our Droidel tool does this by automatically generating application-specific stubs that summarize the reflective behavior for a particular app.  The result is a program with a single entry-point that can be processed by any existing Java analysis platform (e.g., Soot, WALA, Chord).  We compared call graphs constructed using Droidel to call graphs constructed using a state-of-the-art Android model and found that Droidel captures more concrete behaviors.
</p>
      </abstract>
    </pub>
    <pub id="performance-array15">
      <title>Performance Search Engine Driven by Prior Knowledge of Optimization</title>
      <authors>
  <author person="ykim"/>
  <author person="cernyp"/>
  <author person="jdennis"/>
      </authors>
      <urls>
  <!--<url name="pdf">papers/performance-array15.pdf</url>-->
      </urls>
      <howpub>
  <proceedings event="array15" />
      </howpub>
      <!--
      <abstract>
  <p></p>
      </abstract>
      -->
    </pub>
    <pub id="netsynth-pldi15">
      <title>Efficient Synthesis of Network Updates</title>
      <authors>
  <author person="mcclurg" />
  <author person="hojjat" />
  <author person="cernyp" />
  <author person="jnfoster" />
      </authors>
      <urls>
  <url name="pdf">papers/netsynth-pldi15.pdf</url>
      </urls>
      <howpub>
  <proceedings event="pldi15" />
      </howpub>
      <abstract>
  <p>Software-defined networking (SDN) is revolutionizing the networking
industry, but current SDN programming platforms do not
provide automated mechanisms for updating global configurations
on the fly. Implementing updates by hand is challenging for SDN
programmers because networks are distributed systems with hundreds
or thousands of interacting nodes. Even if initial and final
configurations are correct, naively updating individual nodes can
lead to incorrect transient behaviors, including loops, black holes,
and access control violations. This paper presents an approach for
automatically synthesizing updates that are guaranteed to preserve
specified properties. We formalize network updates as a distributed
programming problem and develop a synthesis algorithm based on
counterexample-guided search and incremental model checking.
We describe a prototype implementation, and present results from
experiments on real-world topologies and properties demonstrating
that our tool scales to updates involving over one-thousand nodes.</p>
      </abstract>
    </pub>
    <pub id="desynchronized-esop15">
      <title>Desynchronized Multi-State Abstractions for Open Programs in Dynamic Languages</title>
      <authors>
  <author person="cox" student="y"/>
  <author person="bec"/>
  <author person="rival"/>
      </authors>
      <urls>
  <url name="pdf">papers/desynchronized-esop15.pdf</url>
      </urls>
      <howpub>
  <proceedings event="esop15" />
      </howpub>
      <pages>356-371</pages>
      <year>2015</year>
      <ee>http://dx.doi.org/10.1007/978-3-662-48899-7_25</ee>
      <abstract>
  <p>Dynamic language library developers face a challenging problem:
  ensuring that their libraries will behave correctly for a wide variety
  of client programs without having access to those client programs. This
  problem stems from the common use of two defining features for dynamic
  languages: callbacks into client code and complex manipulation of
  attribute names within objects. To remedy this problem, we introduce two
  state-spanning abstractions. To analyze callbacks, the first abstraction
  desynchronizes a heap, allowing partitions of the heap that may be
  affected by a callback to an unknown function to be frozen in the state
  prior to the call. To analyze object attribute manipulation, building
  upon an abstraction for dynamic language heaps, the second abstraction
  tracks attribute name/value pairs across the execution of a library. We
  implement these abstractions and use them to verify modular
  specifications of class-, trait-, and mixin-implementing libraries.</p>
      </abstract>
    </pub>
    <pub id="wcet-esop15">
      <title>Segment Abstraction for Worst-Case Execution Time Analysis</title>
      <authors>
  <author person="cernyp"/>
  <author person="tah"/>
  <author person="lkovacs"/>
  <author person="aradhakrishna"/>
  <author person="jzwirchmayr"/>
      </authors>
      <urls>
  <!--<url name="pdf">papers/wcet-esop15.pdf</url>-->
      </urls>
      <howpub>
  <proceedings event="esop15" />
      </howpub>
    </pub>
    <pub id="soundiness-cacm15">
      <title>In Defense of Soundiness: A Manifesto</title>
      <authors>
  <author person="blivshits"/>
  <author person="msridhar"/>
  <author person="ysmaragdakis"/>
  <author person="olhotak"/>
  <author person="jamaral"/>
  <author person="bec"/>
  <author person="sguyer"/>
  <author person="ukhedker"/>
  <author person="amoeller"/>
  <author person="dvardoulakis"/>
      </authors>
      <urls>
      </urls>
      <pages>44-46</pages>
      <date>2015-02</date>
      <volume>58</volume>
      <number>2</number>
      <doi>10.1145/2644805</doi>
      <ee>http://doi.acm.org/10.1145/2644805</ee>
      <howpub>
        <issue journal="cacm" />
      </howpub>
      <abstract>
      </abstract>
    </pub>
    <pub id="controller-emsoft14">
      <title>Infinite Horizon Safety Controller Synthesis through Disjunctive Polyhedral Abstract Interpretation</title>
      <authors>
  <author person="hravanbakhsh"/>
  <author person="srirams"/>
      </authors>
      <urls>
  <url name="pdf">papers/emsoft14-synthesis.pdf</url>
      </urls>
      <howpub>
  <proceedings event="emsoft14" />
      </howpub>
      <abstract>
  <p>This paper presents a controller synthesis approach using disjunctive polyhedral abstract interpretation. Our approach synthesizes infinite time-horizon controllers for safety properties with discrete-time, linear plant model and a switching feedback controller that is suitable for time-triggered implementations. The core idea behind our approach is to perform an abstract interpretation over disjunctions of convex polyhedra to identify states that are potentially uncontrollable. Complementing this set yields the set of controllable states, starting from which, the safety property can be guaranteed by an appropriate control function. Since, a straightforward disjunctive domain is computationally inefficient, we present an abstract domain based on a state partitioning scheme that allows us to efficiently control the complexity of the intermediate representations. Next, we focus on the automatic generation of controller implementation from our final fixed point. We show that a balanced tree approach can yield efficient controller code with guarantees on the worst-case execution time of the controller. Finally, we evaluate our approach on a suite of benchmarks, comparing different instantiations with related synthesis tools. Our evaluation shows that our approach can successfully synthesize controller implementations for small to medium sized benchmarks.</p>
      </abstract>
    </pub>
    <pub id="shooting-emsoft14">
      <title>Multiple Shooting, CEGAR-based Falsification for Hybrid Systems</title>
      <authors>
  <author person="adityaz"/>
  <author person="srirams"/>
  <author person="jdeshmukh"/>
  <author person="jkapinski"/>
      </authors>
      <urls>
  <url name="pdf">papers/emsoft14-multipleShooting.pdf</url>
      </urls>
      <howpub>
  <proceedings event="emsoft14" />
      </howpub>
      <abstract>
  <p>In this paper, we present an approach for finding violations of safety properties of hybrid systems. Existing approaches search for complete system trajectories that begin from an initial state and reach some unsafe state. We present an approach that searches over segmented trajectories, consisting of a sequence of segments starting from any system state. Adjacent segments may have gaps, which our approach then seeks to narrow iteratively. We show that segmented trajectories are actually paths in the abstract state graph obtained by tiling the state space with cells. Instead of creating the prohibitively large abstract state graph explicitly, our approach implicitly performs a randomized search on it using a {em scatter-and-simulate} technique. This involves repeated simulations, graph search to find likeliest abstract counterexamples, and iterative refinement of the abstract state graph. Finally, we demonstrate our technique on a number of case studies ranging from academic examples to models of industrial-scale control systems.</p>
      </abstract>
    </pub>
    <pub id="absdom-isola14" type="reviewed-invited">
      <title>Construction of Abstract Domains for Heterogeneous Properties (Position Paper)</title>
      <authors>
  <author person="rival"/>
  <author person="toubhans" student="y"/>
  <author person="bec"/>
      </authors>
      <howpub>
        <proceedings event="isola14" />
      </howpub>
      <pages>489-492</pages>
      <doi>10.1007/978-3-662-45231-8_40</doi>
      <ee>http://dx.doi.org/10.1007/978-3-662-45231-8_40</ee>
    </pub>
    <pub id="expectation-sas14">
      <title>Expectation Invariants for Probabilistic Program Loops as Fixed Points</title>
      <authors>
  <author person="chakarov"/>
  <author person="srirams"/>
      </authors>
      <urls>
      </urls>
      <howpub>
  <proceedings event="sas14" />
      </howpub>
      <abstract>
  <p></p>
      </abstract>
    </pub>
    <pub id="hoo-sas14">
      <title>Automatic Analysis of Open Objects in Dynamic Language Programs</title>
      <authors>
  <author person="cox" student="y"/>
  <author person="bec"/>
  <author person="rival"/>
      </authors>
      <urls>
  <url name="pdf">papers/hoo-sas14.pdf</url>
      </urls>
      <howpub>
  <proceedings event="sas14" />
      </howpub>
      <pages>134-150</pages>
      <doi>10.1007/978-3-319-10936-7_9</doi>
      <ee>http://dx.doi.org/10.1007/978-3-319-10936-7_9</ee>
      <abstract>
  <p>In dynamic languages, objects are <em>open</em>&emdash;they support iteration over and dynamic addition/deletion of their attributes. Open objects, because they have an unbounded number of attributes, are difficult to abstract without a priori knowledge of all or nearly all of the attributes and thus pose a significant challenge for precise static analysis. To address this challenge, we present the HOO (Heap with Open Objects) abstraction that can precisely represent and infer properties about open-object-manipulating programs without any knowledge of specific attributes.  It achieves this by building upon a relational abstract domain for sets that is used to reason about partitions of object attributes.  An implementation of the resulting static analysis is used to verify specifications for dynamic language framework code that makes extensive use of open objects, thus demonstrating the effectiveness of this approach.</p>
      </abstract>
    </pub>
    <pub id="sepdom-sas14">
      <title>An Abstract Domain Combinator for Separately Conjoining Memory Abstractions</title>
      <authors>
  <author person="toubhans" student="y" />
  <author person="bec"/>
  <author person="rival"/>
      </authors>
      <urls>
  <url name="pdf">papers/sepdom-sas14.pdf</url>
      </urls>
      <howpub>
  <proceedings event="sas14" />
      </howpub>
      <pages>285-301</pages>
      <doi>10.1007/978-3-319-10936-7_18</doi>
      <ee>http://dx.doi.org/10.1007/978-3-319-10936-7_18</ee>
      <abstract>
  <p>The breadth and depth of heap properties that can be inferred by the union of today's shape analyses is quite astounding.  Yet, achieving scalability while supporting a wide range of complex data structures in a generic way remains a long-standing challenge. In this paper, we propose a way to side-step this issue by defining a generic abstract domain combinator for combining memory abstractions on disjoint regions. In essence, our abstract domain construction is to the separating conjunction in separation logic as the reduced product construction is to classical, non-separating conjunction. This approach eases the design of the analysis as memory abstract domains can be re-used by applying our separating conjunction domain combinator. And more importantly, this combinator enables an analysis designer to easily create a combined domain that applies computationally-expensive abstract domains only where it is required.</p>
      </abstract>
    </pub>
    <pub id="quicr-cav14">
      <title>QUICr: A Reusable Library for Parametric Abstraction of Sets and Numbers</title>
      <authors>
  <author person="cox" student="y" />
  <author person="bec"/>
  <author person="srirams"/>
      </authors>
      <urls>
  <url name="pdf">papers/quicr-cav14.pdf</url>
      </urls>
      <pages>866-873</pages>
      <doi>10.1007/978-3-319-08867-9_57</doi>
      <ee>http://dx.doi.org/10.1007/978-3-319-08867-9_57</ee>
      <howpub>
  <proceedings event="cav14" />
      </howpub>
      <abstract>
  <p>This paper introduces QUICr, an abstract domain combinator library that lifts any domain for numbers into an efficient domain for numbers and <em>sets</em> of numbers.  As a library, it is useful for inferring relational data invariants in programs that manipulate data structures.  As a testbed, it allows easy extension of widening and join heuristics, enabling adaptations to new and varied applications.  In this paper we present the architecture of the library, guidelines on how to select heuristics, and an example instantiation of the library using the Apron library to verify set-manipulating programs.</p>
      </abstract>
    </pub>
    <pub id="vmv-pldi14">
      <title>Verification Modulo Versions: Towards Usable Verification</title>
      <authors>
  <author person="flogozzo" />
  <author person="mfahndrich" />
  <author person="slahiri" />
  <author person="blackshear" />
      </authors>
      <howpub>
  <proceedings event="pldi14" />
      </howpub>
    </pub>
    <pub id="outlier-chi-ea14">
      <title>Android Apps Consistency Scrutinized</title>
      <authors>
  <author person="kalharbi" student="y"/>
  <author person="blackshear" student="y"/>
  <author person="ekowalczyk" student="y"/>
  <author person="amemon"/>
  <author person="bec"/>
  <author person="tyeh"/>
      </authors>
      <urls>
      </urls>
      <pages>2347-2352</pages>
      <doi>10.1145/2559206.2581352</doi>
      <ee>http://doi.acm.org/10.1145/2559206.2581352</ee>
      <howpub>
  <proceedings event="chi-ea14" />
      </howpub>
      <abstract>
      </abstract>
    </pub>
    <pub id="fissile-popl14">
      <title>Fissile Type Analysis: Modular Checking of Almost Everywhere Invariants</title>
      <authors>
  <author person="coughlin" student="y" />
  <author person="bec"/>
      </authors>
      <urls>
  <url name="pdf">papers/fissile-popl14.pdf</url>
      </urls>
      <pages>73-86</pages>
      <doi>10.1145/2535838.2535855</doi>
      <ee>http://doi.acm.org/10.1145/2535838.2535855</ee>
      <howpub>
  <proceedings event="popl14" />
      </howpub>
      <abstract>
  <p>We present a generic analysis approach to the <em>imperative
  relationship update problem</em>, in which destructive updates
  temporarily violate a global invariant of interest. Such invariants can
  be conveniently and concisely specified with dependent refinement types,
  which are efficient to check flow-insensitively. Unfortunately, while
  traditional flow-insensitive type checking is fast, it is inapplicable
  when the desired invariants can be temporarily broken. To overcome this
  limitation, past works have directly ratcheted up the complexity of the
  type analysis and associated type invariants, leading to inefficient
  analysis and verbose specifications. In contrast, we propose a
  <em>generic lifting</em> of modular refinement type analyses with a
  symbolic analysis to efficiently and effectively check concise
  invariants that hold <em>almost everywhere</em>. The result is an
  efficient, highly modular flow-insensitive type analysis to
  <em>optimistically</em> check the preservation of global relationship
  invariants that can fall back to a precise, disjunctive symbolic
  analysis when the optimistic assumption is violated. This technique
  permits programmers to temporarily break and then re-establish
  relationship invariants&emdash;a flexibility that is crucial for
  checking relationships in real-world, imperative languages. A
  significant challenge is selectively violating the global type
  consistency invariant over heap locations, which we achieve via
  <em>almost type-consistent heaps</em>. To evaluate our approach, we have
  encoded the problem of verifying the safety of reflective method calls
  in dynamic languages as a refinement type checking problem. Our analysis
  is capable of validating reflective call safety at interactive speeds on
  commonly-used Objective-C libraries and applications.</p>
      </abstract>
    </pub>
    <pub id="acceleration-popl14">
      <title>Abstract Acceleration of General Linear Loops</title>
      <authors>
  <author person="bjeannet"/>
  <author person="schramme"/>
  <author person="srirams"/>
      </authors>
      <urls>
      </urls>
      <howpub>
  <proceedings event="popl14" />
      </howpub>
      <abstract>
      </abstract>
    </pub>
    <pub id="refutation-vmcai14" type="invited">
      <title>Refuting Heap Rechability (Extended Abstract)</title>
      <authors>
  <author person="bec"/>
      </authors>
      <urls>
  <url name="pdf">papers/refutation-vmcai14.pdf</url>
      </urls>
      <howpub>
  <proceedings event="vmcai14" />
      </howpub>
      <pages>137-141</pages>
      <doi>10.1007/978-3-642-54013-4_8</doi>
      <ee>http://dx.doi.org/10.1007/978-3-642-54013-4_8</ee>
      <abstract>
  <p>Precise heap reachability information is a prerequisite for many
  static verification clients. However, the typical scenario is that
  the available heap information, computed by say an up-front
  points-to analysis, is not precise enough for the client of
  interest. This imprecise heap information in turn leads to a deluge
  of false alarms for the tool user to triage. Our position is to
  approach the false alarm problem not just by improving the up-front
  analysis but by also employing after-the-fact, goal-directed
  <em>refutation analyses</em> that yield targeted precision
  improvements. We have investigated refutation analysis in the
  context of detecting statically a class of Android memory leaks. For
  this client, we have found the necessity for an overall analysis
  capable of path-sensitive reasoning interprocedurally and with
  strong updates---a level of precision difficult to achieve globally
  in an up-front manner. Instead, our approach uses a
  refutation analysis that mixes highly precise, goal-directed
  reasoning with facts derived from the up-front analysis
  to prove alarms false and thus enabling effective and sound
  filtering of the overall list of alarms.</p>
      </abstract>
      <bibnote>
  <b>Invited contribution</b>.
      </bibnote>
    </pub>
    <pub id="shapenumeric-sairp13" type="reviewed-invited">
      <title>Modular Construction of Shape-Numeric Analyzers</title>
      <authors>
  <author person="bec"/>
  <author person="rival"/>
      </authors>
      <urls>
  <url name="pdf">papers/shapenumeric-sairp13.pdf</url>
      </urls>
      <howpub>
  <proceedings event="sairp13" />
      </howpub>
      <abstract>
  <p>The aim of static analysis is to infer invariants about programs that are precise enough to establish semantic properties, such as the absence of run-time errors. Broadly speaking, there are two major branches of static analysis for imperative programs.  Pointer and <em>shape</em> analyses focus on inferring properties of pointers, dynamically-allocated memory, and recursive data structures, while <em>numeric</em> analyses seek to derive invariants on numeric values. Although simultaneous inference of shape-numeric invariants is often needed, this case is especially challenging and is not particularly well explored.  Notably, simultaneous shape-numeric inference raises complex issues in the design of the static analyzer itself.
In this paper, we study the construction of such shape-numeric, static analyzers. We set up an abstract interpretation framework that allows us to reason about simultaneous shape-numeric properties by combining shape and numeric abstractions into a modular, expressive abstract domain.  Such a modular structure is highly desirable to make its formalization and implementation easier to do and get correct. To achieve this, we choose a concrete semantics that can be abstracted step-by-step, while preserving a high level of expressiveness.  The structure of abstract operations (i.e., transfer, join, and comparison) follows the structure of this semantics.  The advantage of this construction is to divide the analyzer in modules and functors that implement abstractions of distinct features.</p>
      </abstract>
    </pub>
    <pub id="concursyn-cav13">
      <title>Efficient Synthesis for Concurrency using Semantics-Preserving Transformations</title>
      <authors>
  <author person="cernyp"/>
  <author person="tah"/>
  <author person="aradhakrishna"/>
  <author person="lryzhyk"/>
  <author person="ttarrach"/>
      </authors>
      <urls>
  <url name="pdf">papers/concursyn-cav13.pdf</url>
      </urls>
      <howpub>
  <proceedings event="cav13" />
      </howpub>
      <abstract>
      </abstract>
    </pub>
    <pub id="martingales-cav13">
      <title>Probabilistic Program Analysis with Martingales</title>
      <authors>
  <author person="chakarov"/>
  <author person="srirams"/>
      </authors>
      <urls>
  <url name="pdf">papers/martingales-cav13.pdf</url>
      </urls>
      <howpub>
  <proceedings event="cav13" />
      </howpub>
      <abstract>
  <p>We present techniques for the analysis of infinite state
  probabilistic programs to synthesize probabilistic invariants and prove
  almost-sure termination. Our analysis is based on the notion of (super)
  martingales from probability theory. First, we define the concept of
  (super) martingales for loops in probabilistic programs. Next, we
  present the use of concentration of measure inequalities to bound the
  values of martingales with high probability. This directly allows us to
  infer probabilistic bounds on assertions involving the program
  variables. Next, we present the notion of a super martingale ranking
  function (SMRF) to prove almost sure termination of probabilistic
  programs. Finally, we extend constraint-based techniques to synthesize
  martingales and super-martingale ranking functions for probabilistic
  programs. We present some applications of our approach to reason about
  invariance and termination of small but complex probabilistic programs.</p>
      </abstract>
    </pub>
    <pub id="flowstar-cav13">
      <title>Flow*: An Analyzer for Non-Linear Hybrid Systems</title>
      <authors>
  <author person="xinchen"/>
  <author person="erikaabraham"/>
  <author person="srirams"/>
      </authors>
      <urls>
  <url name="pdf">papers/flowstar-cav13.pdf</url>
      </urls>
      <howpub>
  <proceedings event="cav13" />
      </howpub>
      <abstract>
  <p>The tool Flow* performs Taylor model-based flowpipe construction for
  non-linear (polynomial) hybrid systems. Flow* combines well-known Taylor
  model arithmetic techniques for guaranteed approximations of the
  continuous dynamics in each mode with a combination of approaches for
  handling mode invariants and discrete transitions. Flow* supports a wide
  variety of optimizations including adaptive step sizes, adaptive
  selection of approximation orders and the heuristic selection of
  template directions for aggregating flowpipes. This paper describes
  Flow* and demonstrates its performance on a series of non-linear
  continuous and hybrid system benchmarks. Our comparisons show that Flow*
  is competitive with other tool</p>
      </abstract>
    </pub>
    <pub id="quicgraphs-ecoop13">
      <title>QUIC Graphs: Relational Invariant Generation for Containers</title>
      <authors>
  <author person="cox" student="y" />
  <author person="bec"/>
  <author person="srirams"/>
      </authors>
      <urls>
  <url name="pdf">papers/quicgraphs-ecoop13.pdf</url>
      </urls>
      <pages>401-425</pages>
      <doi>10.1007/978-3-642-39038-8_17</doi>
      <ee>http://dx.doi.org/10.1007/978-3-642-39038-8_17</ee>
      <howpub>
  <proceedings event="ecoop13" />
      </howpub>
      <abstract>
  <p>Programs written in modern languages perform intricate
  manipulations of containers such as arrays, lists, dictionaries,
  and sets. We present an abstract interpretation-based framework
  for automatically inferring <em>relations</em> between the set of values
  stored in these containers. Relations include inclusion relations over
  unions and intersections, as well as quantified relationships with
  scalar variables. We develop an abstract domain constructor that builds
  a container domain out of a
  <em>Quantified Union-Intersection Constraint</em> (QUIC) graph
  parameterized by an arbitrary <em>base domain</em>.  We instantiate
  our domain with a polyhedral base domain and evaluate it on
  programs extracted from the Python test suite.  Over traditional,
  non-relational domains, we find significant precision improvements
  with minimal performance cost.</p>
      </abstract>
      <bibnote>
  <b>Distinguished Artifact Award</b>.
      </bibnote>
    </pub>
    <pub id="automata-lics13">
      <title>Regular Real Analysis</title>
      <authors>
  <author person="swarat"/>
  <author person="srirams"/>
  <author person="vardi"/>
      </authors>
      <urls>
  <url name="pdf">papers/automata-lics13.pdf</url>
      </urls>
      <howpub>
  <proceedings event="lics13" />
      </howpub>
      <abstract>
      </abstract>
    </pub>
    <pub id="thresher-pldi13">
      <title>Thresher: Precise Refutations for Heap Reachability</title>
      <authors>
  <author person="blackshear" student="y" />
  <author person="bec"/>
  <author person="msridhar"/>
      </authors>
      <urls>
  <url name="pdf">papers/thresher-pldi13.pdf</url>
      </urls>
      <pages>275-286</pages>
      <doi>10.1145/2462156.2462186</doi>
      <ee>http://doi.acm.org/10.1145/2462156.2462186</ee>
      <doi>10.1145/2499370.2462186</doi>
      <ee>http://doi.acm.org/10.1145/2499370.2462186</ee>
      <howpub>
  <proceedings event="pldi13" />
      </howpub>
      <abstract>
    <p>We present a precise, path-sensitive static analysis for reasoning about
    <em>heap reachability</em>; that is, whether an object can be reached
    from another variable or object via pointer dereferences. Precise
    reachability information is useful for a number of clients, including
    static detection of a class of Android memory leaks. For this client,
    we found that the heap reachability information computed by a
    state-of-the-art points-to analysis was too imprecise, leading to
    numerous false-positive leak reports. Our analysis combines a symbolic
    execution capable of path-sensitivity and strong updates with abstract
    heap information computed by an initial flow-insensitive points-to
    analysis. This novel <em>mixed</em> representation allows us to
    achieve both precision and scalability by leveraging the pre-computed
    points-to facts to guide execution and prune infeasible paths. We have
    evaluated our techniques in the <span style="font-variant:
    small-caps">Thresher</span> tool, which we used to find several
    developer-confirmed leaks in Android applications.</p>
      </abstract>
    </pub>
    <pub id="acspec-pldi13">
      <title>Almost-Correct Specifications: A Modular Semantic
      Framework for Assigning Confidence to Warnings</title>
      <authors>
  <author person="blackshear"/>
  <author person="slahiri"/>
      </authors>
      <urls>
  <url name="pdf">papers/papers/pldi13-acspec.pdf</url>
      </urls>
      <howpub>
  <proceedings event="pldi13" />
      </howpub>
      <abstract>
      </abstract>
    </pub>
    <pub id="probabilistic-pldi13">
      <title>Towards Static Analysis for Probabilistic Programs</title>
      <authors>
  <author person="srirams"/>
  <author person="chakarov"/>
  <author person="sumitg"/>
      </authors>
      <urls>
  <url name="pdf">papers/probabilistic-pldi13.pdf</url>
      </urls>
      <howpub>
  <proceedings event="pldi13" />
      </howpub>
      <abstract>
  <p>We propose an approach for the static analysis of probabilistic
  programs that sense, manipulate, and control based on uncertain
  data. Examples include programs used in risk analysis, medical
  decision making and cyber-physical systems. Correctness properties
  of such programs take the form of <em>queries</em> that seek the
  probabilities of assertions over program variables.  We present a
  static analysis approach that provides guaranteed interval bounds on
  the values (assertion probabilities) of such queries.  First, we
  observe that for probabilistic programs, it is possible to conclude
  facts about the behavior of the entire program by choosing a finite,
  <em>adequate set</em> of its paths. We provide strategies for choosing
  such a set of paths and verifying its adequacy.  The queries are
  evaluated over each path by a combination of symbolic execution and
  probabilistic volume-bound computations. Each path yields interval
  bounds that can be summed up with a "coverage"  bound to yield an
  interval that encloses the probability of assertion for the program
  as a whole.  We demonstrate promising results on a suite of
  benchmarks from many different sources including robotic
  manipulators and medical decision making programs.</p>
      </abstract>
    </pub>
    <pub id="ui-icse-nier13">
      <title>Exploring the Internal State of User Interfaces by Combining Computer Vision Techniques with Grammatical Inference</title>
      <authors>
  <author person="givens"/>
  <author person="chakarov"/>
  <author person="srirams"/>
  <author person="tyeh"/>
      </authors>
      <urls>
  <url name="pdf">papers/ui-icse-nier13.pdf</url>
      </urls>
      <howpub>
  <proceedings event="icse-nier13" />
      </howpub>
      <abstract>
      </abstract>
    </pub>
    <pub id="filters-sttt13">
      <title>A Bit Too Precise? Verification of Quantized Digital Filters</title>
      <authors>
  <author person="cox" student="y" />
  <author person="srirams" />
  <author person="bec" />
      </authors>
      <urls>
  <url name="pdf">papers/sttt13-filter_verification.pdf</url>
      </urls>
      <pages>175-190</pages>
      <date>2014</date>
      <volume>16</volume>
      <number>2</number>
      <doi>10.1007/s10009-013-0279-9</doi>
      <ee>http://dx.doi.org/10.1007/s10009-013-0279-9</ee>
      <howpub>
        <issue journal="sttt" />
      </howpub>
      <abstract>
  <p>Fixed point digital filters are simple yet ubiquitous components of a
  wide variety of digital processing and control systems. Common errors
        in fixed point filters include arithmetic round-off (truncation) errors,
  overflows and the presence of limit cycles. These errors can potentially
  compromise the correctness of the system as a whole. Traditionally digital
  filters have been verified using a combination of design techniques from control
  theory and extensive testing. In this paper, we examine the use of formal
  verification techniques as part of the design flow for fixed point digital
  filters. We study two classes of verification techniques involving bit-precise
  analysis and real-valued error approximations, respectively. We empirically
  evaluate several variants of these two fundamental approaches for verifying
  fixed-point implementations of digital filters. We design our comparison to
  reveal the best possible approach towards verifying real-world designs of
  infinite impulse response (IIR) digital filters. Our study compares the
  strengths and weaknesses of different verification techniques for digital
  filters and suggests efficient approaches using modern
  satisfiability-modulo-theories solvers (SMT) and hardware model checkers. This
  manuscript extends our previous work evaluating bounded verification, where a
  limited number of iterations of the system are explored, with unbounded
  verification, where an unlimited number of iterations of the system are
  considered. Doing so allows us to evaluate techniques that can prove the
  correctness of fixed point digital filter implementations.</p>
      </abstract>
    </pub>
    <pub id="quantitative-popl13">
      <title>Quantitative Abstraction Refinement</title>
      <authors>
  <author person="cernyp"/>
  <author person="tah"/>
  <author person="aradhakrishna"/>
      </authors>
      <urls>
  <url name="pdf">papers/quantitative-popl13.pdf</url>
      </urls>
      <howpub>
  <proceedings event="popl13" />
      </howpub>
      <abstract>
      </abstract>
    </pub>
    <pub id="reducedproduct-vmcai13">
      <title>Reduced Product Combination of Abstract Domains for Shapes</title>
      <authors>
  <author person="toubhans" student="y" />
  <author person="bec"/>
  <author person="rival"/>
      </authors>
      <urls>
  <url name="pdf">papers/reducedproduct-vmcai13.pdf</url>
      </urls>
      <pages>375-395</pages>
      <doi>10.1007/978-3-642-35873-9_23</doi>
      <ee>http://dx.doi.org/10.1007/978-3-642-35873-9_23</ee>
      <howpub>
  <proceedings event="vmcai13" />
      </howpub>
      <abstract>
  <p>Real-world data structures are often enhanced with additional
  pointers capturing alternative paths through a basic inductive skeleton
        (e.g., back pointers, head pointers). From the static analysis point of view,
  we must obtain several interlocking shape invariants. At the same time, it is
  well understood in abstract interpretation design that supporting a separation
  of concerns is critically important to designing powerful static analyses.
  Such a separation of concerns is often obtained via a reduced product on a
  case-by-case basis. In this paper, we lift this idea to abstract domains for
  shape analyses, introducing a domain combination operator for memory
  abstractions. As an example, we present <em>simultaneous separating shape
  graphs</em>, a product construction that combines instances of
  separation logic-based shape domains. The key enabler for this
  construction is a static analysis on inductive data structure
  definitions to derive relations between the skeleton and the alternative
  paths. From the engineering standpoint, this construction allows each
  component to reason independently about different aspects of the data
  structure invariant and then separately exchange information via a
  reduction operator. From the usability standpoint, we enable describing
  a data structure invariant in terms of several inductive definitions
  that hold simultaneously.</p>
      </abstract>
    </pub>
    <pub id="reflective-sas12">
      <title>Invariant Generation for Parametrized Systems using Self-Reflection</title>
      <authors>
        <author person="asanchez" student="y" />
        <author person="srirams" />
        <author person="cesar" />
        <author person="bec" />
      </authors>
      <urls>
        <url name="pdf">papers/sas12-reflective.pdf</url>
      </urls>
      <pages>146-163</pages>
      <doi>10.1007/978-3-642-33125-1_12</doi>
      <ee>http://dx.doi.org/10.1007/978-3-642-33125-1_12</ee>
      <date>2012</date>
      <howpub>
  <proceedings event="sas12" />
      </howpub>
      <abstract>
        <p>We examine the problem of inferring invariants for
        parametrized systems. Parametrized systems are concurrent
        systems consisting of an a priori unbounded number of process
        instances running the same program. Such systems are commonly
        encountered in many situations including device drivers,
        distributed systems, and robotic swarms. In this paper we
        describe a technique that enables leveraging off-the-shelf
        invariant generators designed for sequential programs to infer
        invariants of parametrized systems. The central challenge in
        invariant inference for parametrized systems is that näıvely
        exploding the transition system with all interleavings is not
        just impractical but impossible. In our approach, the key
        enabler is the notion of a reflective abstraction that we prove
        has an important correspondence with inductive
        invariants. This correspondence naturally gives rise to an
        iterative invariant generation procedure that alternates
        between computing candidate invariants and creating reflective
        abstractions.</p>
      </abstract>
      <note>
   <tr>
      <extendedtr/>
      <number>CU-CS-1094-12</number>
      <institute>University of Colorado Boulder</institute>
      <url>papers/CU-CS-1094-12-reflective.pdf</url>
      <pages>31 pages</pages>
   </tr>
      </note>
    </pub>
    <pub id="enforcements-issta12">
      <title>Measuring Enforcement Windows with Symbolic Trace Interpretation: What Well-Behaved Programs Say</title>
      <authors>
  <author person="coughlin" student="y" />
  <author person="bec" />
  <author person="diwan" />
  <author person="siek" />
      </authors>
      <urls>
  <url name="pdf">papers/issta12-enforcements.pdf</url>
        <url name="video">http://youtu.be/N_jQ6K8BCc0</url>
      </urls>
      <pages>276-286</pages>
      <doi>10.1145/2338965.2336786</doi>
      <ee>http://doi.acm.org/10.1145/2338965.2336786</ee>
      <howpub>
  <proceedings event="issta12" />
      </howpub>
      <note>
  <tr>
    <extendedtr />
    <number>CU-CS-1093-12</number>
          <institute>University of Colorado Boulder</institute>
    <url>papers/CU-CS-1093-12-enforcements.pdf</url>
      <pages>18 pages</pages>
  </tr>
      </note>
      <date>2012</date>
      <abstract>
  <p>A static analysis design is <em>sufficient</em> if it can
  prove the property of interest with an acceptable number of
  false alarms.  Ultimately, the only way to confirm that an
  analysis design is sufficient is to implement it and run it on
  real-world programs.  If the evaluation shows that the design
  is insufficient, the designer must return to the drawing board
  and repeat the process&emdash;wasting expensive implementation
  effort over and over again.  In this paper, we make the
  observation that there is a minimal range of code needed to
  prove a property of interest under an ideal static analysis;
  we call such a range of code a <em>validation scope</em>.
  Armed with this observation, we create a dynamic measurement
  framework that quantifies validation scopes and thus enables
  designers to rule out insufficient designs at lower cost.  A
  novel attribute of our framework is the ability to model
  aspects of static reasoning using dynamic execution
  measurements.  To evaluate the flexibility of our framework,
  we instantiate it on an example property&emdash;null
  dereference errors&emdash;and measure validation scopes on
  real-world programs. We use a broad range of metrics that
  capture the difficulty of analyzing programs along varying
  dimensions.  We also examine how validation scopes evolve as
  developers fix null dereference errors and as code matures.
  We find that bug fixes shorten validation scopes, that longer
  validation scopes are more likely to be buggy, and that
  overall validation scopes are remarkably stable as programs
  evolve.</p>
      </abstract>
    </pub>
    <pub id="sl-cav12">
      <title>Diagnosing Abstraction Failure in Separation Logic-based Analyses</title>
      <authors>
        <author person="berdine" />
        <author person="cox" />
        <author person="ishtiaq" />
        <author person="wintersteiger" />
      </authors>
      <urls>
        <url name="pdf">papers/cav12-diag-abs-fail.pdf</url>
      </urls>
      <howpub>
        <proceedings event="cav12" />
      </howpub>
      <abstract>
        <p>Abstraction refinement is an effective verification
        technique for automatically proving safety properties of
        software. Application of this technique in shape analyses has proved
        impractical as core components of existing refinement techniques such
        as backward analysis, general conjunction, and identification of
        unreachable but doomed states are computationally infeasible in such
        domains.</p>
        <p>We propose a new method to diagnose proof failures to
        be used in a refinement scheme for Separation Logic–based shape
        analyses. To check feasibility of abstract error traces, we perform
        Bounded Model Checking over the traces using a novel encoding into
        SMT. A subsequent diagnosis finds discontinuities on infeasible
        traces, and identifies doomed states admitted by the abstraction. To
        construct doomed states, we give a model-finding algorithm for
        “symbolic heap” Separation Logic formulas, employing the execution
        machinery of the feasibility checker to search for concrete
        counter-examples. The diagnosis has been implemented in SLAyer, and we
        present a simple scheme for refining the abstraction of hierarchical
        data structures, and illustrate its effectiveness on benchmarks from
        the SLAyer test suite.</p>
      </abstract>
    </pub>
    <pub id="timed-relational-cav12">
      <title>Timed Relational Abstractions of Sampled-Data Control Systems</title>
      <authors>
        <author person="adityaz" />
        <author person="srirams" />
        <author person="atiwari" />
      </authors>
      <urls>
        <url name="pdf">papers/cav12-timed-relational.pdf</url>
      </urls>
      <howpub>
        <proceedings event="cav12" />
      </howpub>
      <abstract>
        <p>
          In this paper, we define timed relational abstractions for
          verifying sampled data control systems. Sampled data control
          systems consist of a plant, modeled as a hybrid system and a
          synchronous controller, modeled as a discrete transition
          system. The controller computes control inputs and/or sends
          control events to the plant based on the periodically
          sampled state of the plant. The correctness of the system
          depends on the controller design as well as an appropriate
          choice of the controller sampling period.
        </p>
        <p>
          Our approach constructs a timed relational abstraction of
          the hybrid plant by replacing the continuous plant dynamics
          by relations. These relations map a state of the plant to
          states reachable within the sampling time period. We present
          techniques for building timed relational abstractions, while
          taking care of discrete transitions that can be taken by the
          plant between samples. The resulting abstractions are better
          suited for the verification of sampled data control
          systems. The abstractions focus on the states that can be
          observed by the controller at the sample times, while
          abstracting away behaviors between sample times
          conservatively. The resulting abstractions are discrete,
          infinite-state transition systems. Thus conventional
          verification tools can be used to verify safety properties
          of these abstractions. We use k-induction to prove safety
          properties and bounded model checking (BMC) to find
          potential falsifications. We present our idea, its
          implementation and results on many benchmark examples.
        </p>
      </abstract>
    </pub>
    <pub id="iictl-cav12">
      <title>Incremental Inductive CTL Model Checking</title>
      <authors>
        <author person="hassanz" />
        <author person="arbrad" />
        <author person="fabio" />
      </authors>
      <urls>
        <url name="pdf">papers/cav12-iictl.pdf</url>
      </urls>
      <howpub>
        <proceedings event="cav12" />
      </howpub>
      <abstract>
        <p>A SAT-based incremental, inductive algorithm for model
        checking CTL properties is proposed. As in classic CTL model
        checking, the parse graph of the property shapes the
        analysis. However, in the proposed algorithm, called IICTL,
        the analysis is directed by task states that are pushed down
        the parse tree. To each node is associated over- and
        under-approximations to the set of states satisfying that
        node’s property; these approximations are refined until a
        proof that the property does or does not hold is
        obtained. Each CTL operator corresponds naturally to an
        incremental sub-query: given a task state, an EX node executes
        a SAT query; an EU node applies IC3; and an EG node applies
        FAIR. In each case, the query result provides more general
        information than necessary to satisfy the task. When a query
        is satisfiable, the returned trace is generalized using
        forall-exists reasoning, during which IC3 is applied to obtain
        new reachability information that enables greater
        generalization. When a query is unsatisfiable, the proof
        provides the generalization. In this way, property-directed
        abstraction is achieved.
        </p>
      </abstract>
    </pub>
    <pub id="filters-tacas12">
      <title>A Bit Too Precise? Bounded Verification of Quantized Digital Filters</title>
      <authors>
  <author person="cox" student="y" />
  <author person="srirams" />
  <author person="bec" />
      </authors>
      <urls>
  <url name="pdf">papers/tacas12-filter_verification.pdf</url>
      </urls>
      <pages>33-47</pages>
      <doi>10.1007/978-3-642-28756-5_4</doi>
      <ee>http://dx.doi.org/10.1007/978-3-642-28756-5_4</ee>
      <howpub>
  <proceedings event="tacas12" />
      </howpub>
      <abstract>
  <p>Digital filters are simple yet ubiquitous components of a wide
  variety of digital processing and control systems. Errors in
  the filters can be catastrophic.  Traditionally digital
  filters have been verified using methods from control theory
  and extensive testing.  We study two alternative verification
  techniques: bit-precise analysis and real-valued error
  approximations.  In this paper, we empirically evaluate
  several variants of these two fundamental approaches for
  verifying fixed-point implementations of digital filters. We
  design our comparison to reveal the best possible approach
  towards verifying real-world designs of infinite impulse
  response (IIR) digital filters. Our study reveals broader
  insights into cases where bit-reasoning is absolutely
  necessary and suggests efficient approaches using modern
  satisfiability-modulo-theories (SMT) solvers.</p>
      </abstract>
    </pub>
    <pub id="fair-fmcad11">
      <title>An Incremental Approach to Model Checking Progress Properties</title>
      <authors>
  <author person="arbrad" />
  <author person="fabio" />
  <author person="hassanz" />
  <author person="yanzhang" />
      </authors>
      <urls>
  <url name="pdf">http://theory.stanford.edu/~arbrad/papers/fair.pdf</url>
      </urls>
      <howpub>
  <proceedings event="fmcad11" />
      </howpub>
      <abstract>
  <p>An incremental algorithm for model checking progress
  properties is proposed. It follows from the following insight:
  any SCC-closed region of a system’s state graph can be
  represented by a sequence of inductive assertions. Each
  iteration of the algorithm selects a set of states, called a
  skeleton, that together satisfy all fairness conditions; it
  then applies safety model checkers to attempt to connect the
  states into a reachable fair cycle. If this attempt fails, the
  resulting learned lemma takes one of two forms: an inductive
  reachability assertion that shows that at least one state of
  the skeleton is unreachable, or an inductive wall that defines
  two SCC-closed regions of the state graph. Subsequent
  skeletons must be chosen entirely from one side of the
  wall. Because a lemma often applies more generally than to the
  one skeleton from which it was derived, property-directed
  abstraction is achieved. The algorithm is highly
  parallelizable.</p>
      </abstract>
    </pub>
    <pub id="ptaprecision-sas11">
      <title>The Flow-Insensitive Precision of Andersen's Analysis in Practice</title>
      <authors>
  <author person="blackshear" student="y" />
  <author person="bec" />
  <author person="srirams" />
  <author person="msridhar" />
      </authors>
      <urls>
  <url name="pdf">http://www.cs.colorado.edu/~bec/papers/sas11-ptaprecision.pdf</url>
      </urls>
      <pages>60-76</pages>
      <doi>10.1007/978-3-642-23702-7_9</doi>
      <ee>http://dx.doi.org/10.1007/978-3-642-23702-7_9</ee>
      <howpub>
  <proceedings event="sas11" />
      </howpub>
      <date>2011</date>
      <note>
  <tr>
    <extendedtr />
    <number>CU-CS-1083-11</number>
          <institute>University of Colorado Boulder</institute>
    <url>http://www.cs.colorado.edu/~bec/papers/CU-CS-1083-11-ptaprecision.pdf</url>
  </tr>
      </note>
      <abstract>
  <p>We present techniques for determining the precision gap
  between Andersen's points-to analysis and precise
  flow-insensitive points-to analysis in practice.  While
  previous work has shown that such a gap may exist, no
  efficient algorithm for precise flow-insensitive analysis is
  known, making measurement of the gap on real-world programs
  difficult.  We give an algorithm for precise flow-insensitive
  analysis of programs with finite memory, based on a novel
  technique for refining any points-to analysis with a search
  for flow-insensitive witnesses.  We give a compact symbolic
  encoding of the technique that enables computing the search
  using a tuned SAT solver.  We also present extensions of the
  algorithm that enable computing lower and upper bounds on the
  precision gap in the presence of dynamic memory allocation. In
  our experimental evaluation over a suite of small- to
  medium-sized C programs, we never observed a precision gap
  between Andersen's analysis and the precise analysis. In other
  words, Andersen's analysis computed a precise flow-insensitive
  result for all of our benchmarks.  Hence, we conclude that
  while better algorithms for the precise flow-insensitive
  analysis are still of theoretical interest, their practical
  impact for C programs is likely to be negligible.</p>
      </abstract>
    </pub>
    <pub id="relationalization-cav11">
      <title>Relational Abstractions for Continuous and Hybrid Systems</title>
      <authors>
  <author person="srirams" />
  <author person="atiwari"/>
      </authors>
      <urls>
  <url name="pdf">http://www.cs.colorado.edu/~srirams/papers/cav11-relational.pdf</url>
      </urls>
      <howpub> <proceedings event="cav11" /> </howpub>
      <abstract>
  <p> In this paper, we define relational abstractions of hybrid systems.
  A relational abstraction is obtained by replacing the continuous
  dynamics in each mode by a binary transition relation that relates a
  state of the system to any state that can potentially be reached at
  some future time instant using the continuous dynamics.  We
  construct relational abstractions by reusing template-based
  invariant generation techniques for continuous systems described by
  Ordinary Differential Equations (ODE).  As a result, we abstract a
  given hybrid system as a purely discrete, infinite-state system.  We
  apply k-induction to this abstraction to prove safety properties,
  and use bounded model-checking to find potential falsifications.  We
  present the basic underpinnings of our approach and demonstrate its
  use on many benchmark systems to derive simple and usable
  abstractions. </p>
      </abstract>
    </pub>
    <pub id="linearization-hscc11">
        <title> Automatic Abstraction of Non-Linear Systems Using Change of Variables Transformations </title>
    <authors>
    <author person="srirams"/>
    </authors>
    <urls> <url name="pdf"> http://www.cs.colorado.edu/~srirams/papers/hscc11.pdf</url>
    </urls>
    <howpub>
    <proceedings event="hscc11"/>
    </howpub>
    <abstract>
 <p>      We present abstraction techniques that transform a given non-linear
  dynamical system into a linear system, such that, invariant
  properties of the resulting linear abstraction can be used to infer
  invariants for the original system. The abstraction techniques rely
  on a change of bases transformation that associates each state
  variable of the abstract system with a function involving the state
  variables of the original system. We present conditions under which
  a given change of basis transformation for a non-linear system can
  define an abstraction. </p>

<p>  Furthermore, we present a technique to discover, given a non-linear
  system, if a change of bases transformation involving degree-bounded
  polynomials yielding a linear system abstraction exists. If so, our
  technique yields the resulting abstract linear system, as well. This
  approach is further extended to search for a change of bases
  transformation that abstracts a given non-linear system into a
  system of linear differential inclusions.  Our techniques enable the
  use of analysis techniques for linear systems to infer invariants
  for non-linear systems. We present preliminary evidence of the
  practical feasibility of our ideas using a prototype implementation. </p>
    </abstract>
    </pub>
    <pub id="staliro-tool-paper">
      <title>S-Taliro: A Tool for Temporal Logic Falsification for Hybrid Systems</title>
      <authors>
  <author person="yeshwanta"/>
  <author person="liuche"/>
  <author person="fainekosg"/>
  <author person="srirams"/>
      </authors>
      <urls>
  <url name="pdf">http://www.cs.colorado.edu/~srirams/papers/sTaliro-tacas11.pdf</url>
      </urls>
      <howpub>
  <proceedings event="tacas11"/>
      </howpub>
      <abstract>
<p>S-TaLiRo is a Matlab (TM) toolbox that searches for trajectories of
minimal robustness in Simulink/Stateflow diagrams. It can analyze
arbitrary Simulink models or user defined functions that model the
system. At the heart of the tool, we use randomized testing based on
stochastic optimization techniques including Monte-Carlo methods and
Ant-Colony Optimization. Among the advantages of the toolbox is the
seamless integration inside the Matlab environment, which is widely
used in the industry for model-based development of control
software. We present the architecture of S-TaLiRo and its working on
an application example.</p>
    </abstract>
    </pub>

    <pub id="template-esop11">
    <title> Generalizing the Template Polyhedral Domain </title>
    <authors>
    <author person="colonm"/>
    <author person="srirams"/>
    </authors>
    <urls>
      <url name="pdf">http://www.cs.colorado.edu/~srirams/papers/gtp-esop10.pdf</url>
    </urls>
    <howpub>
    <proceedings event="esop11"/>
    </howpub>
    <abstract>
  <p>Template polyhedra generalize weakly relational domains by
  specifying arbitrary fixed linear expressions on the left-hand sides
  of inequalities and undetermined constants on the right. The domain
  operations required for analysis over template polyhedra can be
  computed in polynomial time using linear programming.  In this
  paper, we introduce the generalized template polyhedral domain that
  extends template polyhedra using fixed left-hand side expressions
  with bilinear forms involving program variables and unknown
  parameters to the right. We prove that the domain operations over
  generalized templates can be defined as the ``best possible
  abstractions'' of the corresponding polyhedral domain
  operations. The resulting analysis can straddle the entire space of
  linear relation analysis starting from the template domain to the
  full polyhedral domain.</p>


<p>  We show that analysis in the generalized template domain can be
  performed by dualizing the join, post-condition and widening
  operations.  We also investigate the special case of template
  polyhedra wherein each bilinear form has at most two parameters. For
  this domain, we use the special properties of two dimensional
  polyhedra and techniques from fractional linear programming to
  derive domain operations that can be implemented in polynomial time
  over the number of variables in the program and the size of the
  polyhedra. We present applications of generalized template polyhedra
  to strengthen previously obtained invariants by converting them into
  templates.  We describe an experimental evaluation of an
  implementation over several benchmark systems.</p>
    </abstract>
    </pub>
    <pub id="blame-popl11">
      <title>Blame for All</title>
      <authors>
  <author person="amal" />
  <author person="robby" />
  <author person="siek" />
  <author person="wadler" />
      </authors>
      <urls>
  <url name="pdf">http://ecee.colorado.edu/~siek/blame-forall-2011.pdf</url>
      </urls>
      <howpub>
  <proceedings event="popl11" />
      </howpub>
      <abstract>
  <p>Several programming languages are beginning to integrate
  static and dynamic typing, including Racket (formerly PLT
  Scheme), Perl 6, and C# 4.0 and the research languages Sage
  (Gronski, Knowles, Tomb, Freund, and Flanagan, 2006) and Thorn
  (Wrigstad, Eugster, Field, Nystrom, and Vitek, 2009). However,
  an important open question remains, which is how to add
  parametric polymorphism to languages that combine static and
  dynamic typing. We present a system that permits a value of
  dynamic type to be cast to a polymorphic type and vice versa,
  with relational parametricity enforced by a kind of dynamic
  sealing along the lines proposed by Matthews and Ahmed (2008)
  and Neis, Dreyer, and Rossberg (2009). Our system includes a
  notion of blame, which allows us to show that when casting
  between a more-precise type and a less-precise type, any cast
  failures are due to the less-precisely-typed portion of the
  program. We also show that a cast from a subtype to its
  supertype cannot fail.</p>
      </abstract>
    </pub>
    <pub id="stack-popl11">
      <title>Calling Context Abstraction with Shapes</title>
      <authors>
  <author person="rival" />
  <author person="bec" />
      </authors>
      <urls>
  <url name="pdf">http://www.cs.colorado.edu/~bec/papers/popl11-stack.pdf</url>
  <url name="ps">http://www.cs.colorado.edu/~bec/papers/popl11-stack.ps</url>
      </urls>
      <pages>173-186</pages>
      <doi>10.1145/1926385.1926406</doi>
      <ee>http://doi.acm.org/10.1145/1926385.1926406</ee>
      <howpub>
  <proceedings event="popl11" />
      </howpub>
      <abstract>
  <p>Interprocedural program analysis is often performed by
  computing procedure summaries.  While possible, computing
  adequate summaries is difficult, particularly in the presence
  of recursive procedures.  In this paper, we propose a
  complementary framework for interprocedural analysis based on
  a direct abstraction of the calling context.  Specifically,
  our approach exploits the inductive structure of a calling
  context by treating it directly as a stack of activation
  records.  We then build an abstraction based on separation
  logic with inductive definitions.  A key element of this
  abstract domain is the use of parameters to refine the meaning
  of such call stack summaries and thus express relations across
  activation records and with the heap.  In essence, we define
  an abstract interpretation-based analysis framework for
  recursive programs that permits a fluid per call site
  abstraction of the call stack&emdash;much like how shape analyzers
  enable a fluid per program point abstraction of the heap.</p>
      </abstract>
    </pub>
    <pub id="accessnets-vmcai11">
      <title>Access Nets: Modeling Access to Physical Spaces</title>
      <authors>
  <author person="frohardt" student="y" />
  <author person="bec" />
  <author person="srirams" />
      </authors>
      <urls>
  <url name="pdf">http://www.cs.colorado.edu/~bec/papers/accessnets-vmcai11.pdf</url>
  <url name="ps">http://www.cs.colorado.edu/~bec/papers/accessnets-vmcai11.ps</url>
      </urls>
      <pages>184-198</pages>
      <doi>10.1007/978-3-642-18275-4_14</doi>
      <ee>http://dx.doi.org/10.1007/978-3-642-18275-4_14</ee>
      <howpub>
  <proceedings event="vmcai11" />
      </howpub>
      <date>2011</date>
      <note>
  <tr>
    <extendedtr />
    <number>CU-CS-1076-10</number>
          <institute>University of Colorado Boulder</institute>
    <url>http://www.cs.colorado.edu/~bec/papers/CU-CS-1076-10.pdf</url>
      <pages>23 pages</pages>
  </tr>
      </note>
      <abstract>
  <p>Electronic, software-managed mechanisms using, for example,
  radio-frequency identification (RFID) cards, enable great
  flexibility in specifying access control policies to physical
  spaces.  For example, access rights may vary based on time of
  day or could differ in normal versus emergency situations.
  With such fine-grained control, understanding and reasoning
  about what a policy permits becomes surprisingly difficult
  requiring knowledge of permission levels, spatial layout, and
  time.  In this paper, we present a formal modeling framework,
  called <fmt kind="tool">Access Nets</fmt>, suitable for describing a
  combination of access permissions, physical spaces, and
  temporal constraints.  Furthermore, we provide evidence that
  model checking techniques are effective in reasoning about
  physical access control policies.  We describe our results
  from a tool that uses reachability analysis to validate
  security policies.</p>
      </abstract>
    </pub>
    <pub id="mix-pldi10">
      <title>Mixing Type Checking and Symbolic Execution</title>
      <authors>
  <author person="khooyp" student="y" />
  <author person="bec" />
  <author person="jfoster" />
      </authors>
      <urls>
  <url name="pdf">http://www.cs.colorado.edu/~bec/papers/pldi10-mix.pdf</url>
  <url name="ps">http://www.cs.colorado.edu/~bec/papers/pldi10-mix.ps</url>
      </urls>
      <pages>436-447</pages>
      <doi>10.1145/1809028.1806645</doi>
      <ee>http://doi.acm.org/10.1145/1809028.1806645</ee>
      <doi>10.1145/1806596.1806645</doi>
      <ee>http://doi.acm.org/10.1145/1806596.1806645</ee>
      <howpub>
  <proceedings event="pldi10" />
      </howpub>
      <date>2010</date>
      <note>
  <tr>
    <extendedtr />
    <number>CS-TR-4954</number>
          <institute>University of Maryland, College Park</institute>
    <url>http://hdl.handle.net/1903/10115</url>
      <pages>19 pages</pages>
  </tr>
      </note>
      <abstract>
  <p>Static analysis designers must carefully balance precision
  and efficiency.  In our experience, many static analysis tools
  are built around an elegant, core algorithm, but that
  algorithm is then extensively tweaked to add just enough
  precision for the coding idioms seen in practice, without
  sacrificing too much efficiency.  There are several downsides
  to adding precision in this way: the tool's implementation
  becomes much more complicated; it can be hard for an end-user
  to interpret the tool's results; and as software systems vary
  tremendously in their coding styles, it may require
  significant algorithmic engineering to enhance a tool to
  perform well in a particular software domain.</p>
  <p>In this paper, we present Mix, a novel system that mixes
  type checking and symbolic execution.  The key aspect of our
  approach is that these analyses are applied independently on
  disjoint parts of the program, in an off-the-shelf manner.  At
  the boundaries between nested type checked and symbolically
  executed code regions, we use special mix rules to communicate
  information between the off-the-shelf systems.  The resulting
  mixture is a provably sound analysis that is more precise than
  type checking alone and more efficient than exclusive symbolic
  execution.  In addition, we also describe a prototype
  implementation, <fmt kind="tool">Mixy</fmt>, for C.  Mixy
  checks for potential null dereferences by mixing a
  null/non-null type qualifier inference system with a symbolic
  executor.</p>
      </abstract>
    </pub>
    <pub id="profilers-pldi10">
      <title>Evaluating the Accuracy of Java Profilers</title>
      <authors>
  <author person="toddm" />
  <author person="diwan" />
  <author person="hauswirth" />
  <author person="sweeney" />
      </authors>
      <urls>
  <url name="pdf">papers/mytkowicz-pldi10.pdf</url>
      </urls>
      <howpub>
  <proceedings event="pldi10" />
      </howpub>
      <abstract>
  <p>
    Performance analysts profile their programs to find methods
    that are worth optimizing: the "hot" methods. This paper
    shows that four commonly-used Java profilers (xprof, hprof,
    jprofile, and yourkit) often disagree on the identity of the
    hot methods. If two profilers disagree, at least one must be
    incorrect. Thus, there is a good chance that a profiler will
    mislead a performance analyst into wasting time optimizing a
    cold method with little or no performance improvement.
  </p>
  <p>
    This paper uses causality analysis to evaluate profilers and
    to gain insight into the source of their incorrectness. It
    shows that these profilers all violate a fundamental
    requirement for sampling-based profilers: to be correct, a
    sampling-based profiler must collect samples randomly.
  </p>
  <p>
    We show that a proof-of-concept profiler, which collects
    samples randomly, does not suffer from the above
    problems. Specifically, we show, using a number of case
    studies, that our profiler correctly identifies methods that
    are important to optimize; in some cases other profilers
    report that these methods are cold and thus not worth
    optimizing.
  </p>
      </abstract>
    </pub>
    <pub id="threesomes-popl10">
      <title>Threesomes, With and Without Blame</title>
      <authors>
  <author person="siek" />
  <author person="wadler" />
      </authors>
      <urls>
  <url name="pdf">http://ecee.colorado.edu/~siek/popl10.pdf</url>
      </urls>
      <howpub>
  <proceedings event="popl10" />
      </howpub>
      <abstract>
  <p>The blame calculus of Wadler and Findler gives a high-level
  semantics to casts in higher-order languages. The coercion
  calculus of Henglein, on the other hand, provides an
  instruction set for casts whose normal forms ensure space
  efficiency. In this paper we address two questions: 1) can
  space efficiency be obtained in a high-level semantics? and 2)
  can we precisely characterize the relationship between the
  high and low-level semantics of casts? Towards answering both
  of these questions, we design a cast calculus that summarizes
  a sequence of casts as a threesome cast that contains a source
  type, a target type, and a third middle type that is the
  greatest lower bound of all the types in the sequence. We show
  that the threesome calculus is equivalent to the blame
  calculus and to one of the coercion-based, blame-tracking
  calculi of Siek, Garcia, and Taha. We also show that the
  threesome calculus is space efficient and obtain a tighter
  bound than that of Herman, Tomb, and Flanagan.</p>
      </abstract>
    </pub>
    <pub id="incremental-gpce10">
      <title>Incremental Type-Checking for Type-Reflective Metaprograms</title>
      <authors>
  <author person="miao" />
  <author person="siek" />
      </authors>
      <urls>
  <url name="pdf">http://ecee.colorado.edu/~siek/gpce10.pdf</url>
      </urls>
      <howpub>
  <proceedings event="gpce10" />
      </howpub>
      <abstract>
  <p></p>
      </abstract>
    </pub>
    <pub id="invalidation-cgo10">
      <title>An Efficient Software Transactional Memory Using Commit-Time Invalidation</title>
      <authors>
  <author person="gottschlich" />
  <author person="vachharajani" />
  <author person="siek" />
      </authors>
      <urls>
  <url name="pdf">http://ecee.colorado.edu/~siek/cgo10.pdf</url>
      </urls>
      <howpub>
  <proceedings event="cgo10" />
      </howpub>
      <abstract>
  <p>To improve the performance of transactional memory (TM),
  researchers have found many eager and lazy optimizations for
  conflict detection, the process of determining if transactions
  can commit. Despite these optimizations, nearly all TMs
  perform one aspect of lazy conflict detection in the same
  manner to preserve serializability. That is, they perform
  commit-time validation, where a transaction is checked for
  conflicts with previously committed transactions during its
  commit phase. While commit-time validation is efficient for
  workloads that exhibit limited contention, it can limit
  transaction throughput for contending workloads.

        This paper presents an efficient implementation of commit-time
        invalidation, a strategy where transactions resolve their
        conflicts with in-flight (uncommitted) transactions before
        they commit. Commit-time invalidation supplies the contention
        manager (CM) with data that is unavailable through commit-time
        validation, allowing the CM to make decisions that increase
        transaction throughput. Commit-time invalidation also requires
        notably fewer operations than commit-time validation for
        memory-intensive transactions, uses zero commit-time
        operations for dynamically detected read-only transactions,
        and guarantees full opacity for any transaction in O(N) time,
        an improvement over incremental validation's O(N2) time. Our
        experimental results show that for contending workloads, our
        efficient commit-time invalidating software TM (STM) is up to
        3 x faster than TL2, a state-of-the-art validating STM.</p>
      </abstract>
    </pub>
    <pub id="ssg-esop10">
      <title>Separating Shape Graphs</title>
      <authors>
  <author person="laviron" student="y" />
  <author person="bec" />
  <author person="rival" />
      </authors>
      <urls>
  <url name="pdf">http://www.cs.colorado.edu/~bec/papers/esop10-sepshapegraph.pdf</url>
      </urls>
      <pages>387-406</pages>
      <doi>10.1007/978-3-642-11957-6_21</doi>
      <ee>http://dx.doi.org/10.1007/978-3-642-11957-6_21</ee>
      <howpub>
    <proceedings event="esop10" />
      </howpub>
      <abstract>
  <p>Detailed memory models that expose individual fields are
  necessary to precisely analyze code that makes use of
  low-level aspects such as, pointers to fields and untagged
  unions.  Yet, higher-level representations that collect fields
  into records are often used because they are typically more
  convenient and efficient in modeling the program heap.  In
  this paper, we present a shape graph representation of memory
  that exposes individual fields while largely retaining the
  convenience of an object-level model.  This representation has
  a close connection to particular kinds of formulas in
  separation logic.  Then, with this representation, we show how
  to extend the <fmt kind="tool">Xisa</fmt> shape analyzer for
  low-level aspects, including pointers to fields, C-style
  nested structures and unions, malloc and free, and array
  values, with minimal changes to the core algorithms (e.g.,
  materialization and summarization).</p>
      </abstract>
    </pub>
    <pub id="gradprog-pldifit09">
      <title>Gradual Programming: Bridging the Semantic Gap (Position Paper)</title>
      <authors>
  <author person="bec" />
  <author person="diwan" />
  <author person="siek" />
      </authors>
      <urls>
  <url name="pdf">http://www.cs.colorado.edu/~bec/papers/pldifit09-gradprog.pdf</url>
      </urls>
      <pages>2 pages</pages>
      <howpub>
  <proceedings event="pldi-fit09" />
      </howpub>
    </pub>

    <pub id="bto-sc09">
      <title>Automating the Generation of Composed Linear Algebra Kernels</title>
      <authors>
  <author person="belter" />
  <author person="jessup" />
  <author person="karlin" />
  <author person="siek" />
      </authors>
      <urls>
  <url name="pdf">http://ecee.colorado.edu/~siek/sc09.pdf</url>
      </urls>
      <howpub>
  <proceedings event="sc09" />
      </howpub>
      <abstract>
  <p>Memory bandwidth limits the performance of important
  kernels in many scientific applications. Such applications
  often use sequences of Basic Linear Algebra Subprograms
  (BLAS), and highly efficient implementations of those routines
  enable scientists to achieve high performance at little
  cost. However, tuning the BLAS in isolation misses
  opportunities for memory optimization that result from
  composing multiple subprograms. Because it is not practical to
  create a library of all BLAS combinations, we have developed a
  domain-specific compiler that generates them on demand. In
  this paper, we describe a novel algorithm for compiling linear
  algebra kernels and searching for the best combination of
  optimization choices. We also present a new hybrid
  analytic/empirical method for quickly evaluating the
  profitability of each optimization. We report experimental
  results showing speedups of up to 130% relative to the
  GotoBLAS on an AMD Opteron and up to 137% relative to MKL on
  an Intel Core 2.</p>
      </abstract>
    </pub>
  </publications>

  <persons>
    <person id="cernyp" group="faculty-alumni">
      <name>Pavol Černý</name>
      <url>http://ecee.colorado.edu/pavol/</url>
      <face>pics/cerny.jpg</face>
    </person>
    <person id="bec" group="faculty">
      <name>Bor-Yuh Evan Chang</name>
      <url>http://www.cs.colorado.edu/~bec/</url>
      <face>pics/chang.jpg</face>
    </person>
    <person id="ddig" group="faculty">
      <name>Danny Dig</name>
      <url>https://danny.cs.colorado.edu/</url>
      <face>pics/generic-male.png</face>
    </person>
    <person id="diwan" group="faculty-alumni">
      <name>Amer Diwan</name>
      <url>http://www.cs.colorado.edu/~diwan/</url>
      <face>pics/diwan.jpg</face>
    </person>
    <person id="grunwald" group="faculty">
      <name>Dirk Grunwald</name>
      <url>http://systems.cs.colorado.edu/people/faculty/dirk-grunwald/</url>
      <face>pics/grunwald.jpg</face>
    </person>
    <person id="gkaki" group="faculty">
      <name>Gowtham Kaki</name>
      <url>https://gowthamk.github.io/</url>
      <face>pics/generic-male.png</face>
    </person>
    <person id="hammer" group="faculty-alumni">
      <name>Matthew A. Hammer</name>
      <url>http://matthewhammer.org</url>
      <face>pics/hammer.png</face>
    </person>
    <person id="srirams" group="faculty">
      <name>Sriram Sankaranarayanan</name>
      <url>http://www.cs.colorado.edu/~srirams/</url>
      <face>pics/sankaranarayanan.jpg</face>
    </person>
    <person id="bshapiro" group="faculty">
      <name>Ben Shapiro</name>
      <url>http://benshapi.ro/</url>
      <face>pics/generic-male.png</face>
    </person>
    <person id="siek" group="faculty-alumni">
      <name>Jeremy G. Siek</name>
      <url>http://ecee.colorado.edu/~siek/</url>
      <face>pics/siek.jpg</face>
    </person>
    <person id="fabio" group="faculty">
      <name>Fabio Somenzi</name>
      <url>http://vlsi.colorado.edu/~fabio/</url>
      <face>pics/somenzi.jpg</face>
    </person>
    <person id="atrivedi" group="faculty">
      <name>Ashutosh Trivedi</name>
      <url>http://www.cs.colorado.edu/~astr3586/</url>
      <face>pics/ashutosh.jpg</face>
    </person>
    <person id="mzamani" group="faculty">
      <name>Majid Zamani</name>
      <url>https://sites.google.com/site/zamani1362/home</url>
      <face>pics/mzamani.png</face>
    </person>
    <person id="elam" group="scientist-alumni">
      <name>Edmund S.L. Lam</name>
      <face>pics/elam.png</face>
    </person>
    <person id="abensassi" group="postdoc-alumni">
      <name>Mohamed Amin Ben Sassi</name>
      <face>pics/aminbensassi.png</face>
    </person>
    <person id="xinchen" group="postdoc-alumni">
      <name>Xin Chen</name>
      <face>pics/xinchen.jpg</face>
      <url>https://www.cs.colorado.edu/~xich8622/</url>
    </person>
    <person id="smover" group="postdoc-alumni">
      <name>Sergio Mover</name>
      <face>pics/smover.jpg</face>
      <url>http://www.sergiomover.eu/</url>
    </person>
    <person id="yvoronin" group="postdoc-alumni">
      <name>Yuen-Lam Voronin</name>
      <url>http://www.cs.colorado.edu/~yuvo9296/</url>
      <face>pics/yvoronin.jpg</face>
    </person>
    <person id="belter" group="phd-alumni">
      <name>Geoffrey Belter</name>
      <face>pics/generic-male.png</face>
    </person>
    <person id="blackshear" group="phd-alumni">
      <name>Sam Blackshear</name>
      <url>http://cs.colorado.edu/~sabl4745</url>
      <face>pics/blackshear.jpg</face>
    </person>
    <person id="chakarov" group="phd-alumni">
      <name>Aleksandar Chakarov</name>
      <url>http://plv.colorado.edu/chakarov.html</url>
      <face>pics/chakarov.jpg</face>
    </person>
    <person id="ychou" group="phd-alumni">
      <name>Chou Yi</name>
      <face>pics/ychou.jpg</face>
    </person>
    <person id="coughlin" group="phd-alumni">
      <name>Devin Coughlin</name>
      <face>pics/coughlin.jpg</face>
      <url>http://www.cs.colorado.edu/~coughlid</url>
    </person>
    <person id="cox" group="phd-alumni">
      <name>Arlen Cox</name>
      <url>http://eces.colorado.edu/~coxaj/</url>
      <face>pics/cox.jpg</face>
    </person>
    <person id="jculak">
      <name>Juraj Culak</name>
      <face>pics/jculak.png</face>
    </person>
    <person id="tdohmen" group="phd">
      <name>Taylor Dohmen</name>
      <face>pics/generic-male.png</face>
    </person>
    <person id="mdooley" group="phd-alumni">
      <name>Michael Dooley</name>
      <face>pics/mdooley.jpg</face>
    </person>
    <person id="sdutta" group="phd-alumni">
      <name>Souradeep Dutta</name>
      <face>pics/sdutta.png</face>
      <url>https://sites.google.com/site/duttasouradeep39/</url>
    </person>
    <person id="deflores" group="phd">
      <name>David Flores</name>
      <face>pics/flores.jpg</face>
      <url>https://plv.colorado.edu/deflores</url>
    </person>
    <person id="cfontenot" group="phd">
      <name>Christian Fontenot</name>
      <face>pics/cfontenot.jpg</face>
      <url>https://chfont.github.io</url>
    </person>
    <person id="frohardt">
      <name>Robert Frohardt</name>
      <url>http://www.cs.colorado.edu/~frohardt/</url>
    </person>
    <person id="agendreau">
      <name>Alexandra Gendreau</name>
      <url>http://www.cs.colorado.edu/~alge6158/</url>
      <face>pics/gendreau.jpg</face>
    </person>
    <person id="gottschlich" group="phd-alumni">
      <name>Justin E. Gottschlich</name>
      <face>pics/generic-male.png</face>
    </person>
    <person id="kheadley">
      <name>Kyle Headley</name>
      <url>http://kyleheadley.github.io/PHDWebsite/</url>
      <face>pics/headley.jpg</face>
    </person>
    <person id="karlin" group="phd-alumni">
      <name>Ian Karlin</name>
      <face>pics/karlin.jpg</face>
    </person>
    <person id="ykim">
      <name>Youngsung Kim</name>
      <face>pics/ykim.png</face>
    </person>
    <person id="jkomp" group="phd">
      <name>John Komp</name>
      <face>pics/generic-male.png</face>
    </person>
    <person id="tkushner" group="phd-alumni">
      <name>Taisa Kushner</name>
      <face>pics/tkushner.png</face>
    </person>
    <person id="nlewchenko" group="phd">
      <name>Nicholas V. Lewchenko</name>
      <face>pics/nlewchenko.jpg</face>
      <url>https://www.octalsrc.org/research</url>
    </person>
    <person id="klinvill" group="phd">
      <name>Kirby Linvill</name>
      <face>pics/klinvill.jpg</face>
      <url>https://kirby.linvill.net</url>
    </person>
    <person id="tlu" group="phd">
      <name>Tianhan Lu</name>
      <url>https://plv.colorado.edu/tianhan/</url>
      <face>pics/tianhan.jpg</face>
    </person>
    <person id="jmartin">
      <name>Jack Martin</name>
      <face>pics/generic-male.png</face>
    </person>
    <person id="mcclurg" group="phd-alumni">
      <name>Jedidiah McClurg</name>
      <url>http://www.jrmcclurg.com/</url>
      <face>pics/mcclurg.jpg</face>
    </person>
    <person id="smeier" group="phd">
      <name>Shawn Meier</name>
      <url>http://plv.colorado.edu/shawn/</url>
      <face>pics/meier.jpg</face>
    </person>
    <person id="miao" group="phd-alumni">
      <name>Weiyu Miao</name>
      <face>pics/miao.jpg</face>
    </person>
    <person id="vmurali" group="phd">
      <name>Vishnu Murali</name>
      <face>pics/generic-male.png</face>
    </person>
    <person id="dmoon">
      <name>David Moon</name>
      <face>pics/moon.jpg</face>
      <url>https://plv.colorado.edu/dmoon</url>
    </person>
    <person id="toddm" group="phd-alumni">
      <name>Todd Mytkowicz</name>
      <url>http://research.microsoft.com/en-us/people/toddm/</url>
      <face>pics/mytkowicz.jpg</face>
    </person>
    <person id="cknagesh" group="phd">
      <name>Chandra Kanth Nagesh</name>
      <url>https://ck090.github.io/</url>
      <face>pics/cknagesh.jpeg</face>
    </person>
    <person id="mnarasimhamurthy" group="phd">
      <name>Monal Narasimhamurthy</name>
      <face>pics/mnarasimhamurthy.jpg</face>
    </person>
    <person id="nelson" group="phd-alumni">
      <name>Thomas Nelson</name>
      <face>pics/nelson.jpg</face>
    </person>
    <person id="sniari" group="phd-alumni">
      <url>https://sites.google.com/a/colorado.edu/saeid-tizpaz-niari/</url>
      <name>Saeid Tizpaz Niari</name>
      <face>pics/tizpaz.jpg</face>
    </person>
    <person id="mperez" group="phd">
      <name>Mateo Perez</name>
      <face>pics/generic-male.png</face>
    </person>
    <person id="pprahladan" group="phd">
      <name>Prasanth Prahladan</name>
      <face>pics/generic-male.png</face>
    </person>
    <person id="rwajid" group="phd">
      <name>Rameez Wajid</name>
      <url>https://rameezw.github.io/</url>
      <face>pics/rwajid.jpeg</face>
    </person>
    <person id="hravanbakhsh" group="phd-alumni">
      <name>Hadi Ravanbakhsh</name>
      <face>pics/ravanbakhsh.png</face>
    </person>
    <person id="creichen" group="phd-alumni">
      <name>Christoph Reichenbach</name>
      <url>http://www.cs.umass.edu/~creichen/</url>
      <face>pics/reichenbach.png</face>
    </person>
    <person id="bstein" group="phd-alumni">
      <name>Benno Stein</name>
      <url>http://plv.colorado.edu/benno</url>
      <face>pics/stein.png</face>
    </person>
    <person id="wtemple">
      <name>William Temple</name>
      <face>pics/wtemple.jpg</face>
    </person>
    <person id="vitousek">
      <name>Michael Vitousek</name>
      <face>pics/vitousek.jpg</face>
    </person>
    <person id="wailes">
      <name>Chris Wailes</name>
      <face>pics/generic-male.png</face>
    </person>
    <person id="jwright">
      <name>Jared Wright</name>
      <face>pics/jwright.jpg</face>
      <url>http://plv.colorado.edu/jwright</url>
    </person>
    <person id="hyoon" group="phd-alumni">
      <name>Hansol Yoon</name>
      <face>pics/hyoon.png</face>
      <url>https://hansolyoon.github.io/</url>
    </person>
    <person id="yanzhang" group="phd-alumni">
      <name>Yan Zhang</name>
      <face>pics/zhang.png</face>
    </person>
    <person id="adityaz" group="phd-alumni">
      <name>Aditya Zutshi</name>
      <face>pics/zutshi.jpg</face>
    </person>
    <person id="emillican" group="bs">
      <name>Emily Millican</name>
      <face>pics/generic-female.png</face>
    </person>
    <person id="rholland" group="bsms-alumni">
      <name>Ross Holland</name>
      <face>pics/rholland.jpg</face>
    </person>
    <person id="khowell" group="bsms-alumni">
      <name>Kyle Howell</name>
      <face>pics/khowell.jpg</face>
    </person>
    <person id="quan" group="bsms-alumni">
      <name>Kira Quan</name>
      <face>pics/quan.jpg</face>
    </person>
    <person id="silkensen" group="bsms-alumni">
      <name>Erik Silkensen</name>
      <url>http://csel.cs.colorado.edu/~silkense</url>
      <face>pics/silkensen.jpg</face>
    </person>
    <person id="agrawal" group="ms-alumni">
      <name>Neelam Agrawal</name>
      <face>pics/generic-female.png</face>
    </person>
    <person id="bennett" group="ms-alumni">
      <name>Huck Bennett</name>
      <url>http://csel.cs.colorado.edu/~bennethd</url>
      <face>pics/bennett.jpg</face>
    </person>
    <person id="bharadwaj" group="ms-alumni">
      <name>Shashank Bharadwaj</name>
      <face>pics/bharadwaj.jpg</face>
    </person>
    <person id="rdiwakaran" group="ms-alumni">
      <name>Ram Das Diwakaran</name>
      <face>pics/rdiwakaran.jpg</face>
    </person>
    <person id="deconomou" group="ms-alumni">
      <name>Dimitrios Economou</name>
      <face>pics/deconomou.jpg</face>
    </person>
    <person id="aguttman" group="ms-alumni">
      <name>Andrew Guttman</name>
      <face>pics/aguttman.png</face>
    </person>
    <person id="njagnik" group="ms-alumni">
      <name>Nilesh Jagnik</name>
      <face>pics/njagnik.jpg</face>
    </person>
    <person id="skumar" group="ms-alumni">
      <name>Suhas Akshar Kumar</name>
      <face>pics/generic-male.png</face>
    </person>
    <person id="aniket" group="ms-alumni">
      <name>Aniket Kumar Lata</name>
      <face>pics/aniket.jpg</face>
    </person>
    <person id="clin" group="ms-alumni">
      <name>Chih-Wei Lin</name>
      <face>pics/clin.jpg</face>
    </person>
    <person id="aphatak" group="ms-alumni">
      <name>Aniruddha Phatak</name>
      <face>pics/generic-male.png</face>
    </person>
    <person id="arajeswari" group="ms-alumni">
      <name>Athithyaa Panchapakesan Rajeswari</name>
      <face>pics/athithyaa.jpg</face>
    </person>
    <person id="sramani" group="ms-alumni">
      <name>Santhanakrishnan Ramani</name>
      <face>pics/generic-male.png</face>
    </person>
    <person id="vsingh" group="ms-alumni">
      <name>Vaibhav Singh</name>
      <face>pics/vsingh.jpg</face>
    </person>
    <person id="nshanmuganathan" group="ms">
      <name>Nagarajan Shanmuganathan</name>
      <face>pics/generic-male.png</face>
    </person>
    <person id="ksripada" group="ms-alumni">
      <name>Krishna Chaitanya Sripada</name>
      <face>pics/ksripada.jpg</face>
    </person>
    <person id="tsai" group="ms-alumni">
      <name>Yi-Fan Tsai</name>
      <face>pics/tsai.jpg</face>
    </person>
    <person id="turner" group="ms-alumni">
      <name>Jonathan Turner</name>
      <face>pics/turner.jpg</face>
    </person>
    <person id="avillani" group="ms-alumni">
      <name>Anna Villani</name>
      <face>pics/avillani.jpg</face>
    </person>
    <person id="beal" group="bs-alumni">
      <name>Alex Beal</name>
      <face>pics/beal.png</face>
    </person>
    <person id="pevans" group="bs-alumni">
      <name>Parker Evans</name>
      <face>pics/generic-male.png</face>
    </person>
    <person id="dfisher" group="bs-alumni">
      <name>Dakota Fisher</name>
      <face>pics/generic-male.png</face>
    </person>
    <person id="agaonkar" group="bs-alumni">
      <name>Akash Gaonkar</name>
      <face>pics/generic-male.png</face>
    </person>
    <person id="givens" group="bs-alumni">
      <name>Paul Givens</name>
      <face>pics/pgivens.jpg</face>
    </person>
    <person id="lapinski" group="bs-alumni">
      <name>Nathan Lapinksi</name>
      <face>pics/generic-male.png</face>
    </person>
    <person id="jlecavalier" group="bs-alumni">
      <name>Jay Lecavlier</name>
      <face>pics/generic-male.png</face>
    </person>
    <person id="aokeson" group="bs-alumni">
      <name>Alexandra Okeson</name>
      <face>pics/generic-female.png</face>
    </person>
    <person id="rolsen" group="bs-alumni">
      <name>Rhys Braginton Pettee Olsen</name>
      <face>pics/rolsen.jpg</face>
    </person>
    <person id="eroncevich" group="bs-alumni">
      <name>Evan Roncevich</name>
      <face>pics/eroncevich.png</face>
    </person>
    <person id="croberts" group="bs-alumni">
      <name>Chance Roberts</name>
      <face>pics/generic-male.png</face>
    </person>
    <person id="mrussek" group="bs-alumni">
      <name>Max Russek</name>
      <face>pics/generic-male.png</face>
    </person>
    <person id="pzhang" group="bs-alumni">
      <name>Peilun Zhang</name>
      <face>pics/pzhang.jpg</face>
      <url>http://peilun.org</url>
    </person>
    <person id="vanderweit" group="bs-alumni">
      <name>Nicholas Vanderweit</name>
      <face>pics/vanderweit.jpg</face>
    </person>
    <person id="tgrohens" group="gradintern-alumni">
      <name>Théotime Grohens</name>
      <face>pics/generic-male.png</face>
    </person>
    <person id="skeenan" group="ugintern">
      <name>Sydney Keenan</name>
      <face>pics/generic-female.png</face>
    </person>
    <person id="proux" group="visitor-alumni">
      <name>Pierre Roux</name>
      <face>pics/proux.jpg</face>
      <url>http://perso.ens-lyon.fr/pierre.roux/</url>
    </person>
    <person id="vachharajani">
      <name>Manish Vachharajani</name>
      <url>http://ecee.colorado.edu/~manishv/</url>
      <face>pics/generic-male.png</face>
    </person>
    <person id="blomstedt">
      <name>Joseph Blomstedt</name>
      <face>pics/generic-male.png</face>
    </person>
    <person id="arbrad">
      <name>Aaron R. Bradley</name>
      <url>http://ece.colorado.edu/~bradleya/</url>
    </person>
    <person id="msridhar">
      <name>Manu Sridharan</name>
      <url>http://manu.sridharan.net</url>
      <face>pics/sridharan.jpg</face>
    </person>
    <person id="berdine">
      <name>Josh Berdine</name>
      <url>http://research.microsoft.com/en-us/people/jjb</url>
    </person>
    <person id="ishtiaq">
      <name>Samin Ishtiaq</name>
      <url>http://research.microsoft.com/en-us/people/sishtiaq</url>
    </person>
    <person id="jessup">
      <name>E.R. Jessup</name>
      <url>http://www.cs.colorado.edu/~jessup/</url>
    </person>
    <person id="khooyp">
      <name>Khoo Yit Phang</name>
      <url>http://www.cs.umd.edu/~khooyp/</url>
    </person>
    <person id="jfoster">
      <name>Jeffrey S. Foster</name>
      <url>http://www.cs.umd.edu/~jfoster/</url>
    </person>
    <person id="laviron">
      <name>Vincent Laviron</name>
    </person>
    <person id="rival">
      <name>Xavier Rival</name>
      <url>http://www.di.ens.fr/~rival/</url>
    </person>
    <person id="toubhans">
      <name>Antoine Toubhans</name>
      <url>http://www.di.ens.fr/~toubhans/</url>
    </person>
    <person id="atiwari">
      <name>Ashish Tiwari</name>
      <url>http://csl.sri.com/~tiwari/</url>
    </person>
    <person id="colonm">
      <name>Michael Colon</name>
    </person>
    <person id="fp">
      <name>Frank Pfenning</name>
      <url>http://www.cs.cmu.edu/~fp/</url>
    </person>
    <person id="astump">
      <name>Aaron Stump</name>
      <url>http://www.cs.uiowa.edu/~astump/</url>
    </person>
    <person id="cesar">
      <name>César Sánchez</name>
      <url>http://software.imdea.org/~cesar/</url>
    </person>
    <person id="asanchez">
      <name>Alejandro Sánchez</name>
      <url>http://software.imdea.org/people/alejandro.sanchez/index.html</url>
    </person>
    <person id="swarat">
      <name>Swarat Chaudhuri</name>
      <url>http://www.cse.psu.edu/~swarat/</url>
    </person>
    <person id="putot">
      <name>Sylvie Putot</name>
      <url>http://www.lix.polytechnique.fr/Labo/Sylvie.Putot/</url>
    </person>
    <person id="goubault">
      <name>Eric Goubault</name>
      <url>http://www.lix.polytechnique.fr/~goubault/</url>
    </person>
    <person id="bycook">
      <name>Byron Cook</name>
      <url>http://research.microsoft.com/en-us/people/bycook/</url>
    </person>
    <person id="wintersteiger">
      <name>Christoph Wintersteiger</name>
      <url>http://research.microsoft.com/en-us/people/cwinter</url>
    </person>
    <person id="chaowang">
      <name>Chao Wang</name>
      <url>http://www.nec-labs.com/~chaowang/</url>
    </person>
    <person id="ivancic">
      <name>Franjo Ivančić</name>
      <url>http://www.nec-labs.com/~ivancic/</url>
      <face>pics/ivancic.jpg</face>
    </person>
    <person id="burtscher">
      <name>Martin Burtscher</name>
      <url>http://www.cs.txstate.edu/~mb92/</url>
    </person>
    <person id="bradchen">
      <name>Brad Chen</name>
      <url>http://research.google.com/pubs/author37895.html</url>
    </person>
    <person id="bodik">
      <name>Rastislav Bodik</name>
      <url>http://www.cs.berkeley.edu/~bodik/</url>
    </person>
    <person id="bcpierce">
      <name>Benjamin C. Pierce</name>
      <url>http://www.cis.upenn.edu/~bcpierce/</url>
    </person>
    <person id="birkedal">
      <name>Lars Birkedal</name>
      <url>http://www.itu.dk/~birkedal/</url>
    </person>
    <person id="mstrout">
      <name>Michelle Mills Strout</name>
      <url>http://www.cs.colostate.edu/~mstrout/</url>
    </person>
    <person id="ssuryana">
      <name>Siddharth Suryanarayanan</name>
      <url>http://www.engr.colostate.edu/~ssuryana/</url>
    </person>
    <person id="fainekosg">
      <name>Georgios Fainekos</name>
      <url>http://www.public.asu.edu/~gfaineko/</url>
    </person>
    <person id="yeshwanta">
      <name>Yashwant Annapureddy</name>
    </person>
    <person id="liuche">
      <name>Che Liu</name>
    </person>
    <person id="amal">
      <name>Amal Ahmed</name>
      <url>https://www.cs.indiana.edu/~amal/</url>
    </person>
    <person id="robby">
      <name>Robert Bruce Findler</name>
      <url>http://www.eecs.northwestern.edu/~robby/</url>
    </person>
    <person id="wadler">
      <name>Philip Wadler</name>
      <url>http://homepages.inf.ed.ac.uk/wadler/</url>
    </person>
    <person id="sweeney">
      <name>Peter F. Sweeney</name>
      <url>https://researcher.ibm.com/researcher/view.php?person=us-pfs</url>
    </person>
    <person id="hauswirth">
      <name>Matthias Hauswirth</name>
      <url>http://www.inf.usi.ch/faculty/hauswirth/</url>
    </person>
    <person id="hassanz">
      <name>Zyad Hassan</name>
      <url>http://eces.colorado.edu/~hassanz/</url>
    </person>
    <person id="schramme">
      <name>Peter Schrammel</name>
      <url>http://pop-art.inrialpes.fr/people/schramme/</url>
    </person>
    <person id="bjeannet">
      <name>Bertrand Jeannet</name>
      <url>http://pop-art.inrialpes.fr/~bjeannet/</url>
    </person>
    <person id="thiagu">
      <name>P.S. Thiagarajan</name>
      <url>http://www.comp.nus.edu.sg/~thiagu/</url>
    </person>
    <person id="tyeh">
      <name>Tom Yeh</name>
      <url>http://www.tomyeh.info/</url>
    </person>
    <person id="slahiri">
      <name>Shuvendu Lahiri</name>
      <url>http://research.microsoft.com/~shuvendu/</url>
    </person>
    <person id="sarnat">
      <name>Jeffrey Sarnat</name>
      <face>pics/sarnat.jpg</face>
    </person>
    <person id="sumitg">
      <name>Sumit Gulwani</name>
      <url>http://research.microsoft.com/~sumitg/</url>
    </person>
    <person id="tah">
      <name>Thomas A. Henzinger</name>
      <url>http://pub.ist.ac.at/~tah/</url>
    </person>
    <person id="erikaabraham">
      <name>Erika Abraham</name>
    </person>
    <person id="aradhakrishna">
      <name>Arjun Radhakrishna</name>
      <url>http://www.seas.upenn.edu/~arjunrad/</url>
    </person>
    <person id="ttarrach">
      <name>Thorsten Tarrach</name>
      <url>http://pub.ist.ac.at/~ttarrach/</url>
    </person>
    <person id="sumitjha">
      <name>Sumit K. Jha</name>
      <url>http://www.eecs.ucf.edu/~jha/</url>
    </person>
    <person id="bolz">
      <name>Carl Friedrich Bolz</name>
      <url>http://cfbolz.de/</url>
    </person>
    <person id="vardi">
      <name>Moshe Vardi</name>
      <url>http://www.rice.edu/~vardi</url>
    </person>
    <person id="gcastagna">
      <name>Giuseppe Castagna</name>
    </person>
    <person id="hjboehm">
      <name>Hans-Juergen Boehm</name>
    </person>
    <person id="cflanagan">
      <name>Cormac Flanagan</name>
    </person>
    <person id="rgiacobazzi">
      <name>Roberto Giacobazzi</name>
    </person>
    <person id="imastroeni">
      <name>Isabella Mastroeni</name>
    </person>
    <person id="ekowalczyk">
      <name>Emily Kowalczyk</name>
    </person>
    <person id="amemon">
      <name>Atif Memon</name>
    </person>
    <person id="kalharbi">
      <name>Khalid Alharbi</name>
    </person>
    <person id="kmcmillan">
      <name>Kenneth L. McMillan</name>
      <url>http://www.kenmcmil.com/</url>
    </person>
    <person id="flogozzo">
      <name>Francesco Logozzo</name>
      <url>http://research.microsoft.com/en-us/people/logozzo/</url>
    </person>
    <person id="mfahndrich">
      <name>Manuel Fähndrich</name>
    </person>
    <person id="eschkufza">
      <name>Eric Schkufza</name>
      <url>http://cs.stanford.edu/people/eschkufz/</url>
      <face>pics/eschkufza.jpg</face>
    </person>
    <person id="cdimoulas">
      <name>Christos Dimoulas</name>
      <url>http://people.seas.harvard.edu/~chrdimo/</url>
      <face>pics/cdimoulas.jpg</face>
    </person>
    <person id="jdeshmukh">
      <name>Jyotirmoy V. Deshmukh</name>
      <url>http://www.cs.utexas.edu/~deshmukh/</url>
    </person>
    <person id="jkapinski">
      <name>James Kapinski</name>
    </person>
    <person id="nnarodytska">
      <name>Nina Narodytska</name>
      <url>http://www.cse.unsw.edu.au/~ninan/</url>
      <face>pics/nnarodytska.jpg</face>
    </person>
    <person id="lryzhyk">
      <name>Leonid Ryzhyk</name>
      <url>http://www.cs.cmu.edu/~ryzhyk/</url>
      <face>pics/lryzhyk.jpg</face>
    </person>
    <person id="lkovacs">
      <name>Laura Kovács</name>
      <url>http://www.cse.chalmers.se/~laurako/</url>
    </person>
    <person id="jzwirchmayr">
      <name>Jakob Zwirchmayr</name>
    </person>
    <person id="hojjat">
      <name>Hossein Hojjat</name>
      <url>http://www.cs.cornell.edu/~hojjat/</url>
    </person>
    <person id="jnfoster">
      <name>Nate Foster</name>
      <url>http://www.cs.cornell.edu/~jnfoster/</url>
    </person>
    <person id="jdennis">
      <name>John Dennis</name>
      <url>http://www.cisl.ucar.edu/staff/dennis.html</url>
    </person>
    <person id="ralur">
      <name>Rajeev Alur</name>
      <url>https://www.cis.upenn.edu/~alur/</url>
    </person>
    <person id="eclarke">
      <name>Edmund M. Clarke</name>
      <url>http://www.cs.cmu.edu/~emc/</url>
    </person>
    <person id="rsamanta">
      <name>Roopsha Samanta</name>
      <url>http://pub.ist.ac.at/~rsamanta/</url>
    </person>
    <person id="mnaik">
      <name>Mayur Naik</name>
      <url>http://pag.gatech.edu/naik/</url>
      <face>pics/mnaik.jpg</face>
    </person>
    <person id="kanderson">
      <name>Kenneth M. Anderson</name>
      <url>http://www.cs.colorado.edu/~kena/</url>
    </person>
    <person id="jblack">
      <name>John Black</name>
      <url>http://www.cs.colorado.edu/~jrblack/</url>
    </person>
    <person id="idillig">
      <name>Işıl Dillig</name>
      <url>http://www.cs.utexas.edu/~isil/</url>
    </person>
    <person id="mheule">
      <name>Marijn J. H. Heule</name>
      <url>http://www.cs.utexas.edu/~marijn/</url>
    </person>
    <person id="hsipma">
      <name>Henny Sipma</name>
    </person>
    <person id="hli">
      <name>Huisong Li</name>
    </person>
    <person id="jdunfield">
      <name>Joshua Dunfield</name>
      <url>http://www.cs.ubc.ca/~joshdunf/</url>
    </person>
    <person id="nlabich">
      <name>Nicholas Labich</name>
    </person>
    <person id="mhicks">
      <name>Michael Hicks</name>
      <url>http://www.cs.umd.edu/~mwh/</url>
    </person>
    <person id="dvanhorn">
      <name>David Van Horn</name>
      <url>https://www.cs.umd.edu/~dvanhorn/</url>
    </person>
    <person id="tball">
      <name>Thomas Ball</name>
      <face>pics/tball.jpg</face>
      <url>http://research.microsoft.com/en-us/people/tball/</url>
    </person>
    <person id="blivshits">
      <name>Benjamin Livshits</name>
      <url>http://research.microsoft.com/en-us/um/people/livshits/</url>
    </person>
    <person id="ysmaragdakis">
      <name>Yannis Smaragdakis</name>
      <url>https://yanniss.github.io/</url>
    </person>
    <person id="olhotak">
      <name>Ondřej Lhoták</name>
      <url>https://plg.uwaterloo.ca/~olhotak/</url>
    </person>
    <person id="jamaral">
      <name>J. Nelson Amaral</name>
      <url>https://webdocs.cs.ualberta.ca/~amaral/</url>
    </person>
    <person id="sguyer">
      <name>Samuel Z. Guyer</name>
      <url>http://www.cs.tufts.edu/~sguyer/</url>
    </person>
    <person id="ukhedker">
      <name>Uday P. Khedker</name>
      <url>https://www.cse.iitb.ac.in/~uday/</url>
    </person>
    <person id="amoeller">
      <name>Anders Møller</name>
      <url>https://cs.au.dk/~amoeller/</url>
    </person>
    <person id="dvardoulakis">
      <name>Dimitrios Vardoulakis</name>
      <url>http://dimvar.github.io/</url>
    </person>
    <person id="xjin">
      <name>Xiaoqing Jin</name>
    </person>
    <person id="obouissou">
      <name>Olivier Bouissou</name>
    </person>
    <person id="jdaniel">
      <name>Jakub Daniel</name>
    </person>
    <person id="acimatti">
      <name>Alessandro Cimatti</name>
      <url>https://es-static.fbk.eu/people/cimatti/</url>
    </person>
    <person id="agriggio">
      <name>Alberto Griggio</name>
      <url>https://es-static.fbk.eu/people/griggio/</url>
    </person>
    <person id="stonetta">
      <name>Stefano Tonetta</name>
      <url>https://es-static.fbk.eu/people/tonetta/</url>
    </person>
    <person id="fberenger">
      <name>François Bérenger</name>
    </person>
    <person id="comar">
      <name>Cyrus Omar</name>
      <url>https://www.cs.cmu.edu/~comar/</url>
    </person>
    <person id="ivoysey">
      <name>Ian Voysey</name>
    </person>
    <person id="mhilton">
      <name>Michael Hilton</name>
    </person>
    <person id="jaldrich">
      <name>Jonathan Aldrich</name>
      <url>http://www.cs.cmu.edu/~aldrich/</url>
    </person>
    <person id="gfainekos">
      <name>Georgios Fainekos</name>
      <face>pics/gfainekos.jpg</face>
      <url>http://www.public.asu.edu/~gfaineko/</url>
    </person>
    <person id="bwu">
      <name>Bo Wu</name>
      <face>pics/bwu.png</face>
      <url>https://inside.mines.edu/~bwu/</url>
    </person>
    <person id="btouri">
      <name>Behrouz Touri</name>
      <url>http://eceweb.ucsd.edu/~btouri/</url>
    </person>
    <person id="dbortz">
      <name>David Bortz</name>
      <url>http://mathbio.colorado.edu/index.php/D_M_Bortz</url>
    </person>
    <person id="dmaahs">
      <name>David Maahs</name>
    </person>
    <person id="lclapp">
      <name>Lazaro Clapp</name>
      <url>http://web.stanford.edu/~lazaro/</url>
    </person>
    <person id="bnielsen">
      <name>Benjamin Barslev Nielsen</name>
      <url></url>
    </person>
    <person id="efrew">
      <name>Eric Frew</name>
      <url>https://www.colorado.edu/faculty/frew/</url>
    </person>
    <person id="cdragoi">
      <name>Cezara Drăgoi</name>
      <url>https://www.di.ens.fr/~cezarad/</url>
    </person>
    <person id="rmanevich">
      <name>Roman Manevich</name>
      <url>https://sites.google.com/view/roman-manevich</url>
    </person>
    <person id="nrinetzky">
      <name>Noam Rinetzky</name>
      <url>https://www.cs.tau.ac.il/~maon/</url>
    </person>
    <person id="ehahn">
      <name>Ernst Moritz Hahn</name>
    </person>
    <person id="sschewe">
      <name>Sven Schewe</name>
    </person>
    <person id="dwojtczak">
      <name>Dominik Wojtczak</name>
    </person>
    <person id="sfeng">
      <name>Shenghua Feng</name>
    </person>
    <person id="mchen">
      <name>Mingshuai Chen</name>
    </person>
    <person id="bxue">
      <name>Bai Xue</name>
    </person>
    <person id="nzhan">
      <name>Naijun Zhan</name>
    </person>
    <person id="adevonport">
      <name>Alex Devonport</name>
    </person>
    <person id="mkhaled">
      <name>Mahmoud Khaled</name>
    </person>
    <person id="marcak">
      <name>Murat Arcak</name>
    </person>
    <person id="alavaei">
      <name>Abolfazi Lavaei</name>
    </person>
    <person id="ssoudjani">
      <name>Sadegh Soudjani</name>
      <url>http://homepages.cs.ncl.ac.uk/sadegh.soudjani/</url>
    </person>
    <person id="bhoxha">
      <name>Bardh Hoxha</name>
      <url>https://www.bhoxha.com/</url>
    </person>
    <person id="dzikelic">
      <name>Ðorđe Žikelić</name>
    </person>
    <person id="pln">
      <name>Pauline Bolignano</name>
    </person>
    <person id="frai">
      <name>Franco Raimondi</name>
      <url>https://www.rmnd.net/</url>
    </person>
    <person id="ewustrow">
      <name>Eric Wustrow</name>
      <url>https://ericw.us/trow/</url>
    </person>
    <person id="schoeped">
      <name>Daniel Schoepe</name>
      <url>https://schoepe.org/~daniel/</url>
    </person>
    <person id="dseekatz">
      <name>David Seekatz</name>
    </person>
    <person id="ilinas">
      <name>Ilina Stoilkovska</name>
      <url>https://istoilkovska.github.io/</url>
    </person>
    <person id="sastucki">
      <name>Sandro Stucki</name>
      <url>https://sstucki.github.io/</url>
    </person>
    <person id="dtattersall">
      <name>Daniel Tattersall</name>
    </person>
  </persons>

  <events>
    <series id="popl">
      <name>Principles of Programming Languages</name>
      <longPrefix>ACM SIGACT-SIGPLAN Symposium on</longPrefix>
      <issue journal="sigplannot"/>
      <event id="popl20">
        <date>2020-01</date>
        <location>New Orleans, Louisiana, USA</location>
        <nth>Forty-Seventh</nth>
        <url></url>
      </event>
      <event id="popl17">
        <date>2017-01</date>
        <location>Paris, France</location>
        <nth>Forty-Fourth</nth>
        <url>http://conf.researchr.org/home/POPL-2017</url>
        <acceptance>64/282</acceptance>
        <acceptanceRate>22.7%</acceptanceRate>
      </event>
      <event id="popl16">
        <date>2016-01</date>
        <nth>Forty-Third</nth>
        <url>http://conf.researchr.org/home/POPL-2016</url>
      </event>
      <event id="popl15">
        <date>2015-01</date>
        <location>Mumbai, India</location>
        <nth>Forty-Second</nth>
        <url>http://popl.mpi-sws.org/2015/</url>
        <acceptance>52/227</acceptance>
        <acceptanceRate>22.9%</acceptanceRate>
      </event>
      <event id="popl14">
        <date>2014-01</date>
        <location>San Diego, California, USA</location>
        <nth>Forty-First</nth>
        <url>http://popl.mpi-sws.org/2014/</url>
        <acceptance>51/220</acceptance>
        <acceptanceRate>23.2%</acceptanceRate>
        <volume>49</volume>
        <number>1</number>
      </event>
      <event id="popl13">
        <date>2013-01</date>
        <location>Rome, Italy</location>
        <nth>Fortieth</nth>
        <url>http://popl.mpi-sws.org/2013/</url>
      </event>
      <event id="popl12">
        <date>2012-01</date>
        <location>Philadelphia, Pennsylvania, USA</location>
        <nth>Thirty-Ninth</nth>
        <url>http://www.cse.psu.edu/popl/12/</url>
        <acceptance>44/205</acceptance>
        <acceptanceRate>21.5%</acceptanceRate>
      </event>
      <event id="popl11">
        <date>2011-01</date>
        <location>Austin, Texas, USA</location>
        <nth>Thirty-Eighth</nth>
        <url>http://www.cse.psu.edu/popl/11/</url>
        <acceptance>49/209</acceptance>
        <acceptanceRate>23.4%</acceptanceRate>
        <volume>46</volume>
        <number>1</number>
      </event>
      <event id="popl10">
        <date>2010-01</date>
        <location>Madrid, Spain</location>
        <nth>Thirty-Seventh</nth>
        <url>http://www.cse.psu.edu/popl/10/</url>
      </event>
      <event id="popl08">
        <date>2008-01</date>
        <location>San Francisco, California, USA</location>
        <nth>Thirty-Fifth</nth>
        <url>http://www.cs.ucsd.edu/popl/08/</url>
        <acceptance>35/212</acceptance>
        <acceptanceRate>16.5%</acceptanceRate>
        <volume>43</volume>
        <number>1</number>
      </event>
    </series>
    <series id="pldi">
      <name>Programming Language Design and Implementation</name>
      <longPrefix>ACM SIGPLAN Conference on</longPrefix>
      <issue journal="sigplannot"/>
      <event id="pldi22">
        <date>2022-06</date>
        <location>San Diego, California, USA</location>
        <url>https://pldi22.sigplan.org/</url>
        <acceptance>68/326</acceptance>
        <acceptanceRate>20.9%</acceptanceRate>
      </event>
      <event id="pldi21">
        <date>2021-06</date>
        <location>Virtual</location>
        <url>https://conf.researchr.org/home/pldi-2021</url>
        <acceptance>87/320</acceptance>
        <acceptanceRate>27.2%</acceptanceRate>
      </event>
      <event id="pldi20">
        <date>2020-06</date>
        <location>Virtual</location>
      </event>
      <event id="pldi17">
        <date>2017-06</date>
        <location>Barcelona, Spain</location>
      </event>
      <event id="pldi16">
        <date>2016-06</date>
        <location>Santa Barbara, California, USA</location>
        <url>http://conf.researchr.org/home/pldi-2016/</url>
        <acceptance>49/304</acceptance>
        <acceptanceRate>16.1%</acceptanceRate>
      </event>
      <event id="pldi15">
        <date>2015-06</date>
        <location>Portland, Oregon, USA</location>
        <url>http://conf.researchr.org/home/pldi2015/</url>
        <acceptance>58/303</acceptance>
        <acceptanceRate>19.1%</acceptanceRate>
      </event>
      <event id="pldi14">
        <date>2014-06</date>
        <location>Edinburgh, UK</location>
        <url>http://conferences.inf.ed.ac.uk/pldi2014/</url>
      </event>
      <event id="pldi13">
        <date>2013-06</date>
        <location>Seattle, Washington, USA</location>
        <url>http://pldi2013.ucombinator.org/</url>
        <acceptance>46/267</acceptance>
        <acceptanceRate>17.2%</acceptanceRate>
        <volume>48</volume>
        <number>6</number>
        <editors>
          <author person="hjboehm"/>
          <author person="cflanagan"/>
        </editors>
      </event>
      <event id="pldi12">
        <date>2012-06</date>
        <location>Beijing, China</location>
        <url>http://pldi12.cs.purdue.edu/</url>
      </event>
      <event id="pldi10">
        <date>2010-06</date>
        <location>Toronto, Ontario, Canada</location>
        <url>http://www.cs.stanford.edu/pldi10/</url>
        <acceptance>41/204</acceptance>
        <acceptanceRate>20.1%</acceptanceRate>
        <volume>45</volume>
        <number>6</number>
      </event>
      <event id="pldi09">
        <date>2009-06</date>
        <location>Dublin, Ireland</location>
        <url>http://www.cs.colorado.edu/pldi09/</url>
      </event>
    </series>
    <series id="oopsla">
      <name>Object Oriented Programming Systems Languages and Applications</name>
      <longPrefix>ACM SIGPLAN Conference on</longPrefix>
      <event id="oopsla24">
        <date>2024-10</date>
        <location>Pasadena, California, USA</location>
        <url>https://2024.splashcon.org/track/splash-2024-oopsla</url>
        <issue journal="pacmpl"/>
      </event>
      <event id="oopsla23">
        <date>2023-10</date>
        <location>Cascais, Portugal</location>
        <url>http://2023.splashcon.org/</url>
        <acceptance>79/211</acceptance>
        <acceptanceRate>37.4%</acceptanceRate>
        <volume>7</volume>
        <number>OOPSLA2</number>
        <issue journal="pacmpl"/>
      </event>
      <event id="oopsla19">
        <date>2019-10</date>
        <location>Athens, Greece</location>
        <url>http://2019.splashcon.org/</url>
        <acceptance>73/201</acceptance>
        <acceptanceRate>36.3%</acceptanceRate>
        <volume>3</volume>
        <number>OOPSLA</number>
        <issue journal="pacmpl"/>
      </event>
      <event id="oopsla15">
        <date>2015-10</date>
        <location>Pittsburgh, Pennsylvania, USA</location>
        <url>http://2015.splashcon.org/</url>
        <acceptance>53/210</acceptance>
        <acceptanceRate>25.2%</acceptanceRate>
        <volume>50</volume>
        <number>10</number>
        <issue journal="sigplannot"/>
      </event>
    </series>
    <series id="splash">
      <name>Systems, Programming, Languages and Applications: Software for Humanity</name>
      <longPrefix>ACM SIGPLAN Conference on</longPrefix>
      <event id="splash23">
        <date>2023-10</date>
        <location>Cascais, Portugal</location>
        <url>https://2023.splashcon.org/</url>
      </event>
      <event id="splash22">
        <date>2022-11</date>
        <location>Auckland, New Zealand</location>
        <url>https://2022.splashcon.org/</url>
      </event>
    </series>
    <series id="icfp">
      <name>Functional Programming</name>
      <longPrefix>ACM SIGPLAN International Conference on</longPrefix>
      <event id="icfp19">
        <date>2019-08</date>
        <location>Berlin, Germany</location>
        <url>https://icfp19.sigplan.org/</url>
      </event>
    </series>
    <series id="onward!">
      <name>New Ideas, New Paradigms, and Reflections on Programming and Software</name>
      <longPrefix>ACM Symposium on</longPrefix>
      <event id="onward17">>
        <date>2017-10</date>
        <location>Vancouver, British Columbia, Canada</location>
        <url>https://conf.researchr.org/home/onward-2017</url>
        <acceptance>15/30</acceptance>
        <acceptanceRate>50.0%</acceptanceRate>
      </event>
    </series>
    <series id="asplos">
      <name>Architectural Support for Programming Languages and Operating Systems</name>
      <longPrefix>ACM International Conference on</longPrefix>
      <event id="asplos18">
        <date>2018-03</date>
        <location>Williamsburg, Virginia, USA</location>
        <url>https://www.asplos2018.org/</url>
      </event>
    </series>
    <series id="cav">
      <name>Computer Aided Verification</name>
      <longPrefix>International Conference on</longPrefix>
      <issue journal="lncs"/>
      <event id="cav24">
        <date>2024-07</date>
        <location>Montreal, Canada</location>
        <url>http://i-cav.org/2023/</url>
      </event>
      <event id="cav23">
        <date>2023-07</date>
        <location>Paris, France</location>
        <url>http://i-cav.org/2023/</url>
      </event>
      <event id="cav22">
        <date>2022-07</date>
        <location>Haifa, Israel</location>
        <url>http://i-cav.org/2022/</url>
      </event>
      <event id="cav21">
        <date>2021-07</date>
        <location>Virtual</location>
        <url>http://i-cav.org/2021/</url>
      </event>
      <event id="cav20">
        <date>2020-07</date>
        <location>Virtual</location>
        <url>http://i-cav.org/2020/</url>
      </event>
      <event id="cav19">
        <date>2019-07</date>
        <location>New York City, New York, USA</location>
        <url>http://i-cav.org/2019/</url>
      </event>
      <event id="cav16">
        <date>2016-07</date>
        <location>Toronto, Ontario, Canada</location>
        <url>http://i-cav.org/2016/</url>
      </event>
      <event id="cav15">
        <date>2015-07</date>
        <location>San Francisco, California, USA</location>
        <url>http://i-cav.org/2015/</url>
      </event>
      <event id="cav14">
        <date>2014-07</date>
        <location>Vienna, Austria</location>
        <url>http://cavconference.org/</url>
        <acceptance>57/229</acceptance>
        <acceptanceRate>24.9%</acceptanceRate>
        <volume>8859</volume>
      </event>
      <event id="cav13">
        <date>2013-07</date>
        <location>Saint Petersburg, Russia</location>
        <url>http://cav2013.forsyte.at/</url>
      </event>
      <event id="cav12">
        <date>2012-07</date>
        <location>Berkeley, California, USA</location>
        <url>http://cav12.cs.illinois.edu/</url>
        <acceptance>58 (38 regular + 20 tool)/185 (140 regular + 45 tool)</acceptance>
        <acceptanceRate>31.4%</acceptanceRate>
      </event>
      <event id="cav11">
        <date>2011-07</date>
        <location>Snowbird, Utah, USA</location>
        <url>http://www.cs.utah.edu/events/conferences/cav2011/</url>
      </event>
    </series>
    <series id="ecoop">
      <name>Object-Oriented Programming</name>
      <longPrefix>European Conference on</longPrefix>
      <event id="ecoop19">
        <date>2019-07</date>
        <location>London, UK</location>
        <nth>Thirty-First</nth>
        <url>https://2019.ecoop.org/</url>
        <acceptance>19/60</acceptance>
        <acceptanceRate>31.7%</acceptanceRate>
        <volume>134</volume>
        <issue journal="lipics"/>
      </event>
      <event id="ecoop17">
        <date>2017-06</date>
        <location>Barcelona, Spain</location>
      </event>
      <event id="ecoop13">
        <date>2013-07</date>
        <location>Montpellier, France</location>
        <nth>Twenty-Seventh</nth>
        <url>http://www.lirmm.fr/ecoop13/</url>
        <acceptance>29/116</acceptance>
        <acceptanceRate>25.0%</acceptanceRate>
        <volume>7920</volume>
        <editors>
          <author person="gcastagna"/>
        </editors>
        <issue journal="lncs"/>
      </event>
    </series>
    <series id="esop">
        <name>European Symposium on Programming</name>
        <issue journal="lncs"/>
        <event id="esop15">
          <date>2015-04</date>
          <location>London, United Kingdom</location>
          <url>http://conf.researchr.org/home/esop-2015</url>
          <acceptance>33/115</acceptance>
          <acceptanceRate>28.7%</acceptanceRate>
          <volume>9032</volume>
        </event>
        <event id="esop11">
          <date>2011-03</date>
          <location>Saarbrücken, Germany</location>
          <url>http://www.etaps.org/etaps-2011/esop</url>
        </event>
        <event id="esop10">
          <date>2010-03</date>
          <location>Paphos, Cyprus</location>
          <nth>Nineteenth</nth>
          <url>http://research.microsoft.com/en-us/um/people/adg/esop2010/</url>
          <acceptance>30/121</acceptance>
          <acceptanceRate>24.8%</acceptanceRate>
          <volume>6012</volume>
        </event>
    </series>
    <series id="tacas">
      <name>Tools and Algorithms for the Construction and Analysis of Systems</name>
      <longPrefix>International Conference on</longPrefix>
      <issue journal="lncs"/>
      <event id="tacas17">
        <date>2017-04</date>
        <location>Uppsala, Sweden</location>
        <nth>Twenty-Third</nth>
        <url>http://www.etaps.org/2017/tacas/</url>
        <acceptance>48/167</acceptance>
        <acceptanceRate>28.7%</acceptanceRate>
        <volume>10206</volume>
      </event>
      <event id="tacas16">
        <date>2016-04</date>
        <location>Eindhoven, The Netherlands</location>
        <nth>Twenty-Second</nth>
        <url>http://www.etaps.org/2016/tacas/</url>
        <acceptance>36/147</acceptance>
        <acceptanceRate>24.5%</acceptanceRate>
        <volume>7214</volume>
      </event>
      <event id="tacas12">
        <date>2012-03</date>
        <location>Tallinn, Estonia</location>
        <nth>Eighteenth</nth>
        <url>http://www.etaps.org/2012/tacas/</url>
        <acceptance>36/147</acceptance>
        <acceptanceRate>24.5%</acceptanceRate>
        <volume>7214</volume>
      </event>
      <event id="tacas11">
        <date>2011-03</date>
        <location>Saarbrücken, Germany</location>
        <url>http://www.etaps.org/etaps-2011/tacas</url>
      </event>
    </series>
    <series id="sas">
      <name>Static Analysis Symposium</name>
      <longPrefix>International</longPrefix>
      <issue journal="lncs"/>
      <event id="sas23">
        <date>2023-10</date>
        <location>Cascais, Portugal</location>
        <nth>Thirtieth</nth>
        <url>https://conf.researchr.org/home/sas-2023</url>
        <acceptance>19/39</acceptance> <!-- 20/40 all papers -->
        <acceptanceRate>50.0%</acceptanceRate>
        <volume>14284</volume>
      </event>
      <event id="sas21">
        <date>2021-10</date>
        <location>Chicago, Illinois, USA</location>
        <nth>Twenty-Eighth</nth>
        <url>https://conf.researchr.org/home/sas-2021</url>
        <acceptance>18/33</acceptance>
        <acceptanceRate>54.5%</acceptanceRate>
        <volume>12913</volume>
      </event>
      <event id="sas20">
        <date>2020-11</date>
        <nth>Twenty-Seventh</nth>
        <url>https://conf.researchr.org/home/sas-2020</url>
      </event>
      <event id="sas19">
        <date>2019-10</date>
        <location>Porto, Portugal</location>
        <nth>Twenty-Sixth</nth>
        <url>http://staticanalysis.org/sas2019/</url>
      </event>
      <event id="sas18">
        <date>2018-09</date>
        <nth>Twenty-Fifth</nth>
        <url>http://staticanalysis.org/sas2018/</url>
      </event>
      <event id="sas16">
        <date>2016-09</date>
        <location>Edinburgh, UK</location>
        <nth>Twenty-Third</nth>
        <url>http://staticanalysis.org/sas2016/</url>
      </event>
      <event id="sas15">
        <date>2015-09</date>
        <location>Saint-Malo, France</location>
        <nth>Twenty-Second</nth>
        <url>http://sas2015.inria.fr/</url>
        <acceptance>18/44</acceptance>
        <acceptanceRate>40.1%</acceptanceRate>
        <volume>9291</volume>
      </event>
      <event id="sas14">
        <date>2014-09</date>
        <location>Munich, Germany</location>
        <nth>Twenty-First</nth>
        <url>http://cs.uni-muenster.de/sev/sas14/</url>
        <acceptance>20/53</acceptance>
        <acceptanceRate>37.7%</acceptanceRate>
        <volume>8723</volume>
      </event>
      <event id="sas12">
        <date>2012-09</date>
        <location>Deauville, France</location>
        <nth>Nineteenth</nth>
        <url>http://www.sas2012.ens.fr/</url>
        <acceptance>25/62</acceptance>
        <acceptanceRate>40.3%</acceptanceRate>
        <volume>7460</volume>
      </event>
      <event id="sas11">
        <date>2011-09</date>
        <location>Venice, Italy</location>
        <nth>Eighteenth</nth>
        <url>http://sas2011.cs.technion.ac.il/</url>
        <acceptance>22/67</acceptance>
        <acceptanceRate>32.8%</acceptanceRate>
        <volume>6887</volume>
      </event>
      <event id="sas07">
        <date>2007-08</date>
        <nth>Fourteenth</nth>
        <url>http://www2.imm.dtu.dk/sas2007/</url>
        <acceptance>26/85</acceptance>
        <acceptanceRate>30.6%</acceptanceRate>
        <volume>4634</volume>
      </event>
      <event id="sas06">
        <date>2006-08</date>
        <nth>Thirteenth</nth>
        <url>http://ropas.snu.ac.kr/sas06/</url>
        <acceptance>23/80</acceptance>
        <acceptanceRate>28.8%</acceptanceRate>
        <volume>4134</volume>
      </event>
    </series>
    <series id="vmcai">
      <name>Verification, Model Checking, and Abstract Interpretation</name>
      <longPrefix>International Conference on</longPrefix>
      <issue journal="lncs"/>
      <event id="vmcai23">
        <date>2023-01</date>
        <location>Boston, Massachusetts, USA</location>
        <url>https://popl23.sigplan.org/home/VMCAI-2023</url>
      </event>
      <event id="vmcai19">
        <date>2019-01</date>
        <location>Cascais, Portugal</location>
        <nth>Twentieth</nth>
        <url>https://popl19.sigplan.org/track/VMCAI-2019</url>
        <acceptance>27/67</acceptance>
        <acceptanceRate>43.5%</acceptanceRate>
        <volume>11388</volume>
      </event>
      <event id="vmcai16">
        <date>2016-01</date>
        <location>St. Petersburg, Florida, USA</location>
        <nth>Seventeenth</nth>
        <url>http://conf.researchr.org/home/VMCAI-2016</url>
      </event>
      <event id="vmcai14">
        <date>2014-01</date>
        <location>San Diego, California, USA</location>
        <nth>Fifteenth</nth>
        <url>http://vmcai2014.di.ens.fr/</url>
        <volume>8318</volume>
        <editors>
          <author person="kmcmillan"/>
          <author person="rival"/>
        </editors>
      </event>
      <event id="vmcai13">
        <date>2013-01</date>
        <location>Rome, Italy</location>
        <nth>Fourteenth</nth>
        <url>http://vmcai13.di.univr.it/</url>
        <acceptance>27/72</acceptance>
        <acceptanceRate>37.5%</acceptanceRate>
        <volume>7737</volume>
        <editors>
          <author person="rgiacobazzi"/>
          <author person="berdine"/>
          <author person="imastroeni"/>
        </editors>
      </event>
      <event id="vmcai12">
        <date>2012-01</date>
        <nth>Thirteenth</nth>
        <url>http://lara.epfl.ch/vmcai2012/</url>
      </event>
      <event id="vmcai11">
        <date>2011-01</date>
        <location>Austin, Texas, USA</location>
        <nth>Twelfth</nth>
        <url>http://vmcai11.cis.ksu.edu/</url>
        <acceptance>24/71</acceptance>
        <acceptanceRate>33.8%</acceptanceRate>
        <volume>6538</volume>
      </event>
      <event id="vmcai06">
        <date>2006-01</date>
        <nth>Seventh</nth>
        <url>http://www.cs.utexas.edu/~vmcai06/</url>
        <acceptance>28/58</acceptance>
        <acceptanceRate>48.3%</acceptanceRate>
        <volume>3855</volume>
      </event>
      <event id="vmcai05">
        <date>2005-01</date>
        <nth>Sixth</nth>
        <url>http://www.polytechnique.fr/vmcai05/</url>
        <acceptance>27/92</acceptance>
        <acceptanceRate>29.3%</acceptanceRate>
        <volume>3385</volume>
      </event>
    </series>
    <series id="rv">
      <name>Runtime Verification</name>
      <longPrefix>International Conference on</longPrefix>
      <event id="rv19">
        <date>2019-10</date>
        <location>Porto, Portugal</location>
        <nth>Nineteenth</nth>
        <url>https://www.react.uni-saarland.de/rv2019/</url>
      </event>
    </series>
    <series id="lics">
      <name>Logic in Computer Science</name>
      <longPrefix>IEEE Symposium on</longPrefix>
      <event id="lics13">
        <date>2013-06</date>
        <location>New Orleans, Louisiana, USA</location>
        <nth>Twenty-Eighth</nth>
        <url>http://lii.rwth-aachen.de/lics/lics13/</url>
      </event>
    </series>
    <series id="aaai">
      <name>Artificial Intelligence</name>
      <longPrefix>AAAI Conference on</longPrefix>
      <event id="aaai18">
        <date>2018-02</date>
        <location>New Orleans, Louisiana, USA</location>
        <nth>Thirty-Second</nth>
        <url>https://aaai.org/Conferences/AAAI-18/</url>
        <acceptance>933/over 3800</acceptance>
        <acceptanceRate>24.6%</acceptanceRate>
      </event>
    </series>
    <series id="lpar">
      <name>Logic for Programming, Artificial Intelligence and Reasoning</name>
      <longPrefix>International Conference on</longPrefix>
      <issue journal="lncs"/>
      <event id="lpar15">
        <date>2015-11</date>
        <location>Suva, Fiji</location>
        <nth>Twentieth</nth>
        <url>http://www.lpar-20.org/</url>
        <acceptance>43/92</acceptance>
        <acceptanceRate>46.7%</acceptanceRate>
        <volume>9450</volume>
      </event>
    </series>
    <series id="vstte">
      <name>Verified Software: Theories, Tools, and Experiments</name>
      <longPrefix>IFIP Working Conference on</longPrefix>
      <event id="vstte20">
        <date>2020-07</date>
        <location>Virtual</location>
        <nth>Twelfth</nth>
        <url>https://sri-csl.github.io/VSTTE20/</url>
      </event>
      <event id="vstte15">
        <date>2015-07</date>
        <location>San Francisco, California, USA</location>
        <nth>Seventh</nth>
        <url>https://sites.google.com/site/vstte2015/</url>
      </event>
    </series>
    <series id="sigcse">
      <name>Computer Science Education</name>
      <longPrefix>ACM Technical Symposium on</longPrefix>
      <event id="sigcse2013">
    <date>2013-03</date>
    <location>Denver, Colorado, USA</location>
    <nth>Forty-Fourth</nth>
    <url>http://www.sigcse.org/sigcse2013/</url>
      </event>
    </series>
    <series id="icse">
      <name>Software Engineering</name>
      <longPrefix>International Conference on</longPrefix>
      <event id="icse18">
        <date>2018-05</date>
        <location>Gothenburg, Sweden</location>
        <nth>Fortieth</nth>
        <url>https://www.icse2018.org/</url>
        <acceptance>105/502</acceptance>
        <acceptanceRate>20.9%</acceptanceRate>
      </event>
      <event id="icse13">
        <date>2013-05</date>
        <location>San Francisco, California, USA</location>
        <nth>Thirty-Fifth</nth>
        <url>http://2013.icse-conferences.org/</url>
      </event>
    </series> 
    <series id="icse-nier">
      <name>New and Emerging Results Track at ICSE</name>
      <event id="icse-nier13">
        <date>2013-05</date>
        <url>http://2013.icse-conferences.org/content/new-ideas-and-emerging-results-nier</url>
        <location>San Francisco, California, USA</location>
      </event>
    </series>
    <series id="ase">
      <name>Automated Software Engineering</name>
      <longPrefix>IEEE/ACM International Conference on</longPrefix>
      <event id="ase18">
        <date>2018-09</date>
        <location>Montpellier, France</location>
        <nth>Thirty-Third</nth>
        <url>http://www.ase2018.com/</url>
        <acceptance>64/315</acceptance>
        <acceptanceRate>20.3%</acceptanceRate>
      </event>
    </series> 
    <series id="issta">
      <name>Software Testing and Analysis</name>
      <longPrefix>International Symposium on</longPrefix>
      <event id="issta19">
        <date>2019-07</date>
        <location>Minneapolis, Minnesota, USA</location>
        <nth>Twenty-Eighth</nth>
        <url></url>
      </event>
      <event id="issta12">
        <date>2012-07</date>
        <location>Minneapolis, Minnesota, USA</location>
        <nth>Twenty-First</nth>
        <url>http://crisys.cs.umn.edu/issta2012/</url>
        <acceptance>31/108</acceptance>
        <acceptanceRate>28.7%</acceptanceRate>
      </event>
    </series>
    <series id="saner">
      <name>Software Analysis, Evolution and Reengineering</name>
      <longPrefix>International Conference on</longPrefix>
      <event id="saner18">
        <date>2018-03</date>
        <location>Campobasso, Italy</location>
        <nth>Twenty-Fifth</nth>
        <url>http://saner.unimol.it/</url>
        <acceptance>39/146</acceptance>
        <acceptanceRate>26.7%</acceptanceRate>
      </event>
    </series>
    <series id="aplas">
      <name>Programming Languages and Systems</name>
      <longPrefix>Asian Symposium on</longPrefix>
      <event id="aplas17">
        <date>2017-11</date>
        <location>Suzhou, China</location>
        <url>https://www-aplas.github.io/</url>
      </event>
      <event id="aplas16">
        <date>2016-11</date>
        <location>Hanoi, Vietnam</location>
        <url>http://soict.hust.edu.vn/~aplas2016/</url>
      </event>
    </series>
    <series id="hscc">
      <name>Hybrid Systems: Computation and Control</name>
      <longPrefix>International Conference on</longPrefix>
      <event id="hscc18">
        <date>2018-04</date>
        <location>Porto, Portugal</location>
        <url>https://www.hscc2018.deib.polimi.it/</url>
      </event>
      <event id="hscc16">
        <date>2016-04</date>
        <location>Vienna, Austria</location>
        <url>http://www.cs.ox.ac.uk/conferences/hscc2016/</url>
      </event>
      <event id="hscc11">
        <date>2011-04</date>
        <location>Chicago, Illinois, USA</location>
        <url>http://hscc2011.cs.sunysb.edu/</url>
      </event>
    </series>
    <series id="iccps">
      <name>Cyber-Physical Systems</name>
      <longPrefix>International Conference on</longPrefix>
      <event id="iccps18">
        <date>2018-04</date>
        <location>Porto, Portugal</location>
        <url>http://iccps.acm.org/2018/</url>
      </event>
    </series>
    <series id="fmcad">
      <name>Formal Methods in Computer Aided Design</name>
      <longPrefix>International Conference on</longPrefix>
      <event id="fmcad11">
        <date>2011-10</date>
        <location>Austin, Texas, USA</location>
        <url>http://www.cs.utexas.edu/~ragerdl/fmcad11/</url>
      </event>
    </series>
    <series id="cmsb">
      <name>Computational Methods in Systems Biology</name>
      <longPrefix>International Conference on</longPrefix>
      <event id="cmsb18">
        <date>2018-09</date>
        <location>Brno, Czech Republic</location>
        <url>https://cmsb2018.fi.muni.cz/</url>
      </event>
    </series>
    <series id="fmco">
      <name>Formal Methods for Components and Objects</name>
      <longPrefix>International Symposium on</longPrefix>
      <issue journal="lncs"/>
      <event id="fmco05">
        <date>2005</date>
        <nth>Fourth</nth>
        <url>http://fmco.liacs.nl/fmco05.html</url>
        <volume>4111</volume>
      </event>
    </series>
    <series id="chi">
      <name>Human Factors in Computing Systems</name>
      <longPrefix>ACM SIGCHI Conference on</longPrefix>
      <event id="chi14">
        <date>2014-04</date>
        <url>http://chi2014.acm.org/</url>
        <location>Toronto, Ontario, Canada</location>
      </event>
    </series>
    <series id="emsoft">
      <name>Embedded Software</name>
      <longPrefix>ACM SIGBED International Conference on</longPrefix>
      <event id="emsoft17">
        <date>2017-10</date>
        <url>http://emsoft.org/</url>
        <location>Torino, Italy</location>
      </event>
      <event id="emsoft16">
        <date>2016-10</date>
        <url>http://emsoft.org/</url>
        <location>Pittsburgh, Pennsylvania, USA</location>
      </event>
      <event id="emsoft14">
        <date>2014-10</date>
        <url>http://emsoft.org/</url>
        <location>New Delhi, India</location>
      </event>
    </series>
    <series id="rss">
      <name>Robotics: Science and Systems</name>
      <longPrefix></longPrefix>  
      <event id="rss17">
        <date>2017-06</date>
        <location>Cambridge, Massachusetts, USA</location>
        <url>http://rss2017.lids.mit.edu/</url>
      </event>
    </series>
    <series id="isola">
      <name>Leveraging Applications of Formal Methods, Verification and Validation</name>
      <longPrefix>International Symposium on</longPrefix>
      <issue journal="lncs"/>
      <event id="isola14">
        <date>2014-10</date>
        <nth>Sixth</nth>
        <url>http://www.cs.uni-potsdam.de/isola/isola2014/</url>
        <location>Imperial, Corfu, Greece</location>
        <volume>8803</volume>
      </event>
    </series>
    <series id="chi-ea" type="workshop">
      <name>Extended Abstracts at <ref table="series" key="chi"/></name>
      <event id="chi-ea14">
        <date>2014-04</date>
        <url>http://chi2014.acm.org/</url>
        <location>Toronto, Ontario, Canada</location>
      </event>
    </series>
    <series id="tldi" type="workshop">
      <name>Types in Language Design and Implementation</name>
      <longPrefix>ACM SIGPLAN International Workshop on</longPrefix>
      <event id="tldi05">
        <date>2005-01</date>
        <nth>Second</nth>
        <url>http://research.microsoft.com/~maf/tldi05/</url>
        <acceptance>10/23</acceptance>
        <acceptanceRate>43.5%</acceptanceRate>
      </event>
    </series>
    <series id="nsad" type="workshop">
      <name>Numerical and Symbolic Abstract Domains</name>
      <longPrefix>International Workshop on</longPrefix>
      <event id="nsad11">
        <date>2011</date>
        <nth>Third</nth>
        <url>http://software.imdea.org/events/nsad2011/</url>
      </event>
    </series>
    <series id="tapas" type="workshop">
      <name>Tools for Automatic Program Analysis</name>
      <longPrefix>International Workshop on</longPrefix>
      <event id="tapas13">
        <date>2013</date>
        <nth>Fourth</nth>
        <url>http://pl.cs.colorado.edu/tapas2013/</url>
      </event>
      <event id="tapas12">
        <date>2012</date>
        <nth>Third</nth>
        <url>http://tapas2012.inrialpes.fr/</url>
      </event>
    </series>
    <series id="paste" type="workshop">
      <name>Program Analysis for Software Tools and Engineering</name>
      <longPrefix>ACM SIGPLAN-SIGSOFT Workshop on</longPrefix>
      <event id="paste11">
        <date>2011</date>
        <nth>Tenth</nth>
        <url>https://sites.google.com/site/paste2011/</url>
      </event>
    </series>
    <series id="soap" type="workshop">
      <name>State of the Art in Program Analysis</name>
      <longPrefix>ACM SIGPLAN Workshop on</longPrefix>
      <event id="soap15">
        <date>2015-06</date>
        <nth>Fourth</nth>
        <url>http://www.sable.mcgill.ca/soap/</url>
        <location>Portland, Oregon, USA</location>
      </event>
    </series>
    <series id="array" type="workshop">
      <name>Libraries, Languages and Compilers for Array Programming</name>
      <longPrefix>ACM SIGPLAN Workshop on</longPrefix>
      <event id="array15">
        <date>2015-06</date>
        <nth>Second</nth>
        <url>http://www.sable.mcgill.ca/array/</url>
        <location>Portland, Oregon, USA</location>
      </event>
    </series>
    <series id="lcpc" type="workshop">
      <name>Languages and Compilers for Parallel Computing</name>
      <longPrefix>International Workshop on</longPrefix>
      <event id="lcpc11">
        <date>2011</date>
        <nth>Twenty-Fourth</nth>
        <url>http://lcpc11.cs.colostate.edu/</url>
      </event>
    </series>
    <series id="aiool" type="workshop">
      <name>Abstract Interpretation of Object-Oriented Languages</name>
      <longPrefix>International Workshop on</longPrefix>
      <issue journal="entcs"/>
      <event id="aiool05">
        <date>2005-01</date>
        <nth>First</nth>
        <url>http://www.polytechnique.fr/vmcai05/Aiool.html</url>
        <acceptance>11/13</acceptance>
        <acceptanceRate>84.6%</acceptanceRate>
        <volume>131</volume>
      </event>
    </series>
    <series id="bioconcur" type="workshop">
      <name>Concurrent Models in Molecular Biology</name>
      <longPrefix>Workshop on</longPrefix>
      <abbrev>BioConcur</abbrev>
      <issue journal="entcs"/>
      <event id="bioconcur03">
        <date>2003-09</date>
        <url>http://www.pps.jussieu.fr/~bioconcu/</url>
        <volume>180</volume>
        <number>3</number>
      </event>
    </series>
    <series id="grid" type="workshop">
      <name>Grid Computing</name>
      <longPrefix>International Workshop on</longPrefix>
      <issue journal="lncs"/>
      <event id="grid02">
        <date>2002-11</date>
        <url>http://www.gridcomputing.org/grid2002</url>
        <volume>2536</volume>
      </event>
    </series>
    <series id="ptp" type="workshop">
      <name>Proof Transformations, Proof Presentations, and Complexity of Proofs</name>
      <longPrefix>Workshop on</longPrefix>
      <event id="ptp01">
        <date>2001-06</date>
        <url>http://www.ags.uni-sb.de/~ptp-01/</url>
      </event>
    </series>
    <series id="pldi-fit" type="workshop">
      <name>Fun Ideas and Thoughts at <ref table="series" key="pldi"/></name>
      <event id="pldi-fit09">
        <date>2009-06</date>
        <url>http://www.cs.colorado.edu/pldi09/fit/</url>
        <location>Dublin, Ireland</location>
      </event>
    </series>
    <series id="fractal" type="workshop">
      <name>Front Range Architecture Compilers Tools and Languages Workshop</name>
      <event id="fractal-f09">
        <date>F2009</date>
        <url>http://fractal.cs.colorado.edu/</url>
        <location>Boulder, Colorado, USA</location>
      </event>
    </series>
    <series id="mvd" type="workshop">
      <name>Midwest Verification Day</name>
      <event id="mvd12">
        <date>2012-09</date>
        <url>http://www.ittc.ku.edu/mvd12/</url>
        <location>Lawrence, Kansas, USA</location>
      </event>
    </series>
    <series id="sairp">
      <name>Semantics, Abstract Interpretation, and Reasoning about Programs: Essays Dedicated to David A. Schmidt on the Occasion of his Sixtieth Birthday</name>
      <issue journal="eptcs"/>
      <event id="sairp13">
        <date>2013-09</date>
        <location>Manhattan, Kansas, USA</location>
        <volume>129</volume>
      </event>
    </series>
    <series id="splash-src" type="workshop">
      <name>Systems, Programming, Languages and Applications: Software for Humanity</name>
      <longPrefix>ACM SIGPLAN Conference on</longPrefix>
      <event id="splash-src14">
        <date>2014-10</date>
        <location>Portland, Oregon, USA</location>
        <url>http://2014.splashcon.org/track/splash2014-src</url>
      </event>
    </series>
    <series id="icfp-src" type="workshop">
      <name>Functional Programming</name>
      <longPrefix>ACM SIGPLAN International Conference on</longPrefix>
      <event id="icfp-src15">
        <date>2015-08</date>
        <location>Vancouver, British Columbia, Canada</location>
        <url>http://icfpconference.org/icfp2015/src.html</url>
      </event>
    </series>
    <series id="cs-colloquium">
      <name>University of Colorado Boulder Computer Science Colloquium</name>
      <abbrev>CU CS Colloquium</abbrev>
      <event id="cs-colloquium">
  <url>http://www.cs.colorado.edu/</url>
      </event>
    </series>
    <series id="gpce">
      <name>Generative Programming and Component Engineering</name>
      <longPrefix>ACM SIGPLAN International Conference on</longPrefix>
      <event id="gpce16">
         <date>2016-10</date>
         <location>Amsterdam, The Netherlands</location>
         <nth>Fifteenth</nth>
         <url>http://conf.researchr.org/home/gpce-2016</url>
         <acceptance>20/53</acceptance>
         <acceptanceRate>37.7%</acceptanceRate>
      </event>
      <event id="gpce10">
         <date>2010-10</date>
         <location>Eindhoven, The Netherlands</location>
         <nth>Ninth</nth>
         <url>http://www.program-transformation.org/GPCE10/</url>
      </event>
    </series>
    <series id="sc">
     <name>International Conference on High Performance Computing Networking, Storage and Analysis</name>
     <event id="sc09">
       <location>Portland, Oregon, USA</location>
       <date>2009-11</date>
       <url>http://sc09.supercomputing.org/</url>
     </event>
    </series>
    <series id="cgo">
     <name>Code Generation and Optimization</name>
     <longPrefix>International Symposium on</longPrefix>
     <event id="cgo10">
       <location>Toronto, Ontario, Canada</location>
       <date>2010-04</date>
       <url>http://www.cgo.org/cgo2010/</url>
     </event>
    </series>
  </events>

  <journals>
    <journal id="pacmpl">
      <name>Proceedings of the ACM on Programming Languages</name>
      <short>PACMPL</short>
    </journal>
    <journal id="sigplannot">
      <name>ACM SIGPLAN Notices</name>
      <short>ACM SIGPLAN Notices</short>
    </journal>
    <journal id="lncs">
      <name>Lecture Notes in Computer Science</name>
      <short>Lect Notes Comput Sc</short>
    </journal>
    <journal id="lipics">
      <name>Leibniz International Proceedings in Informatics</name>
      <short>LIPIcs</short>
    </journal>
    <journal id="entcs">
      <name>Electronic Notes in Theoretical Computer Science</name>
      <short>Electr Notes Theor Comput Sc</short>
    </journal>
    <journal id="cacm">
      <name>Communications of the ACM (CACM)</name>
      <short>Commun. ACM</short>
    </journal>
    <journal id="toplas">
      <name>ACM Transactions on Programming Languages and Systems (TOPLAS)</name>
      <short>ACM Trans. Program. Lang. Syst.</short>
    </journal>
    <journal id="fntpl">
      <name>Foundations and Trends in Programming Languages (FnTPL)</name>
      <short>Found. Trends Program. Lang.</short>
    </journal>
    <journal id="sttt">
      <name>International Journal on Software Tools for Technology Transfer (STTT)</name>
      <short>Int J Softw Tools Technol Transfer</short>
    </journal>
    <journal id="eptcs">
      <name>Electronic Proceedings in Theoretical Computer Science</name>
      <short>Electr P in Theor Comput Sc</short>
    </journal>
  </journals>
</cv>