Saddek Bensalem
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Saddek Bensalem has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Marius Bozga
Univ. Grenoble Alpes, CNRS, Grenoble INP, Verimag
5 shared publications - Jacques Combaz
University Grenoble Alpes, VERIMAG
4 shared publications - Axel Legay
INRIA/IRISA, Rennes, France
2 shared publications - Ayoub Nouri
Univ. Grenoble Alpes, CNRS, Grenoble INP*, VERIMAG
2 shared publications - Braham Lotfi Mediouni
University Grenoble Alpes, CNRS, Grenoble INP (Institute of Engineering University Grenoble Alpes), VERIMAG
2 shared publications - Mahieddine Dellabani
Univ. Grenoble Alpes, CNRS, Grenoble INP*, VERIMAG
2 shared publications
Latest Publications
- Open Access
Institution-based Encoding and Verification of Simple UML State Machines in CASL/SPASS
This paper provides the first correct semantical representation of UML state-machines within the logical framework of an institution (previous attempts were flawed). A novel encoding of this representation into first-order logic enables symbolic analyses through a multitude of theorem-provers. UML state-machines are central to model-based systems-engineering. Till now, state-machine analysis has been mostly restricted to model checking, which for state-machines suffers heavily from the state-space explosion problem. Symbolic reasoning, as enabled and demonstrated here, provides a powerful alternative, which can deal with large or even infinite state spaces. Full proofs are given.
Open AccessInstitution-based Encoding and Verification of Simple UML State Machines in CASL/SPASS
This paper provides the first correct semantical representation of UML state-machines within the logical framework of an institution (previous attempts were flawed). A novel encoding of this representation into first-order logic enables symbolic analyses through a multitude of theorem-provers. UML state-machines are central to model-based systems-engineering. Till now, state-machine analysis has been mostly restricted to model checking, which for state-machines suffers heavily from the state-space explosion problem. Symbolic reasoning, as enabled and demonstrated here, provides a powerful alternative, which can deal with large or even infinite state spaces. Full proofs are given.
- 30 September 2018
- Published by Springer Nature
- p. 536-542
$\mathcal {S}$BIP 2.0: Statistical Model Checking Stochastic Real-Time Systems- 30 September 2018
- Published by Springer Nature
- p. 536-542
$\mathcal {S}$BIP 2.0: Statistical Model Checking Stochastic Real-Time Systems- 15 June 2018
- Published by Springer Nature in Innovations in Systems and Software Engineering
- Vol. 14 (2) , 117-142
TT-BIP: using correct-by-design BIP approach for modelling real-time system with time-triggered paradigm
- 15 June 2018
- Published by Springer Nature in Innovations in Systems and Software Engineering
- Vol. 14 (2) , 117-142
TT-BIP: using correct-by-design BIP approach for modelling real-time system with time-triggered paradigm
- 1 January 2018
- Published by Inderscience Publishers in International Journal of Critical Computer-Based Systems
- Vol. 8 (3/4) , 340
Performance evaluation of stochastic real-time systems with the SBIP framework
- 1 January 2018
- Published by Inderscience Publishers in International Journal of Critical Computer-Based Systems
- Vol. 8 (3/4) , 340
Performance evaluation of stochastic real-time systems with the SBIP framework
- Open Access
Polynomial invariants by linear algebra
We present in this paper a new technique for generating polynomial invariants, divided in two independent parts : a procedure that reduces polynomial assignments composed loops analysis to linear loops under certain hypotheses and a procedure for generating inductive invariants for linear loops. Both of these techniques have a polynomial complexity for a bounded number of variables and we guarantee the completeness of the technique for a bounded degree which we successfully implemented for C programs verification.
Open AccessPolynomial invariants by linear algebra
We present in this paper a new technique for generating polynomial invariants, divided in two independent parts : a procedure that reduces polynomial assignments composed loops analysis to linear loops under certain hypotheses and a procedure for generating inductive invariants for linear loops. Both of these techniques have a polynomial complexity for a bounded number of variables and we guarantee the completeness of the technique for a bounded degree which we successfully implemented for C programs verification.
- 8 November 2016
- Published by Springer Nature
- p. 199-216
Local Planning of Multiparty Interactions with Bounded Horizons
- 8 November 2016
- Published by Springer Nature
- p. 199-216
Local Planning of Multiparty Interactions with Bounded Horizons
- Open Access
- 17 September 2015
- Published by Centre pour la Communication Scientifique Directe (CCSD) in Logical Methods in Computer Science
- Vol. ume 11, Is
Compositional Verification for Timed Systems Based on Automatic Invariant Generation
We propose a method for compositional verification to address the state space explosion problem inherent to model-checking timed systems with a large number of components. The main challenge is to obtain pertinent global timing constraints from the timings in the components alone. To this end, we make use of auxiliary clocks to automatically generate new invariants which capture the constraints induced by the synchronisations between components. The method has been implemented in the RTD-Finder tool and successfully experimented on several benchmarks.
- 17 September 2015
- Published by Centre pour la Communication Scientifique Directe (CCSD) in Logical Methods in Computer Science
- Vol. ume 11, Is
Open AccessCompositional Verification for Timed Systems Based on Automatic Invariant Generation
We propose a method for compositional verification to address the state space explosion problem inherent to model-checking timed systems with a large number of components. The main challenge is to obtain pertinent global timing constraints from the timings in the components alone. To this end, we make use of auxiliary clocks to automatically generate new invariants which capture the constraints induced by the synchronisations between components. The method has been implemented in the RTD-Finder tool and successfully experimented on several benchmarks.
- 17 December 2013
- Published by Springer Nature in International Journal on Software Tools for Technology Transfer
- Vol. 16 (1) , 1-12
Verification and validation meet planning and scheduling
- 17 December 2013
- Published by Springer Nature in International Journal on Software Tools for Technology Transfer
- Vol. 16 (1) , 1-12
Verification and validation meet planning and scheduling
- 18 April 2013
- Published by Springer Nature in Software and Systems Modeling
- Vol. 14 (1) , 173-199
Runtime verification of component-based systems in the BIP framework with formally-proved sound and complete instrumentation
- 18 April 2013
- Published by Springer Nature in Software and Systems Modeling
- Vol. 14 (1) , 173-199
Runtime verification of component-based systems in the BIP framework with formally-proved sound and complete instrumentation
- Open Access
- 1 January 2013
- Published by Springer Nature
- p. 235-249
Model-Based Implementation of Parallel Real-Time Systems
- 1 January 2013
- Published by Springer Nature
- p. 235-249
Open AccessModel-Based Implementation of Parallel Real-Time Systems