Next: About this document ...
Alexei Lisitsa: papers and publications
 A. Lisitsa, I. Potapov, R. Saleh, Automata on Gauss words, to appear in the Proceedings of LATA'2009, LNCS 5457, 2009
 Fisher, M., Konev, B., and Lisitsa, A.
Temporal Verification of FaultTolerant Protocols, to a appear in the Book on Methods Models and Tools for Fault Tolerance, LNCS 5454, 2009(?)
 Michael Fisher, Clare Dixon, Alexei Lisitsa, Boris Konev,
Practical FirstOrder Temporal Reasoning, in Proceedings of 15th International Symposium on Temporal Represenation and
Reasoning, TIME 2008
 Alexei Lisitsa, A logic with temporally accessible iteration
CoRR abs/0806.2802: (2008)
 Alexei Lisitsa and Andrei P. Nemytykh, Verification as Specialization of
Interpreters with Respect to Data, in Proceedings of First International
Workshop on Metacomputation in Russia, META'2008, PereslavlZalessky, Russia,
25 July 2008, ISBN 9785901795125, pp 94112
 Alexei Lisitsa and Matt Webster, Supercompilation for Equivalence Testing in Metamorphic
Computer Viruses Detection , in Proceedings of First International
Workshop on Metacomputation in Russia, META'2008, PereslavlZalessky, Russia,
25 July 2008, ISBN 9785901795125, pp 113118
 Alexei Lisitsa and Andrei P. Nemytykh, Reachability Analysis in Verification
via Supercompilation, International Journal of
Foundations of Computer Science, Vol. 19, No. 4 (2008) 953969
 Alexei Lisitsa and Matt Webster, Detecting Metamorphic Computer Viruses
using Supercompilation, in Proceedings of the Workshop on the Theory of Computer Viruses, Nancy,
France, June 2008
 Alexei Lisitsa, Probabilistic Model Checking in Neural Cryptography:
Preliminary Report, in Proceedings of 6th Workshop on Quantitative Aspects of Programming Languages, QAPL'2008,
Budapest, Hungary, March 2008.

A. Lisitsa, A.P. Nemytykh, Extracting Bugs from the Failed Proofs in Verification via Supercompilation, in Bernhard Beckert, Reiner Hahnle, eds. Tests and Proofs: Papers Presented at the Second International Conference TAP 2008, Prato, Italy, April 2008,
Reports of the Faculty of Informatics, Univesitat KoblenzLandau, No 5/2008, pp 4965,
ISSN (print): 18640346, ISSN (Online): 18640850,
 Alexei Lisitsa and Andrei P. Nemytykh, A Note on Specialization of
Interpreters, In Proceedings of CSR 2007, LNCS, Volume 4649, pp 237248
 Fisher, M., Konev, B., and Lisitsa, A.
Temporal Verification of FaultTolerant Protocols. In IFM'07
Workshop on Methods, Models and Tools for Fault Tolerance (MeMoT), Oxford, UK, July 2007.
 Alexei Lisitsa and Andrei P. Nemytykh, Reachability Analysis in Verification
via Supercompilation, in Proceedings of the Workshop on Reachability Problems,
TUCS General prublication, No 45, June 2007, pp 5367
 A.P. Lisitsa and A.P. Nemytykh, Verification as a Parameterized Testing
(Experiments with the SCP4 Supercompiler), in Programming and Computer Software,
2007, Vol. 33, No.1, pp 1423.
 A.P. Lisitsa and A.P. Nemytykh, Work on Errors, in
S. M. Abramov at al. (eds.) Proceedings of
Program Systems, Theory and Applications Conference ,
PereslavlZalessky, Russia, October 2006, FIZMATLIT, Moscow pp 195232 (in Russian)
 Alexei Lisitsa and Igor Potapov, In Time Alone: On the Computational Power
of Querying the History, in the Proceedings of 13th International Symposium on Temporal Represenation and
Reasoning, TIME 2006, pp. 4249, IEEE, 2006
 Alexei Lisitsa and Andrei P. Nemytykh,
Verification of parameterized systems
using supercompilation. A case study. In the Proccedings of the Third Workshop on Applied
Semantics (APPSEM05), Frauenchiemsee, Germany, 1215 September 2005.
 Michael Fisher, Ullrich Hustadt, Boris Konev and Alexei Lisitsa,
What First Order Theorem Provers Do for Monodic Temporal Reasoning,
in Proceedings of ESCAR'05 Workshop.
 A.Lisitsa and A.Nemytykh, Towards verification via supercompulation,
in the Proceedings of the 29th Annual International Computer Sofware and
Applications Conference COMPSAC 2005, Workshops and Fast Abstracts Volume, pp.
910, IEEE, 2005.
 A.Lisitsa, I.Potapov
