general

Invited talk at Int'l Conf. on Quality Software

April 4, 2013
Roberto Bagnara will give an invited talk at the 13th International Conference on Quality Software (QSIC 2013), July 29-30, 2013 in Nanjing, China. The QSIC series of conferences has a long tradition of bringing together researchers and practitioners to present and discuss innovative methods of assuring software and system qualities.

BUGSENG active in international conferences

January 13, 2013
BUGSENG personnel is involved in several 2013 international conferences and symposia that have, among their key topics, methodologies, techniques and tools to (automatically) reason about programs. Roberto Bagnara is a Program Committee member for the 13th International Conference on Quality Software (QSIC 2013, Nanjing, China, July 29-30, 2013), the 29th International Conference on Logic Programming (ICLP 2013, Istambul, Turkey, August 24-29, 2013), and the 22nd EACSL Annual
Read more »

PPL 1.0 has been released

June 28, 2012

This release includes support for the optimized representation of sparse vectors of coefficients, achieving significant performance improvements, e.g., when dealing with constraint systems describing weakly relational abstractions such as boxes and octagonal shapes. See the release notes for more information.

BUGSENG selected ACE's SuperTest

June 1, 2012

BUGSENG selected ACE’s SuperTest to validate its ECLAIR Software Verification Platform

Validation of Verification tools proves value

Amsterdam, June 1st, 2012. BUGSENG, a highly skilled business in program verification, based in Parma, Italy, has selected and acquired a license for the SuperTest™ compiler test and validation suite from ACE Associated Compiler Experts, the Dutch compiler and system software technology company. Read more »

PPL 0.12.1 has been released

April 16, 2012

This release includes portability improvements, a couple of new minor features, some interface changes and an important bug fix concerning the PIP solver. See the release notes for more information.

New paper to appear on Information and Computation

March 30, 2012

The paper A New Look at the Automatic Synthesis of Linear Ranking Functions has been accepted for publication on Information and Computation. The paper presents two algorithms for the synthesis of linear ranking functions that have important applications in automatic termination analysis of computer programs. The algorithms are fully implemented in the Parma Polyhedra Library.

Two in one shot!

November 17, 2010
Fabio Bossi got a Master’s degree in Computer Science, with full marks and honours and a thesis about the extensions he made to the PPL and to the ECLAIR analyzer in order to support the correct approximation of floating-point computations. Marco Poletti got a Laurea degree in Computer Science, with full marks and honours and a thesis about his work on the sparse matrices that are used in the MIP and PIP solvers of the PPL. Congratulations, Dottor2 Bossi and Dottor Poletti!

PPL 0.11 has been released

August 2, 2010
This release features a brand new Parametric Integer Programming (PIP) problem solver, “deterministic” timeout computation facilities, support for termination analysis via the automatic synthesis of linear ranking functions, support for the approximation of computations involving (bounded) machine integers, plus a number of other new minor features and enhancements, including some speed improvements.

The PPL has now a bug tracking system

June 12, 2009
We have finally got round to setting up a bug tracking system for the PPL. Users and developers are now strongly encouraged to use it for communicating, commenting and keeping track of all PPL issues.

Elena graduated!

April 27, 2009

Elena Mazzi got her Laurea degree in Mathematics with a dissertation on correct widening operators for weakly-relational numerical abstractions. The widening operators and algorithms described and proved correct in her thesis are the ones used in the BD_Shape and Octagonal_Shape classes of the PPL.
Congratulations, Dottoressa Mazzi!

Syndicate content