This paper introduces a temporal logic based on precedence constraints among events which captures net semantics, i.e. a particular net can be mapped into a semantic-equivalent formula in the logic. Tempo, a declarative concurrent programming language, is based on such logic and has a procedural interpretation which allows specifications to be executed as concurrent programs. Thus, the execution of a net may be simulated by executing a semantic-equivalent formula as a Tempo program. Tempo++, an object-oriented extension of Tempo is presented. In this framework, concurrency issues are declaratively abstracted by temporal constraints among events. The concurrent behaviour (safety properties) of programs is explicitly specified which provides ...
AbstractIn this methodology, programming problems which can be specified by an input/output assertio...
This is an attempt to combine the two research areas of programming methodology and automated theore...
A logic for reasoning about timing properties of concurrent programs is presented. The logic is ba...
AbstractConcurrentMetateMis a programming language based on the notion of concurrent, communicating ...
. In this paper, we describe an approach to the representation, specification and implementation of ...
AbstractThe formalism of Temporal Logic is suggested as an appropriate tool for formalizing the sema...
We propose a high-level language based on first order logic for expressing synchronization in concur...
Concurrency is ubiquitous in modern software. The computing base of systems software, including oper...
Abstract. In this paper we put forward a concurrent object-oriented programming language in which co...
Rapport interne.In the paper we consider a proof-theoretical approach to Linear Logic in order to de...
This paper has the purpose of reviewing some of the established relationships between logic and conc...
In this paper, we introduce object{oriented programs as sets of communicat-ing objects. We investiga...
. This document aims to provide a formal semantics for an object-oriented language with constructs f...
A brief overview is made of the use of temporal logic formalisms for specifying and verifying concur...
A distributed computer system consists of different processes or agents that function largely autono...
AbstractIn this methodology, programming problems which can be specified by an input/output assertio...
This is an attempt to combine the two research areas of programming methodology and automated theore...
A logic for reasoning about timing properties of concurrent programs is presented. The logic is ba...
AbstractConcurrentMetateMis a programming language based on the notion of concurrent, communicating ...
. In this paper, we describe an approach to the representation, specification and implementation of ...
AbstractThe formalism of Temporal Logic is suggested as an appropriate tool for formalizing the sema...
We propose a high-level language based on first order logic for expressing synchronization in concur...
Concurrency is ubiquitous in modern software. The computing base of systems software, including oper...
Abstract. In this paper we put forward a concurrent object-oriented programming language in which co...
Rapport interne.In the paper we consider a proof-theoretical approach to Linear Logic in order to de...
This paper has the purpose of reviewing some of the established relationships between logic and conc...
In this paper, we introduce object{oriented programs as sets of communicat-ing objects. We investiga...
. This document aims to provide a formal semantics for an object-oriented language with constructs f...
A brief overview is made of the use of temporal logic formalisms for specifying and verifying concur...
A distributed computer system consists of different processes or agents that function largely autono...
AbstractIn this methodology, programming problems which can be specified by an input/output assertio...
This is an attempt to combine the two research areas of programming methodology and automated theore...
A logic for reasoning about timing properties of concurrent programs is presented. The logic is ba...