Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Home Topics Titles Quotes Blog Featured Help
Search
 
German Vidal
Universidad Politecnica de Valencia
Valencia, Spain
 

Germán Vidal is currently a professor of computer science in the Department of Information Systems and Computation (DSIC) at the Technical University of Valencia, Spain. He holds BS and PhD degrees in computer science (from the Technical University of Valencia). He became part of the academic staff of DSIC in 1994, where he has taught courses on software engineering, programming languages, requirements engineering, declarative programming, and partial evaluation. He has been an active researcher in declarative programming since 1992, when he discovered the beauty and simplicity of this programming paradigm.

Germán currently leads the Multi-paradigm Software Technology (MiST) group at the Technical University of Valencia, which is focused on declarative programming technology. While software construction in other language paradigms is mostly a craft, declarative programs can be synthesized from specifications, formally verified, mechanically optimized, or automatically specialized with respect to some particular constraints. And, what is more important, the correctness of these techniques can be formally proven by well-known mathematical methods.

His main research interests range over a variety of topics in declarative programming. He has worked on multi-paradigm declarative languages and, particularly, the integration of functional and logic programming, the most popular declarative programming paradigms. He has also developed several formal techniques and tools for multi-paradigm declarative languages (like Curry, Haskell, and Prolog), providing program analysis, verification, refactoring, partial evaluation, debugging, tracing, profiling, and slicing.

He has published more than 50 papers in refereed conference proceedings and journals on the above topics. He has served on the program committee of several conferences in his area of expertise, like European Symposium on Programming (ESOP), Principles and Practice of Declarative Programming (PPDP), Partial Evaluation and Semantics-Based Program Manipulation (PEPM), and Logic-Based Program Synthesis and Transformation (LOPSTR). He has been a member of the PEPM steering committee since 2005. In his spare time, he enjoys spending time with his family, reading, watching movies, and traveling.


     

Automated termination proofs for logic programs by term rewriting
Schneider-Kamp P., Giesl J., Serebrenik A., Thiemann R. ACM Transactions on Computational Logic 11(1): 1-52, 2009.  Type: Article

Analyzing the termination of programs is perhaps one of the most active research topics in most declarative programming languages. Within the logic programming paradigm, one can find two different types of approaches to analyze termina...

 

Imperative-program transformation by instrumented-interpreter specialization
Debois S. Higher-Order and Symbolic Computation 21(1-2): 37-58, 2008.  Type: Article

The interpretive approach is an appealing program transformation technique. Loosely speaking, it amounts to designing a nonstandard interpreter that exhibits a particular good behavior with regard to some criterion, and then specializi...

 

Specialization for applications using shared libraries
Zhu P., Khoo S.  Partial evaluation and semantics-based program manipulation (Proceedings of the 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, San Francisco, California, Jan 7-8, 2008) 159-168, 2008.  Type: Proceedings

Zhu and Khoo present a novel approach to the runtime specialization of C applications that use shared libraries. In contrast to static libraries, shared libraries are not linked to every application that uses them. Rather, only a refer...

 

Termination analysis of logic programs through combination of type-based norms
Bruynooghe M., Codish M., Gallagher J., Genaim S., Vanhoof W. ACM Transactions on Programming Languages and Systems 29(2): 10-es, 2007.  Type: Article

Establishing that all computations terminate is a fundamental, though generally undecidable, property of computer programs. Therefore, termination analyses that approximate this property have been developed for different programming la...

 

Theoretical foundations of dynamic program slicing
Binkley D., Danicic S., Gyimóthy T., Harman M., Kiss Á., Korel B. Theoretical Computer Science 360(1): 23-41, 2006.  Type: Article

Program slicing was originally introduced by Mark Weiser to formalize the mental process that a programmer follows to find a bug. Essentially, program slicing extracts those sentences that are related to some criterion (referred to as ...

 
  more...

 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy