Back to the main page

• Runtime assertion checking

• A common specification language for static and dynamic analysis.

• Monitoring for memory-related constructs of EACSL specifications.

• Combination of static and dynamic analysis for program verification.

• Combining value analysis, program slicing and test generation. The SANTE method.

• Incremental verification combining deductive verification with test generation. The StaDy tool.

• Structural testing of C programs.

• All-Paths test generation for C programs with aliases.

• Complexity of all-paths test generation.

• A late treatment of C precondition in DSE tools.

• Efficient Leverage of Symbolic ATG Tools to Advanced Coverage Criteria. Label coverage.

• Protocol verification.

• Verification of cryptographic protocols.

• Verification of parameterized protocols.

• Constraint Solving for Sequences.

• Several methods of propagation for constraint solving for sequences.

• Implementation of constraint solvers based on these methods in CHR.

• Software Testing. Boundary coverage criteria.

• Definition of boundary states and generalized edges of domains.

• Definition of boundary coverage criteria for automatic test generation.

• Homological dimensions of pullback rings.

• Estimates for the injective, projective and flat dimensions of modules over pullback rings.

• Estimates for the global, flat and finitistic dimensions of pullback rings.

• Cohomology of algebras of tame representation type.

• Development of an original C++ program RESOLUT to compute the minimal projective resolutions of simple modules over algebras of tame representation type.

• Computation of the Yoneda algebra for some families of dihedral algebras.

Back to the main page