Source: http://cliplab.org/clippubsbytopic/node3.html
Timestamp: 2019-04-23 21:58:51+00:00

Document:
E. Albert, S. Genaim, M. Gómez-Zamalloa, E. B. Johnsen, R. Schlatte, S. L. Tapia Tarifa. Simulating Concurrent Behaviors with Worst-Case Cost Bounds. 17th Interational Symposium on Formal Methods (FM 2011), Lecture Notes in Computer Science, Vol. 6664, pages 353-368, Springer, June 2011.
E. Albert, P. Arenas, S. Genaim, D. Zanardini. Task-Level Analysis for a Language with Async-Finish Parallelism. Proceedings of the ACM SIGPLAN/SIGBED 2011 conference on Languages, compilers, and tools for embedded systems, LCTES 2011, Chicago, IL, USA, April 11-14, 2011, pages 21-30, ACM, April 2011.
E. Albert, P. Arenas, S. Genaim, G. Puebla. Closed-Form Upper Bounds in Static Cost Analysis. Journal of Automated Reasoning, Vol. 46, Num. 2, pages 161-203, Springer, February 2011.
JCR: position (ave) top 51%, impact (ave) 0.78, subject(s): COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE CORE: A. Citeseer: position 152/1221 (top 12%), impact 1.3. Average position: top 28%.
E. Albert, P. Arenas, S. Genaim, G. Puebla. Closed-Form Upper Bounds in Static Cost Analysis. Journal of Automated Reasoning, Vol. 46, Num. 2, pages 161-203, Springer, 2011.
E. Albert, P. Arenas, S. Genaim, G. Puebla. Field-Sensitive Value Analysis by Field-Insensitive Analysis. 16th International Symposium on Formal Methods (FM'09), Lecture Notes in Computer Science, Vol. 5850, pages 370-386, Springer, 2009.
M. Mancioppi, M. Carro, W.-J. van den Heuvel, M.P. Papazoglou. Sound Multi-party Business Protocols for Service Networks. Proceedings of the Sixth International Conference on Service Oriented Computing, LNCS, Vol. 5364, pages 302-316, Springer-Verlag, December 2008.
E. Trias, J. Navas, E. S. Ackley, S. Forrest, M. V. Hermenegildo. Negative Ternary Set-Sharing. International Conference on Logic Programming, ICLP, LNCS, Num. 5366, pages 301-316, Springer-Verlag, December 2008.
Elvira Albert, Puri Arenas, Samir Genaim, German Puebla. Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis. Static Analysis, 15th International Symposium, SAS 2008, Valencia, Spain, July 15-17, 2008, Proceedings, Lecture Notes in Computer Science, Vol. 5079, pages 221-237, Springer-Verlag, July 2008.
Samir Genaim, Andy King. Inferring non-suspension conditions for logic programs with dynamic scheduling. ACM Trans. Comput. Log., Vol. 9, Num. 3, 2008.
CORE: A. Citeseer: position 150/1221 (top 12%), impact 1.3. Average position: top 16%.
E. Mera, P. López-García, G. Puebla, M. Carro, M. Hermenegildo. Using Combined Static Analysis and Profiling for Logic Program Execution Time Estimation. 22nd International Conference on Logic Programming (ICLP'06), LNCS, Num. 4079, pages 431-432, Springer-Verlag, August 2006.
G. Puebla, E. Albert, M. V. Hermenegildo. Abstract Interpretation with Specialized Definitions. The 13th International Static Analysis Symposium (SAS'06), LNCS, Num. 4134, pages 107-126, Springer, August 2006.
Andy King, Lunjin Lu, Samir Genaim. Detecting Determinacy in Prolog Programs.. Logic Programming, 22nd International Conference, ICLP 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings, Lecture Notes in Computer Science, Vol. 4079, pages 132-147, Springer, 2006.
C. Vaucheret, F. Bueno. More Precise yet Efficient Type Inference for Logic Programs (also available in ps). 9th International Static Analysis Symposium (SAS'02), Lecture Notes in Computer Science, Vol. 2477, pages 102-116, Springer-Verlag, September 2002.
M. Codish, V. Lagoon, F. Bueno. An algebraic approach to sharing analysis of logic programs (also available in ps). Journal of Logic Programming, Vol. 42, Num. 2, pages 111-149, Elsevier - North Holland, February 2000.
S. K. Debray, P. López-García, M. V. Hermenegildo, N.-W. Lin. Lower Bound Cost Estimation for Logic Programs (also available in ps). 1997 International Logic Programming Symposium, pages 291-305, MIT Press, Cambridge, MA, October 1997.
M. Codish, M. Bruynooghe, M. García de la Banda, M. V. Hermenegildo. Exploiting Goal Independence in the Analysis of Logic Programs (also available in ps). Journal of Logic Programming, Vol. 32, Num. 3, pages 247-261, Elsevier - North Holland, September 1997.
S.K. Debray, P. López-García, M. V. Hermenegildo. Non-Failure Analysis for Logic Programs (also available in ps). 1997 International Conference on Logic Programming, pages 48-62, MIT Press, Cambridge, MA, June 1997.
G. Puebla, M. García de la Banda, K. Marriott, P. Stuckey. Optimization of Logic Programs with Dynamic Scheduling (also available in ps). 1997 International Conference on Logic Programming, pages 93-107, MIT Press, June 1997.
M. Codish, V. Lagoon, F. Bueno. An algebraic approach to sharing analysis of logic programs (also available in ps). Proc. of the Fourth International Static Analysis Symposium, LNCS, Num. 1302, pages 68-82, Springer Verlag, 1997.
M. García de la Banda, K. Marriott, P. Stuckey. Efficient Analysis of Constraint Logic Programs with Dynamic Scheduling (also available in ps). 1995 International Logic Programming Symposium, pages 417-431, MIT Press, Cambridge, MA, December 1995.
M. V. Hermenegildo, G. Puebla, K. Marriott, P. Stuckey. Incremental Analysis of Logic Programs (also available in ps). International Conference on Logic Programming, pages 797-811, MIT Press, June 1995.
M. Codish, A. Mulkers, M. Bruynooghe, M. García de la Banda, M. Hermenegildo. Improving Abstract Interpretations by Combining Domains. ACM Transactions on Programming Languages and Systems, Vol. 17, Num. 1, pages 28-44, ACM, January 1995.
E. Albert, J. Correas, G. Puebla, G. Román-Díez. Towards Incremental Resource Usage Analysis. The Ninth Asian Symposium on Programming Languages and Systems (APLAS'11), Springer, December 2011. Poster Presentation.
CORE: B. CiteseerX position (ave) top 45%, impact (ave) 0.080. Average position: top 55%.
J. F. Morales, M. V. Hermenegildo, R. Haemmerlé. Modular Extensions for Modular (Logic) Languages. Proceedings of the 21th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR'11), LNCS, Vol. 7225, pages 139-154, Springer, July 2011.
E. Albert, R. Bubel, S. Genaim, R. Hähnle, G. Puebla, G. Román-Díez. Verified Resource Guarantees using COSTA and KeY. Proceedings of the 2011 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM 2011, Austin, TX, USA, January 24-25, 2011, pages 73-76, ACM Press, January 2011.
E. Albert, S. Genaim, A. N. Masud. More Precise yet Widely Applicable Cost Analysis. 12th Verification, Model Checking, and Abstract Interpretation (VMCAI'11), Lecture Notes in Computer Science, Vol. 6538, pages 38-53, Springer Verlag, January 2011.
E. Albert, P. Arenas, S. Genaim, M. Gómez-Zamalloa, G. Puebla. Cost Analysis of Concurrent OO Programs. The 9th Asian Symposium on Programming Languages and Systems (APLAS'11), Vol. 7078, pages 238-254, Springer, 2011.
E. Albert, M. Gómez-Zamalloa, J.M. Rojas, G. Puebla. Compositional CLP-based Test Data Generation for Imperative Languages. LOPSTR 2010 Revised Selected Papers, LNCS, Vol. 6564, pages 99-116, Springer-Verlag, 2011.
E. Albert, P. Arenas, D. Alonso, S. Genaim, G. Puebla. Asymptotic Resource Usage Bounds. The Seventh Asian Symposium on Programming Languages and Systems (APLAS'09), Lecture Notes in Computer Science, Vol. 5904, pages 294-310, Springer, December 2009.
E. Albert, J. Gallagher, M. Gómez-Zamalloa, G. Puebla. Type-based Homeomorphic Embedding for Online Termination. Information Processing Letters, Vol. 109, Num. 15, pages 879-886, Elsevier, July 2009.
JCR: position (ave) top 72%, impact (ave) 0.44, subject(s): COMPUTER SCIENCE, INFORMATION SYSTEMS CORE: B. Citeseer: position 551/1221 (top 45%), impact 0.58. Average position: top 61%.
E. Albert, M. Gómez-Zamalloa, G. Puebla. Test Data Generation of Bytecode by CLP Partial Evaluation. 18th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR'08), LNCS, Vol. 5438, pages 4-23, Springer-Verlag, March 2009.
M. Gómez-Zamalloa, E. Albert, G. Puebla. Modular Decompilation of Low-Level Code by Partial Evaluation. 8th IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM'08), pages 239-248, IEEE Computer Society, September 2008.
CiteseerX position (ave) top 37%, impact (ave) 0.085. Average position: top 37%.
D. Zanardini. The Semantics of Abstract Program Slicing. 8th International Working Conference on Source Code Analysis and Manipulation (SCAM'08), IEEE Computer Society, September 2008.
E. Albert, P. Arenas, S. Genaim, G. Puebla, D. Zanardini. Removing Useless Variables in Cost Analysis of Java Bytecode. ACM Symposium on Applied Computing (SAC) - Software Verification Track (SV08), pages 368-375, ACM Press, New York, March 2008.
E. Albert, J. Gallagher, M. Gómez-Zamalloa, G. Puebla. Type-based Homeomorphic Embedding and its Applications to Online Partial Evaluation. 17th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR'07), LNCS, Vol. 4915, pages 23-42, Springer-Verlag, February 2008.
C. Ochoa, G. Puebla, M. V. Hermenegildo. Removing Superfluous Versions in Polyvariant Specialization of Prolog Programs. 15th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR'05), LNCS, Num. 3901, pages 80-97, Springer-Verlag, April 2006.
E. Albert, G. Puebla, J. Gallagher. Non-Leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates. 15th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR'05), LNCS, Num. 3901, pages 115-132, Springer-Verlag, April 2006.
J. Gallagher, G. Puebla, E. Albert . Converting one Type-Based Abstract Domain to Another. 15th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR'05), LNCS, Num. 3901, pages 147-162, Springer-Verlag, April 2006.
J. Correas, G. Puebla, M. V. Hermenegildo, F. Bueno. Experiments in Context-Sensitive Analysis of Modular Programs. 15th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR'05), LNCS, Num. 3901, pages 163-178, Springer-Verlag, April 2006.
G. Puebla, C. Ochoa. Poly-Controlled Partial Evaluation. 8th ACM-SIGPLAN International Symposium on Principles and Practice of Declarative Programming (PPDP'06), ACM Press, 2006.
G. Puebla, M. V. Hermenegildo. Implementation of Multiple Specialization in Logic Programs (also available in ps). Proc. ACM SIGPLAN Symposium on Partial Evaluation and Semantics Based Program Manipulation, pages 77-87, ACM Press, June 1995.
M. Codish, A. Mulkers, M. Bruynooghe, M. García de la Banda, M. Hermenegildo. Improving Abstract Interpretations by Combining Domains. Proc. ACM SIGPLAN Symposium on Partial Evaluation and Semantics Based Program Manipulation, pages 194-206, ACM, June 1993.
M. Gómez-Zamalloa. Transformation and Analysis of Object-Oriented Bytecode. Ph.D. Thesis, Complutense University of Madrid, October 2009.
M. García de la Banda. Implementación de un Intérprete Abstracto de Programas Prolog sobre el Dominio ``sharing + freeness'' (Implementation and Evaluation of an Abstract Interpreter over the ``sharing + freeness'' Domain). Ms. Thesis, T. University of Madrid (UPM), Facultad de Informática, Madrid, 28660, December 1991.
Elvira Albert, Israel Cabañas, Antonio Flores-Montoya, Miguel Gómez-Zamalloa, Sergio Gutiérrez. jPET: an Automatic Test-Case Generator for Java. 18th Working Conference on Reverse Engineering (WCRE 2011), 2 pages, IEEE Computer Society, October 2011.
D. Ramírez-Deantes, J. Correas, G. Puebla. Modular Termination Analysis of Java Bytecode and its Application to phoneME Core Libraries. Postproceedings of Formal Aspects of Computer Software (FACS 2010), Lecture Notes in Computer Science, Vol. 6921, pages 218-236, Springer, 2011.
M. Gómez-Zamalloa, E. Albert, G. Puebla. Decompilation of Java Bytecode to Prolog by Partial Evaluation. Information and Software Technology, Vol. 51, Num. 10, pages 1409-1427, Elsevier, October 2009.
JCR: position (ave) top 67%, impact (ave) 0.49, subject(s): COMPUTER SCIENCE, INFORMATION SYSTEMSCOMPUTER SCIENCE, SOFTWARE ENGINEERINGCOMPUTER SCIENCE, SOFTWARE, GRAPHICS, PROGRAMMING CORE: B. Citeseer: position 930/1221 (top 76%), impact 0.19. Average position: top 69%.
M. Gómez-Zamalloa, E. Albert, G. Puebla. Decompilation of Java Bytecode to Prolog by Partial Evaluation. JIST, Vol. 51, pages 1409-1427, Elsevier, October 2009.
E. Albert, P. Arenas, S. Genaim, M. Gómez-Zamalloa, G. Puebla, D. Ramírez, G. Román, D. Zanardini. Termination and Cost Analysis with COSTA and its User Interfaces. Spanish Conference on Programming and Computer Languages (PROLE'09 ), ENTCS, Vol. 248, pages 109-121, Elsevier, September 2009.
G. Marpons, J. Mariño, M. Carro, A. Herranz, L.Å. Fredlund, J.J. Moreno-Navarro, A. Polo. A Coding Rule Conformance Checker Integrated into GCC. Spanish Conference on Programming and Computer Languages (PROLE'09), ENTCS, Vol. 258, pages 149-159, Elsevier, August 2009.
E. Albert, P. Arenas, S. Genaim, G. Puebla, D. Zanardini. COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode. 6th International Symposium on Formal Methods for Components and Objects (FMCO'07), Lecture Notes in Computer Science, Num. 5382, pages 113-133, Springer, February 2008.
E. Albert, P. Arenas, S. Genaim, G. Puebla. Cost Relation Systems: a Language-Independent Target Language for Cost Analysis. 8th Spanish Conference on Programming and Computer Languages (PROLE'08), Electronic Notes in Theoretical Computer Science, Vol. 17615, Elsevier, 2008.
H. Soza, M. Carro, P. López-García. Probabilistic Cost Analysis of Logic Programs: A First Case Study. XXXII Latin-American Conference on Informatics, August 2006.
F. Bueno, M. García de la Banda, M. V. Hermenegildo, P. López-García, E. Mera, P. J. Stuckey. Towards Resource Usage Analysis of MiniZinc Models. MiniZinc Workshop (MZN'11), 15 pages, September 2011.
E. Albert, R. Bubel, S. Genaim, R. Hähnle, G. Román-Díez. Verified Resource Guarantees for Heap Manipulating Programs. 10th KeY Symposium, August 2011.
Diego Alonso, Puri Arenas, Samir Genaim. Handling Non-linear Operations in the Value Aanalysis of COSTA. Proceedings of the Bytecode 2011 workshop, the Sixth Workshop on Bytecode Semantics, Verification, Analysis and Transformation (Bytecode), Electronic Notes in Theoretical Computer Science, Vol. 279 Issue 1, pages 3-17, Elsevier, 2011.
E. Albert, P. Arenas, S. Genaim, G. Puebla, D. Ramírez, D. Zanardini. Upper Bounds of Resource Usage for Java Bytecode using COSTA and its Web Interface. Workshop on Resource Analysis, September 2008.
E. Albert, P. Arenas, S. Genaim, G. Puebla. Dealing with Numeric Fields in Termination Analysis of Java-like Languages. 10th Workshop on Formal Techniques for Java-like Programs, July 2008.
S. Genaim, F. Spoto. Constancy Analysis. 10th Workshop on Formal Techniques for Java-like Programs, July 2008.
E. Trias, J. Navas, E. S. Ackley, S. Forrest, M. V. Hermenegildo. Two Efficient Representations for Set-Sharing Analysis in Logic Programs . 17th International Workshop on Functional and (Constraint) Logic Programming, WFLP'08, 15 pages, July 2008.
E. Albert, P. Arenas, S. Genaim, G. Puebla, D. Ramírez, D. Zanardini. The COSTA Cost and Termination Analyzer for Java Bytecode and its Web Interface (Tool Demo). 22nd European Conference on Object-Oriented Programming (ECOOP'08), July 2008.
R. Haemmerlé, H. Betz. Verification of Constraint Handling Rules using Liner Logic Phase Semantics. 5th Int'l Workshop on Constraint Handling Rules (CHR 2011), Report Series 08-10, RICS-Linz, July 2008.
J. Navas, M. Méndez-Lojo, M. Hermenegildo. Safe Upper-bounds Inference of Energy Consumption for Java Bytecode Applications. The Sixth NASA Langley Formal Methods Workshop (LFM 08), pages 29-32, April 2008. Extended Abstract.
C. Ochoa, G. Puebla. Oracle-Based Poly-Controlled Partial Evaluation. ETAPS Workshop on Quantitative Aspects of Programming Languages (QAPL'08), Vol. 220, Num. 3, pages 145-161, Elsevier, March 2008.
M. Gómez-Zamalloa, E. Albert, G. Puebla. On the Generation of Test Data for Prolog by Partial Evaluation. Workshop on Logic-based methods in Programming Environments (WLPE'08), pages 26-43, 2008. Report number: WLPE/2008/06.
M. Gómez-Zamalloa, E. Albert, G. Puebla. Towards Modular Interpretive Decompilation of Low-Level Code to Prolog. 8th Spanish Conference on Programming and Computer Languages (PROLE'08), 2008.
E. Mera, P. López-García, G. Puebla, M. Carro, M. Hermenegildo. Towards Execution Time Estimation for Logic Programs via Static Analysis and Profiling. 16th Workshop on Logic Programming Environments, pages 45-60, University of Namur, Institut d'Informatique, August 2006.
C. Vaucheret, F. Bueno. More Precise Yet Efficient Type Inference for Logic Programs. Workshop on Logic Programming Environments, July 2002.
F. Bueno, M. Garcia de la Banda, M. V. Hermenegildo, K. Marriott, G. Puebla, P. Stuckey. A Model for Inter-module Analysis and Optimizing Compilation. Tenth International Workshop on Logic-based Program Synthesis and Transformation, July 2000.
G. Puebla, J. Gallagher, M. V. Hermenegildo. Towards Integrating Partial Evaluation in a Specialization Framework based on Generic Abstract Interpretation (also available in ps). Proceedings of the ILPS'97 Workshop on Specialization of Declarative Programs, October 1997. Post ILPS'97 Workshop.
F. Bueno, D. Cabeza, M. V. Hermenegildo, G. Puebla. Data-flow Analysis of Standard Prolog Programs. ICLP95 WS on Abstract Interpretation of Logic Languages, June 1995.
F. Bueno, M. V. Hermenegildo. Analysis of Concurrent Constraint Logic Programs with a Fixed Scheduling Rule. ICLP95 WS on Abstract Interpretation of Logic Languages, June 1995.
M. García de la Banda, K. Marriott, P. Stuckey. Efficient Analysis of Constraint Logic Programs with Dynamic Scheduling. ICLP95 WS on Abstract Interpretation of Logic Languages, June 1995.
E. Albert, P. Arenas, S. Genaim, G. Puebla, D. Zanardini. Cost Analysis of Object-Oriented Bytecode Programs. Num. CLIP7/2008.0, Technical University of Madrid (UPM), September 2008.
E. Trias, J. Navas, E. S. Ackley, S. Forrest, M. V. Hermenegildo. Efficient Representations for Set-Sharing Analysis. Num. CLIP9/2008.0, University of New Mexico and Technical University of Madrid, September 2008.
D. Zanardini. The Semantics of Abstract Program Slicing. Num. CLIP4/2008.0, Technical University of Madrid (UPM), June 2008.
M. Gómez-Zamalloa, E. Albert, G. Puebla. Modular Decompilation of Low-Level Code by Partial Evaluation. Num. CLIP2/2008.0, Technical University of Madrid (UPM), April 2008. Available at http://cliplab.org/papers/mod-decomp-tr.pdf.
E. Albert, P. Arenas, S. Genaim, G. Puebla, D. Zanardini. Automatic Cost Analysis of Java Bytecode. Num. CLIP10/2006.0, Technical University of Madrid, December 2006.
J. Navas, E. Mera, P. López-García, M. Hermenegildo. Resource Bounds Analysis. Num. CLIP6/2006.0, 19 pages, Technical University of Madrid (UPM), November 2006.
E. Mera, P. López-García, G. Puebla, M. Carro, M. Hermenegildo. Towards Combining Static Analysis and Profiling for Estimating Execution Times in Logic Programs. Num. CLIP5/2006.0, 15 pages, Technical University of Madrid (UPM), April 2006.
C. Vaucheret, F. Bueno. Structural Type Widening. Num. CLIP2/2001.1, Facultad de Informática, UPM, Technical University of Madrid (UPM), January 2002.
S.K. Debray, P. López-García, M. V. Hermenegildo, N.-W. Lin. Lower Bound Cost Estimation for Logic Programs. Num. CLIP20/95.0, T.U. of Madrid (UPM), December 1995.
G. Puebla, M. V. Hermenegildo. Specialization and Optimization of Constraint Programs with Dynamic Scheduling. Num. CLIP12/95.0, Facultad de Informática, UPM, September 1995. Presented at the 1995 COMPULOG Meeting on Program Development.
F. Bueno, D. Cabeza, M. V. Hermenegildo, G. Puebla. Data-Flow Analysis of Prolog Programs with Extra-Logical Features (also available in ps). Num. CLIP2/95.0, Computer Science Dept., Technical U. of Madrid (UPM), March 1995.
M. García de la Banda, K. Marriott, P. Stuckey. Efficient Analysis of Constraint Logic Programs with Dynamic Scheduling. Facultad de Informática, UPM, March 1995.
F. Bueno, D. Cabeza, M. García de la Banda, M. V. Hermenegildo, G. Puebla. Abstract Functions for the Analysis of Builtins in the PLAI System. Num. CLIP1/95.0, Computer Science Dept., Technical U. of Madrid (UPM), January 1995.
K. Marriott, M. García de la Banda, M. V. Hermenegildo. Analyzing Logic Programs with Dynamic Scheduling. Num. CLIP6/93.1, T.U. of Madrid (UPM), October 1992.
G. Janssens, M. V. Hermenegildo, F. Bueno, M. García de la Banda, A. Mulkers. A Review of some Abstract Interpretation Systems. Num. CW143, Department of Computer Science, Katholieke Universiteit Leuven, February 1992.
K. Muthukumar, M. Hermenegildo. Deriving A Fixpoint Computation Algorithm for Top-down Abstract Interpretation of Logic Programs. Num. ACT-DC-153-90, Microelectronics and Computer Technology Corporation (MCC), Austin, TX 78759, April 1990.
R. Warren, M. Hermenegildo. On the Practicality of Global Flow Analysis of Logic Programs. Num. ACA-126-88, Microelectronics and Computer Technology Corporation (MCC), Austin, TX 78759, January 1988.

References: V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V.