Automated Compositional Reasoning of Intuitionistically Closed Regular Properties

Analysis of infinitary safety properties with automated compositional reasoning through learning is discussed. We consider the class of intuitionistically closed regular languages and show that it forms a Heyting algebra and is finitely approximatable. Consequently, compositional proof rules can be verified automatically and learning algorithms for finitary regular languages suffice for generating the needed contextual assumptions. We also provide a semantic justification of an axiom to deduce circular compositional proof rules for such infinitary languages.

[1]  Jozef Hooman,et al.  Concurrency Verification: Introduction to Compositional and Noncompositional Methods , 2001, Cambridge Tracts in Theoretical Computer Science.

[2]  Ronald L. Rivest,et al.  Inference of finite automata using homing sequences , 1989, STOC '89.

[3]  Martín Abadi,et al.  A Logical View of Composition , 1993, Theor. Comput. Sci..

[4]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[5]  Patrick Maier.  Intuitionistic LTL and a New Characterization of Safety and Liveness , 2004, CSL.

[6]  Amir Pnueli,et al.  On the learnability of infinitary regular sets , 1991, COLT '91.

[7]  Klaus W. Wagner,et al.  On omega-Regular Sets , 1979, Inf. Control..

[8]  Corina S. Pasareanu,et al.  Learning Assumptions for Compositional Verification , 2003, TACAS.

[9]  Moshe Y. Vardi.  Verification of Concurrent Programs: The Automata-Theoretic Framework , 1991, Ann. Pure Appl. Log..

[10]  Yih-Kuen Tsay,et al.  Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages , 2008, TACAS.

[11]  Bowen Alpern,et al.  Defining Liveness , 1984, Inf. Process. Lett..

[12]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[13]  Lawrence H. Landweber,et al.  Decision problems forω-automata , 1969, Mathematical systems theory.

[14]  Howard Barringer,et al.  Proof Rules for Automated Compositional Verification through Learning , 2003 .

[15]  Thomas A. Henzinger,et al.  Reactive Modules , 1999, Formal Methods Syst. Des..

[16]  Bow-Yaw Wang,et al.  Automatic Derivation of Compositional Rules in Automated Compositional Reasoning , 2007, CONCUR.