Taolue Chen

Orcid: 0000-0002-5993-1665

According to our database1, Taolue Chen authored at least 157 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
How Important Are Good Method Names in Neural Code Generation? A Model Robustness Perspective.
ACM Trans. Softw. Eng. Methodol., March, 2024

Compositional Verification of First-Order Masking Countermeasures against Power Side-Channel Attacks.
ACM Trans. Softw. Eng. Methodol., March, 2024

DRIVE: Dockerfile Rule Mining and Violation Detection.
ACM Trans. Softw. Eng. Methodol., February, 2024

Enhancing test reuse with GUI events deduplication and adaptive semantic matching.
Sci. Comput. Program., January, 2024

EasyBC: A Cryptography-Specific Language for Security Analysis of Block Ciphers against Differential Cryptanalysis.
Proc. ACM Program. Lang., January, 2024

Learning with Logical Constraints but without Shortcut Satisfaction.
CoRR, 2024

Softened Symbol Grounding for Neuro-symbolic Systems.
CoRR, 2024

Towards Efficient Verification of Constant-Time Cryptographic Implementations.
CoRR, 2024

2023
A syntax-guided multi-task learning approach for Turducken-style code generation.
Empir. Softw. Eng., November, 2023

Compositional Verification of Efficient Masking Countermeasures against Side-Channel Attacks.
Proc. ACM Program. Lang., October, 2023

Precise Quantitative Analysis of Binarized Neural Networks: A BDD-based Approach.
ACM Trans. Softw. Eng. Methodol., May, 2023

Context-aware API recommendation using tensor factorization.
Sci. China Inf. Sci., February, 2023

ExploitGen: Template-augmented exploit code generation based on CodeBERT.
J. Syst. Softw., 2023

Chain-of-Thought in Neural Code Generation: From and For Lightweight Language Models.
CoRR, 2023

Advancing Transformer Architecture in Long-Context Large Language Models: A Comprehensive Survey.
CoRR, 2023

Assessing and Improving Syntactic Adversarial Robustness of Pre-trained Models for Code Translation.
CoRR, 2023

SAT-based Formal Fault-Resistance Verification of Cryptographic Circuits.
CoRR, 2023

A Syntax-Guided Multi-Task Learning Approach for Turducken-Style Code Generation.
CoRR, 2023

Neuro-symbolic Learning Yielding Logical Constraints.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Lightweight Approaches to DNN Regression Error Reduction: An Uncertainty Alignment Perspective.
Proceedings of the 45th IEEE/ACM International Conference on Software Engineering, 2023

Learning with Logical Constraints but without Shortcut Satisfaction.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Softened Symbol Grounding for Neuro-symbolic Systems.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Syntax-Aware Retrieval Augmented Code Generation.
Proceedings of the Findings of the Association for Computational Linguistics: EMNLP 2023, 2023

Automated Verification of Correctness for Masked Arithmetic Programs.
Proceedings of the Computer Aided Verification - 35th International Conference, 2023

2022
Boosting API Recommendation With Implicit Feedback.
IEEE Trans. Software Eng., 2022

Formal Verification of Masking Countermeasures for Arithmetic Programs.
IEEE Trans. Software Eng., 2022

Adversarial Robustness of Deep Code Comment Generation.
ACM Trans. Softw. Eng. Methodol., 2022

Solving string constraints with Regex-dependent functions through transducers with priorities and variables.
Proc. ACM Program. Lang., 2022

Automatic source code summarization with graph attention networks.
J. Syst. Softw., 2022

ESampler: Boosting sampling of satisfying assignments for Boolean formulas via derivation.
J. Syst. Archit., 2022

Sequence-Aware API Recommendation Based on Collaborative Filtering.
Int. J. Softw. Eng. Knowl. Eng., 2022

Model-based automated testing of JavaScript Web applications via longer test sequences.
Frontiers Comput. Sci., 2022

QVIP: An ILP-based Formal Verification Approach for Quantized Neural Networks.
CoRR, 2022

Preventing Timing Side-Channels via Security-Aware Just-In-Time Compilation.
CoRR, 2022

DeJITLeak: eliminating JIT-induced timing side-channel leaks.
Proceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2022

CLEVEREST: Accelerating CEGAR-based Neural Network Verification via Adversarial Attacks.
Proceedings of the Static Analysis - 29th International Symposium, 2022

Test Reuse based on Adaptive Semantic Matching across Android Mobile Applications.
Proceedings of the 22nd IEEE International Conference on Software Quality, 2022

QVIP: An ILP-based Formal Verification Approach for Quantized Neural Networks.
Proceedings of the 37th IEEE/ACM International Conference on Automated Software Engineering, 2022

ADEPT: A Testing Platform for Simulated Autonomous Driving.
Proceedings of the 37th IEEE/ACM International Conference on Automated Software Engineering, 2022

PoS4MPC: Automated Security Policy Synthesis for Secure Multi-party Computation.
Proceedings of the Computer Aided Verification - 34th International Conference, 2022

2021
User Review-Based Change File Localization for Mobile Applications.
IEEE Trans. Software Eng., 2021

A Hybrid Approach to Formal Verification of Higher-Order Masked Arithmetic Programs.
ACM Trans. Softw. Eng. Methodol., 2021

A theory of change for prioritised resilient and evolvable software systems.
Synth., 2021

Learning safe neural network controllers with barrier certificates.
Formal Aspects Comput., 2021

Robustness and performance of Deep Reinforcement Learning.
Appl. Soft Comput., 2021

BRAID: an API recommender supporting implicit user feedback.
Proceedings of the ESEC/FSE '21: 29th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2021

ESampler: Efficient Sampling of Satisfying Assignments for Boolean Formulas.
Proceedings of the Dependable Software Engineering. Theories, Tools, and Applications, 2021

Hybrid Collaborative Filtering-Based API Recommendation.
Proceedings of the 21st IEEE International Conference on Software Quality, 2021

Evaluating Code Summarization with Improved Correlation with Human Assessment.
Proceedings of the 21st IEEE International Conference on Software Quality, 2021

BDD4BNN: A BDD-Based Quantitative Analysis Framework for Binarized Neural Networks.
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

2020
Automatic Detection and Repair Recommendation of Directive Defects in Java API Documentation.
IEEE Trans. Software Eng., 2020

Predicted Robustness as QoS for Deep Neural Network Models.
J. Comput. Sci. Technol., 2020

Probabilistic analysis of QoS-aware service composition with explicit environment models.
IET Softw., 2020

Finger Texture Biometric Characteristic: a Survey.
CoRR, 2020

Computing Linear Arithmetic Representation of Reachability Relation of One-Counter Automata.
Proceedings of the Dependable Software Engineering. Theories, Tools, and Applications, 2020

Training Deep Code Comment Generation Models via Data Augmentation.
Proceedings of the Internetware'20: 12th Asia-Pacific Symposium on Internetware, 2020

Adaptive Code Completion with Meta-learning.
Proceedings of the Internetware'20: 12th Asia-Pacific Symposium on Internetware, 2020

Synthesizing barrier certificates using neural networks.
Proceedings of the HSCC '20: 23rd ACM International Conference on Hybrid Systems: Computation and Control, 2020

A Decision Procedure for Path Feasibility of String Manipulating Programs with Integer Data Type.
Proceedings of the Automated Technology for Verification and Analysis, 2020

2019
Decision procedures for path feasibility of string-manipulating programs with complex operations.
Proc. ACM Program. Lang., 2019

Augmenting Java method comments generation with context information based on neural networks.
J. Syst. Softw., 2019

Deep finger texture learning for verifying people.
IET Biom., 2019

Model-based Automated Testing of JavaScript Web Applications via Longer Test Sequences.
CoRR, 2019

Online Observability of Boolean Control Networks.
CoRR, 2019

Making Agents' Abilities Explicit.
IEEE Access, 2019

Quantitative Verification of Masked Arithmetic Programs Against Side-Channel Attacks.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2019

Separation Logic with Linearly Compositional Inductive Predicates and Set Data Constraints.
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

DRONE: a tool to detect and repair directive defects in Java APIs documentation.
Proceedings of the 41st International Conference on Software Engineering: Companion Proceedings, 2019

Road Tracking Using Deep Reinforcement Learning for Self-driving Car Applications.
Proceedings of the Progress in Computer Recognition Systems, 2019

Android Multitasking Mechanism: Formal Semantics and Static Analysis of Apps.
Proceedings of the Programming Languages and Systems - 17th Asian Symposium, 2019

Probabilistic Alternating-Time <i>µ</i>-Calculus.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Polynomial-time algorithms for computing distances of fuzzy transition systems.
Theor. Comput. Sci., 2018

What is decidable about string constraints with the ReplaceAll function.
Proc. ACM Program. Lang., 2018

Bisimulations for fuzzy transition systems revisited.
Int. J. Approx. Reason., 2018

