| IoTEF: A Federated Edge-Cloud Architecture for Fault-Tolerant IoT Applications | 2 | 0.37 | 2020 |
| Scalable Reference Genome Assembly from Compressed Pan-Genome Index with Spark. | 0 | 0.34 | 2020 |
| An optimal cut-off algorithm for parameterised refinement checking | 0 | 0.34 | 2020 |
| Bmc For Weak Memory Models: Relation Analysis For Compact Smt Encodings | 2 | 0.37 | 2019 |
| Exploiting Event Log Data-Attributes in RNN Based Prediction. | 0 | 0.34 | 2019 |
| Exploiting Event Log Event Attributes in RNN Based Prediction. | 0 | 0.34 | 2019 |
| Access Time Improvement Framework for Standardized IoT Gateways | 0 | 0.34 | 2019 |
| Testing Programs with Contextual Unfoldings. | 0 | 0.34 | 2018 |
| ViraPipe: Scalable Parallel Pipeline for Viral Metagenome Analysis from Next Generation Sequencing Reads. | 0 | 0.34 | 2018 |
| CEFIoT: A fault-tolerant IoT architecture for edge and cloud | 3 | 0.40 | 2018 |
| BMC with Memory Models as Modules | 0 | 0.34 | 2018 |
| Classifying Process Instances Using Recurrent Neural Networks. | 1 | 0.39 | 2018 |
| Dynamic Cut-Off Algorithm for Parameterised Refinement Checking. | 0 | 0.34 | 2018 |
| Portability Analysis for Weak Memory Models. PORTHOS: One Tool for all Models. | 1 | 0.36 | 2017 |
| Portability Analysis for Axiomatic Memory Models. PORTHOS: One Tool for all Models. | 1 | 0.35 | 2017 |
| Minimizing Test Suites with Unfoldings of Multithreaded Programs. | 1 | 0.38 | 2017 |
| Structural Feature Selection for Event Logs. | 1 | 0.38 | 2017 |
| LCTD: Test-guided proofs for C programs on LLVM | 0 | 0.34 | 2016 |
| LCTD: Tests-Guided Proofs for C Programs on LLVM - (Competition Contribution). | 0 | 0.34 | 2016 |
| Assessing Big Data SQL Frameworks for Analyzing Event Logs | 2 | 0.40 | 2016 |
| Verifying large modular systems using iterative abstraction refinement. | 0 | 0.34 | 2015 |
| Unfolding Based Minimal Test Suites for Testing Multithreaded Programs | 2 | 0.38 | 2015 |
| Unfolding based automated testing of multithreaded programs | 2 | 0.37 | 2015 |
| Unfolding-Based Process Discovery | 2 | 0.38 | 2015 |
| When Do We (Not) Need Complex Assume-Guarantee Rules? | 3 | 0.42 | 2015 |
| Parametrised Modal Interface Automata | 2 | 0.37 | 2015 |
| Reporting Races in Dynamic Partial Order Reduction. | 0 | 0.34 | 2015 |
| Hardware Model Checking Competition 2014: An Analysis and Comparison of Solvers and Benchmarks. | 0 | 0.34 | 2014 |
| Testing Multithreaded Programs with Contextual Unfoldings and Dynamic Symbolic Execution | 3 | 0.39 | 2014 |
| SeqPig: simple and scalable scripting for large sequencing data sets in Hadoop. | 33 | 1.45 | 2014 |
| Lightweight State Capturing for Automated Testing of Multithreaded Programs. | 4 | 0.45 | 2014 |
| Increasing Confidence in Liveness Model Checking Results with Proofs. | 2 | 0.40 | 2013 |
| Asynchronous multi-core incremental SAT solving | 5 | 0.44 | 2013 |
| Parametrised Compositional Verification with Multiple Process and Data Types | 4 | 0.42 | 2013 |
| Concurrent clause strengthening | 2 | 0.37 | 2013 |
| Model checking of safety-critical software in the nuclear engineering domain. | 15 | 0.81 | 2012 |
| Solving parity games by a reduction to SAT | 11 | 0.59 | 2012 |
| Hadoop-BAM: directly manipulating next generation sequencing data in the cloud. | 21 | 1.68 | 2012 |
| Exploiting step semantics for efficient bounded model checking of asynchronous systems | 6 | 0.79 | 2012 |
| Using unfoldings in automated testing of multithreaded programs | 12 | 0.61 | 2012 |
| Improving Dynamic Partial Order Reductions for Concolic Testing | 14 | 0.69 | 2012 |
| A symbolic model checking approach to verifying satellite onboard software | 9 | 0.55 | 2011 |
| Efficient Model Checking of PSL Safety Properties | 5 | 0.48 | 2011 |
| Experimental comparison of concolic and random testing for java card applets | 1 | 0.37 | 2010 |
| The LIME Interface Specification Language and Runtime Monitoring Tool | 11 | 0.62 | 2009 |
| Tarmo: A Framework For Parallelized Bounded Model Checking | 11 | 0.78 | 2009 |
| Symbolic Step Encodings for Object Based Communicating State Machines | 10 | 0.74 | 2008 |
| Analyzing Context-Free Grammars Using an Incremental SAT Solver | 28 | 1.81 | 2008 |
| Planning as satisfiability: parallel plans and algorithms for plan search | 88 | 2.68 | 2006 |
| Linear Encodings of Bounded LTL Model Checking | 108 | 3.37 | 2006 |