Temporal logic with predicate lambdaabstraction,
in Jan Chomicki and David Toman(eds.), Proceedings of 12th International
Symposium on Temporal Representation and Reasoning, TIME 2005, IEEE Computer
Society, pp 147155, 2005.
 M.Fisher, A.Lisitsa, and B.Konev,
Practical Infinitestate Verification with Temporal Reasoning, in the
Proceedings of the NATO advance reasearch workshop
Verification of infinitestate systems with applications to security,
VISSAS2005, IOS Press, pp 91100, 2006.
 A.Lisitsa, I.Potapov,
Membership and Reachability Problems for
RowMonomial Transformations, in J.Fiala et al. (Eds.),
Proceedings of 29th International Symposium, MFCS 2004, Prague Czech
Republic, August 2227,2004, LNCS 3135, pp 623634, 2004
 M.Fisher, A.Lisitsa,
Monodic ASMs and Temporal Verification,
in W.Zimmermann and B.Talheim (eds.) ASM 2004, LNCS 3052, pp 95110, 2004
 M.Fisher, A. Lisitsa, Deductive Verification of
Cache Coherence Protocols, in Proceedings of 3rd Workshop on Automated
Verification of Critical Systems AV0CS'2003, Southampton, UK, pp 117186
 A. Degtyarev, M. Fisher and A. Lisitsa, Equality and monodic firstorder
logic, Studia Logica, 72, vol.2, (2002), pp 147156
 J. Brotherston, A. Degtyarev, M. Fisher and A. Lisitsa,
Searching for Invariants using Temporal Resolution,
in Proceeding of 9th International Conference on Logic for Programming,
Artificial Intelligence and Reasoning (LPAR), Tbilisi, Georgia,
2002, LNAI 2514
Next: About this document ... , Springer, pp 86101
 A. Lisitsa and I.Potapov,
Regular Behaviour of Learning Agents in Minority Games, in Proceedings of the
AISB'02 symposium on Adaptive Agents and MultiAgent systems, April 2002,
Imperial College of Science, technology and Medicine University of London,
2002, pp 105110
 A. Lisitsa, Generalized vs. formula circumscription on finite models, in:
Electronic
Proceedings of 6th International Symposium on Artificial Intelligence and Mathematics,
http://rutcor.rutgers.edu/~amai, FortLauderdale, Florida, January 2000
 A. Lisitsa and V. Sazonov,
Linear ordering on graphs, antifounded sets and polynomial time computability
,
Theoretical Computer Science 224 (1999) pp 173213
 A. Dawar and A. Lisitsa, Predicative secondorder logic on finite structures,
in: Proceedings of International Conference on Mathematical Logic devoted
to 90th anniversary
of A.I. Maltsev, Novosibirsk, August 1999, pp. 7778
 A. Lisitsa, V. Sazonov,
languages for sets and LOGSPACEcomputable graph transformers,
Theoretical Computer Science 175 (1997) 183222
 A. Lisitsa, V. Sazonov, Bounded hyperset theory and
weblike data bases in : G.Gotlob, A.Leisch, D.Mundici (Eds.,
Computational Logic and Proof Theory,
5th Kurt Godel Colloquium, KGC'97, Vienna, Austria, 2529 August 1997,
Lecture Notes in Computer Science, vol 1289, Springer, Berlin, 1997, pp 172185
 A. Lisitsa, V. Sazonov,
On linear ordering of strongly extensional
finitelybranching graphs and nonwellfounded sets in :S.Adian, A.Nerode (eds.,
Logical Foundations of Computer Science,
4th International Symposium LFCS'97, Yaroslavl, Russia, July 1997,
Lecture Notes in Computer Science , vol. 1234, Springer, Berlin, 1997, pp. 172185
 A. Lisitsa and G. Osipov, Evolving algebras and
labelled deductive systems for the semantic network based reasoning, in
Proceedings of Workshop on Applied Semiotics, held in conjunction with ECAI96,
Budapest, Aug. 1996, 512
 V. Sazonov, A. Lisitsa, languages for sets and subPTIME
graph transformers, Database Theory  ICDT'95, 5th International Conference,
Prague, Czech Republic, January, 1995, Proceedings. Lecture Notes in Computer Science 893,
Springer (1995) 125138
 A. Lisitsa,
On model checking complexity of circumscription, in Proceedings of Workshop on Algorithms, Complexity and
Commonsence Reasoning'94, held in conjunction with ECAI94, Amsterdam, August, 1994
 A. Lisitsa, Complexity of Universal Circumscription,
International Journal of Foundations of Computer Science, Vol.4 No. 3
(1993) 241244
Next: About this document ...
Alexei Lisitsa
20040921