The SCEAS System
| |||||||

## Search the dblp DataBase
Alexei Lisitsa:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Alexei Lisitsa
**Generalized vs formula circumscription over finite models.**[Citation Graph (0, 0)][DBLP] AMAI, 2000, pp:- [Conf] - Michael Fisher, Alexei Lisitsa
**Monodic ASMs and Temporal Verification.**[Citation Graph (0, 0)][DBLP] Abstract State Machines, 2004, pp:95-110 [Conf] - Alexei Lisitsa, Andrei P. Nemytykh
**Towards Verification via Supercompilation.**[Citation Graph (0, 0)][DBLP] COMPSAC (2), 2005, pp:9-10 [Conf] - Vladimir Yu. Sazonov, Alexei Lisitsa
**Delta-Languages for Sets and sub-PTIME Graphs Transformers.**[Citation Graph (0, 13)][DBLP] ICDT, 1995, pp:125-138 [Conf] - Alexei Lisitsa, Vladimir Yu. Sazonov
**Bounded Hyperset Theory and Web-like Data Bases.**[Citation Graph (0, 0)][DBLP] Kurt Gödel Colloquium, 1997, pp:172-185 [Conf] - Alexei Lisitsa, Vladimir Yu. Sazonov
**On Linear Ordering of Strongly Extensional Finitely-Branching Graphs and Non-well-founded Sets.**[Citation Graph (0, 0)][DBLP] LFCS, 1997, pp:178-188 [Conf] - James Brotherston, Anatoli Degtyarev, Michael Fisher, Alexei Lisitsa
**Searching for Invariants Using Temporal Resolution.**[Citation Graph (0, 0)][DBLP] LPAR, 2002, pp:86-101 [Conf] - Alexei Lisitsa, Igor Potapov
**Membership and Reachability Problems for Row-Monomial Transformations.**[Citation Graph (0, 0)][DBLP] MFCS, 2004, pp:623-634 [Conf] - Alexei Lisitsa, Igor Potapov
**Temporal Logic with Predicate lambda-Abstraction.**[Citation Graph (0, 0)][DBLP] TIME, 2005, pp:147-155 [Conf] - Alexei Lisitsa, Igor Potapov
**In time alone: on the computational power of querying the history.**[Citation Graph (0, 0)][DBLP] TIME, 2006, pp:42-49 [Conf] - Michael Fisher, Boris Konev, Alexei Lisitsa
**Practical Infinite-State Verification with Temporal Reasoning.**[Citation Graph (0, 0)][DBLP] VISSAS, 2005, pp:91-100 [Conf] - Alexei Lisitsa, Igor Potapov
**Temporal logic with predicate abstraction**[Citation Graph (0, 0)][DBLP] CoRR, 2004, v:0, n:, pp:- [Journal] - Alexei Lisitsa
**Complexity of Universal Circumscription.**[Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 1993, v:4, n:3, pp:241-244 [Journal] - Alexei Lisitsa, Andrei P. Nemytykh
**Verification as a parameterized testing (experiments with the SCP4 supercompiler).**[Citation Graph (0, 0)][DBLP] Programming and Computer Software, 2007, v:33, n:1, pp:14-23 [Journal] - Anatoli Degtyarev, Michael Fisher, Alexei Lisitsa
**Equality and Monodic First-Order Temporal Logic.**[Citation Graph (0, 0)][DBLP] Studia Logica, 2002, v:72, n:2, pp:147-156 [Journal] - Alexei Lisitsa, Vladimir Yu. Sazonov
**Delta-Languages for Sets and LOGSPACE Computable Graph Transformers.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1997, v:175, n:1, pp:183-222 [Journal] - Alexei Lisitsa, Vladimir Yu. Sazonov
**Linear Ordering on Graphs, Anti-Founded Sets and Polynomial Time Computability.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:224, n:1-2, pp:173-213 [Journal] - Alexei Lisitsa, Andrei P. Nemytykh
**A Note on Specialization of Interpreters.**[Citation Graph (0, 0)][DBLP] CSR, 2007, pp:237-248 [Conf] - Clare Dixon, Michael Fisher, Boris Konev, Alexei Lisitsa
**Efficient First-Order Temporal Logic for Infinite-State Systems**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] **Reachability as Derivability, Finite Countermodels and Verification.**[Citation Graph (, )][DBLP]**Practical First-Order Temporal Reasoning.**[Citation Graph (, )][DBLP]**Automata on Gauss Words.**[Citation Graph (, )][DBLP]**A logic with temporally accessible iteration**[Citation Graph (, )][DBLP]**On Descriptional Complexity of the Planarity Problem for Gauss Words**[Citation Graph (, )][DBLP]**Agent Based Approaches to Engineering Autonomous Space Software**[Citation Graph (, )][DBLP]
Search in 0.150secs, Finished in 0.150secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |