contact information

Postal address Germán Vidal
DSIC, Universitat Politècnica de València
Camino de Vera, S/N
46020 Valencia, Spain
Visiting address DSIC building, Room 2D42 (2nd floor)
Universitat Politècnica de València
Phone: +34-96-387-7007 (Ext. 13587)
Email: gvidal@dsic.upv.es / gvidal@acm.org

research interests

  • Current R+D projects: MERINET (Rigorous Methods for the Future Internet) and COST action IC1405 on reversible computation -extending horizons of computing. I also collaborate with the DCore project on Causal Debugging for Concurrent Systems.
    • Declarative formalisms

      • Declarative formalisms are known for their higher level of abstraction. They can be considered both as specification languages and, often, as programming languages. Among others, we consider term rewriting, logic programming (Prolog), functional programming (Haskell), and the actor model (Erlang).
    • Static analysis and program transformation techniques

      • These techniques can be used for computing program properties as well as for improving its efficiency, readability, etc. Moreover, they have a rigorous mathematical foundation, which allows us to formally prove their correctness (and other useful properties).
    • Software verification, testing and debugging

      • Ensuring the reliability of critical software is one of the major challenges today. In this context, we consider different approaches, like formal verification (e.g., model checking) and software testing (e.g., concolic testing). Furthermore, debugging techniques are essential to locate bugs in faulty code.
    • Reversible computation

      • Besides its theoretical interest, reversible computation is a fundamental concept which is relevant in many different areas like cellular automata, bidirectional program transformation, or quantum computing, to name a few. In particular, we use a reversible semantics for the concurrent language Erlang in order to design a causal consistent reversible debugger, to improve fault-tolerance, etc.

PC chair

program committees

  • ICFP 2019, 18-23 August 2019 (Berlin, Germany).
  • RC 2019, 24-25, June 2019 (Lausanne, Switzerland).
  • SMC 2018, 7-10 October 2018 (Miyazaki, Japan).
  • RC 2018, 13-14 September 2018 (Leicester, UK).
  • LOPSTR 2018, 4-6 September 2018 (Frankfurt am Main, Germany).
  • ICLP 2018, 14-17 July 2018 (Oxford, UK).
  • WFLP'17, September 19-22, 2017 (Würzburg, Germany).
  • DECPS'17, October 19, 2017 (Seoul, South Korea).
  • ICLP 2017, August 29 to September 1, 2017 (Melbourne, Australia).
  • PROLE'17, Santa Cruz de Tenerife (Spain), July 19-21, 2017.
  • VPT 2016, April 2nd, 2016 (Eindhoven, The Netherlands).
  • Past research activities...

editorial boards

invited talks

steering committees

  • PPDP (Principles and Practice of Declarative Programming), since 2016
  • LOPSTR (Logic-based Program Synthesis and Transformation), 2010 - 2017
  • FLOPS (International Symposium on Functional and Logic Programming), since 2008
  • ACM SIGPLAN PEPM (Partial Evaluation and Semantics-Based Program Manipulation), 2005 - 2011

other activities

copyrights are held variously by the authors or publishers. In general, these papers are provided for direct use in scholarship and education. If you are contemplating other uses, such as republication, you must obtain appropriate permissions. If you wish to cite any of the published work, please look up the formal publication, and use that version. The preprints in this area are as accurate as I can make them, but they are not authoritative copies of the published versions

2019

2018

2017

2016

2015

2014

2013

2012

  • Matthias Blume and Germán Vidal (guest editors). Functional and Logic Programming. Theoretical Computer Science, vol. 435. Special issue on FLOPS 2010. Available online
  • Naoki Nishida and Germán Vidal. More Specific Term Rewriting Systems. Proc. of the 21st International Workshop on Functional and (Constraint) Logic Programming (WFLP 2012). PDF
  • Naoki Nishida and Germán Vidal. Computing More Specific Versions of Conditional Rewriting Systems. 22nd International Symposium on Logic-Based Program Synthesis and Transformation , LOPSTR 2012. PDF (check also the extended version with proofs).
  • Germán Vidal. Annotation of Logic Programs for Independent AND-Parallelism by Partial Evaluation. 28th International Conference on Logic Programming, ICLP 2012. PDF (check also PPEval) LOPSTR 2011 
						cover
  • Germán Vidal. Closed symbolic execution for verifying program termination. 12th IEEE International Working Conference on Source Code Analysis and Manipulation, SCAM 2012. PDF (extended version including proofs; check also SETT)
  • Germán Vidal (editor). Logic-Based Program Synthesis and Transformation. Revised and selected papers from LOPSTR 2011. Springer, volume 7225, 2012. Online version © Springer

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1999

  • Elvira Albert, María Alpuente, Michael Hanus, Germán Vidal. A Partial Evaluation Framework for Curry Programs. LPAR'99, 1999. PS © Springer-Verlag
  • Elvira Albert, María Alpuente, Michael Hanus, Germán Vidal. Partial Evaluation of Residuating Functional Logic Programs. WFLP'99, Grenoble (France), 1999
  • María Alpuente, Moreno Falaschi, Ginés Moreno, Germán Vidal. A Transformation System for Lazy Functional Logic Programs. FLOPS'99, 1999. PS. Online paper © Springer-Verlag
  • María Alpuente, Michael Hanus, Salvador Lucas, Germán Vidal. Specialization of Inductively Sequential Functional Logic Programs. ICFP'99. ACM Sigplan Notices 34(9):273-283, 1999. PS © ACM Press
  • María Alpuente, Michael Hanus, Salvador Lucas, Germán Vidal. Specialization of Functional Logic Programs Based on Needed Narrowing. WFLP'99, Grenoble (France), 1999

1998

1997

  • María Alpuente, Moreno Falaschi, Ginés Moreno, Germán Vidal. Safe Folding/Unfolding with Conditional Narrowing. ALP'97, 1997. PDF preprint. Online paper © Springer-Verlag
  • María Alpuente, Moreno Falaschi, Pascual Julián, Germán Vidal. Specialization of Lazy Functional Logic Programs. PEPM'97, ACM Sigplan Notices, volume 32(12):151-162, ACM Press, 1997. PDF
  • María Alpuente, Moreno Falaschi, Ginés Moreno, Germán Vidal. Safe Folding/Unfolding with Conditional Narrowing. APPIA-GULP-PRODE'97, Grado (Italy). G.R.U. Logic Programming, pp. 347-358, 1997.
  • Germán Vidal. Semantics-Based Analysis and Transformation of Functional Logic Programs (thesis abstract). Bulletin of the EATCS, number 61:253-254, Feb 1997

1996

  • María Alpuente, Moreno Falaschi, Pascual Julián, Germán Vidal. Call-by-Name Specialization of Functional Logic Programs. MPLP'96, Bonn (Germany). T.U. Berlin, 1996. PDF
  • María Alpuente, Moreno Falaschi, Germán Vidal. A Compositional Semantic Basis for the Analysis of Equational Horn Programs. Theoretical Computer Science, volume 165(1):97-131, Sept 1996. PDF preprint
  • María Alpuente, Moreno Falaschi, Germán Vidal. Narrowing-driven Partial Evaluation of Functional Logic Programs. ESOP'96, Linköping (Sweden). Springer LNCS 1058, pp. 45-61, 1996. PDF Online paper © Springer-Verlag
  • Germán Vidal. Semantics-Based Analysis and Transformation of Functional Logic Programs. Ph.D. Thesis, Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Sep 1996. In Spanish (published by Ed. UPV, ISBN 84-699-5066-5, 2001). PDF / PS

1995

  • María Alpuente, Moreno Falaschi, Pascual Julián, Germán Vidal. Narrowing-driven Specialization of Functional Logic Programs. 4th Compulog Subgroup Meeting on Programming Languages, 1995. PDF
  • María Alpuente, Moreno Falaschi, Germán Vidal. Partial Evaluation of Functional Logic Programs. First International Workshop of the HCM Project CONSOLE, Venezia, Italy, 1995

