Home | ASE 2016 Website | Call for Papers | Submission | Registration | Travel | Committee |
ForMABS Workshop Program
Formal methods for Analysis of Business Systems
Co-located with ASE 2016, Date: September 04, 2016
Chair: Ravindra Naik
Welcome & Workshop Objectives
|Ravindra Naik / Ansuman Banerjee |
||Keynote talk: Flexible, Adaptable & Compliant Business Systems with Dynamic Condition Response Graphs
||Prof. Thomas Hildebrandt, |
IT University of Copenhagen, Denmark
||Paper 1 : Domain-independent Method of Detecting Inconsistencies in SBVR-based Business Rules
Pavan Kumar Chittimalli,
||Chair: Ansuman Banerjee|
||Invited talk: SemFix and Beyond: Semantic techniques for Program Repair
||Prof. Abhik Roychoudhury|
||Paper 2: Improving Configurable Software Testing with Statistical Test Selection
||Invited talk: Business Process Adaptation using Discrete Event Controller Synthesis
||Dr. Sebastian Uchitel|
Imperial College, London,
University of Buenos Aires, Argentina
||Chair: Raveendra Kumar|
||Invited talk: Static analysis to enable verification and transformation of data-intensive business applications.
Indian Institute of Science, Bangalore.
||Panel Discussion / Round table discussion: Moderator: Ansuman Banerjee
||Panelists: Prof. Thomas Hildebrandt, Dr. Sebastian Uchitel, Prof. K.V.Raghavan, Prof. Abhik Roychoudhury, Ravindra Naik|
||Summarization and Closing
||Closing & Coffee
Key Note :
Speaker : Thomas Hildebrandt
Title: Flexible, Adaptable & Compliant Business Systems with Dynamic Condition Response Graphs
Software systems are increasingly used to support business processes and knowledge workflows within critical areas, including transportation, finance, healthcare and government. The support for such processes, which are at the same time unpredictable and subject to changing legal constraints, calls for flexibility, adaptability and compliancy.
In this talk the speaker will present theory and applications of Dynamic Condition Response (DCR) graphs, a formal declarative event-based process language implemented in the commercial web-tool DCRGraphs.net for collaborative process design and simulation and the academic tools dcr.itu.dk. The language and tools are the result of a series of research and PhD projects supported by the danish national research foundations, ITU and Exformatics A/S and the ongoing Computational Artefacts (CompArt.ku.dk) project supported by the Velux foundation.
Invited Talk :
Speaker : Abhik Roychoudhury
Title : SemFix and Beyond: Semantic techniques for Program Repair
Automated program repair is of great promise for future programming environments. It is also of obvious importance for patching vulnerabilities in software, or for building self-healing systems for critical infra-structure. Traditional program repair techniques tend to lift the fix from elsewhere in the program via syntax based approaches. In this talk, the speaker will mention how the search problems in program repair can be solved by semantic analysis techniques. Here semantic analysis methods are not only used to guide the search, but also for extracting formal specifications from tests. The talk will be concluded with positioning of the syntax based and semantic based methods for vulnerability patching, future generation programming, and self-healing systems.
Invited Talk :
Speaker : Uchitel, Sebastian
In this talk the speaker will discuss how discrete event controller synthesis can play a key role in achieving self-adaptation. He will also discuss a reference architecture for self-adaptive systems and show why discrete event controller synthesis is particularly well suited for adapting at runtime business processes.
Title : Business Process Adaptation using Discrete Event Controller Synthesis
Invited Talk :
Speaker : K V Raghavan
Title : Static analysis to enable verification and transformation of data-intensive business applications
Programs that process data that reside in files are widely used in varied enterprise domains, such as banking, healthcare, and web-traffic analysis. Precise static analysis of these programs in the context of software transformation and verification tasks is a challenging problem. Our key
insight is that static analysis of file- processing programs can be made more useful if knowledge of the input file formats of these programs is made available to the analysis. We instantiate this idea to solve two practical problems – specializing the code of a program to a given “restricted” input file format, and verifying if a program “conforms” to a given input file format. We then discuss an implementation of our approach, and also empirical results on a set of real and realistic programs. The results are very encouraging in the terms of both scalability as well as precision of the approach.