Suite à la panne Microsoft, nos outils Office sont impactés.

Plus d'informations dès que possible.

The English-language site is gradually being launched. Visit our international pages.

Search
Menu
Je me connecte
Search
  • Home
Photo of Charles Pecheur

Charles Pecheur

Professeur
charles.pecheur@uclouvain.be

SST/EPL Louvain School of Engineering (EPL)

SST/ICTM Institute of Information and Communication Technologies, Electronics and Applied Mathematics (ICTEAM)

SST/ICTM/INGI Pôle en ingénierie informatique (INGI)

2019
Journal article

Busard, S., Pecheur, C., Qu, H., & Raimondi, F. (2019). Comparing approaches for model-checking strategies under imperfect information and fairness constraints. International Journal on Software Tools for Technology Transfer, 21(4), 449-469. https://doi.org/10.1007/s10009-018-0505-6 (Original work published 2019)

https://research.dial.uclouvain.be/handle/2078.5/168756


2018
Conference paper

Limbrée, C., Pecheur, C., & et al. (2018). A Framework for the Formal Verification of Networks of Railway Interlockings - Application to the Belgian Railway. AVOCS2018. Accepted/in-press. (Original work published 2018)

https://research.dial.uclouvain.be/handle/2078.5/174451


Busard, S., & Pecheur, C. (2018). Producing explanations for rich logics. In Havelund K., Roscoe B., de Vink E. e.a. (ed.), Formal methods : lecture notes in computer science (p. p. 129-146). https://doi.org/10.1007/978-3-319-95582-7_8

https://research.dial.uclouvain.be/handle/2078.5/220673


2017
Conference paper

Gillard, X. (2017). On the community structure of SAT-BMC problems. PhD Symposium at iFM’17 on Formal Methods: Algorithms, Tools and Applications (PhD-iFM’17), Turin.

https://research.dial.uclouvain.be/handle/2078.5/226775


Busard, S., & Pecheur, C. (2017). A Backward-traversal-based Approach for Symbolic Model Checking of Uniform Strategies for Constrained Reachability. In Patricia Bouyer, Andrea Orlandini and Pierluigi San Pietro (ed.), Proceedings of Eighth International Symposium on Games, Automata, Logics and Formal Verification. Open Publishing Association. https://doi.org/10.4204/EPTCS.256.18

https://research.dial.uclouvain.be/handle/2078.5/226853


Book chapter

Maudoux, G., Pecheur, C., & Combéfis, S. (2017). Learning Safe Interactions and Full-Control. In Benjamin Weyers, Philippe Palanque, Judy Bowen et Alan Dix (ed.), Formal Methods in Human Computer Interactions. https://doi.org/10.1007/978-3-319-51838-1_11

https://research.dial.uclouvain.be/handle/2078.5/229957


2016
Journal article

Combéfis, S., Giannakopoulou, D., & Pecheur, C. (2016). Automatic Detection of Potential Automation Surprises for ADEPT Models. I E E E Transactions on Human-Machine Systems, 46(2), 267-278. https://doi.org/10.1109/THMS.2015.2424851 (Original work published 2016)

https://research.dial.uclouvain.be/handle/2078.5/185731


Conference paper

Limbrée, C., Cappart, Q., Pecheur, C., & Tonetta, S. (2016). Verification of Railway Interlocking - Compositional Approach with OCRA. Reliability, Safety, and Security of Railway Systems. Published. RSSR2016, Paris. https://doi.org/10.1007/978-3-319-33951-1_10

https://research.dial.uclouvain.be/handle/2078.5/272722


2015
Journal article

Busard, S., Pecheur, C., Qu, H., & Raimondi, F. (2015). Reasoning about memoryless strategies under partial observability and unconditional fairness constraints. Information and Computation, 242, 128-156. https://doi.org/10.1016/j.ic.2015.03.014 (Original work published 2015)

https://research.dial.uclouvain.be/handle/2078.5/192640


Conference paper

Busard, S., Cappart, Q., Limbrée, C., Pecheur, C., & Schaus, P. (2015). Verification of railway interlocking systems. Electronic Proceedings in Theoretical Computer Science, 184, 19-31. https://doi.org/10.4204/EPTCS.184.2 (Original work published 2015)

https://research.dial.uclouvain.be/handle/2078.5/272340


Maudoux, G., Combéfis, S., & Pecheur, C. (2015). Tasks Decomposition of System Models for Human-Machine Interaction Analysis. Workshop on Formal Methods in Human Computer Interaction (FoMHCI), in conjunction with ACM SIGCHI Symposium on Enginnering Interactive Computing Systems (EICS) 2015, Duisburg, Germany.

https://research.dial.uclouvain.be/handle/2078.5/231545


2014
Conference paper

