Table of Contents

Program Correctness Automation Lab

At PCA-Lab we build theories and supporting tools to enhance program correctness automation. The theories define (1) program data elements such as types, operations and relations, (2) program control elements such as conditionals, loops and functions, and (3) program correctness elements such as test cases, oracles, coverage criteria, assertions, pre-conditions, post-conditions and invariants. The aim is to establish that the program data and control elements satisfy the program correctness elements either by (i) analysis (static and dynamic) or by (ii) synthesis (construction). The supporting tools use structural analysis, logic solvers and model checkers to automate the process.

Team

Faculty

Paul Attie Mohamad Jaber Wassim Masri Fadi Zaraket

Students

Maya Safieddine, PhD student

Graduating students

Kassem Fawaz,

Mohamad Fawaz

Mohamad Noureddine, Masters student

Mohamad Sakr, Masters student

Joan Farjo, Masters student

Farah Hariri, Senior student

Join the team

Projects

Specification Construction

Specification construction

Coverage Specifications

UCOV: Use Defined Coverage Criterion

Concern Separation for Design For Testing Logic

Concern Separation

Deadlock Analysis of Distributed Behavior, Interaction, Port Distributed Computing systems

Deadlock BIP

Program Analysis with Decision and Transformation Algorithms

PaDATA

Synthesis of LTL SERE Formulae

LTL-SERE Synthesis for Verification

Visualization of Dependency Chains

Visualization of dependency chains

Property Based Coverage

Property based coverage

Automated GUI Testing

Automated GUI testing

More Ideas

Code Repositories

http://code.google.com/p/sarlab/

https://bitbucket.org/codelogicanalysis/sa

Code of Conduct