278,120 research outputs found
Properties of Concurrent Programs
A program property is a predicate on programs. In this paper we explore program properties of the form U -> V where U and V are either predicates on states of a program or program properties, and -> satisfies three rules that are also used in reasoning about sequential programs and safety properties of parallel programs. We show how such properties can be used to reason about concurrent programs
CSeq: A Sequentialization Tool for C - (Competition Contribution)
Abstract. Sequentialization translates concurrent programs into equivalent nondeterministic sequential programs so that the different concurrent schedules no longer need to be handled explicitly. It can thus be used as a concurrency preprocessor for many sequential program verification techniques. CSeq implements sequentialization for C and uses ESBMC as sequential verification backend [5].
Reachability and Termination Analysis of Concurrent Quantum Programs
We introduce a Markov chain model of concurrent quantum programs. This model
is a quantum generalization of Hart, Sharir and Pnueli's probabilistic
concurrent programs. Some characterizations of the reachable space, uniformly
repeatedly reachable space and termination of a concurrent quantum program are
derived by the analysis of their mathematical structures. Based on these
characterizations, algorithms for computing the reachable space and uniformly
repeatedly reachable space and for deciding the termination are given.Comment: Accepted by Concur'12. Comments are welcom
Abstract Diagnosis for Timed Concurrent Constraint programs
The Timed Concurrent Constraint Language (tccp in short) is a concurrent
logic language based on the simple but powerful concurrent constraint paradigm
of Saraswat. In this paradigm, the notion of store-as-value is replaced by the
notion of store-as-constraint, which introduces some differences w.r.t. other
approaches to concurrency. In this paper, we provide a general framework for
the debugging of tccp programs. To this end, we first present a new compact,
bottom-up semantics for the language that is well suited for debugging and
verification purposes in the context of reactive systems. We also provide an
abstract semantics that allows us to effectively implement debugging algorithms
based on abstract interpretation. Given a tccp program and a behavior
specification, our debugging approach automatically detects whether the program
satisfies the specification. This differs from other semiautomatic approaches
to debugging and avoids the need to provide symptoms in advance. We show the
efficacy of our approach by introducing two illustrative examples. We choose a
specific abstract domain and show how we can detect that a program is
erroneous.Comment: 16 page
- …