Busard, S., Pecheur, C., Qu, H., & Raimondi, F. (2014). Improving the Model Checking of Strategies under Partial Observability and Fairness Constraints. Formal Methods and Software Engineering. Published. 16th International Conference on Formal Engineering Methods, ICFEM 2014, Luxembourg, Luxembourg. https://doi.org/10.1007/978-3-319-11737-9_3

https://research.dial.uclouvain.be/handle/2078.5/230521


Javaux, D., Wortelen, B., Lüdtke, A., Pecheur, C., Peldszus, R., Sievi, S., & Yushtein, Y. (2014). A methodology for analyzing human-automation interactions in flight operations using formal verification techniques. In Eric G. Mercer, Michael A. Goodrich, Neha Rungta, Ellen Bass (ed.), Proceedings of AAAI Symposium on Formal Verification in Human-Machine Systems (p. p. 1-6).

https://research.dial.uclouvain.be/handle/2078.5/231896


Combéfis, S., Giannakopoulou, D., & Pecheur, C. (2014). State Event Models for the Formal Analysis of Human-Machine Interactions. AAAI 2014 Symposium “Modeling in Human Machine Systems: Challenges for Formal Verification”, Palo Alto, 2014.

https://research.dial.uclouvain.be/handle/2078.5/231725


2013
Monography

Dierkes, M., & Pecheur, C. (2013). Formal Methods for Industrial Critical Systems. Springer.

https://research.dial.uclouvain.be/handle/2078.5/202494


Conference paper

Busard, S., & Pecheur, C. (2013). PyNuSMV: NuSMV as a Python Library. In Guillaume Brat, Neha Rungta, Arnaud Venet (ed.), NASA Formal Methods (pp. 453-458). https://doi.org/10.1007/978-3-642-38088-4_33

https://research.dial.uclouvain.be/handle/2078.5/229258


Busard, S., Pecheur, C., Qu, H., & Raimondi, F. (2013). Reasoning about Strategies under Partial Observability and Fairness Constraints. Electronic Proceedings in Theoretical Computer Science, 112, 71-79. https://doi.org/10.4204/EPTCS.112.12 (Original work published 2013)

https://research.dial.uclouvain.be/handle/2078.5/163618


2012
Conference paper

Busard, S., & Pecheur, C. (2012). Rich counter-examples for temporal-epistemic logic model checking. Electronic Proceedings in Theoretical Computer Science, 78, 39-53. https://doi.org/10.4204/EPTCS.78.4 (Original work published 2012)

https://research.dial.uclouvain.be/handle/2078.5/163023


2011
Conference paper

Vander Meulen, J., & Pecheur, C. (2011). Milestones: a model checker combining Symbolic model Checking and partial order reduction. In Bobaru, M.; Havelund, K.; Holzmann, G.; Joshi, R. (Eds.) (ed.), NASA formal methods (pp. 525-531). Springer. https://doi.org/10.1007/978-3-642-20398-5_43

https://research.dial.uclouvain.be/handle/2078.5/226144


Combéfis, S., Giannakopoulou, D., Pecheur, C., & Feary, M. (2011). Learning system abstractions for human operators. roceedings of the International Workshop on Machine Learning Technologies in Software Engineering, 3-10. https://doi.org/10.1145/2070821.2070822

https://research.dial.uclouvain.be/handle/2078.5/226329


Combéfis, S., Giannakopoulou, D., Pecheur, C., & Feary, M. (2011). A formal framework for design and analysis of Human-Machine interaction. IEEE International Conference on Systems, Man, and Cybernetics. Conference Proceedings, Oct 2011, 1801-1808. https://doi.org/10.1109/ICSMC.2011.6083933 (Original work published 2011)

https://research.dial.uclouvain.be/handle/2078.5/154334


Combéfis, S., Giannakopoulou, D., Pecheur, C., & Mehlitz, P. (2011). A JavaPathfinder Extension to Analyse Human-Machine Interactions. The Java Pathfinder Workshop 2011, Oread, Lawrence, Kansas.

https://research.dial.uclouvain.be/handle/2078.5/226636


Vander Meulen, J., & Pecheur, C. (2011). Combining Partial-Order reduction and symbolic model checking to verify LTL properties. In Mihaela Bobaru, Klaus Havelund, Gerard Holzmann, Rajeev Joshi (ed.), NASA formal methods (pp. 405-420). Springer. https://doi.org/10.1007/978-3-642-20398-5_29

https://research.dial.uclouvain.be/handle/2078.5/226149


2010
Conference paper

Pecheur, C., Andrews, J., & Di Nitto, E. (2010). Conference proceedings of ASE 2010, 25th IEEE/ACM International Conference on Automated Software Engineering. IEEE/ACM International Conference on Automated Software Engineering, Antwerp, Belgium.

https://research.dial.uclouvain.be/handle/2078.5/153902


