default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSava Krstic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[i1]Sylvain Conchon, Amit Goel, Sava Krstic, Rupak Majumdar, Mattias Roux:
FAR-Cubicle - A new reachability algorithm for Cubicle. CoRR abs/1811.08131 (2018)- 2017
- [c23]Sylvain Conchon, Amit Goel, Sava Krstic, Rupak Majumdar, Mattias Roux:
FAR-Cubicle - A new reachability algorithm for Cubicle. FMCAD 2017: 172-175 - 2014
- [c22]Sava Krstic, Jin Yang, David W. Palmer, Randy B. Osborne, Eran Talmor:
Security of SoC firmware load protocols. HOST 2014: 70-75 - 2013
- [c21]Andrew Reynolds, Cesare Tinelli
, Amit Goel, Sava Krstic, Morgan Deters, Clark W. Barrett:
Quantifier Instantiation Techniques for Finite Model Finding in SMT. CADE 2013: 377-391 - [c20]Andrew Reynolds, Cesare Tinelli, Amit Goel, Sava Krstic:
Finite Model Finding in SMT. CAV 2013: 640-655 - [c19]Sylvain Conchon, Amit Goel, Sava Krstic, Alain Mebsout, Fatiha Zaïdi:
Invariants for finite instances and beyond. FMCAD 2013: 61-68 - [c18]John Launchbury, Sava Krstic, T. E. Sauerwein:
Coroutining Folds with Hyperfunctions. Festschrift for Dave Schmidt 2013: 121-135 - 2012
- [j4]Alexander Fuchs, Amit Goel, Jim Grundy, Sava Krstic, Cesare Tinelli:
Ground interpolation for the theory of equality. Log. Methods Comput. Sci. 8(1) (2012) - [c17]Amit Goel, Sava Krstic, Rebekah Leslie, Mark R. Tuttle:
SMT-Based System Verification with DVF. SMT@IJCAR 2012: 32-43 - [c16]Sylvain Conchon, Amit Goel, Sava Krstic, Alain Mebsout, Fatiha Zaïdi:
Cubicle: A Parallel SMT-Based Model Checker for Parameterized Systems - Tool Paper. CAV 2012: 718-724
2000 – 2009
- 2009
- [c15]Amit Goel, Sava Krstic, Cesare Tinelli:
Ground Interpolation for Combined Theories. CADE 2009: 183-198 - [c14]Alexander Fuchs, Amit Goel, Jim Grundy, Sava Krstic, Cesare Tinelli:
Ground Interpolation for the Theory of Equality. TACAS 2009: 413-427 - 2008
- [e1]Sava Krstic, Albert Oliveras:
Proceedings of the 5th International Workshop on Satisfiability Modulo Theories, SMT@CAV 2007, Berlin, Germany, July 1-2, 2007. Electronic Notes in Theoretical Computer Science 198(2), Elsevier 2008 [contents] - 2007
- [c13]Sava Krstic, Amit Goel:
Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL. FroCoS 2007: 1-27 - [c12]Sava Krstic, Amit Goel, Jim Grundy, Cesare Tinelli:
Combined Satisfiability Modulo Parametric Theories. TACAS 2007: 602-617 - [c11]Sava Krstic, Albert Oliveras:
Preface. SMT@CAV 2007: 1-2 - 2006
- [j3]Sylvain Conchon, Sava Krstic:
Strategies for combining decision procedures. Theor. Comput. Sci. 354(2): 187-210 (2006) - [c10]Michael Kishinevsky, Jordi Cortadella, Bill Grundmann, Sava Krstic, John O'Leary:
Synchronous Elastic Circuits. CSR 2006: 3-5 - [c9]Sava Krstic, Jordi Cortadella, Michael Kishinevsky, John O'Leary:
Synchronous Elastic Networks. FMCAD 2006: 19-30 - [c8]Sava Krstic, Robert B. Jones, John O'Leary:
Mothers of Pipelines. PDPAR/PaUL@FLoC 2006: 7-22 - 2005
- [j2]Sava Krstic, Sylvain Conchon:
Canonization for disjoint unions of theories. Inf. Comput. 199(1-2): 87-106 (2005) - [c7]Jim Grundy, Thomas F. Melham, Sava Krstic, Sean McLaughlin:
Tool Building Requirements for an API to First-Order Solvers. PDPAR@CAV 2005: 15-26 - 2004
- [c6]Sava Krstic, John Matthews:
Semantics of the reFLect language. PPDP 2004: 32-42 - 2003
- [c5]Sava Krstic, Sylvain Conchon:
Canonization for Disjoint Unions of Theories. CADE 2003: 197-211 - [c4]Sylvain Conchon, Sava Krstic:
Strategies for Combining Decision Procedures. TACAS 2003: 537-552 - [c3]Sava Krstic, John Matthews:
Inductive Invariants for Nested Recursion. TPHOLs 2003: 253-269 - 2002
- [c2]Sava Krstic, John Matthews:
Verifying BDD Algorithms through Monadic Interpretation. VMCAI 2002: 182-195 - 2001
- [c1]Sava Krstic, John Launchbury, Dusko Pavlovic:
Categories of Processes Enriched in Final Coalgebras. FoSSaCS 2001: 303-317
1990 – 1999
- 1998
- [j1]Mauricio Gutierrez, Sava Krstic:
Normal Forms for Basis-Conjugating Automorphisms of a Free Group. Int. J. Algebra Comput. 8(6): 631-670 (1998)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
