| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Alexei Lisitsa Alexei Lisitsa, Andrei P. Nemytykh : Towards Verification via Supercompilation. COMPSAC (2) 2005 : 9-10 Alexei Lisitsa, Igor Potapov : Temporal Logic with Predicate lambda-Abstraction. TIME 2005 : 147-155 Michael Fisher , Alexei Lisitsa: Monodic ASMs and Temporal Verification. Abstract State Machines 2004 : 95-110 Alexei Lisitsa, Igor Potapov : Membership and Reachability Problems for Row-Monomial Transformations. MFCS 2004 : 623-634 Alexei Lisitsa, Igor Potapov : Temporal logic with predicate abstraction CoRR cs.LO/0410072 : (2004) James Brotherston , Anatoli Degtyarev , Michael Fisher , Alexei Lisitsa: Searching for Invariants Using Temporal Resolution. LPAR 2002 : 86-101 Anatoli Degtyarev , Michael Fisher , Alexei Lisitsa: Equality and Monodic First-Order Temporal Logic. Studia Logica 72 (2): 147-156 (2002) Alexei Lisitsa: Generalized vs formula circumscription over finite models. AMAI 2000 Alexei Lisitsa, Vladimir Yu. Sazonov : Linear Ordering on Graphs, Anti-Founded Sets and Polynomial Time Computability. Theor. Comput. Sci. 224 (1-2): 173-213 (1999) Alexei Lisitsa, Vladimir Yu. Sazonov : Bounded Hyperset Theory and Web-like Data Bases. Kurt Gödel Colloquium 1997 : 172-185 Alexei Lisitsa, Vladimir Yu. Sazonov : On Linear Ordering of Strongly Extensional Finitely-Branching Graphs and Non-well-founded Sets. LFCS 1997 : 178-188 Alexei Lisitsa, Vladimir Yu. Sazonov : Delta-Languages for Sets and LOGSPACE Computable Graph Transformers. Theor. Comput. Sci. 175 (1): 183-222 (1997) Vladimir Yu. Sazonov , Alexei Lisitsa: Delta-Languages for Sets and sub-PTIME Graphs Transformers. ICDT 1995 : 125-138 Alexei Lisitsa: Complexity of Universal Circumscription. Int. J. Found. Comput. Sci. 4 (3): 241-244 (1993) 1 [ 9 ] 2 [ 8 ] [ 9 ] 3 [ 8 ] [ 9 ] [ 12 ] 4 [ 14 ] 5 [ 10 ] [ 11 ] [ 13 ] 6 [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ]  ©2006 Association for Computing Machinery |