Raimondi, F., Pecheur, C., & Brat, G. (2010). Testing Planning Domains (without Model Checkers). Proceedings of the third workshop on model-based testing. Published. Third Workshop on Model-Based Testing, Braga, Portugal.

https://research.dial.uclouvain.be/handle/2078.5/231788


2009
Conference paper

Combéfis, S., & Pecheur, C. (2009). A bisimulation-based approach to the analysis of human-computer interaction. Proceedings of the 1st ACM SIGCHI symposium on Engineering interactive computing systems, 101-110.

https://research.dial.uclouvain.be/handle/2078.5/230373


Raimondi, F., Pecheur, C., & Brat, G. (2009). PDVer, a Tool to Verify PDDL Planning Domains. Proceedings of ICAPS′09 Workshop on Verification and Validation of Planning and Scheduling Systems, Thessaloniki, Greece.

https://research.dial.uclouvain.be/handle/2078.5/150193


Vander Meulen, J., & Pecheur, C. (2009). Combining Partial Order Reduction with Bounded Model Checking. Communicating Process Architectures 2009, 29-48.

https://research.dial.uclouvain.be/handle/2078.5/230414


Pecheur, C., Raimondi, F., & Brat, G. (2009). A Formal Analysis of Requirements-Based Testing. Proceedings of the eighteenth international symposium on Software testing and analysis, 1-9.

https://research.dial.uclouvain.be/handle/2078.5/230418


2008
Conference paper

Pecheur, C. (2008). Verification of embedded software: from mars to actions. In Leue, S.; Merino, P.; (ed.), Formal Methods for Industrial Critical Systems. 12th International Workshop, FMICS 2007 (p. p. 1). Springer-verlag.

https://research.dial.uclouvain.be/handle/2078.5/228706


Vander Meulen, J., & Pecheur, C. (2008). Efficient symbolic model checking for process algebras. In Darren Cofer, Alessandro Fantechi (ed.), Formal Methods for Industrial Critical Systems (pp. 69-84).

https://research.dial.uclouvain.be/handle/2078.5/230101


2007
Conference paper

Pecheur, C., & Raimondi, F. (2007). Symbolic Model Checking of Logics with Actions. In Stefan Edelkamp and Alessio Lomuscio (ed.), Model Checking and Artificial Intelligence (pp. 113-128). Springer.

https://research.dial.uclouvain.be/handle/2078.5/229814


Raimondi, F., Pecheur, C., & Brat, G. (2007). Testing Planning Domains (without Model Checkers). Electronic Notes in Theoretical Computer Science, 190(2), 113-125. (Original work published 2007)

https://research.dial.uclouvain.be/handle/2078.5/150217


Lomuscio, A., Pecheur, C., & Raimondi, F. (2007). Automatic Verification of Knowledge and Time with NuSMV. Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, 1384-1389.

https://research.dial.uclouvain.be/handle/2078.5/230430


2006
Conference paper

Pecheur, C., & Simmons, R. (2006). From Livingstone to SMV. In Rash, James L. (ed.) ; Truszkowski, Walt (ed.) ; Rouff, Christopher A. (ed.) ; Gordon, Diana (ed.) (ed.), Formal Approaches to Agent-Based Systems (p. p. 103-113). Lecture Notes in Computer Science.

https://research.dial.uclouvain.be/handle/2078.5/231898


2005
Journal article

Menzies, T., & Pecheur, C. (2005). Verification and validation and artificial intelligence. Advances in Computers, 65, 153-201. https://doi.org/10.1016/S0065-2458(05)65004-8 (Original work published 2005)

https://research.dial.uclouvain.be/handle/2078.5/202141


Conference paper

Raimondi, F., Pecheur, C., & Lomuscio, A. (2005). Applications of model checking for multi-agent systems: verification of diagnosability and recoverability. Proceedings of Concurrency Specification and Programming (CSP 2005), Ruciane-Nida, Poland. Published. CSP 200, Ruciane-Nida, Poland.

https://research.dial.uclouvain.be/handle/2078.5/231723


1999
Journal article

Leduc, G., Bonaventure, O., Leonard, L., Koerner, E., & Pecheur, C. (1999). Model-based verification of a security protocol for conditional acess to services. Formal Methods in System Design : an international journal, 14(2), 171-191. https://doi.org/10.1023/A:1008683519655 (Original work published 1999)

https://research.dial.uclouvain.be/handle/2078.5/255199


Learning units for 2026

Label Code
Semester 1 Coordination LEPL1001
Informatics 1 LEPL1401
Project 1 LEPL1501
Introduction to programming LINFO1101
Program design methods LINFO1122
Calculability and Complexity LINFO1123
Concurrent systems : models and analysis LINFO2143
Software Quality Assurance LINFO2251
Software engineering and programming systems seminar LINFO2359
Computer Science 1: Introduction to Programming LSINC1101