default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicos Malevris
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j13]Marinos Kintis
, Mike Papadakis, Andreas Papadopoulos, Evangelos Valvis, Nicos Malevris, Yves Le Traon:
How effective are mutation testing tools? An empirical analysis of Java mutation testing tools with manual analysis and real faults. Empir. Softw. Eng. 23(4): 2426-2463 (2018)- [j12]Marinos Kintis, Mike Papadakis, Yue Jia, Nicos Malevris, Yves Le Traon, Mark Harman:
Detecting Trivial Mutant Equivalences via Compiler Optimisations. IEEE Trans. Software Eng. 44(4): 308-333 (2018) - 2016
- [c24]Marinos Kintis, Mike Papadakis, Andreas Papadopoulos, Evangelos Valvis, Nicos Malevris:
Analysing and Comparing the Effectiveness of Mutation Testing Tools: A Manual Study. SCAM 2016: 147-156 - 2015
- [j11]Marinos Kintis, Nicos Malevris:
MEDIC: A static analysis framework for equivalent mutant identification. Inf. Softw. Technol. 68: 1-17 (2015) - [j10]Marinos Kintis, Mike Papadakis, Nicos Malevris:
Employing second-order mutation for isolating first-order equivalent mutants. Softw. Test. Verification Reliab. 25(5-7): 508-535 (2015) - 2014
- [c23]Marinos Kintis, Nicos Malevris:
Using Data Flow Patterns for Equivalent Mutant Detection. ICST Workshops 2014: 196-205 - 2013
- [c22]Marinos Kintis, Nicos Malevris:
Identifying More Equivalent Mutants via Code Similarity. APSEC (1) 2013: 180-188 - 2012
- [j9]Mike Papadakis, Nicos Malevris:
Mutation based test case generation via a path selection strategy. Inf. Softw. Technol. 54(9): 915-932 (2012) - [c21]Marinos Kintis, Mike Papadakis, Nicos Malevris:
Isolating First Order Equivalent Mutants via Second Order Mutation. ICST 2012: 701-710 - [c20]Mike Papadakis, Nicos Malevris:
Killing Mutants Effectively a Search Based Approach. JCKBSE 2012: 217-226 - 2011
- [j8]Mike Papadakis, Nicos Malevris:
Automatically performing weak mutation with the aid of symbolic execution, concolic testing and search-based testing. Softw. Qual. J. 19(4): 691-723 (2011) - [c19]Mike Papadakis, Nicos Malevris:
Automatic mutation based test data generation. GECCO (Companion) 2011: 247-248 - 2010
- [c18]Marinos Kintis, Mike Papadakis, Nicos Malevris:
Evaluating Mutation Testing Alternatives: A Collateral Experiment. APSEC 2010: 300-309 - [c17]Mike Papadakis, Nicos Malevris, Maria Kallia:
Towards automating the generation of mutation tests. AST 2010: 111-118 - [c16]Mike Papadakis, Nicos Malevris:
A Symbolic Execution Tool Based on the Elimination of Infeasible Paths. ICSEA 2010: 435-440 - [c15]Mike Papadakis, Nicos Malevris, Marinos Kintis:
Mutation Testing Strategies - A Collateral Approach. ICSOFT (2) 2010: 325-328 - [c14]Mike Papadakis, Nicos Malevris:
An Empirical Evaluation of the First and Second Order Mutation Testing Strategies. ICST Workshops 2010: 90-99 - [c13]Mike Papadakis, Nicos Malevris:
Automatic Mutation Test Case Generation via Dynamic Symbolic Execution. ISSRE 2010: 121-130
2000 – 2009
- 2009
- [j7]Spyridon K. Gardikiotis, Nicos Malevris:
A two-folded impact analysis of schema changes on database applications. Int. J. Autom. Comput. 6(2): 109-123 (2009) - [j6]Efthimis N. Efthimiadis, Nicos Malevris, Apostolos Kousaridas, Alexandra Lepeniotou, Nikos Loutas:
Non-english web search: an evaluation of indexing and searching the Greek web. Inf. Retr. 12(3): 352-379 (2009) - [j5]Derek F. Yates, Nikolaos Malevris:
Inclusion, subsumption, JJ-paths, and structured path testing: a Redress. Softw. Test. Verification Reliab. 19(3): 199-213 (2009) - [c12]Mike Papadakis, Nicos Malevris:
An Effective Path Selection Strategy for Mutation Testing. APSEC 2009: 422-429 - [c11]Mike Papadakis, Nicos Malevris:
Improving Evolutionary Test Data Generation with the Aid of Symbolic Execution. AIAI Workshops 2009: 201-210 - 2008
- [c10]Efthimis N. Efthimiadis, Nicos Malevris, Apostolos Kousaridas, Alexandra Lepeniotou, Nikos Loutas:
An Evaluation of How Search Engines Respond to Greek Language Queries. HICSS 2008: 136 - 2007
- [j4]Derek F. Yates, Nicos Malevris:
An objective comparison of the cost effectiveness of three testing methods. Inf. Softw. Technol. 49(9-10): 1045-1060 (2007) - [c9]Spyridon K. Gardikiotis, Vasilios S. Lazarou, Nikolaos Malevris:
Employing Agents Towards Database Applications Testing. ICTAI (1) 2007: 173-180 - [c8]Spyridon K. Gardikiotis, Vasilios S. Lazarou, Nikolaos Malevris:
An Agent-based Approach for the Maintenance of Database Applications. SERA 2007: 558-568 - 2006
- [j3]Nicos Malevris, Derek F. Yates:
The collateral coverage of data flow criteria when branch testing. Inf. Softw. Technol. 48(8): 676-686 (2006) - [c7]Spyridon K. Gardikiotis, Nicos Malevris:
Program Analysis and Testing of Database Applications. ACIS-ICIS 2006: 368-373 - [c6]Spyridon K. Gardikiotis, Nicos Malevris:
DaSIAn: A Tool for Estimating the Impact of Database Schema Modifications on Web Applications. AICCSA 2006: 188-195 - 2004
- [c5]Spyridon K. Gardikiotis, Nikolaos Malevris, T. Konstantinou:
A Structural Approach Towards the Maintenance of Database Applications. IDEAS 2004: 277-282 - [c4]Nicos Malevris:
On structurally testing Java programs effectively. PPPJ 2004: 21-26 - 2001
- [c3]C. Koutsikas, Nicos Malevris:
A Unified Symbolic Execution System. AICCSA 2001: 466-469 - 2000
- [c2]Nicos Malevris, E. Petrova:
On the Determination of an Appropriate Time for Ending the Software Testing Process. APAQS 2000: 81-88
1990 – 1999
- 1995
- [j2]Nicos Malevris:
A path generation method for testing LCSAJs that restrains infeasible paths. Inf. Softw. Technol. 37(8): 435-441 (1995) - [j1]Derek F. Yates, Nicos Malevris:
The effort required by LCSAJ testing: an assessment via a new path generation strategy. Softw. Qual. J. 4(3): 227-242 (1995)
1980 – 1989
- 1989
- [c1]Derek F. Yates, Nicos Malevris:
Reducing the Effects of Infeasible Paths in Branch Testing. Symposium on Testing, Analysis, and Verification 1989: 48-54 - 1988
- [b1]Nicos Malevris:
An effective approach for testing program branches and linear code sequences and jumps. University of Liverpool, UK, 1988
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
