1 /*******************************************************************************
2 * Copyright (c) 2017 Politecnico di Torino and others.
4 * All rights reserved. This program and the accompanying materials
5 * are made available under the terms of the Apache License, Version 2.0
6 * which accompanies this distribution, and is available at
7 * http://www.apache.org/licenses/LICENSE-2.0
8 *******************************************************************************/
9 package it.polito.verigraph.mcnet.netobjs;
11 import java.util.ArrayList;
12 import java.util.List;
14 import com.microsoft.z3.BoolExpr;
15 import com.microsoft.z3.Context;
16 import com.microsoft.z3.DatatypeExpr;
17 import com.microsoft.z3.Expr;
18 import com.microsoft.z3.FuncDecl;
19 import com.microsoft.z3.IntExpr;
20 import com.microsoft.z3.Solver;
21 import com.microsoft.z3.Sort;
23 import it.polito.verigraph.mcnet.components.NetContext;
24 import it.polito.verigraph.mcnet.components.Network;
25 import it.polito.verigraph.mcnet.components.NetworkObject;
26 import it.polito.verigraph.mcnet.components.Tuple;
28 /** Represents a Firewall with the associated Access Control List
31 public class AclFirewall extends NetworkObject{
33 List<BoolExpr> constraints;
36 ArrayList<Tuple<DatatypeExpr,DatatypeExpr>> acls;
41 public AclFirewall(Context ctx, Object[]... args) {
46 protected void init(Context ctx, Object[]... args) {
49 constraints = new ArrayList<BoolExpr>();
50 acls = new ArrayList<Tuple<DatatypeExpr,DatatypeExpr>>();
51 z3Node = ((NetworkObject)args[0][0]).getZ3Node();
53 net = (Network)args[0][1];
54 nctx = (NetContext)args[0][2];
64 public void setPolicy(ArrayList<Tuple<DatatypeExpr, DatatypeExpr>> policy){
68 public void addAcls(ArrayList<Tuple<DatatypeExpr,DatatypeExpr>> acls){
69 this.acls.addAll(acls);
73 public DatatypeExpr getZ3Node() {
79 protected void addConstraints(Solver solver) {
80 BoolExpr[] constr = new BoolExpr[constraints.size()];
81 solver.add(constraints.toArray(constr));
82 aclConstraints(solver);
85 private void firewallSendRules (){
86 Expr p_0 = ctx.mkConst(fw+"_firewall_send_p_0", nctx.packet);
87 Expr n_0 = ctx.mkConst(fw+"_firewall_send_n_0", nctx.node);
88 Expr n_1 = ctx.mkConst(fw+"_firewall_send_n_1", nctx.node);
89 IntExpr t_0 = ctx.mkIntConst(fw+"_firewall_send_t_0");
90 IntExpr t_1 = ctx.mkIntConst(fw+"_firewall_send_t_1");
91 acl_func = ctx.mkFuncDecl(fw+"_acl_func", new Sort[]{nctx.address, nctx.address},ctx.mkBoolSort());
93 //Constraint1send(fw, n_0, p, t_0) -> (exist n_1,t_1 : (recv(n_1, fw, p, t_1) &&
94 // t_1 < t_0 && !acl_func(p.src,p.dest))
96 ctx.mkForall(new Expr[]{n_0, p_0, t_0},
98 (BoolExpr)nctx.send.apply(new Expr[]{ fw, n_0, p_0, t_0}),
99 ctx.mkExists(new Expr[]{t_1},
100 ctx.mkAnd(ctx.mkLt(t_1,t_0),
101 ctx.mkExists(new Expr[]{n_1},
102 nctx.recv.apply(n_1, fw, p_0, t_1),1,null,null,null,null),
103 ctx.mkNot((BoolExpr)acl_func.apply(nctx.pf.get("src").apply(p_0), nctx.pf.get("dest").apply(p_0)))),1,null,null,null,null)),1,null,null,null,null));
107 private void aclConstraints(Solver solver){
108 if (acls.size() == 0)
110 Expr a_0 = ctx.mkConst(fw+"_firewall_acl_a_0", nctx.address);
111 Expr a_1 = ctx.mkConst(fw+"_firewall_acl_a_1", nctx.address);
112 BoolExpr[] acl_map = new BoolExpr[acls.size()];
113 for(int y=0;y<acls.size();y++){
114 Tuple<DatatypeExpr,DatatypeExpr> tp = acls.get(y);
115 acl_map[y] = ctx.mkOr(ctx.mkAnd(ctx.mkEq(a_0,tp._1),ctx.mkEq(a_1,tp._2)), ctx.mkAnd(ctx.mkEq(a_0,tp._2),ctx.mkEq(a_1,tp._1)));
117 //Constraint2acl_func(a_0,a_1) == or(foreach ip1,ip2 in acl_map ((a_0 == ip1 && a_1 == ip2)||(a_0 == ip2 && a_1 == ip1)))
118 solver.add(ctx.mkForall(new Expr[]{a_0, a_1},
120 acl_func.apply(a_0, a_1),
121 ctx.mkOr(acl_map)),1,null,null,null,null));