Alexei Lisitsa

Alexei Lisitsa: First-order theorem proving in the exploration of Andrews-Curtis conjecture. TinyToCS 2 (2013)

Alexei Lisitsa: Finite Models vs Tree Automata in Safety Verification. RTA 2012: 225-239

Alexei Lisitsa, Andrei P. Nemytykh: A Note on Program Specialization. What Can Syntactical Properties of Residual Programs Reveal? CoRR abs/1209.5407 (2012)

Alexei Lisitsa, Igor Potapov, Rafiq Saleh: Planarity of Knots, Register Automata and LogSpace Computability. LATA 2011: 366-377

Abdulbasit Ahmed, Alexei Lisitsa, Clare Dixon: A misuse-based network Intrusion Detection System using Temporal Logic and stream processing. NSS 2011: 1-8

Alexei Lisitsa: Temporal Access to the Iteration Sequences: A Unifying Approach to Fixed Point Logics. TIME 2011: 57-63

Alexei Lisitsa: First-order finite satisfiability vs tree automata in safety verification. CoRR abs/1107.0349 (2011)

Alexei Lisitsa: Finite countermodels for safety verification of parameterized tree systems. CoRR abs/1107.5142 (2011)

Louise A. Dennis, Michael Fisher, Alexei Lisitsa, Nicholas Lincoln, Sandor M. Veres: Satellite Control Using Rational Agent Programming. IEEE Intelligent Systems 25(3): 92-97 (2010)

Alexei Lisitsa, Andrei P. Nemytykh: On one application of computations with oracle. Programming and Computer Software 36(3): 157-165 (2010)

Alexei Lisitsa: Reachability as Derivability, Finite Countermodels and Verification. ATVA 2010: 233-244

Louise A. Dennis, Michael Fisher, Nicholas Lincoln, Alexei Lisitsa, Sandor M. Veres: Declarative Abstractions for Agent Based Hybrid Control Systems. DALT 2010: 96-111

Alexei Lisitsa: Finite Model Finding for Parameterized Verification. CoRR abs/1011.0447 (2010)

Alexei Lisitsa, Igor Potapov: On the Computational Power of Querying the History. Fundam. Inform. 91(2): 395-409 (2009)

Alexei Lisitsa, Igor Potapov, Rafiq Saleh: Automata on Gauss Words. LATA 2009: 505-517

Louise A. Dennis, Michael Fisher, Nicholas Lincoln, Alexei Lisitsa, Sandor M. Veres: Agent Based Approaches to Engineering Autonomous Space Software. FMA 2009: 63-67

Michael Fisher, Boris Konev, Alexei Lisitsa: Temporal Verification of Fault-Tolerant Protocols. Methods, Models and Tools for Fault Tolerance 2009: 44-56

Vitaliy Kurlin, Alexei Lisitsa, Igor Potapov, Rafiq Saleh: On Descriptional Complexity of the Planarity Problem for Gauss Words. CoRR abs/0907.4180 (2009)

Alexei Lisitsa, Andrei P. Nemytykh: Reachability Analysis in Verification via Supercompilation. Int. J. Found. Comput. Sci. 19(4): 953-969 (2008)

Clare Dixon, Michael Fisher, Boris Konev, Alexei Lisitsa: Practical First-Order Temporal Reasoning. TIME 2008: 156-163

Alexei Lisitsa: A logic with temporally accessible iteration. CoRR abs/0806.2802 (2008)

Alexei Lisitsa, Andrei P. Nemytykh: Verification as a parameterized testing (experiments with the SCP4 supercompiler). Programming and Computer Software 33(1): 14-23 (2007)

Alexei Lisitsa, Andrei P. Nemytykh: A Note on Specialization of Interpreters. CSR 2007: 237-248

Clare Dixon, Michael Fisher, Boris Konev, Alexei Lisitsa: Efficient First-Order Temporal Logic for Infinite-State Systems. CoRR abs/cs/0702036 (2007)

Alexei Lisitsa, Igor Potapov: In time alone: on the computational power of querying the history. TIME 2006: 42-49

Michael Fisher, Wiebe van der Hoek, Boris Konev, Alexei Lisitsa (Eds.): Logics in Artificial Intelligence, 10th European Conference, JELIA 2006, Liverpool, UK, September 13-15, 2006, Proceedings. Lecture Notes in Computer Science 4160, Springer 2006, isbn 3-540-39625-X

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, Boris Konev, Alexei Lisitsa: Practical Infinite-State Verification with Temporal Reasoning. VISSAS 2005: 91-100

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)

Anatoli Degtyarev, Michael Fisher, Alexei Lisitsa: Equality and Monodic First-Order Temporal Logic. Studia Logica 72(2): 147-156 (2002)

James Brotherston, Anatoli Degtyarev, Michael Fisher, Alexei Lisitsa: Searching for Invariants Using Temporal Resolution. LPAR 2002: 86-101

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: Delta-Languages for Sets and LOGSPACE Computable Graph Transformers. Theor. Comput. Sci. 175(1): 183-222 (1997)

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

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)