default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZurab Khasidashvili
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c46]Franz Brauße
, Zurab Khasidashvili, Konstantin Korovin:
SMLP: Symbolic Machine Learning Prover. CAV (1) 2024: 219-233- [i5]Franz Brauße, Zurab Khasidashvili, Konstantin Korovin:
SMLP: Symbolic Machine Learning Prover. CoRR abs/2402.01415 (2024) - [i4]Franz Brauße, Zurab Khasidashvili, Konstantin Korovin:
SMLP: Symbolic Machine Learning Prover (User Manual). CoRR abs/2405.10215 (2024) - 2022
- [c45]Franz Brauße, Zurab Khasidashvili, Konstantin Korovin:
Combining Constraint Solving and Bayesian Techniques for System Optimization. IJCAI 2022: 1788-1794 - [i3]Zurab Khasidashvili:
Accelerating System-Level Debug Using Rule Learning and Subgroup Discovery Techniques. CoRR abs/2207.00622 (2022) - 2021
- [j8]Zurab Khasidashvili, Adam J. Norman:
Feature range analysis. Int. J. Data Sci. Anal. 11(3): 195-219 (2021) - [i2]Franz Brauße, Zurab Khasidashvili, Konstantin Korovin:
Bayesian Optimisation with Formal Guarantees. CoRR abs/2106.06067 (2021) - 2020
- [c44]Franz Brauße, Zurab Khasidashvili, Konstantin Korovin:
Selecting Stable Safe Configurations for Systems Modelled by Neural Networks with ReLU Activation. FMCAD 2020: 119-127
2010 – 2019
- 2019
- [c43]Zurab Khasidashvili, Adam J. Norman:
Range Analysis and Applications to Root Causing. DSAA 2019: 298-307 - 2017
- [j7]Supratik Chakraborty, Zurab Khasidashvili, Carl-Johan H. Seger, Rajkumar Gajavelly, Tanmay Haldankar, Dinesh Chhatani, Rakesh Mistry:
Symbolic trajectory evaluation for word-level verification: theory and implementation. Formal Methods Syst. Des. 50(2-3): 317-352 (2017) - 2016
- [c42]Zurab Khasidashvili, Konstantin Korovin:
Predicate Elimination for Preprocessing in First-Order Theorem Proving. SAT 2016: 361-372 - 2015
- [c41]Supratik Chakraborty, Zurab Khasidashvili, Carl-Johan H. Seger, Rajkumar Gajavelly, Tanmay Haldankar, Dinesh Chhatani, Rakesh Mistry:
Word-Level Symbolic Trajectory Evaluation. CAV (2) 2015: 128-143 - [c40]Zurab Khasidashvili, Konstantin Korovin, Dmitry Tsarkov:
EPR-based k-induction with Counterexample Guided Abstraction Refinement. GCAI 2015: 137-150 - [i1]Supratik Chakraborty, Zurab Khasidashvili, Carl-Johan H. Seger, Rajkumar Gajavelly, Tanmay Haldankar, Dinesh Chhatani, Rakesh Mistry:
Word-level Symbolic Trajectory Evaluation. CoRR abs/1505.07916 (2015) - 2014
- [c39]Ranan Fraer, Doron Keren, Zurab Khasidashvili, Alexander Novakovsky, Avi Puder, Eli Singerman, Eran Talmor, Moshe Y. Vardi, Jin Yang:
From visual to logical formalisms for SoC validation. MEMOCODE 2014: 165-174 - 2012
- [c38]Moshe Emmer, Zurab Khasidashvili, Konstantin Korovin, Christoph Sticksel, Andrei Voronkov:
EPR-Based Bounded Model Checking at Word Level. IJCAR 2012: 210-224 - [c37]Krystof Hoder, Zurab Khasidashvili, Konstantin Korovin, Andrei Voronkov:
Preprocessing techniques for first-order clausification. FMCAD 2012: 44-51 - 2011
- [c36]Zurab Khasidashvili, Alexander Nadel:
Implicative Simultaneous Satisfiability and Applications. Haifa Verification Conference 2011: 66-79 - 2010
- [c35]Moshe Emmer, Zurab Khasidashvili, Konstantin Korovin, Andrei Voronkov:
Encoding industrial hardware verification problems into effectively propositional logic. FMCAD 2010: 137-144
2000 – 2009
- 2009
- [c34]Zurab Khasidashvili, Gavriel Gavrielov, Tom Melham:
Assume-guarantee validation for STE properties within an SVA environment. FMCAD 2009: 108-115 - [c33]Zurab Khasidashvili, Mahmoud Kinanah, Andrei Voronkov:
Verifying equivalence of memories using a first order logic theorem prover. FMCAD 2009: 128-135 - [c32]Zurab Khasidashvili, Daher Kaiss, Doron Bustan:
A compositional theory for post-reboot observational equivalence checking of hardware. FMCAD 2009: 136-143 - 2008
- [c31]Zurab Khasidashvili:
On Formal Equivalence Verification of Hardware. CSR 2008: 11-12 - 2007
- [c30]Daher Kaiss, Marcelo Skaba, Ziyad Hanna, Zurab Khasidashvili:
Industrial Strength SAT-based Alignability Algorithm for Hardware Equivalence Verification. FMCAD 2007: 20-26 - 2006
- [c29]Zurab Khasidashvili, Marcelo Skaba, Daher Kaiss, Ziyad Hanna:
Post-reboot Equivalence and Compositional Verification of Hardware. FMCAD 2006: 11-18 - [c28]Daher Kaiss, Silvian Goldenberg, Zurab Khasidashvili:
Seqver : A Sequential Equivalence Verifier for Hardware Designs . ICCD 2006: 267-273 - 2005
- [j6]Zurab Khasidashvili, John R. W. Glauert:
The conflict-free Reduction Geometry. Theor. Comput. Sci. 347(3): 465-497 (2005) - [c27]John R. W. Glauert, Delia Kesner, Zurab Khasidashvili:
Expression Reduction Systems and Extensions: An Overview. Processes, Terms and Cycles 2005: 496-553 - [c26]Zurab Khasidashvili, Alexander Nadel, Amit Palti, Ziyad Hanna:
Simultaneous SAT-Based Model Checking of Safety Properties. Haifa Verification Conference 2005: 56-75 - [c25]Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Anders Franzén, Ziyad Hanna, Zurab Khasidashvili, Amit Palti, Roberto Sebastiani:
Encoding RTL Constructs for MathSAT: a Preliminary Report. PDPAR@CAV 2005: 3-14 - 2004
- [c24]Zurab Khasidashvili, Marcelo Skaba, Daher Kaiss, Ziyad Hanna:
Theoretical framework for compositional sequential hardware equivalence verification in presence of design constraints. ICCAD 2004: 58-65 - 2003
- [c23]Zurab Khasidashvili, John R. W. Glauert:
Stable Computational Semantics of Conflict-Free Rewrite Systems (Partial Orders with Duplication). RTA 2003: 467-482 - [c22]Zurab Khasidashvili, Ziyad Hanna:
SAT-based methods for sequential hardware equivalence verification without synchronization. BMC@CAV 2003: 593-607 - [c21]Zurab Khasidashvili, John R. W. Glauert:
An Abstract Concept of Optimal Implementation. WRS 2003: 689-713 - 2002
- [j5]Zurab Khasidashvili, John R. W. Glauert:
Relating conflict-free stable transition and event models via redex families. Theor. Comput. Sci. 286(1): 65-95 (2002) - [c20]Zurab Khasidashvili, John Moondanos, Ziyad Hanna:
TRANS: efficient sequential verification of loop-free circuits. HLDVT 2002: 115-120 - [c19]Richard Kennaway, Zurab Khasidashvili, Adolfo Piperno:
Static Analysis of Modularity of beta-Reduction in the Hyperbalanced lambda-Calculus. RTA 2002: 51-65 - [c18]John R. W. Glauert, Zurab Khasidashvili:
An Abstract Böhm-normalization. WRS 2002: 118-134 - 2001
- [j4]Zurab Khasidashvili, Mizuhito Ogawa, Vincent van Oostrom:
Perpetuality and Uniform Normalization in Orthogonal Rewrite Systems. Inf. Comput. 164(1): 118-151 (2001) - [j3]Zurab Khasidashvili:
On the longest perpetual reductions in orthogonal expression reduction systems. Theor. Comput. Sci. 266(1-2): 737-772 (2001) - [c17]Zurab Khasidashvili, John Moondanos, Daher Kaiss, Ziyad Hanna:
An enhanced cut-points algorithm in formal equivalence verification. HLDVT 2001: 171-176 - [c16]Zurab Khasidashvili, Mizuhito Ogawa, Vincent van Oostrom:
Uniform Normalisation beyond Orthogonality. RTA 2001: 122-136 - 2000
- [j2]John R. W. Glauert, Richard Kennaway, Zurab Khasidashvili:
Stable results and relative normalization. J. Log. Comput. 10(3): 323-348 (2000) - [j1]Zurab Khasidashvili, Adolfo Piperno:
A syntactical analysis of normalization. J. Log. Comput. 10(3): 381-410 (2000)
1990 – 1999
- 1998
- [c15]Zurab Khasidashvili, Adolfo Piperno:
Normalization of Typable Terms by Superdevelopments. CSL 1998: 260-282 - 1997
- [c14]Zurab Khasidashvili, Mizuhito Ogawa:
Perpetuality and Uniform Normalization. ALP/HOA 1997: 240-255 - [c13]Zurab Khasidashvili, John R. W. Glauert:
The Geometry of Orthogonal Reduction Spaces. ICALP 1997: 649-659 - [c12]Zurab Khasidashvili, John R. W. Glauert:
Relating Conflict-Free Stable Transition and Event Models (Extended Abstract). MFCS 1997: 269-278 - 1996
- [c11]Zurab Khasidashvili, John R. W. Glauert:
Discrete Normalization and Standardization in Deterministic Residual Structures. ALP 1996: 135-149 - [c10]John R. W. Glauert, Zurab Khasidashvili:
Relative Normalization in Deterministic Residual Structures. CAAP 1996: 180-195 - [c9]John R. W. Glauert, Zurab Khasidashvili:
Minimal Relative Normalization in Orthogonal Expression Reduction Systems. FSTTCS 1996: 238-249 - 1995
- [c8]Zurab Khasidashvili, Vincent van Oostrom:
Context-sensitive conditional expression reduction systems. SEGRAGRA 1995: 167-176 - 1994
- [c7]Zurab Khasidashvili:
On Higher Order Recursive Program Schemes. CAAP 1994: 172-186 - [c6]John R. W. Glauert, Zurab Khasidashvili:
Relative Normalization in Orthogonal Expression Reduction Systems. CTRS 1994: 144-165 - [c5]Zurab Khasidashvili:
The Longest Perpetual Reductions in Orthogonal Expression Reduction Systems. LFCS 1994: 191-203 - [c4]Zurab Khasidashvili:
Perpetuality and Strong Normalization in Orthogonal Term Rewriting Systems. STACS 1994: 163-174 - 1993
- [c3]Zurab Khasidashvili:
On the Equivalence of Persistent Term Rewriting Systems and Recursive Program Schemes. ISTCS 1993: 240-249 - [c2]Zurab Khasidashvili:
Optimal Normalization in Orthogonal Term Rewriting Systems. RTA 1993: 243-258
1980 – 1989
- 1988
- [c1]Zurab Khasidashvili:
beta-reductions and beta developments of lambda terms with the least number of steps. Conference on Computer Logic 1988: 105-111
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-10-07 22:18 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:
