Accueil › Annuaire des chercheurs › Ali Mili
Ali Mili
Affiliation : New Jersey Institute of Technology
- 90Publications (affiliation américaine)
- 228Publications au total
- 1606Citations
- 22Indice h
Profil de recherche
Ali Mili compte 90 publications référencées (1985–2024). Ses travaux paraissent principalement dans « International Conference on Software Technologies (ICSOFT) », « Science of Computer Programming » et « Acta Informatica ». Son article le plus cité, « A cybersecurity model in cloud computing environments » (2012), a été cité 101 fois. 16 de ces publications datent des trois dernières années d’activité. Ses travaux sont cosignés avec au moins 12 chercheurs, notamment dans des établissements de Tunisie, Canada, France.
C’est vous ? Faites connaître vos travaux
Créez gratuitement votre profil DzCademia et ajoutez vos articles : ils apparaîtront plus facilement sur Google et dans les assistants d’IA comme ChatGPT. Plus de personnes pourront vous lire et vous citer.
Créer mon profil gratuit Ajouter mes publicationsDomaines de recherche
- Logic, programming, and type systems
- Software Testing and Debugging Techniques
- Software Engineering Research
- Formal Methods in Verification
- Advanced Software Engineering Methodologies
Publications (90)
- Subsumption, correctness and relative correctness: Implications for software testing
- Invariant relations for affine loops
- “Function Extraction: A New Paradigm for Producing Secure Code“
- Toward a theory of program repair
- Semantic Coverage: Measuring Test Suite Effectiveness
- On the persistent rumors of the programmer’s imminent demise
- Subsumption, Correctness and Relative Correctness
- Three Forms of Mutant Subsumption: Basic, Strict and Broad
- Invariant Relations for Recurrence and Stratified Recurrence
- Subsumption, Correctness and Relative Correctness
- Invariant Relations: A Bridge from Programs to Equations
- Assume(), Capture(), Verify(), Establish(): A Vocabulary for Static Program Analysis
- Computing program functions
- Generalized Mutant Subsumption
- Invarint Relations for Affine Loops
- Quantifying the Effectiveness of Mutant Sets
- The ratio of equivalent mutants: A key to analyzing mutation equivalence
- Quantifying Faultiness: What Does It Mean to Have N Faults?
- Assume, Capture, Verify, Establish: Ingredients for Scalable Software Analysis
- Mutation Subsumption as Relative Incorrectness
- A Massively Parallel Approach to Automated Software Correctness Enhancement in Java
- The Bane of Generate-and-Validate Program Repair: Too Much Generation, Too Little Validation
- Quantitative Analysis of Mutant Equivalence
- Correctness enhancement: a pervasive software engineering paradigm
- A Semantic Definition of Faults and Its Implications
- Correctness enhancement: a pervasive software engineering paradigm
- Program Repair at Arbitrary Fault Depth
- Using Semantic Metrics to Predict Mutation Equivalence
- Quantitative Metrics for Mutation Testing
- Fault Density, Fault Depth and Fault Multiplicity: The Reward of Discernment
- Convergence: Integrating termination and abort-freedom
- Impact of Mutation Operators on Mutant Equivalence
- Impact of Mutation Operators on the Ratio of Equivalent Mutants
- Impact of Mutation Operators on Mutant Equivalence
- A Comparative Study of Invariant Assertions, Invariant Relations, and Invariant Functions
- A Generic Algorithm for Program Repair
- What is a fault? and why does it matter?
- A generic algorithm for program repair
- Estimating the Survival Rate of Mutants
- Projecting programs on specifications: Definition and implications
- Debugging without Testing
- Software Evolution by Correctness Enhancement
- Program Repair by Stepwise Correctness Enhancement
- Relational Mathematics for Relative Correctness
- Correctness and relative correctness
- Correctness and Relative Correctness
- Computing Attributes of Software Architectures - A Static Method and Its Validation
- The MFC Cybersecurity Model Extension and Diagnostic toward a Depth Measurement
- The Mean Failure Cost Cybersecurity Model to Quantify Security in E-Learning Environments
- Verifying while loops with invariant relations
- Quantifying the impact of unavailability in cyber-physical environments
- Quantifying availability in SCADA environments using the cyber security metric MFC
- Automated Quantitative Attributes Prediction from Architectural Description Language
- Mean Failure Cost as a Measurable Value and Evidence of Cybersecurity
- A cybersecurity model in cloud computing environments
- An economic model of security threats for cloud computing systems
- Invariant assertions, invariant relations, and invariant functions
- A versatile concept for the analysis of loops
- Invariant functions and invariant relations: An alternative to invariant assertions
- Defining and computing a value based cyber-security measure
- Defining and computing a value based cyber-security measure
- Computing Preconditions and Postconditions of While Loops
- Invariant Relations: An Automated Tool to Analyze Loops
- A quantitative model for software engineering trends
- Quantifying security threats and their potential impacts: a case study
- Modeling stakeholder/value dependency through mean failure cost
- Software requirements for a system to compute mean failure cost
- Using invariant functions and invariant relations to compute loop functions
- A model for analyzing architectural attributes
- Quantifying security threats and their impact
- MODELING THE EVOLUTION OF SOFTWARE ENGINEERING TRENDS - A Bottom Up Approach
- Harnessing a Refinement Theory to Compute Loop Functions
- Relational Methods in the Analysis of While Loops: Observations of Versatility
- Towards an Engineering Discipline of Computational Society
- Modeling security as a dependability attribute: a refinement-based approach
- Towards the Verification and Validation of Online Learning Adaptive Systems
- A calculus of program adaptation and its applications
- Embedding a demonic semilattice in a relation algebra
- Machine translation from Arabic to English and French
- A relational division operator: the conjugate kernel
- On the lattice of specifications: Applications to a specification methodology
- Heuristics for constructing while loops
- An introduction to program fault tolerance: A structured programming approach
- The use of executable assertions for error detection and damage assessment
- A Database of Software Components: An Algebraic Structure and Its Implementation
- Relational heuristics for the design of deterministic programs
- On the use of executable assertions in structured programs
- Formal models of stepwise refinements of programs
- Specification methodology: An integrated relational approach
- Strongest invariant functions: Their use in the systematic analysis of while statements
Revues de publication
- International Conference on Software Technologies (ICSOFT) × 7
- Science of Computer Programming × 5
- Acta Informatica × 4
- SSRN Electronic Journal × 4
- Communications in computer and information science × 4
- IEEE International Conference on Software Quality, Reliability and Security Companion (QRS-C) × 4
Publications par année
- 20243
- 20239
- 20224
- 20216
- 20204
- 20194
- 20185
- 20175
- 20163
- 20156
Collaborations
Établissements partenaires : Tunis University · Tunis El Manar University · Oak Ridge National Laboratory · Institut Supérieur de Gestion de Tunis · Université Laval
Pays des co-auteurs : Tunisie · Canada · France
Co-auteurs
- Amani Ayad
- Nafi Diallo
- Frederick T. Sheldon
- Aleksandr Zakharchenko
- Robert K. Abercrombie
- JiMeng Loh
- samia Alblwi
- Hessamaldin Mohammadi
- Ji Meng Loh
- Mark G. Pleszkoch
- Lamia Labed Jilani
- Elijah Brick
Données bibliographiques issues d’OpenAlex (base ouverte).
Pourquoi choisir Dzcademia ?
Pour donner à vos travaux plus de chances d’être découverts et recommandés par les IA. Profils, articles et communications : donnez à votre recherche une présence publique structurée. Les métadonnées intégrées aident les moteurs de recherche et les assistants IA à identifier vos travaux et à comprendre leurs références.
Commenter avec Google
Connecte-toi avec Google pour commenter directement sur cette page.