Computer Science – Programming Languages
Scientific paper
2011-09-09
Computer Science
Programming Languages
Scientific paper
We wish to abstract nodes in a reactive programming language, such as Lustre, into nodes with a simpler control structure, with a bound on the number of control states. In order to do so, we compute disjunctive invariants in predicate abstraction, with a bounded number of disjuncts, then we abstract the node, each disjunct representing an abstract state. The computation of the disjunctive invariant is performed by a form of quantifier elimination expressed using SMT-solving. The same method can also be used to obtain disjunctive loop invariants.
Bodin Martin
Monniaux David
No associations
LandOfFree
Modular Abstractions of Reactive Nodes using Disjunctive Invariants does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Modular Abstractions of Reactive Nodes using Disjunctive Invariants, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modular Abstractions of Reactive Nodes using Disjunctive Invariants will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-413058