The challenges of building advanced mechatronic systems
W Schafer, H Wehrheim - Future of Software Engineering …, 2007 - ieeexplore.ieee.org
Mechatronics is an engineering discipline integrating the fields of mechanical engineering,
electrical engineering and computer science. While the word" mechatronics" already has a …
electrical engineering and computer science. While the word" mechatronics" already has a …
PKind: A parallel k-induction based model checker
PKind is a novel parallel k-induction-based model checker of invariant properties for finite-or
infinite-state Lustre programs. Its architecture, which is strictly message-based, is designed …
infinite-state Lustre programs. Its architecture, which is strictly message-based, is designed …
Tarmo: A framework for parallelized bounded model checking
S Wieringa, M Niemenmaa, K Heljanko - arXiv preprint arXiv:0912.2552, 2009 - arxiv.org
This paper investigates approaches to parallelizing Bounded Model Checking (BMC) for
shared memory environments as well as for clusters of workstations. We present a generic …
shared memory environments as well as for clusters of workstations. We present a generic …
Model counting modulo theories
QS Phan - arXiv preprint arXiv:1504.02796, 2015 - arxiv.org
This thesis is concerned with the quantitative assessment of security in software. More
specifically, it tackles the problem of efficient computation of channel capacity, the maximum …
specifically, it tackles the problem of efficient computation of channel capacity, the maximum …
Towards better heuristics for solving bounded model checking problems
A Kheireddine, E Renault, S Baarir - Constraints, 2023 - Springer
This paper presents a new way to improve the performance of the SAT-based bounded
model checking problem on sequential and parallel procedures by exploiting relevant …
model checking problem on sequential and parallel procedures by exploiting relevant …
Concurrent bounded model checking
We introduce a methodology, based on symbolic execution, for Concurrent Bounded Model
Checking. In our approach, we translate a program into a formula in a disjunctive form. This …
Checking. In our approach, we translate a program into a formula in a disjunctive form. This …
Concurrent bug finding based on bounded model checking
M Vujošević Janičić - International Journal of Software Engineering …, 2020 - World Scientific
Automated and reliable software verification is of crucial importance for development of high-
quality software. Formal methods can be used for finding different kinds of bugs without …
quality software. Formal methods can be used for finding different kinds of bugs without …
Parallel SAT solving in bounded model checking
Bounded model checking (BMC) is an incremental refutation technique to search for
counterexamples of increasing length. The existence of a counterexample of a fixed length …
counterexamples of increasing length. The existence of a counterexample of a fixed length …
Asynchronous multi-core incremental SAT solving
S Wieringa, K Heljanko - Tools and Algorithms for the Construction and …, 2013 - Springer
Solvers for propositional logic formulas, so called SAT solvers, are used in many practical
applications. As multi-core and multi-processor hardware has become widely available …
applications. As multi-core and multi-processor hardware has become widely available …
Challenges in constraint-based analysis of hybrid systems
A Eggers, N Kalinnik, S Kupferschmid… - Recent Advances in …, 2009 - Springer
In the analysis of hybrid discrete-continuous systems, rich arithmetic constraint formulae with
complex Boolean structure arise naturally. The iSAT algorithm, a solver for such formulae, is …
complex Boolean structure arise naturally. The iSAT algorithm, a solver for such formulae, is …