Parameter Synthesis Problems for one parametric clock Timed Automata.
CoRR, 2018

Parameter Synthesis Problems for Parametric Timed Automata.
CoRR, 2018

Android Stack Machine.
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

2017
Augmenting Bug Localization with Part-of-Speech and Invocation.
Int. J. Softw. Eng. Knowl. Eng., 2017

The packing chromatic number of the infinite square lattice is between 13 and 15.
Discret. Appl. Math., 2017

Analyzing APIs documentation and code to detect directive defects.
Proceedings of the 39th International Conference on Software Engineering, 2017

ProEva: runtime proactive performance evaluation based on continuous-time markov chains.
Proceedings of the 39th International Conference on Software Engineering, 2017

Model Checking Pushdown Epistemic Game Structures.
Proceedings of the Formal Methods and Software Engineering, 2017

A Proof-Theoretic Trust and Reputation Model for VANET.
Proceedings of the 2017 IEEE European Symposium on Security and Privacy Workshops, 2017

Tractability of Separation Logic with Inductive Definitions: Beyond Lists.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

Satisfiability of Compositional Separation Logic with Tree Predicates and Data Constraints.
Proceedings of the Automated Deduction - CADE 26, 2017

2016
Asymptotic Perturbation Bounds for Probabilistic Model Checking with Empirically Determined Probability Parameters.
IEEE Trans. Software Eng., 2016

A Computationally Grounded, Weighted Doxastic Logic.
Stud Logica, 2016

Formal Reasoning on Infinite Data Values: An Ongoing Quest.
Proceedings of the Engineering Trustworthy Software Systems - Second International School, 2016

Verifying Pushdown Multi-Agent Systems against Strategy Logics.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

An Iterative Decision-Making Scheme for Markov Decision Processes and Its Application to Self-adaptive Systems.
Proceedings of the Fundamental Approaches to Software Engineering, 2016

Model based analysis of insider threats.
Proceedings of the 2016 International Conference On Cyber Security And Protection Of Digital Services (Cyber Security), 2016

A Complete Decision Procedure for Linearly Compositional Separation Logic with Data Constraints.
Proceedings of the Automated Reasoning - 8th International Joint Conference, 2016

Global Model Checking on Pushdown Multi-Agent Systems.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Continuous-time orbit problems are decidable in polynomial-time.
Inf. Process. Lett., 2015

The packing chromatic number of the infinite square lattice is less than or equal to 16.
CoRR, 2015

On the Axiomatizability of Impossible Futures.
Log. Methods Comput. Sci., 2015

Towards A Novel Approach for Defect Localization Based on Part-of-Speech and Invocation.
Proceedings of the 7th Asia-Pacific Symposium on Internetware, 2015

Analyzing Eventual Leader Election Protocols for Dynamic Systems by Probabilistic Model Checking.
Proceedings of the Cloud Computing and Security - First International Conference, 2015

A Probabilistic Analysis Framework for Malicious Insider Threats.
Proceedings of the Human Aspects of Information Security, Privacy, and Trust, 2015

On the Satisfiability of Indexed Linear Temporal Logics.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014
Quantitative verification of implantable cardiac pacemakers over hybrid heart models.
Inf. Comput., 2014

On the Complexity of Computing Maximum Entropy for Markovian Models.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

On the total variation distance of labelled Markov chains.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

Perturbation Analysis in Verification of Discrete-Time Markov Chains.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

2013
Verification of linear duration properties over continuous-time markov chains.
ACM Trans. Comput. Log., 2013

On the complexity of model checking interval-valued discrete time Markov chains.
Inf. Process. Lett., 2013

Automatic verification of competitive stochastic systems.
Formal Methods Syst. Des., 2013

Orbit Problem Revisited
CoRR, 2013

Model Repair for Markov Decision Processes.
Proceedings of the Seventh International Symposium on Theoretical Aspects of Software Engineering, 2013

PRISM-games: A Model Checker for Stochastic Multi-Player Games.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

Synthesis for Multi-objective Stochastic Games: An Application to Autonomous Urban Driving.
Proceedings of the Quantitative Evaluation of Systems - 10th International Conference, 2013

On Stochastic Games with Multiple Objectives.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

A simulink hybrid heart model for quantitative verification of cardiac pacemakers.
Proceedings of the 16th international conference on Hybrid systems: computation and control, 2013

Solvency Markov Decision Processes with Interest.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012
Quantitative Verification of Implantable Cardiac Pacemakers.
Proceedings of the 33rd IEEE Real-Time Systems Symposium, 2012

