Philippe Devienne

According to our database, Philippe Devienne authored at least 30 papers between 1986 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2022

Progressive compression and weight reinforcement for spiking neural networks.

Hammouda Elbez, Mohammed Kamel Benhaoua, Philippe Devienne, Pierre Boulet

Concurr. Comput. Pract. Exp., 2022

2021

VS2N : Interactive Dynamic Visualization and Analysis Tool for Spiking Neural Networks.

Hammouda Elbez, Mohammed Kamel Benhaoua, Philippe Devienne, Pierre Boulet

Proceedings of the 18th International Conference on Content-Based Multimedia Indexing, 2021

2019

Unsupervised visual feature learning with spike-timing-dependent plasticity: How far are we from traditional feature learning approaches?

Pierre Falez, Pierre Tirilly, Ioan Marius Bilasco, Philippe Devienne, Pierre Boulet

Pattern Recognit., 2019

Multi-layered Spiking Neural Network with Target Timestamp Threshold Adaptation and STDP.

Pierre Falez, Pierre Tirilly, Ioan Marius Bilasco, Philippe Devienne, Pierre Boulet

Proceedings of the International Joint Conference on Neural Networks, 2019

Spiking Neural Computing in Memristive Neuromorphic Platforms.

Mahyar Shahsavari, Philippe Devienne, Pierre Boulet

Proceedings of the Handbook of Memristor Networks., 2019

2018

Mastering the Output Frequency in Spiking Neural Networks.

Pierre Falez, Pierre Tirilly, Ioan Marius Bilasco, Philippe Devienne, Pierre Boulet

Proceedings of the 2018 International Joint Conference on Neural Networks, 2018

2016

evt_MNIST: A spike based version of traditional MNIST.

Mazdak Fatahi, Mahmood Ahmadi, Mahyar Shahsavari, Arash Ahmadi, Philippe Devienne

CoRR, 2016

2004

Co-Design and Refinement for Safety Critical Systems.

Ammar Aljer, Philippe Devienne

Proceedings of the 19th IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (DFT 2004), 2004

2003

BHDL: Circuit Design in B.

Ammar Aljer, Philippe Devienne, Sophie Tison, Jean-Louis Boulanger, Georges Mariano

Proceedings of the 3rd International Conference on Application of Concurrency to System Design (ACSD 2003), 2003

2000

Generalized Definite Set Constraints.

Jean-Marc Talbot, Philippe Devienne, Sophie Tison

Constraints An Int. J., 2000

1998

Co-definite Set Constraints with Membership Expressions.

Philippe Devienne, Jean-Marc Talbot, Sophie Tison

Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming, 1998

Source-to-source Prolog Program Compression.

Philippe Devienne, Anne Parrain, Patrick Taillibert, S. Varennes

Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming, 1998

1997

Set-Based Analysis for Logic Programming and Tree Automata.

Jean-Marc Talbot, Sophie Tison, Philippe Devienne

Proceedings of the Static Analysis, 4th International Symposium, 1997

Solving Classes of Set Constraints with Tree Automata.

Philippe Devienne, Jean-Marc Talbot, Sophie Tison

Proceedings of the Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29, 1997

1996

Smallest Horn Clause Programs.

Philippe Devienne, Patrick Lebègue, Anne Parrain, Jean-Christophe Routier, Jörg Würtz

J. Log. Program., 1996

1994

One Binary Horn Clause is Enough.

Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier, Jörg Würtz

Proceedings of the STACS 94, 1994

1993

Weighted Systems of Equations.

Philippe Devienne, Patrick Lebègue, Max Dauchet

Theor. Comput. Sci., 1993

Halting Problem of One Binary Horn Clause is Undecidable.

Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier

Proceedings of the STACS 93, 1993

The Emptiness Problem of One Binary Recursive Horn Clause is Undecidable.

Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier

Proceedings of the Logic Programming, 1993

1992

Weighted Systems Revisited.

Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier

Proceedings of the Actes WSA'92 Workshop on Static Analysis (Bordeaux, 1992

Towards Optimization of Full Prolog Programs Guided by Abstract Interpretation.

Anne Parrain, Philippe Devienne, Patrick Lebègue

Proceedings of the Logic Program Synthesis and Transformation, 1992

Termination induction by means of an abstract OLDT resolution.

Christophe Lecoutre, Philippe Devienne, Patrick Lebègue

Proceedings of the JFPL'92, 1992

Halting Problem of One Binary Horn Clause id Undecidable.

Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier

Proceedings of the Informal Proceedings of the Workshop Structural Complexity and Recursion-theoretic methods in Logic-Programming, 1992

1991

Techniques de transformations de programmes Prolog généraux et validation de méta-interpréteurs.

Anne Parrain, Philippe Devienne, Patrick Lebègue

Proceedings of the Actes JTASPEFL'91 (Bordeaux, 1991

Une analyse du comportement récursif de programmes Prolog par une interprétation abstraite.

Christophe Lecoutre, Philippe Devienne, Patrick Lebègue

Proceedings of the Actes JTASPEFL'91 (Bordeaux, 1991

Prolog Program Transformations and Meta-Interpreters.

Anne Parrain, Philippe Devienne, Patrick Lebègue

Proceedings of the Logic Program Synthesis and Transformation, 1991

Abstract Interpretation and Recursive Behaviour of Logic Programs.

Christophe Lecoutre, Philippe Devienne, Patrick Lebègue

Proceedings of the Logic Program Synthesis and Transformation, 1991

1990

Weighted Graphs: A Tool for Studying the Halting Problem and Time Complexity in Term Rewriting Systems and Logic Programming.

Philippe Devienne

Theor. Comput. Sci., 1990

1988

WEIGHTED GRAPHS, A Tool for Expressing the Behavious of Recursive Rules in Logic Programming.

Philippe Devienne

Proceedings of the International Conference on Fifth Generation Computer Systems, 1988

1986

Weighted Graphs: A Tool for Logic Programming.

Philippe Devienne, Patrick Lebègue

Proceedings of the CAAP '86, 1986