2008 |
34 | EE | Zurab Khasidashvili:
On Formal Equivalence Verification of Hardware.
CSR 2008: 11-12 |
2007 |
33 | EE | Daher Kaiss,
Marcelo Skaba,
Ziyad Hanna,
Zurab Khasidashvili:
Industrial Strength SAT-based Alignability Algorithm for Hardware Equivalence Verification.
FMCAD 2007: 20-26 |
2006 |
32 | EE | Zurab Khasidashvili,
Marcelo Skaba,
Daher Kaiss,
Ziyad Hanna:
Post-reboot Equivalence and Compositional Verification of Hardware.
FMCAD 2006: 11-18 |
31 | EE | Daher Kaiss,
Silvian Goldenberg,
Zurab Khasidashvili:
Seqver : A Sequential Equivalence Verifier for Hardware Designs .
ICCD 2006 |
30 | EE | 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.
Electr. Notes Theor. Comput. Sci. 144(2): 3-14 (2006) |
2005 |
29 | EE | Zurab Khasidashvili,
Alexander Nadel,
Amit Palti,
Ziyad Hanna:
Simultaneous SAT-Based Model Checking of Safety Properties.
Haifa Verification Conference 2005: 56-75 |
28 | EE | John J. Glauert,
Delia Kesner,
Zurab Khasidashvili:
Expression Reduction Systems and Extensions: An Overview.
Processes, Terms and Cycles 2005: 496-553 |
27 | EE | Zurab Khasidashvili,
John J. Glauert:
The conflict-free Reduction Geometry.
Theor. Comput. Sci. 347(3): 465-497 (2005) |
2004 |
26 | EE | 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 |
25 | EE | Zurab Khasidashvili,
John J. Glauert:
Stable Computational Semantics of Conflict-Free Rewrite Systems (Partial Orders with Duplication).
RTA 2003: 467-482 |
24 | EE | Zurab Khasidashvili,
Ziyad Hanna:
SAT-based methods for sequential hardware equivalence verification without synchronization.
Electr. Notes Theor. Comput. Sci. 89(4): (2003) |
2002 |
23 | EE | Richard Kennaway,
Zurab Khasidashvili,
Adolfo Piperno:
Static Analysis of Modularity of beta-Reduction in the Hyperbalanced lambda-Calculus.
RTA 2002: 51-65 |
22 | EE | John R. W. Glauert,
Zurab Khasidashvili:
An Abstract Böhm-normalization.
Electr. Notes Theor. Comput. Sci. 70(6): (2002) |
21 | EE | 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) |
2001 |
20 | EE | Zurab Khasidashvili,
Mizuhito Ogawa,
Vincent van Oostrom:
Uniform Normalisation beyond Orthogonality.
RTA 2001: 122-136 |
19 | | Zurab Khasidashvili,
Mizuhito Ogawa,
Vincent van Oostrom:
Perpetuality and Uniform Normalization in Orthogonal Rewrite Systems.
Inf. Comput. 164(1): 118-151 (2001) |
18 | EE | Zurab Khasidashvili:
On the longest perpetual reductions in orthogonal expression reduction systems.
Theor. Comput. Sci. 266(1-2): 737-772 (2001) |
2000 |
17 | | John R. W. Glauert,
Richard Kennaway,
Zurab Khasidashvili:
Stable results and relative normalization.
J. Log. Comput. 10(3): 323-348 (2000) |
16 | | Zurab Khasidashvili,
Adolfo Piperno:
A syntactical analysis of normalization.
J. Log. Comput. 10(3): 381-410 (2000) |
1998 |
15 | | Zurab Khasidashvili,
Adolfo Piperno:
Normalization of Typable Terms by Superdevelopments.
CSL 1998: 260-282 |
1997 |
14 | | Zurab Khasidashvili,
Mizuhito Ogawa:
Perpetuality and Uniform Normalization.
ALP/HOA 1997: 240-255 |
13 | | Zurab Khasidashvili,
John R. W. Glauert:
The Geometry of Orthogonal Reduction Spaces.
ICALP 1997: 649-659 |
12 | | Zurab Khasidashvili,
John R. W. Glauert:
Relating Conflict-Free Stable Transition and Event Models (Extended Abstract).
MFCS 1997: 269-278 |
1996 |
11 | | Zurab Khasidashvili,
John R. W. Glauert:
Discrete Normalization and Standardization in Deterministic Residual Structures.
ALP 1996: 135-149 |
10 | | John R. W. Glauert,
Zurab Khasidashvili:
Relative Normalization in Deterministic Residual Structures.
CAAP 1996: 180-195 |
9 | | John R. W. Glauert,
Zurab Khasidashvili:
Minimal Relative Normalization in Orthogonal Expression Reduction Systems.
FSTTCS 1996: 238-249 |
1995 |
8 | EE | Zurab Khasidashvili,
Vincent van Oostrom:
Context-sensitive conditional expression reduction systems.
Electr. Notes Theor. Comput. Sci. 2: (1995) |
1994 |
7 | | Zurab Khasidashvili:
On Higher Order Recursive Program Schemes.
CAAP 1994: 172-186 |
6 | | John R. W. Glauert,
Zurab Khasidashvili:
Relative Normalization in Orthogonal Expression Reduction Systems.
CTRS 1994: 144-165 |
5 | | Zurab Khasidashvili:
The Longest Perpetual Reductions in Orthogonal Expression Reduction Systems.
LFCS 1994: 191-203 |
4 | | Zurab Khasidashvili:
Perpetuality and Strong Normalization in Orthogonal Term Rewriting Systems.
STACS 1994: 163-174 |
1993 |
3 | | Zurab Khasidashvili:
On the Equivalence of Persistent Term Rewriting Systems and Recursive Program Schemes.
ISTCS 1993: 240-249 |
2 | | Zurab Khasidashvili:
Optimal Normalization in Orthogonal Term Rewriting Systems.
RTA 1993: 243-258 |
1988 |
1 | | Zurab Khasidashvili:
beta-reductions and beta developments of lambda terms with the least number of steps.
Conference on Computer Logic 1988: 105-111 |