2009 |
24 | EE | Alexei Lisitsa,
Igor Potapov,
Rafiq Saleh:
Automata on Gauss Words.
LATA 2009: 505-517 |
2008 |
23 | EE | Clare Dixon,
Michael Fisher,
Boris Konev,
Alexei Lisitsa:
Practical First-Order Temporal Reasoning.
TIME 2008: 156-163 |
22 | EE | Alexei Lisitsa:
A logic with temporally accessible iteration
CoRR abs/0806.2802: (2008) |
21 | EE | Alexei Lisitsa,
Andrei P. Nemytykh:
Reachability Analysis in Verification via Supercompilation.
Int. J. Found. Comput. Sci. 19(4): 953-969 (2008) |
2007 |
20 | EE | Alexei Lisitsa,
Andrei P. Nemytykh:
A Note on Specialization of Interpreters.
CSR 2007: 237-248 |
19 | EE | Clare Dixon,
Michael Fisher,
Boris Konev,
Alexei Lisitsa:
Efficient First-Order Temporal Logic for Infinite-State Systems
CoRR abs/cs/0702036: (2007) |
18 | EE | Alexei Lisitsa,
Andrei P. Nemytykh:
Verification as a parameterized testing (experiments with the SCP4 supercompiler).
Programming and Computer Software 33(1): 14-23 (2007) |
2006 |
17 | | Michael Fisher,
Wiebe van der Hoek,
Boris Konev,
Alexei Lisitsa:
Logics in Artificial Intelligence, 10th European Conference, JELIA 2006, Liverpool, UK, September 13-15, 2006, Proceedings
Springer 2006 |
16 | EE | Alexei Lisitsa,
Igor Potapov:
In time alone: on the computational power of querying the history.
TIME 2006: 42-49 |
2005 |
15 | EE | Alexei Lisitsa,
Andrei P. Nemytykh:
Towards Verification via Supercompilation.
COMPSAC (2) 2005: 9-10 |
14 | EE | Alexei Lisitsa,
Igor Potapov:
Temporal Logic with Predicate lambda-Abstraction.
TIME 2005: 147-155 |
13 | | Michael Fisher,
Boris Konev,
Alexei Lisitsa:
Practical Infinite-State Verification with Temporal Reasoning.
VISSAS 2005: 91-100 |
2004 |
12 | EE | Michael Fisher,
Alexei Lisitsa:
Monodic ASMs and Temporal Verification.
Abstract State Machines 2004: 95-110 |
11 | EE | Alexei Lisitsa,
Igor Potapov:
Membership and Reachability Problems for Row-Monomial Transformations.
MFCS 2004: 623-634 |
10 | EE | Alexei Lisitsa,
Igor Potapov:
Temporal logic with predicate abstraction
CoRR cs.LO/0410072: (2004) |
2002 |
9 | EE | James Brotherston,
Anatoli Degtyarev,
Michael Fisher,
Alexei Lisitsa:
Searching for Invariants Using Temporal Resolution.
LPAR 2002: 86-101 |
8 | | Anatoli Degtyarev,
Michael Fisher,
Alexei Lisitsa:
Equality and Monodic First-Order Temporal Logic.
Studia Logica 72(2): 147-156 (2002) |
2000 |
7 | EE | Alexei Lisitsa:
Generalized vs formula circumscription over finite models.
AMAI 2000 |
1999 |
6 | EE | 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) |
1997 |
5 | | Alexei Lisitsa,
Vladimir Yu. Sazonov:
Bounded Hyperset Theory and Web-like Data Bases.
Kurt Gödel Colloquium 1997: 172-185 |
4 | | Alexei Lisitsa,
Vladimir Yu. Sazonov:
On Linear Ordering of Strongly Extensional Finitely-Branching Graphs and Non-well-founded Sets.
LFCS 1997: 178-188 |
3 | EE | Alexei Lisitsa,
Vladimir Yu. Sazonov:
Delta-Languages for Sets and LOGSPACE Computable Graph Transformers.
Theor. Comput. Sci. 175(1): 183-222 (1997) |
1995 |
2 | EE | Vladimir Yu. Sazonov,
Alexei Lisitsa:
Delta-Languages for Sets and sub-PTIME Graphs Transformers.
ICDT 1995: 125-138 |
1993 |
1 | | Alexei Lisitsa:
Complexity of Universal Circumscription.
Int. J. Found. Comput. Sci. 4(3): 241-244 (1993) |