Model Checking Stochastic Branching Processes.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

A Compositional Specification Theory for Component Behaviours.
Proceedings of the Programming Languages and Systems, 2012

Playing Stochastic Games Precisely.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

2011
On the axiomatizability of priority II.
Theor. Comput. Sci., 2011

Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
Log. Methods Comput. Sci., 2011

Efficient CTMC Model Checking of Linear Real-Time Objectives.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2011

Observing Continuous-Time MDPs by 1-Clock Timed Automata.
Proceedings of the Reachability Problems - 5th International Workshop, 2011

Time-Bounded Verification of CTMCs against Real-Time Specifications.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2011

Verifying Team Formation Protocols with Probabilistic Model Checking.
Proceedings of the Computational Logic in Multi-Agent Systems, 2011

Reachability probabilities in Markovian Timed Automata.
Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, 2011

2010
Towards Analysis of Semi-Markov Decision Processes.
Proceedings of the Artificial Intelligence and Computational Intelligence, 2010

2009
On metrics for probabilistic systems: Definitions and algorithms.
Comput. Math. Appl., 2009

Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

On Finite Bases for Weak Semantics: Failures Versus Impossible Futures.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications.
Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

LTL Model Checking of Time-Inhomogeneous Markov Chains.
Proceedings of the Automated Technology for Verification and Analysis, 2009

2008
On the axiomatisability of priority.
Math. Struct. Comput. Sci., 2008

Ready to preorder: The case of weak process semantics.
Inf. Process. Lett., 2008

On finite alphabets and infinite bases.
Inf. Comput., 2008

Complete Axiomatization for Divergent-Sensitive Bisimulations in Basic Process Algebra with Prefix Iteration.
Proceedings of the First International Conference on Foundations of Informatics, 2008

PDL over Accelerated Labeled Transition Systems.
Proceedings of the Second IEEE/IFIP International Symposium on Theoretical Aspects of Software Engineering, 2008

Time-Abstracting Bisimulation for Probabilistic Timed Automata.
Proceedings of the Second IEEE/IFIP International Symposium on Theoretical Aspects of Software Engineering, 2008

On the Axiomatizability of Impossible Futures: Preorder versus Equivalence.
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

Towards the Complexity of Controls for Timed Automata with a Small Number of Clocks.
Proceedings of the Fifth International Conference on Fuzzy Systems and Knowledge Discovery, 2008

2007
Probabilistic Alternating-time Temporal Logic and Model Checking Algorithm.
Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery, 2007

On Behavioral Metric for Probabilistic Systems: Definition and Approximation Algorithm.
Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery, 2007

Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems.
Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

2006
On the Complete Axiomatization for Prefix Iteration modulo Observation Congruence.
Acta Cybern., 2006

On the Axiomatizability of Priority.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

On the Markovian Randomized Strategy of Controller for Markov Decision Processes.
Proceedings of the Fuzzy Systems and Knowledge Discovery, Third International Conference, 2006

On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation.
Proceedings of the Foundations of Software Science and Computation Structures, 2006

On Finite Alphabets and Infinite Bases III: Simulation.
Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

2005
Structure Analysis for Dynamic Software Architecture.
Proceedings of the 6th ACIS International Conference on Software Engineering, 2005

On the Bisimulation Congruence in <i>chi</i>-Calculus.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

Structure Analysis for Dynamic Software Architecture Based on Spatial Logic.
Proceedings of the 29th Annual International Computer Software and Applications Conference, 2005

Analysis of A Leader Election Algorithm in uCRL.
Proceedings of the Fifth International Conference on Computer and Information Technology (CIT 2005), 2005

2004
Checking Strong Open Congruence in Chi -Calculus.
Proceedings of Computing: The Australasian Theory Symposium, 2004

A Modal Logic for pi-Calculus and Model Checking Algorithm.
Proceedings of the 11th Workshop on Logic, Language, Information and Computation, 2004

Tree logic with recursion and model checking algorithm.
Proceedings of the IASTED Conference on Software Engineering and Applications, 2004

Towards a Model Logic for p-Calculus.
Proceedings of the 28th International Computer Software and Applications Conference (COMPSAC 2004), 2004

Framework of Performance Evaluation for Mobile Process Based on Mobile Ambient.
Proceedings of the 2004 International Conference on Computer and Information Technology (CIT 2004), 2004

2003
Intensionality of modal logic for Robust Ambient Calculus.
Proceedings of the 2nd EATCS Workshop on Foundations of Global Computing, 2003


  Loading...