Relational Analysis of Algebraic Datatypes代数数据类型的关联分析.pptVIP

Outline Idea of decision procedure: reduction to a shared theory of sets BAPA-reducible theories BAPA-reduction for WS1S Outline Idea of decision procedure: reduction to a shared theory of sets BAPA-reducible theories BAPA-reduction of WS1S Reduction to BAPA Amalgamation of Models:The Disjoint Case Amalgamation of Models: The Set-Sharing Case BAPA-reducible Theories Outline Idea of decision procedure: reduction to a shared theory of sets BAPA-reducible theories BAPA-reduction of WS1S * * Combining Theories Sharing Set Operations Thomas Wies joint work with Ruzica Piskac and Viktor Kuncak TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAAAAA 3 4 Fragment of Insertion into Tree right left right left data data data p tmp left data size: root e Program Verification with Jahob implementation specification, proof hints Generated Verification Condition Expressing this VC requires a rich logic transitive closure * (in lists and also in trees) unconstraint functions (data, data0) cardinality operator on sets | ... | Is there a decidable logic containing all this? “The number of stored objects has increased by one.” ?next0*(root0,n) ? x ? {data0(v) | next0*(root0,v)} ? next=next0[n:=root0]?? data=data0[n:=x] ? |{data(v) . next*(n,v)}| = |{data0(v) . next0*(root0,v)}| + 1 Decomposing the Formula Consider a (simpler) formula |{data(x). next*(root,x)}|=k+1 Introduce fresh variables denoting sets:A = {x. next*(root,x)} ? B = {y. ? x. data(x,y) ? x ? A} ? |B|=k+1 1) WS2S 2) C2 3) BAPA Good news: conjuncts are in decidable fragments Next: explain these decidable fragments Bad news: conjuncts share more than just equality(they share set variables and set operations) WS2S: Monadic 2nd Order Logic Weak Monadic 2nd-order Logic of 2 Successors F ::= x=f1(y) | x=f2(y) | x?S | S?T | 9S.F | F1 ? F2 | :F - quantification is over finite sets of positions in a tree- transitive closure encoded using set q