This paper presents a decomposition technique for Hennessy-Milner logic with past and its extension with recursively defined formulae. In order to highlight the main ideas and technical tools, processes are described using a subset of CCS with parallel composition, nondeterministic choice, action prefixing and the inaction constant. The study focuses on developing decompositional reasoning techniques for parallel contexts in that language
AbstractWhen reasoning about parallel programs we would like to combine fixed-point laws for unrolli...
Abstract. The increasingly widespread availability of multicore and manycore computers demands new p...
A framework allowing a unified and rigorous definition of the semantics of concurrency is proposed. ...
This paper presents a decomposition technique for Hennessy-Milner logic with past and its extension ...
Abstract. This paper presents a decomposition technique for Hennessy-Milner logic with past and its ...
This paper presents a method for the decomposition of HML formulas. It can be used to decide whether...
This paper presents a method for the decomposition of HML formulae. It can be used to decide whethe...
This paper proposes a parallel programming notation and a method of reasoning about programs with th...
This chapter surveys the research in parallel or distributed strategies for mechanical theorem provi...
Current techniques for interpretation of logic programs involve a sequential search of a global tree...
In standard process algebra, parallel components do not share a common state and communicate through...
AbstractThis paper investigates some semantic properties of concurrent logic languages. Concurrent l...
In this paper we present a general analysis of the parallelization of deduction strategies. We clas...
AbstractWe present a framework for reasoning about processes (complex actions) that are constituted ...
We study an extension of Hennessy-Milner logic for the pi-calculus which gives a sound and complete ...
AbstractWhen reasoning about parallel programs we would like to combine fixed-point laws for unrolli...
Abstract. The increasingly widespread availability of multicore and manycore computers demands new p...
A framework allowing a unified and rigorous definition of the semantics of concurrency is proposed. ...
This paper presents a decomposition technique for Hennessy-Milner logic with past and its extension ...
Abstract. This paper presents a decomposition technique for Hennessy-Milner logic with past and its ...
This paper presents a method for the decomposition of HML formulas. It can be used to decide whether...
This paper presents a method for the decomposition of HML formulae. It can be used to decide whethe...
This paper proposes a parallel programming notation and a method of reasoning about programs with th...
This chapter surveys the research in parallel or distributed strategies for mechanical theorem provi...
Current techniques for interpretation of logic programs involve a sequential search of a global tree...
In standard process algebra, parallel components do not share a common state and communicate through...
AbstractThis paper investigates some semantic properties of concurrent logic languages. Concurrent l...
In this paper we present a general analysis of the parallelization of deduction strategies. We clas...
AbstractWe present a framework for reasoning about processes (complex actions) that are constituted ...
We study an extension of Hennessy-Milner logic for the pi-calculus which gives a sound and complete ...
AbstractWhen reasoning about parallel programs we would like to combine fixed-point laws for unrolli...
Abstract. The increasingly widespread availability of multicore and manycore computers demands new p...
A framework allowing a unified and rigorous definition of the semantics of concurrency is proposed. ...