On Tool Support for Duration Calculus on the Basis of Presburger Arithmetic

2011 ◽  
Author(s):  
Michael R. Hansen ◽  
Aske W. Brekling
Keyword(s):  
Tool Support ◽  
Duration Calculus ◽  
Presburger Arithmetic

scholarly journals Anatomy of Alternating Quantifier Satisfiability (Work in progress)

10.29007/8cf7 ◽  
2018 ◽  
Author(s):  
Anh-Dung Phan ◽  
Nikolaj Bjørner ◽  
David Monniaux
Keyword(s):  
Quantifier Elimination ◽  
Model Checker ◽  
Duration Calculus ◽  
Presburger Arithmetic ◽  
Work In Progress ◽  
Quantifier Alternation

We report on work in progress to generalize an algorithm recently introduced in [10] for checkingsatisfiability of formulas with quantifier alternation. The algorithm uses two auxiliary procedures:a procedure for producing a candidate formula for quantifier elimination and a procedure for eliminatingor partially eliminating quantifiers. We also apply the algorithm for Presburger Arithmeticformulas and evaluate it on formulas from a model checker for Duration Calculus [8]. We report onexperiments on different variants of the auxiliary procedures. So far, there is an edge to applyingSMT-TEST proposed in [10], while we found that a simpler approach which just eliminates quantifiedvariables per round is almost as good. Both approaches offer drastic improvements to applyingdefault quantifier elimination.

scholarly journals Reasoning with the HERMIT: tool support for equational reasoning on GHC core programs

2016 ◽  
Vol 50 (12) ◽  
pp. 23-34 ◽  
Author(s):  
Andrew Farmer ◽  
Neil Sculthorpe ◽  
Andy Gill
Keyword(s):  
Tool Support ◽  
Equational Reasoning

scholarly journals Correct program parallelisations

2021 ◽  
Author(s):  
S. Blom ◽  
S. Darabi ◽  
M. Huisman ◽  
M. Safari
Keyword(s):  
Composition Operators ◽  
Parallel Programs ◽  
Parallel Program ◽  
Tool Support ◽  
Intermediate Representation ◽  
Data Race ◽  
Sequential Program ◽  
Functional Correctness ◽  
Correct Program ◽  
Basic Blocks

AbstractA commonly used approach to develop deterministic parallel programs is to augment a sequential program with compiler directives that indicate which program blocks may potentially be executed in parallel. This paper develops a verification technique to reason about such compiler directives, in particular to show that they do not change the behaviour of the program. Moreover, the verification technique is tool-supported and can be combined with proving functional correctness of the program. To develop our verification technique, we propose a simple intermediate representation (syntax and semantics) that captures the main forms of deterministic parallel programs. This language distinguishes three kinds of basic blocks: parallel, vectorised and sequential blocks, which can be composed using three different composition operators: sequential, parallel and fusion composition. We show how a widely used subset of OpenMP can be encoded into this intermediate representation. Our verification technique builds on the notion of iteration contract to specify the behaviour of basic blocks; we show that if iteration contracts are manually specified for single blocks, then that is sufficient to automatically reason about data race freedom of the composed program. Moreover, we also show that it is sufficient to establish functional correctness on a linearised version of the original program to conclude functional correctness of the parallel program. Finally, we exemplify our approach on an example OpenMP program, and we discuss how tool support is provided.

Tool Support for Confidentiality-by-Construction

2019 ◽  
Vol 38 (2) ◽  
pp. 64-68
Author(s):  
Tobias Runge ◽  
Ina Schaefer ◽  
Alexander Knüppel ◽  
Loek Cleophas ◽  
Derrick Kourie ◽  
...  
Keyword(s):  
Tool Support

scholarly journals Periodic behavior in families of numerical and affine semigroups via parametric Presburger arithmetic

2021 ◽  
Vol 102 (2) ◽  
pp. 340-356
Author(s):  
Tristram Bogart ◽  
John Goodrick ◽  
Kevin Woods
Keyword(s):  
Periodic Behavior ◽  
Presburger Arithmetic ◽  
Affine Semigroups
Sign in / Sign up

Export Citation Format

Share Document