Work

Synthesizing Modular Invariants for Synchronous Code

Year: 2014

Type: article

Abstract: In this paper, we explore different techniques to synthesize modular invariants for synchronous code encoded as Horn clauses. Modular invariants are a set of formulas that characterizes the validity of predicates. They are very useful for different aspects of analysis, synthesis, testing and program transformation. We describe two techniques to generate modular invariants for code written in the synchronous dataflow language Lustre. The first technique directly encodes the synchronous code in a modular fashion. While in the second technique, we synthesize modular invariants starting from a monolithic invariant. Both techniques, take advantage of analysis techniques based on property-directed reachability. We also describe a technique to minimize the synthesized invariants.

Source: Electronic Proceedings in Theoretical Computer Science

DOI: 10.4204/eptcs.169.4

Authors: Pierre-Loic Garoche, Arie Gurfinkel, Temesghen Kahsai

Institutions: Office National d'Études et de Recherches Aérospatiales, Carnegie Mellon University, Ames Research Center

Language: English

Topic: Formal Methods in Verification

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funders: U.S. Department of Defense, National Aeronautics and Space Administration, Carnegie Mellon University, Agence Nationale de la Recherche

Awards: G116927039, THE PROPOSED WORK TARGETS THE SSAT1 SUB-TOPIC AFCS-1.2, SUPPORT FOR VERIFICATION OF BLACK-BOX FLIGHT-CRITICAL SYSTEMS (FCS). SPECIFICALLY, THE PROJE, G5926907248