1994

  • María Alpuente, Moreno Falaschi, María José Ramis, Germán Vidal. A Compositional Semantics for Conditional Term Rewriting Systems. ICCL'94, Tolouse (France). IEEE Society Press, pp. 7-12, 1994. PDF © IEEE Computer Society Press
  • María Alpuente, Moreno Falaschi, María José Ramis and Germán Vidal. Unfolding of Equational Logic Programs. Third Compulog-Network Subgroup Meeting on Programming Languages, Madrid, Spain, 1994. PDF
  • María Alpuente, Moreno Falaschi, Germán Vidal. Compositional Analysis for Equational Horn Programs. ALP'94, Madrid (Spain). Springer LNCS 850, pp. 77-94, 1994. PDF. Online paper © Springer-Verlag

1993

  • María Alpuente, Moreno Falaschi, María José Ramis, Germán Vidal. Narrowing Approximations as an Optimization for Equational Logic Programs. PLILP'93, Tallin (Estonia). Springer LNCS 714, pp. 391-409, 1993. PDF © Springer-Verlag
  • María Alpuente, Moreno Falaschi, Germán Vidal. Compositional Analysis for Equational Horn Programs. PRODE'93, Blanes (Spain). CSIC, pp. 155-172, 1993.
  • María Alpuente, Moreno Falaschi, María José Ramis, Germán Vidal. Using Narrowing Approximations to Optimize Equational Logic Programs. GULP'93, Gizzeria Lido (Italy). G.R.U. Logic Programming, 1993. PDF
  • María Alpuente, Moreno Falaschi, Germán Vidal. Incremental Equational Constraint Analyses. ILPS'93, Vancouver (Canada). MIT Press, Cambridge, MA, 1993. Poster.PDF
  • Germán Vidal. Optimizations of Equational Logic Programs Using Abstract Narrowing. Technical Report DSIC - II/32/93, UPV. PDF

1992

  • María Alpuente, Javier Piris, María José Ramírez, Germán Vidal. Combination and Evaluation of Incremental Strategies in CLP(H/E). Technical Report DSIC - II/14/92, UPV. In Spanish

software tools available

  • SWIPrologZ3, a simple SWI Prolog API to Microsoft's SMT solver Z3 (ongoing)
  • CauDEr, a causal-consistent reversible debugger for Erlang (developed by Adrián Palacios)
  • contest, a tool for concolic testing in (pure) Prolog
  • tcgen, a tool for test case generation in Prolog based on the construction of finite (closed) SLD trees
  • erlang2trs, a tool for transforming Erlang programs into term rewrite systems so that existing techniques and tools for the verification of rewrite systems can be used
  • SETT, a symbolic execution-based termination tool for simple imperative programs
  • PPEval, a paralellizing lightweight partial evaluator that is able to extract parallelism from sequential logic programs
  • CPD lite, a lightweight approach to conjunctive partial evaluation of logic programs, combining online and offline styles
  • TNT, a termination prover for narrowing
  • improved web interface for proff (v1.2, Sep 2007), a Prolog offline partial evaluator
  • PEPE, a tool for predicting the effects of partial evaluation

You can also check the MiST repository.

current PhD students

former PhD students

  • Salvador Tamarit. Analysis Techniques for Concurrent Programming Languages. Universitat Politècnica de València, 2013.
  • Gustavo Arroyo. Evaluación parcial dirigida por narrowing. Técnicas de optimización y aplicaciones. Universitat Politècnica de València, 2012.
  • Josep Silva. Debugging Techniques for Declarative Languages: Profiling, Program Slicing, and Algorithmic Debugging. Universitat Politècnica de València, 2007.
  • J. Guadalupe Ramos. Una aproximación offline a la evaluación parcial dirigida por narrowing. Universitat Poliècnica de València, 2007.
  • Elvira Albert. Partial Evaluation of Multi-Paradigm Declarative Languages: Foundations, Control, Algorithms and Efficiency. Universitat Politècnica de València, 2001.
  • Ginés Moreno. Reglas y Estrategias de Transformación para Programas Lógico-Funcionales. Universitat Politècnica de València, 2000.