| "More Than Deep Learning": post-processing for API sequence recommendation | 0 | 0.34 | 2022 |
| Verifying Neural Networks Against Backdoor Attacks | 0 | 0.34 | 2022 |
| Which neural network makes more explainable decisions? An approach towards measuring explainability | 0 | 0.34 | 2022 |
| Holistic Combination of Structural and Textual Code Information for Context Based API Recommendation | 1 | 0.35 | 2022 |
| Repairing Adversarial Texts Through Perturbation | 0 | 0.34 | 2022 |
| Attack as defense: characterizing adversarial examples using robustness | 2 | 0.41 | 2021 |
| Graph-based seed object synthesis for search-based unit testing | 3 | 0.38 | 2021 |
| HRPDF: A Software-Based Heterogeneous Redundant Proactive Defense Framework for Programmable Logic Controller | 1 | 0.36 | 2021 |
| sVerify - Verifying Smart Contracts Through Lazy Annotation and Learning. | 0 | 0.34 | 2021 |
| Explaining Regressions via Alignment Slicing and Mending | 4 | 0.39 | 2021 |
| Improving Neural Network Verification through Spurious Region Guided Refinement. | 0 | 0.34 | 2021 |
| hPRESS: A Hardware-enhanced Proxy Re-encryption Scheme using Secure Enclave | 1 | 0.35 | 2021 |
| Code integrity attestation for PLCs using black box neural network predictions | 0 | 0.34 | 2021 |
| CoinWatch: A Clone-Based Approach For Detecting Vulnerabilities in Cryptocurrencies | 1 | 0.35 | 2020 |
| Accelerating all-SAT computation with short blocking clauses | 0 | 0.34 | 2020 |
| sFuzz: an efficient adaptive fuzzer for solidity smart contracts | 9 | 0.51 | 2020 |
| Learning Fault Models of Cyber Physical Systems. | 0 | 0.34 | 2020 |
| Towards Generating Thread-Safe Classes Automatically | 0 | 0.34 | 2020 |
| White-box fairness testing through adversarial sampling | 11 | 0.54 | 2020 |
| Towards Interpreting Recurrent Neural Networks through Probabilistic Abstraction | 0 | 0.34 | 2020 |
| Towards Repairing Neural Networks Correctly | 0 | 0.34 | 2020 |
| Recovering Fitness Gradients for Interprocedural Boolean Flags in Search-Based Testing | 4 | 0.40 | 2020 |
| Automatic Verification of Multi-threaded Programs by Inference of Rely-Guarantee Specifications | 0 | 0.34 | 2020 |
| ObjSim: efficient testing of cyber-physical systems | 1 | 0.48 | 2020 |
| Generative API usage code recommendation with parameter concretization | 2 | 0.36 | 2019 |
| Careful-Packing - A Practical and Scalable Anti-Tampering Software Protection enforced by Trusted Computing. | 0 | 0.34 | 2019 |
| Learning-Guided Network Fuzzing for Testing Cyber-Physical System Defences. | 3 | 0.38 | 2019 |
| Concolic Testing Heap-Manipulating Programs. | 1 | 0.36 | 2019 |
| Detecting Adversarial Samples for Deep Neural Networks through Mutation Testing. | 4 | 0.41 | 2018 |
| Importance Sampling of Interval Markov Chains | 0 | 0.34 | 2018 |
| On the Sequential Massart Algorithm for Statistical Model Checking. | 1 | 0.35 | 2018 |
| Efficient and Robust Emergence of Norms through Heuristic Collective Learning. | 2 | 0.36 | 2018 |
| An Adaptive Markov Strategy for Defending Smart Grid False Data Injection From Malicious Attackers. | 1 | 0.36 | 2018 |
| CrowdService: Optimizing Mobile Crowdsourcing and Service Composition. | 3 | 0.42 | 2018 |
| Adversarial Sample Detection for Deep Neural Network through Model Mutation Testing. | 17 | 0.60 | 2018 |
| Benchmarking microservice systems for software engineering research. | 0 | 0.34 | 2018 |
| Towards optimal concolic testing. | 9 | 0.56 | 2018 |
| Executable Operational Semantics of Solidity. | 1 | 0.36 | 2018 |
| Learning Likely Invariants to Explain Why a Program Fails | 0 | 0.34 | 2017 |
| Detecting Steganography of Adaptive Multirate Speech with Unknown Embedding Rate. | 0 | 0.34 | 2017 |
| Assertion generation through active learning. | 4 | 0.42 | 2017 |
| Mining implicit design templates for actionable code reuse. | 4 | 0.40 | 2017 |
| Improving Probability Estimation Through Active Probabilistic Model Learning. | 3 | 0.37 | 2017 |
| Satisfiability Modulo Heap-Based Programs | 9 | 0.49 | 2016 |
| Towards Learning and Verifying Invariants of Cyber-Physical Systems by Code Mutation. | 6 | 0.41 | 2016 |
| Optimizing selection of competing services with probabilistic hierarchical refinement. | 9 | 0.48 | 2016 |
| Automated Verification of Timed Security Protocols with Clock Drift. | 0 | 0.34 | 2016 |
| Designing minimal effective normative systems with the help of lightweight formal methods. | 3 | 0.37 | 2016 |
| Regular Symmetry Patterns (Technical Report) | 0 | 0.34 | 2015 |
| A Systematic Study on Explicit-State Non-Zenoness Checking for Timed Automata | 0 | 0.34 | 2015 |
