use of com.rockwellcollins.atc.agree.analysis.ast.AgreeVar in project AGREE by loonwerks.
the class LustreAstBuilder method addTimeEvents.
private static void addTimeEvents(Set<AgreeVar> timeEvents, AgreeNode flatNode, String prefix, List<AgreeStatement> assertions) {
for (AgreeVar event : flatNode.eventTimes) {
timeEvents.add(new AgreeVar(prefix + event.id, event.type, event.reference, event.compInst, null));
}
// set the time variable to be equal
IdExpr timeId = AgreePatternTranslator.timeExpr;
assertions.add(new AgreeStatement("", new BinaryExpr(timeId, BinaryOp.EQUAL, new IdExpr(prefix + timeId.id)), null));
}
use of com.rockwellcollins.atc.agree.analysis.ast.AgreeVar in project AGREE by loonwerks.
the class LustreAstBuilder method getRealizabilityLustreProgram.
// private static AgreeProgram translate(AgreeProgram program){
// return AgreeInlineLatchedConnections.translate(program);
// }
public static Program getRealizabilityLustreProgram(AgreeProgram agreeProgram) {
List<TypeDef> types = AgreeUtils.getLustreTypes(agreeProgram);
List<Expr> assertions = new ArrayList<>();
List<VarDecl> locals = new ArrayList<>();
List<VarDecl> inputs = new ArrayList<>();
List<Equation> equations = new ArrayList<>();
List<String> properties = new ArrayList<>();
AgreeNode topNode = agreeProgram.topNode;
for (AgreeStatement assumption : topNode.assumptions) {
assertions.add(assumption.expr);
}
int i = 0;
for (AgreeStatement guarantee : topNode.guarantees) {
String guarName = guarSuffix + i++;
locals.add(new AgreeVar(guarName, NamedType.BOOL, guarantee.reference, topNode.compInst, null));
equations.add(new Equation(new IdExpr(guarName), guarantee.expr));
properties.add(guarName);
}
List<String> inputStrs = new ArrayList<>();
for (AgreeVar var : topNode.inputs) {
inputs.add(var);
inputStrs.add(var.id);
}
for (AgreeVar var : topNode.outputs) {
inputs.add(var);
}
// and type equations. This would clear this up
for (AgreeStatement statement : topNode.assertions) {
if (AgreeUtils.referenceIsInContract(statement, topNode.compInst)) {
// this is a strange hack we have to do. we have to make
// equation and property
// statements not assertions. They should all be binary
// expressions with an
// equals operator. We will need to removing their corresponding
// variable
// from the inputs and add them to the local variables
BinaryExpr binExpr;
IdExpr varId;
try {
binExpr = (BinaryExpr) statement.expr;
varId = (IdExpr) binExpr.left;
} catch (ClassCastException e) {
// some equation variables are assertions for
// subrange types. do not translate these to
// local equations. Just add them to assertions
assertions.add(statement.expr);
continue;
}
boolean found = false;
int index;
for (index = 0; index < inputs.size(); index++) {
VarDecl var = inputs.get(index);
if (var.id.equals(varId.id)) {
found = true;
break;
}
}
if (!found || binExpr.op != BinaryOp.EQUAL) {
throw new AgreeException("Something went very wrong with the lustre generation in the realizability analysis");
}
locals.add(inputs.remove(index));
equations.add(new Equation(varId, binExpr.right));
}
}
NodeBuilder builder = new NodeBuilder("main");
builder.addInputs(inputs);
builder.addLocals(locals);
builder.addEquations(equations);
builder.addProperties(properties);
builder.addAssertions(assertions);
builder.setRealizabilityInputs(inputStrs);
Node main = builder.build();
List<Node> nodes = new ArrayList<>();
nodes.add(main);
nodes.addAll(agreeProgram.globalLustreNodes);
List<Function> uFunctions = new ArrayList<>();
uFunctions.addAll(agreeProgram.uninterpretedFunctions);
Program program = new ProgramBuilder().addTypes(types).addFunctions(uFunctions).addNodes(nodes).setMain(main.id).build();
return program;
}
use of com.rockwellcollins.atc.agree.analysis.ast.AgreeVar in project AGREE by loonwerks.
the class LustreAstBuilder method addNodeCall.
protected static void addNodeCall(AgreeNode agreeNode, List<AgreeStatement> assertions, String prefix, Expr clockExpr, Node lustreNode) {
List<Expr> inputIds = new ArrayList<>();
for (VarDecl var : lustreNode.inputs) {
String suffix = "";
// if this component implementation is using the latched semantics
if (agreeNode.timing == TimingModel.LATCHED) {
EObject ref = ((AgreeVar) var).reference;
if (ref instanceof DataPortImpl && ((DataPortImpl) ref).isIn() || (ref instanceof EventDataPortImpl && ((EventDataPortImpl) ref).isIn() || (ref instanceof Arg && ref.eContainer() instanceof InputStatement))) {
suffix = AgreeInlineLatchedConnections.LATCHED_SUFFIX;
}
}
inputIds.add(new IdExpr(prefix + var.id + suffix));
}
if (agreeNode.timing == TimingModel.ASYNC || agreeNode.timing == TimingModel.LATCHED) {
// the clock expr should be the last input to the node
inputIds.set(inputIds.size() - 1, clockExpr);
}
Expr condactExpr = new NodeCallExpr(lustreNode.id, inputIds);
AgreeStatement condactCall = new AgreeStatement("", condactExpr, null);
assertions.add(condactCall);
}
use of com.rockwellcollins.atc.agree.analysis.ast.AgreeVar in project AGREE by loonwerks.
the class LustreAstBuilder method addInputsAndOutputs.
protected static void addInputsAndOutputs(AgreeNode parentNode, List<AgreeVar> inputs, List<AgreeVar> outputs, List<AgreeStatement> patternProps, AgreeNode subAgreeNode, Node lustreNode, String prefix) {
int varCount = 0;
for (AgreeVar var : subAgreeNode.inputs) {
varCount++;
AgreeVar input = new AgreeVar(prefix + var.id, var.type, var.reference, var.compInst, var.featInst);
inputs.add(input);
}
for (AgreeVar var : subAgreeNode.outputs) {
varCount++;
AgreeVar output = new AgreeVar(prefix + var.id, var.type, var.reference, var.compInst, var.featInst);
outputs.add(output);
}
// for (AgreeVar var : subAgreeNode.locals) {
// varCount++;
// AgreeVar local = new AgreeVar(prefix + var.id, var.type, var.reference, var.compInst, var.featInst);
// outputs.add(local);
// }
int i = 0;
for (AgreeStatement statement : subAgreeNode.assumptions) {
varCount++;
AgreeVar output = new AgreeVar(prefix + assumeSuffix + i++, NamedType.BOOL, statement.reference, subAgreeNode.compInst, null);
outputs.add(output);
}
int k = 0;
for (AgreeStatement statement : subAgreeNode.patternProps) {
varCount++;
AgreeVar output = new AgreeVar(prefix + patternPropSuffix + k++, NamedType.BOOL, statement, subAgreeNode.compInst, null);
patternProps.add(new AgreeStatement(prefix.replace("__", "") + ": " + statement.string, new IdExpr(output.id), statement.reference));
outputs.add(output);
}
// add the assumption history var
varCount++;
outputs.add(new AgreeVar(prefix + assumeSuffix + "__HIST", NamedType.BOOL, null, subAgreeNode.compInst, null));
int j = 0;
for (AgreeStatement statement : subAgreeNode.lemmas) {
varCount++;
AgreeVar output = new AgreeVar(prefix + lemmaSuffix + j++, NamedType.BOOL, statement.reference, subAgreeNode.compInst, null);
outputs.add(output);
}
if (parentNode.timing == TimingModel.ASYNC || parentNode.timing == TimingModel.LATCHED) {
inputs.add(subAgreeNode.clockVar);
varCount++;
}
if (lustreNode.inputs.size() != varCount) {
throw new AgreeException("Something went wrong during node flattening");
}
}
use of com.rockwellcollins.atc.agree.analysis.ast.AgreeVar in project AGREE by loonwerks.
the class LustreAstBuilder method addHistoricalAssumptionConstraint.
private static void addHistoricalAssumptionConstraint(AgreeNode agreeNode, String prefix, Expr clockExpr, List<AgreeStatement> assertions, Node lustreNode) {
Expr assumConj = new BoolExpr(true);
for (VarDecl lustreVar : lustreNode.inputs) {
AgreeVar var = (AgreeVar) lustreVar;
if (var.reference instanceof AssumeStatement || var.reference instanceof LemmaStatement) {
Expr varId = new IdExpr(prefix + var.id);
assumConj = LustreExprFactory.makeANDExpr(varId, assumConj);
}
}
// assumConj = new BinaryExpr(clockExpr, BinaryOp.IMPLIES, assumConj);
Expr histCall = new NodeCallExpr(historyNodeName, assumConj);
Expr assertExpr = new BinaryExpr(new IdExpr(prefix + assumeSuffix + "__HIST"), BinaryOp.EQUAL, histCall);
assertions.add(new AgreeStatement("", assertExpr, null));
}
Aggregations