Kenneth L. McMillan

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Thomas Dillig

> Home > Persons > Kenneth L. McMillan

Publications

2017
[j18]
- view
  authority control:
- export record
  dblp key:
  - journals/sttt/DilligDLMS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/sttt/DilligDLMS17
Isil Dillig, Thomas Dillig, Boyang Li, Kenneth L. McMillan, Mooly Sagiv:
Synthesis of circular compositional program proofs via abduction. Int. J. Softw. Tools Technol. Transf. 19(5): 535-547 (2017)
2013
[c76]
- view
  authority control:
- export record
  dblp key:
  - conf/oopsla/DilligDLM13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/oopsla/DilligDLM13
Isil Dillig, Thomas Dillig, Boyang Li, Kenneth L. McMillan:
Inductive invariant generation via abductive inference. OOPSLA 2013: 443-456
[c72]
- view
  authority control:
- export record
  dblp key:
  - conf/tacas/LiDDMS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/tacas/LiDDMS13
Boyang Li, Isil Dillig, Thomas Dillig, Kenneth L. McMillan, Mooly Sagiv:
Synthesis of Circular Compositional Program Proofs via Abduction. TACAS 2013: 370-384
2012
[c70]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - conf/cav/DilligDMA12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cav/DilligDMA12
Isil Dillig, Thomas Dillig, Kenneth L. McMillan, Alex Aiken:
Minimum Satisfying Assignments for SMT. CAV 2012: 394-409

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.