Agnieszka Zbrzezny

Orcid: 0000-0001-9897-3561

According to our database1, Agnieszka Zbrzezny authored at least 33 papers between 2011 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Bounded Model Checking for Metric Temporal Logic Properties of Timed Automata with Digital Clocks.
Sensors, 2022

Practical Approach in Verification of Security Systems Using Satisfiability Modulo Theories.
Log. J. IGPL, 2022

SMT-based BMC for Dense Timed Interpreted Systems and EMTLK Properties.
Proceedings of the 14th International Conference on Agents and Artificial Intelligence, 2022

2021
SAT and SMT-Based Verification of Security Protocols Including Time Aspects.
Sensors, 2021

On Guaranteed Optimal Robust Explanations for NLP Models.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Towards a Formal Verification of Seamless Cryptographic Rekeying in Real-Time Communication Systems.
Proceedings of the 2021 11th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS), 2021

2020
VerSecTis - An Agent based Model Checker for Security Protocols.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019
SMT Solvers as Efficient Tools for Automatic Time Properties Verification of Security Protocols.
Proceedings of the 20th International Conference on Parallel and Distributed Computing, 2019

Checking MTL Properties of Timed Automata with Dense Time using Satisfiability Modulo Theories (Extended Abstract).
Proceedings of the 28th International Workshop on Concurrency, 2019

Efficient Verification of Security Protocols Time Properties Using SMT Solvers.
Proceedings of the International Joint Conference: 12th International Conference on Computational Intelligence in Security for Information Systems (CISIS 2019) and 10th International Conference on EUropean Transnational Education (ICEUTE 2019), 2019

2018
SAT-Based BMC Approach to Verifying Real-Time Properties of Multi-Agent Systems.
Proceedings of the 15th IEEE/ACS International Conference on Computer Systems and Applications, 2018

2017
SMT-based Searching for k-quasi-optimal Runs in Weighted Timed Automata.
Fundam. Informaticae, 2017

Simple SMT-Based Bounded Model Checking for Timed Interpreted Systems.
Proceedings of the Rough Sets - International Joint Conference, 2017

Simple Bounded MTLK Model Checking for Timed Interpreted Systems.
Proceedings of the Agent and Multi-Agent Systems: Technology and Applications, 2017

SAT-Versus SMT-Based BMC for TWIS and the Existential Fragment of WCTL with Knowledge.
Proceedings of the Agent and Multi-Agent Systems: Technology and Applications, 2017

2016
Verifying Real-Time Properties of Multi-agent Systems via SMT-Based Bounded Model Checking.
Proceedings of the PRIMA 2016: Princiles and Practice of Multi-Agent Systems, 2016

Efficient Model Checking Timed and Weighted Interpreted Systems Using SMT and SAT Solvers.
Proceedings of the Agent and Multi-Agent Systems: Technology and Applications, 2016

Simple Bounded MTL Model Checking for Discrete Timed Automata (extended abstract).
Proceedings of the 25th International Workshop on Concurrency, 2016

2015
Checking RTECTL properties of STSs via SMT-based Bounded Model Checking.
Int. J. Interact. Multim. Artif. Intell., 2015

Checking WELTLK Properties of Weighted Interpreted Systems via SMT-Based Bounded Model Checking.
Proceedings of the PRIMA 2015: Principles and Practice of Multi-Agent Systems, 2015

Selected Methods of Model Checking Using SAT and SMT-Solvers.
Proceedings of the Trends in Practical Applications of Agents, Multi-Agent Systems and Sustainability, 2015

Checking WECTLK Properties of TRWISs via SMT-based Bounded Model Checking.
Proceedings of the 2015 Imperial College Computing Student Workshop, 2015

Checking WECTLK Properties of Timed Real-Weighted Interpreted Systems via SMT-Based Bounded Model Checking.
Proceedings of the Progress in Artificial Intelligence, 2015

SMT-Based Bounded Model Checking for Weighted Epistemic ECTL.
Proceedings of the Progress in Artificial Intelligence, 2015

SMT-based Bounded Model Checking for Weighted Interpreted Systems and for Weighted Epistemic ECTL.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Selected Methods of Model Checking using SAT and SMT-solvers: (Doctoral Consortium).
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014
Bounded Model Checking for Weighted Interpreted Systems and for Flat Weighted Epistemic Computation Tree Logic.
Proceedings of the PRIMA 2014: Principles and Practice of Multi-Agent Systems, 2014

System Monitoring with Extended Message Sequence Chart (Extended Abstract).
Proceedings of the 23th International Workshop on Concurrency, Specification and Programming, Chemnitz, Germany, September 29, 2014

A Comparison of SAT-Based and SMT-Based Bounded Model Checking Methods for ECTL.
Proceedings of the 23th International Workshop on Concurrency, Specification and Programming, Chemnitz, Germany, September 29, 2014

2013
SAT-Based Bounded Model Checking for Weighted Interpreted Systems and Weighted Linear Temporal Logic.
Proceedings of the PRIMA 2013: Principles and Practice of Multi-Agent Systems, 2013

SAT-Based Bounded Model Checking for RTECTL and Simply-Timed Systems.
Proceedings of the Computer Performance Engineering - 10th European Workshop, 2013

Two Approaches to Bounded Model Checking for a Soft Real-Time Epistemic Computation Tree Logic.
Proceedings of the Distributed Computing and Artificial Intelligence, 2013

2011
The BMC Method for the Existential Part of RTCTLK and Interleaved Interpreted Systems.
Proceedings of the Progress in Artificial Intelligence, 2011


  Loading...