Dr Alexei Lisitsa

Lecturer Computer Science

    Publications

    2020

    Querrying Encrypted Data in Graph Databases (Conference Paper)

    Coenen, F. P., Lisitsa, A., & Aburawi, N. N. (2020). Querrying Encrypted Data in Graph Databases.

    2019

    Analysing Security Protocols Using Scenario Based Simulation (Conference Paper)

    Al-Shareefi, F., Lisitsa, A., & Dixon, C. (2019). Analysing Security Protocols Using Scenario Based Simulation. In Unknown Conference (pp. 47-62). Springer International Publishing. doi:10.1007/978-3-030-35092-5_4

    DOI: 10.1007/978-3-030-35092-5_4

    Agent-based (BDI) modeling for automation of penetration testing (Journal article)

    Chu, G., & Lisitsa, A. (n.d.). Agent-based (BDI) modeling for automation of penetration testing. Retrieved from http://arxiv.org/abs/1908.06970v1

    Proceedings Seventh International Workshop on Verification and Program Transformation (Journal article)

    Lisitsa, A., & Nemytykh, A. (n.d.). Proceedings Seventh International Workshop on Verification and Program Transformation. EPTCS 299, 2019. doi:10.4204/EPTCS.299

    DOI: 10.4204/EPTCS.299

    Modular Verification of Autonomous Space Robotics (Conference Paper)

    Farrell, M., Cardoso, R. C., Dennis, L. A., Dixon, C., Fisher, M., Kourtis, G., . . . Webster, M. (n.d.). Modular Verification of Autonomous Space Robotics. Retrieved from http://arxiv.org/abs/1908.10738v1

    Investigating the Capability of Agile Processes to Support Medical Devices Regulations: The Case of XP, Scrum, and FDD with EU MDR Regulations (Conference Paper)

    Alsaadi, M., Lisitsa, A., Khalaf, M., & Qasaimeh, M. (2019). Investigating the Capability of Agile Processes to Support Medical Devices Regulations: The Case of XP, Scrum, and FDD with EU MDR Regulations. In Unknown Conference (pp. 581-592). Springer International Publishing. doi:10.1007/978-3-030-26766-7_53

    DOI: 10.1007/978-3-030-26766-7_53

    Penetration Testing for Internet of Things and Its Automation (Conference Paper)

    Chu, G., Lisitsa, A., & IEEE. (2018). Penetration Testing for Internet of Things and Its Automation. In IEEE 20TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS / IEEE 16TH INTERNATIONAL CONFERENCE ON SMART CITY / IEEE 4TH INTERNATIONAL CONFERENCE ON DATA SCIENCE AND SYSTEMS (HPCC/SMARTCITY/DSS) (pp. 1479-1484). doi:10.1109/HPCC/SmartCity/DSS.2018.00244

    DOI: 10.1109/HPCC/SmartCity/DSS.2018.00244

    Flexible access control and confidentiality over encrypted data for document-based database (Conference Paper)

    Almarwani, M., Konev, B., & Lisitsa, A. (2019). Flexible access control and confidentiality over encrypted data for document-based database. In ICISSP 2019 - Proceedings of the 5th International Conference on Information Systems Security and Privacy (pp. 606-614).

    2018

    Towards human readability of automated unknottedness proofs (Conference Paper)

    Fish, A., Lisitsa, A., & Vernitski, A. (2018). Towards human readability of automated unknottedness proofs. In CEUR Workshop Proceedings Vol. 2261 (pp. 27-32).

    Revisiting mu-puzzle. A case study in finite countermodels verification (Conference Paper)

    Lisitsa, A. (2018). Revisiting mu-puzzle. A case study in finite countermodels verification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 11123 LNCS (pp. 75-86). doi:10.1007/978-3-030-00250-3_6

    DOI: 10.1007/978-3-030-00250-3_6

    Dihedral semigroups, their defining relations and an application to describing knot semigroups of rational links (Journal article)

    Vernitski, A., Tunsi, L., Ponchel, C., & Lisitsa, A. (2018). Dihedral semigroups, their defining relations and an application to describing knot semigroups of rational links. SEMIGROUP FORUM, 97(1), 75-86. doi:10.1007/s00233-018-9918-5

    DOI: 10.1007/s00233-018-9918-5

    The Andrews-Curtis Conjecture, Term Rewriting and First-Order Proofs (Conference Paper)

    Lisitsa, A. (2018). The Andrews-Curtis Conjecture, Term Rewriting and First-Order Proofs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 10931 LNCS (pp. 343-351). doi:10.1007/978-3-319-96418-8_41

    DOI: 10.1007/978-3-319-96418-8_41

    Visual Algebraic proofs for Unknot Detection (Conference Paper)

    Lisitsa, A., Fish, A., & Vernitski, A. (2018). Visual Algebraic proofs for Unknot Detection. In Diagrams. Edinburgh.

    Clarification of Ambiguity for the Simple Authentication and Security Layer (Conference Paper)

    Al-Shareefi, F., Lisitsa, A., & Dixon, C. (2018). Clarification of Ambiguity for the Simple Authentication and Security Layer. In Unknown Conference (pp. 189-203). Springer International Publishing. doi:10.1007/978-3-319-91271-4_13

    DOI: 10.1007/978-3-319-91271-4_13

    POSTER: A Re-evaluation of Intrusion Detection Accuracy: an Alternative Evaluation Strategy (Conference Paper)

    Al-Riyami, S., Coenen, F., Lisitsa, A., & ACM. (2018). POSTER: A Re-evaluation of Intrusion Detection Accuracy: an Alternative Evaluation Strategy. In PROCEEDINGS OF THE 2018 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'18) (pp. 2195-2197). doi:10.1145/3243734.3278490

    DOI: 10.1145/3243734.3278490

    Poster: Agent-based (BDI) modeling for automation of penetration testing (Conference Paper)

    Chu, G., & Lisitsa, A. (2018). Poster: Agent-based (BDI) modeling for automation of penetration testing. In 2018 16TH ANNUAL CONFERENCE ON PRIVACY, SECURITY AND TRUST (PST) (pp. 327-328). Retrieved from http://gateway.webofknowledge.com/

    Querying Encrypted Graph Databases (Conference Paper)

    Aburawi, N., Lisitsa, A., & Coenen, F. (2018). Querying Encrypted Graph Databases. In ICISSP 2018 - Proceedings of the 4th International Conference on Information Systems Security and Privacy Vol. 2018-January (pp. 447-451).

    Traversal-aware Encryption Adjustment for Graph Databases (Conference Paper)

    Aburawi, N., Coenen, F., & Lisitsa, A. (2018). Traversal-aware Encryption Adjustment for Graph Databases. In DATA 2018 - Proceedings of the 7th International Conference on Data Science, Technology and Applications (pp. 381-387).

    2017

    Abstract State Machines and System Theoretic Process Analysis for Safety-Critical Systems (Conference Paper)

    Al-Shareefi, F., Lisitsa, A., & Dixon, C. (2017). Abstract State Machines and System Theoretic Process Analysis for Safety-Critical Systems. In 20th Brazilian Symposium on Formal Methods. Recife, Brazil.

    Verification of Programs via Intermediate Interpretation (Journal article)

    Lisitsa, A. P., & Nemytykh, A. P. (n.d.). Verification of Programs via Intermediate Interpretation. EPTCS 253, 2017, pp. 54-74. doi:10.4204/EPTCS.253.6

    DOI: 10.4204/EPTCS.253.6

    Proceedings Fifth International Workshop on Verification and Program Transformation (Journal article)

    Lisitsa, A., Nemytykh, A. P., & Proietti, M. (n.d.). Proceedings Fifth International Workshop on Verification and Program Transformation. EPTCS 253, 2017. doi:10.4204/EPTCS.253

    DOI: 10.4204/EPTCS.253

    A Prediction Model Based Approach to Open Space Steganography Detection in HTML Webpages (Conference Paper)

    Coenen, F. P., Sedeeq, I., & Lisitsa. (2017). A Prediction Model Based Approach to Open Space Steganography Detection in HTML Webpages.

    Reputation System Aggregation and Ageing Factor Selection using Subjective Opinions Classification (Conference Paper)

    Coenen, F. P., abdeglmageed., & lisitsa. (2017). Reputation System Aggregation and Ageing Factor Selection using Subjective Opinions Classification.

    Verifying Programs via Intermediate Interpretation (Journal article)

    Lisitsa, A. P., & Nemytykh, A. P. (n.d.). Verifying Programs via Intermediate Interpretation. Retrieved from http://arxiv.org/abs/1705.06738v1

    Attribute Permutation Steganography Detection using Attribute Position Changes Count (Conference Paper)

    Sedeeq, I., Coenen, F., & Lisitsa, A. (2017). Attribute Permutation Steganography Detection using Attribute Position Changes Count. In ICISSP: PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON INFORMATION SYSTEMS SECURITY AND PRIVACY (pp. 95-100). doi:10.5220/0006166400950100

    DOI: 10.5220/0006166400950100

    Automated Reasoning for Knot Semigroups and  $$\pi $$ π -orbifold Groups of Knots (Conference Paper)

    Lisitsa, A., & Vernitski, A. (2017). Automated Reasoning for Knot Semigroups and  $$\pi $$ π -orbifold Groups of Knots. In Unknown Conference (pp. 3-18). Springer International Publishing. doi:10.1007/978-3-319-72453-9_1

    DOI: 10.1007/978-3-319-72453-9_1

    On The Mining and Usage of Movement Patterns in Large Traffic Networks (Conference Paper)

    Al-Zeyadi, M., Coenen, F., Lisitsa, A., & IEEE. (2017). On The Mining and Usage of Movement Patterns in Large Traffic Networks. In 2017 IEEE INTERNATIONAL CONFERENCE ON BIG DATA AND SMART COMPUTING (BIGCOMP) (pp. 135-142). Retrieved from http://gateway.webofknowledge.com/

    Proceedings Fifth International Workshop on Verification and Program Transformation, VPT@ETAPS 2017, Uppsala, Sweden, 29th April 2017. (Conference Paper)

    Lisitsa, A., Nemytykh, A. P., & Proietti, M. (Eds.) (2017). Proceedings Fifth International Workshop on Verification and Program Transformation, VPT@ETAPS 2017, Uppsala, Sweden, 29th April 2017.. In VPT@ETAPS Vol. 253.

    User-to-user recommendation using the concept of movement patterns: A study using a dating social network (Conference Paper)

    Al-Zeyadi, M., Coenen, F., & Lisitsa, A. (2017). User-to-user recommendation using the concept of movement patterns: A study using a dating social network. In IC3K 2017 - Proceedings of the 9th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management Vol. 1 (pp. 173-180).

    2016

    Performance Analysis of Molecular Communication Model (Conference Paper)

    Juhi, A., Kowalski, D. R., Lisitsa, A., & IEEE. (2016). Performance Analysis of Molecular Communication Model. In 2016 IEEE 16TH INTERNATIONAL CONFERENCE ON NANOTECHNOLOGY (IEEE-NANO) (pp. 826-829). Retrieved from http://gateway.webofknowledge.com/

    Practical verification of decision-making in agent-based autonomous systems (Journal article)

    Dennis, L. A., Fisher, M., Lincoln, N. K., Lisitsa, A., & Veres, S. M. (2016). Practical verification of decision-making in agent-based autonomous systems. AUTOMATED SOFTWARE ENGINEERING, 23(3), 305-359. doi:10.1007/s10515-014-0168-9

    DOI: 10.1007/s10515-014-0168-9

    Proceedings of the Fourth International Workshop on Verification and Program Transformation (Journal article)

    Hamilton, G., Lisitsa, A., & Nemytykh, A. P. (n.d.). Proceedings of the Fourth International Workshop on Verification and Program Transformation. EPTCS 216, 2016. doi:10.4204/EPTCS.216

    DOI: 10.4204/EPTCS.216

    Automated verification of programs and Web systems (Journal article)

    ter Beek, M. H., Lisitsa, A., Nemytykh, A. P., & Ravara, A. (2016). Automated verification of programs and Web systems. JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING, 85(5), 653-654. doi:10.1016/j.jlamp.2016.06.005

    DOI: 10.1016/j.jlamp.2016.06.005

    A Statistical Approach to The Detection of HTML Attribute Permutation. (Conference Paper)

    Coenen, F. P., lisitsa., & sedeeq. (2016). A Statistical Approach to The Detection of HTML Attribute Permutation..

    A Statistical Approach to the Detection of HTML Attribute Permutation Steganography. (Conference Paper)

    Sedeeq, I., Coenen, F., & Lisitsa, A. (2016). A Statistical Approach to the Detection of HTML Attribute Permutation Steganography.. In O. Camp, S. Furnell, & P. Mori (Eds.), ICISSP (pp. 522-527). SciTePress. Retrieved from http://www.informatik.uni-trier.de/~ley/db/conf/icissp/icissp2016.html

    Efficient Knot Discrimination via Quandle Coloring with SAT and #-SAT (Conference Paper)

    Fish, A., Lisitsa, A., Stanovsky, D., & Swartwood, S. (2016). Efficient Knot Discrimination via Quandle Coloring with SAT and #-SAT. In MATHEMATICAL SOFTWARE, ICMS 2016 Vol. 9725 (pp. 51-58). doi:10.1007/978-3-319-42432-3_7

    DOI: 10.1007/978-3-319-42432-3_7

    Mining Frequent Movement Patterns in Large Networks: A Parallel Approach Using Shapes. (Conference Paper)

    Al-Zeyadi, M., Coenen, F., & Lisitsa, A. (2016). Mining Frequent Movement Patterns in Large Networks: A Parallel Approach Using Shapes.. In M. Bramer, & M. Petridis (Eds.), SGAI Conf. (pp. 53-67). Springer. Retrieved from https://doi.org/10.1007/978-3-319-47175-4

    Proceedings of the Fourth International Workshop on Verification and Program Transformation, VPT@ETAPS 2016, Eindhoven, The Netherlands, 2nd April 2016. (Conference Paper)

    Hamilton, G. W., Lisitsa, A., & Nemytykh, A. P. (Eds.) (2016). Proceedings of the Fourth International Workshop on Verification and Program Transformation, VPT@ETAPS 2016, Eindhoven, The Netherlands, 2nd April 2016.. In VPT@ETAPS Vol. 216.

    2015

    Finite Countermodel Based Verification for Program Transformation (A Case Study) (Conference Paper)

    Lisitsa, A. P., & Nemytykh, A. P. (n.d.). Finite Countermodel Based Verification for Program Transformation (A Case Study). In EPTCS 199, 2015, pp. 15-32. doi:10.4204/EPTCS.199.2

    DOI: 10.4204/EPTCS.199.2

    Verifying Temporal Properties of Reactive Systems by Transformation (Conference Paper)

    Hamilton, G. (n.d.). Verifying Temporal Properties of Reactive Systems by Transformation. In Electronic Proceedings in Theoretical Computer Science Vol. 199 (pp. 33-49). Open Publishing Association. doi:10.4204/eptcs.199.3

    DOI: 10.4204/eptcs.199.3

    Proceedings of the Third International Workshop on Verification and Program Transformation (Conference Paper)

    Lisitsa, A., Nemytykh, A. P., & Pettorossi, A. (n.d.). Proceedings of the Third International Workshop on Verification and Program Transformation. In EPTCS 199, 2015. doi:10.4204/EPTCS.199

    DOI: 10.4204/EPTCS.199

    A Combinatorial Approach to Knot Recognition (Journal article)

    Fish, A., Lisitsa, A., & Stanovsky, D. (2015). A Combinatorial Approach to Knot Recognition. EMBRACING GLOBAL COMPUTING IN EMERGING ECONOMIES, EGC 2015, 514, 64-78. doi:10.1007/978-3-319-25043-4_7

    DOI: 10.1007/978-3-319-25043-4_7

    A Combinatorial Approach to Knot Recognition. (Conference Paper)

    Fish, A., Lisitsa, A., & Stanovský, D. (2015). A Combinatorial Approach to Knot Recognition.. In R. Horne (Ed.), EGC Vol. 514 (pp. 64-78). Springer. Retrieved from https://doi.org/10.1007/978-3-319-25043-4

    Computer-aided proof of Erdos discrepancy properties (Journal article)

    Konev, B., & Lisitsa, A. (2015). Computer-aided proof of Erdos discrepancy properties. ARTIFICIAL INTELLIGENCE, 224, 103-118. doi:10.1016/j.artint.2015.03.004

    DOI: 10.1016/j.artint.2015.03.004

    First-order logic for safety verification of hedge rewriting systems (Journal article)

    Lisitsa, A. (2015). First-order logic for safety verification of hedge rewriting systems. Electronic Communications of the EASST, 72. doi:10.14279/tuj.eceasst.72.1020.1008

    DOI: 10.14279/tuj.eceasst.72.1020.1008

    2014

    A SAT Attack on the Erdos Discrepancy Conjecture (Conference Paper)

    Konev, B., & Lisitsa, A. (2014). A SAT Attack on the Erdos Discrepancy Conjecture. In THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2014 Vol. 8561 (pp. 219-226). Retrieved from http://gateway.webofknowledge.com/

    A SAT Attack on the Erdős Discrepancy Conjecture. (Conference Paper)

    Konev, B., & Lisitsa, A. (2014). A SAT Attack on the Erdős Discrepancy Conjecture.. In C. Sinz, & U. Egly (Eds.), SAT Vol. 8561 (pp. 219-226). Springer. Retrieved from https://doi.org/10.1007/978-3-319-09284-3

    Computer-Aided Proof of Erdos Discrepancy Properties. (Journal article)

    Konev, B., & Lisitsa, A. (2014). Computer-Aided Proof of Erdos Discrepancy Properties.. CoRR, abs/1405.3097.

    Detecting Unknots via Equational Reasoning, I: Exploration (Journal article)

    Fish, A., & Lisitsa, A. (2014). Detecting Unknots via Equational Reasoning, I: Exploration. INTELLIGENT COMPUTER MATHEMATICS, CICM 2014, 8543, 76-91. Retrieved from http://gateway.webofknowledge.com/

    Detecting Unknots via Equational Reasoning, I: Exploration. (Conference Paper)

    Fish, A., & Lisitsa, A. (2014). Detecting Unknots via Equational Reasoning, I: Exploration.. In S. M. Watt, J. H. Davenport, A. P. Sexton, P. Sojka, & J. Urban (Eds.), CICM Vol. 8543 (pp. 76-91). Springer. Retrieved from https://doi.org/10.1007/978-3-319-08434-3

    Formal Replay of Translation Validation for Highly Optimised C. (Conference Paper)

    Sewell, T. (2014). Formal Replay of Translation Validation for Highly Optimised C.. In A. Lisitsa, & A. P. Nemytykh (Eds.), VPT@CAV Vol. 28 (pp. 99-111). EasyChair. Retrieved from http://www.easychair.org/publications/?page=2047288174

    Local Driving in Higher-Order Positive Supercompilation via the Omega-theorem. (Conference Paper)

    Hamilton, G. W., & Sørensen, M. H. (2014). Local Driving in Higher-Order Positive Supercompilation via the Omega-theorem.. In A. Lisitsa, & A. P. Nemytykh (Eds.), VPT@CAV Vol. 28 (pp. 36-51). EasyChair. Retrieved from http://www.easychair.org/publications/?page=2047288174

    OPTIMIZED NEURAL INCREMENTAL ATTRIBUTE LEARNING FOR CLASSIFICATION BASED ON STATISTICAL DISCRIMINABILITY (Journal article)

    WANG, T., GUAN, S. -U., MAN, K. L., TING, T. O., & LISITSA, A. (2014). OPTIMIZED NEURAL INCREMENTAL ATTRIBUTE LEARNING FOR CLASSIFICATION BASED ON STATISTICAL DISCRIMINABILITY. International Journal of Computational Intelligence and Applications, 13(04), 1450019. doi:10.1142/s1469026814500199

    DOI: 10.1142/s1469026814500199

    On Unfolding for Programs Using Strings as a Data Type. (Conference Paper)

    Nemytykh, A. P. (2014). On Unfolding for Programs Using Strings as a Data Type.. In A. Lisitsa, & A. P. Nemytykh (Eds.), VPT@CAV Vol. 28 (pp. 66-83). EasyChair. Retrieved from http://www.easychair.org/publications/?page=2047288174

    Program Verification using Constraint Handling Rules and Array Constraint Generalizations. (Conference Paper)

    Angelis, E. D., Fioravanti, F., Pettorossi, A., & Proietti, M. (2014). Program Verification using Constraint Handling Rules and Array Constraint Generalizations.. In A. Lisitsa, & A. P. Nemytykh (Eds.), VPT@CAV Vol. 28 (pp. 3-18). EasyChair. Retrieved from http://www.easychair.org/publications/?page=2047288174

    The 'representative' metaheuristic design pattern (Conference Paper)

    Swan, J., Kocsis, Z. A., & Lisitsa, A. (2014). The 'representative' metaheuristic design pattern. In Proceedings of the 2014 conference companion on Genetic and evolutionary computation companion - GECCO Comp '14. ACM Press. doi:10.1145/2598394.2609842

    DOI: 10.1145/2598394.2609842

    VPT 2014. Second International Workshop on Verification and Program Transformation, July 17-18, 2014, Vienna, Austria, The workshop is an event of the Vienna Summer of Logic 2014 and it is co-located with the 26th International Conference on Computer Aided Verification CAV 2014 (Conference Paper)

    Lisitsa, A., & Nemytykh, A. P. (Eds.) (2014). VPT 2014. Second International Workshop on Verification and Program Transformation, July 17-18, 2014, Vienna, Austria, The workshop is an event of the Vienna Summer of Logic 2014 and it is co-located with the 26th International Conference on Computer Aided Verification CAV 2014. In VPT@CAV Vol. 28. EasyChair.

    2013

    'Bounded multi-hyperset theory and polynomial computability' (under re-working) (Journal article)

    Lisitsa, A., & Sazonov, V. (2013). 'Bounded multi-hyperset theory and polynomial computability' (under re-working). Unknown Journal, 50+.

    Autonomous Asteroid Exploration by Rational Agents (Journal article)

    Lincoln, N. K., Veres, S. M., Dennis, L. A., Fisher, M., & Lisitsa, A. (2013). Autonomous Asteroid Exploration by Rational Agents. IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE, 8(4), 25-38. doi:10.1109/MCI.2013.2279559

    DOI: 10.1109/MCI.2013.2279559

    FCM verification method for Rewriting Logic (Journal article)

    Lisitsa, A. (2013). FCM verification method for Rewriting Logic. TCS.

    Finite Reasons for Safety (Journal article)

    Lisitsa, A. (2013). Finite Reasons for Safety. Journal of Automated Reasoning, 51, Is(4), 431-451. Retrieved from https://owa.liv.ac.uk/

    First-order theorem proving in the exploration of Andrews-Curtis conjecture. (Journal article)

    Lisitsa, A. (2013). First-order theorem proving in the exploration of Andrews-Curtis conjecture.. Tiny Transactions on Computer Science, 2. Retrieved from http://tinytocs.org/papers/tinytocs2-lisitsa.pdf

    Tackling Fibonacci words puzzles by finite countermodels (Conference Paper)

    Lisitsa, A. (2013). Tackling Fibonacci words puzzles by finite countermodels. In Fun with Formal Methods, Workshop affiliated with CAV 2013 (pp. 1-6). Saint-Petersburg: CAV Workshops. Retrieved from http://cgi.csc.liv.ac.uk/~alexei/Fibonacci_Challenge/fun2013.pdf

    TeStID: A High Performance Temporal Intrusion Detection System (Conference Paper)

    Ahmed, A., Lisitsa, A., & Dixon, C. (2013). TeStID: A High Performance Temporal Intrusion Detection System. In Conference on Internet Monitoring and Protection (pp. unknown). unknown: IARIA.

    VPT 2013. First International Workshop on Verification and Program Transformation (Conference Paper)

    Lisitsa, A., & Nemytykh, A. (Eds.) (2013). VPT 2013. First International Workshop on Verification and Program Transformation. In VPT 2013. First International Workshop on Verification and Program Transformation Vol. 16 (pp. i+87). Manchester: EPiC. Retrieved from http://www.easychair.org/publications/?page=1244513262

    2012

    A Note on Program Specialization. What Can Syntactical Properties of Residual Programs Reveal? (Conference Paper)

    Lisitsa, A., & Nemytykh, A. P. (n.d.). A Note on Program Specialization. What Can Syntactical Properties of Residual Programs Reveal?. Retrieved from http://arxiv.org/abs/1209.5407v1

    Finite Models vs Tree Automata in Safety Verification. (Conference Paper)

    Lisitsa, A. (2012). Finite Models vs Tree Automata in Safety Verification.. In A. Tiwari (Ed.), RTA 2012 - 23rd International Conference on Rewriting Techniques and Applications (pp. 225-240). Nagoya: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik.

    Finite countermodels for safety verification of parameterized tree systems (Journal article)

    Lisitsa, A. (n.d.). Finite countermodels for safety verification of parameterized tree systems. Retrieved from http://arxiv.org/abs/1107.5142v1

    2011

    A misuse-based network Intrusion Detection System using Temporal Logic and stream processing (Conference Paper)

    Ahmed, A., Lisitsa, A., & Dixon, C. (2011). A misuse-based network Intrusion Detection System using Temporal Logic and stream processing. In 2011 5th International Conference on Network and System Security. IEEE. doi:10.1109/icnss.2011.6059953

    DOI: 10.1109/icnss.2011.6059953

    First-order finite satisfiability vs tree automata in safety verification (Journal article)

    Lisitsa, A. (n.d.). First-order finite satisfiability vs tree automata in safety verification. Retrieved from http://arxiv.org/abs/1107.0349v1

    Planarity of Knots, Register Automata and LogSpace Computability (Conference Paper)

    Lisitsa, A., Potapov, I., & Saleh, R. (2011). Planarity of Knots, Register Automata and LogSpace Computability. In LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS Vol. 6638 (pp. 366-377). Retrieved from http://gateway.webofknowledge.com/

    2010

    Finite Model Finding for Parameterized Verification (Journal article)

    Lisitsa, A. (n.d.). Finite Model Finding for Parameterized Verification. Retrieved from http://arxiv.org/abs/1011.0447v2

    Agent Based Approaches to Engineering Autonomous Space Software (Conference Paper)

    Dennis, L. A., Fisher, M., Lincoln, N., Lisitsa, A., & Veres, S. M. (n.d.). Agent Based Approaches to Engineering Autonomous Space Software. In EPTCS 20, 2010, pp. 63-67. doi:10.4204/EPTCS.20.6

    DOI: 10.4204/EPTCS.20.6

    Automated Technology for Verification and Analysis (Conference Paper)

    Automated Technology for Verification and Analysis (2010). Springer Berlin Heidelberg. doi:10.1007/978-3-642-15643-4

    DOI: 10.1007/978-3-642-15643-4

    On one application of computations with oracle (Journal article)

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

    2009

    Automata on Gauss Words (Conference Paper)

    Lisitsa, A., Potapov, I., & Saleh, R. (2009). Automata on Gauss Words. In LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS Vol. 5457 (pp. 505-517). doi:10.1007/978-3-642-00982-2_43

    DOI: 10.1007/978-3-642-00982-2_43

    On Descriptional Complexity of the Planarity Problem for Gauss Words (Report)

    Kurlin, V., Lisitsa, A., Potapov, I., & Saleh, R. (n.d.). On Descriptional Complexity of the Planarity Problem for Gauss Words. Retrieved from http://arxiv.org/abs/0907.4180v1

    On the Computational Power of Querying the History (Journal article)

    Lisitsa, A., & Potapov, I. (2009). On the Computational Power of Querying the History. FUNDAMENTA INFORMATICAE, 91(2), 395-409. doi:10.3233/FI-2009-0049

    DOI: 10.3233/FI-2009-0049

    Reachability as deducibility, finite countermodels and verification (Conference Paper)

    Lisitsa, A. (2009). Reachability as deducibility, finite countermodels and verification. In L. O'Reilly, & M. Roggenbach (Eds.), Ninth International Workshop on Automated Verification of Critical Systems (pp. 241-244). Gergynog Conference Centre: Swansea University.

    Temporal Verification of Fault-Tolerant Protocols (Conference Paper)

    Fisher, M., Konev, B., & Lisitsa, A. (2009). Temporal Verification of Fault-Tolerant Protocols. In METHODS, MODELS AND TOOLS FOR FAULT TOLERANCE Vol. 5454 (pp. 44-56). Retrieved from http://gateway.webofknowledge.com/

    2008

    A logic with temporally accessible iteration (Journal article)

    Lisitsa, A. (n.d.). A logic with temporally accessible iteration. Retrieved from http://arxiv.org/abs/0806.2802v1

    Extracting Bugs from the Failed Proofs in Verification via Supercompilation (Conference Paper)

    Lisitsa, A., & Nemytykh, A. P. (2008). Extracting Bugs from the Failed Proofs in Verification via Supercompilation. In B. Beckert, & R. Hahnle (Eds.), Tests and Proofs, TAP 2008 Vol. 5 (pp. 49-65). Prato: Univesitat Koblenz-Landau.

    Practical first-order temporal reasoning (Conference Paper)

    Dixon, C., Fisher, M., Konev, B., Lisitsa, A., & Soc, I. E. E. E. C. (2008). Practical first-order temporal reasoning. In TIME 2008: 15TH INTERNATIONAL SYMPOSIUM ON TEMPORAL REPRESENTATION AND REASONING, PROCEEDINGS (pp. 156-163). doi:10.1109/TIME.2008.15

    DOI: 10.1109/TIME.2008.15

    Probabilistic Model Checking in Neural Cryptography. Preliminary report. (Conference Paper)

    Lisitsa, A. (2008). Probabilistic Model Checking in Neural Cryptography. Preliminary report.. In A. Aldini, & C. Baier (Eds.), 6th Workshop on Qunatitative Aspects of Programming Languages (pp. 47-50). Budapest: etaps.

    REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION (Journal article)

    LISITSA, A., & NEMYTYKH, A. P. (2008). REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION. International Journal of Foundations of Computer Science, 19(04), 953-969. doi:10.1142/s0129054108006066

    DOI: 10.1142/s0129054108006066

    Supercompilation for Equivalence Testing in Metamorphic Computer Viruses Detection (Conference Paper)

    Lisitsa, A., & Nemytykh, A. P. (2008). Supercompilation for Equivalence Testing in Metamorphic Computer Viruses Detection. In First International Workshop on Metacomputation in Russia, META'2008 (pp. 94-112). Pereslavl-Zalessky: Fizmatlit.

    Verification as Specialization of Interpreters with Respect to Data (Conference Paper)

    Lisitsa, A., & Nemytykh, A. P. (2008). Verification as Specialization of Interpreters with Respect to Data. In First International Workshop on Metacomputation in Russia, META'2008 (pp. 94-112). Pereslavl-Zalessky: Fizmatlit.

    2007

    Efficient First-Order Temporal Logic for Infinite-State Systems (Journal article)

    Dixon, C., Fisher, M., Konev, B., & Lisitsa, A. (n.d.). Efficient First-Order Temporal Logic for Infinite-State Systems. Retrieved from http://arxiv.org/abs/cs/0702036v1

    A Note on Specialization of Interpreters. (Conference Paper)

    Lisitsa, A., & Nemytykh, A. (2007). A Note on Specialization of Interpreters.. In Computer Science - Theory and Applications, Second International Symposium on Computer Science in Russia, CSR 2007, Vol. 4649 (pp. 237-248). Berlin, Heilderberg: Springer.

    Reachability Analysis in Verification via Supercompilation (Conference Paper)

    Lisitsa, A., & Nemytykh, A. (2007). Reachability Analysis in Verification via Supercompilation. In M. Hirvensalo, V. Halava, I. Potapov, & J. Kari (Eds.), Workshop on Reachability Problems Vol. 45 (pp. 53-67). Turku: Painosalama Oy.

    Verification as a parameterized testing (experiments with the SCP4 supercompiler) (Journal article)

    Lisitsa, A. P., & Nemytykh, A. P. (2007). Verification as a parameterized testing (experiments with the SCP4 supercompiler). Programming and Computer Software, 33(1), 14-23. doi:10.1134/s0361768807010033

    DOI: 10.1134/s0361768807010033

    2006

    In time alone: On the computational power of querying the history (Conference Paper)

    Lisitsa, A., & Potapov, I. (2006). In time alone: On the computational power of querying the history. In TIME 2006: THIRTEENTH INTERNATIONAL SYMPOSIUM ON TEMPORAL REPRESENTATION AND REASONING, PROCEEDINGS (pp. 42-+). Retrieved from http://gateway.webofknowledge.com/

    Logic in Artificial Intelligence (Conference Paper)

    Fisher, M., van der Hoek, W., Konev, B., & Lisitsa, A. (Eds.) (2006). Logic in Artificial Intelligence. In 10th European Conference, JELIA 2006 Vol. 4160 (pp. 516). Berlin, Heidelberg: Springer.

    Logics in Artificial Intelligence (Conference Paper)

    Logics in Artificial Intelligence (2006). Springer Berlin Heidelberg. doi:10.1007/11853886

    DOI: 10.1007/11853886

    Practical Infinite State Verification with Temporal Reasoning (Conference Paper)

    Fisher, M., Lisitsa, A., & Konev, B. (2006). Practical Infinite State Verification with Temporal Reasoning. In E. CLarke, M. Minea, & F. L. Tiplea (Eds.), Verification of Infinite-State Systems with Applications to Security (pp. 91-100). Timisoara: IOS Press.

    2005

    On temporal logic between between propositional and first-order (Conference Paper)

    Lisitsa, A., Potapov, I., & et al. (2005). On temporal logic between between propositional and first-order. In S. S. Goncharov (Ed.), The 9th Asian Logic Conference (pp. 101-102). Novosibirsk: Novosibirsk State University. Retrieved from http://www.ict.nsc.ru/ws/ALC-9/index.en.html

    Practical Infinite-State Verification with Temporal Reasoning (Conference Paper)

    Fisher, M., Konev, B., & Lisitsa, A. (2005). Practical Infinite-State Verification with Temporal Reasoning. In E. M. Clarke, M. Minea, & F. L. Tiplea (Eds.), NATO Advanced Research Workshop "Verification of Infinite State Systems with Applications to Security VISSAS 2005" (pp. 91-100). Amsterdam: IOS Press.

    Temporal logic with predicate lambda-abstraction. (Conference Paper)

    Lisitsa, A., Potapov, I., & Society, I. E. E. E. C. (2005). Temporal logic with predicate lambda-abstraction.. In 12th International Symposium on Temporal Representation and Reasoning, Proceedings (pp. 147-155). doi:10.1109/TIME.2005.34

    DOI: 10.1109/TIME.2005.34

    Towards verification via supercompilation (Conference Paper)

    Lisitsa, A., & Nemytykh, A. (2005). Towards verification via supercompilation. In 29th Annual International Computer Software and Applications Conference COMPSAC 2005 (pp. 9-10). Edinburgh: IEEE.

    Universality in temporal logic extended by predicate abstraction (Conference Paper)

    Lisitsa, A. (2005). Universality in temporal logic extended by predicate abstraction. In J. -Y. Beziau, & A. Costa-Leite (Eds.), UNILOG'05 (pp. 76). Montreux: Swiss Acaemy of Science.

    Verification of parameterized systems using supercompilation (Conference Paper)

    Lisitsa, A., & Nemytykh, A. P. (2005). Verification of parameterized systems using supercompilation. In Third Workshop on Applied Semantics (APPSEM 2005) (pp. 22-32). Frauenchiemsee: University of Munich.

    2004

    Mathematical Foundations of Computer Science 2004 (Conference Paper)

    Mathematical Foundations of Computer Science 2004 (2004). Springer Berlin Heidelberg. doi:10.1007/b99679

    DOI: 10.1007/b99679

    Monodic ASMs and temporal verification (Conference Paper)

    Fisher, M., & Lisitsa, A. (2004). Monodic ASMs and temporal verification. In ABSTRACT STATE MACHINES 2004: ADVANCES IN THEORY AND PRACTICE, PROCEEDINGS Vol. 3052 (pp. 95-110). Retrieved from http://gateway.webofknowledge.com/

    2003

    Deductive Verification of Cache Coherence Protocols (Conference Paper)

    Fisher, M., & Lisitsa, A. (2003). Deductive Verification of Cache Coherence Protocols. In M. Leuschel, S. Gruner, & S. Lo Presti (Eds.), AVOCS 2003 (pp. 177-186). Southampton: University of Southampton.

    2002

    Searching for invariants using temporal resolution (Conference Paper)

    Brotherston, J., Degtyarev, A., Fisher, M., & Lisitsa, A. (2002). Searching for invariants using temporal resolution. In 9th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR) Vol. 2514 (pp. 16). Tbilisi: Springer-Verlag.

    (Journal article)

    Degtyarev, A., Fisher, M., & Lisitsa, A. (2002). Unknown Title. Studia Logica, 72(2), 147-156. doi:10.1023/a:1021352309671

    DOI: 10.1023/a:1021352309671

    (Chapter)

    Unknown Title (n.d.). In Unknown Book (Vol. 199). Open Publishing Association. doi:10.4204/eptcs.199

    DOI: 10.4204/eptcs.199

    2000

    Satellite Control Using Rational Agent Programming (Journal article)

    Dennis, L., Fisher, M., Lisitsa, A., Lincoln, N., & Veres, S. (2010). Satellite Control Using Rational Agent Programming. IEEE INTELLIGENT SYSTEMS, 25(3), 92-97. doi:10.1109/MIS.2010.88

    DOI: 10.1109/MIS.2010.88