The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Maciej Szreter: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Maciej Szreter
    Selective Search in Bounded Model Checking of Reachability Properties. [Citation Graph (0, 0)][DBLP]
    ATVA, 2005, pp:159-173 [Conf]
  2. Magdalena Kacprzak, Alessio Lomuscio, T. Lasica, Wojciech Penczek, Maciej Szreter
    Verifying Multi-agent Systems via Unbounded Model Checking. [Citation Graph (0, 0)][DBLP]
    FAABS, 2004, pp:189-212 [Conf]
  3. Agata Pólrola, Wojciech Penczek, Maciej Szreter
    Towards Efficient Partition Refinement for Checking Reachability in Timed Automata. [Citation Graph (0, 0)][DBLP]
    FORMATS, 2003, pp:2-17 [Conf]
  4. Piotr Dembinski, Agata Janowska, Pawel Janowski, Wojciech Penczek, Agata Pólrola, Maciej Szreter, Bozena Wozna, Andrzej Zbrzezny
    Verics: A Tool for Verifying Timed Automata and Estelle Specifications. [Citation Graph (0, 0)][DBLP]
    TACAS, 2003, pp:278-283 [Conf]
  5. Wojciech Penczek, Maciej Szreter, Rob Gerth, Ruurd Kuiper
    Improving Partial Order Reductions for Universal Branching Time Properties. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2000, v:43, n:1-4, pp:245-267 [Journal]
  6. Agata Pólrola, Wojciech Penczek, Maciej Szreter
    Reachability Analysis for Timed Automata Using Partitioning Algorithms. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:55, n:2, pp:203-221 [Journal]
  7. Magdalena Kacprzak, Alessio Lomuscio, Artur Niewiadomski, Wojciech Penczek, Franco Raimondi, Maciej Szreter
    Comparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:72, n:1-3, pp:215-234 [Journal]
  8. Wojciech Penczek, Maciej Szreter
    SAT-based Unbounded Model Checking of Timed Automata. [Citation Graph (0, 0)][DBLP]
    ACSD, 2007, pp:236-237 [Conf]

  9. Runtime monitoring of contract regulated web services. [Citation Graph (, )][DBLP]


  10. Towards Checking Parametric Reachability for UML State Machines. [Citation Graph (, )][DBLP]


Search in 0.069secs, Finished in 0.070secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002