Abstract. We present a formal model for concurrent systems. The model represents synchronous and asyn-chronous components in a uniform framework that supports compositional (assume-guarantee) and hierarchical (stepwise-refinement) design and verification. While synchronous models are based on a notion of atomic compu-tation step, and asynchronous models remove that notion by introducing stuttering, our model is based on a flexible notion of what constitutes a computation step: by applying an abstraction operator to a system, arbitrarily many consecutive steps can be collapsed into a single step. The abstraction operator, which may turn an asynchronous system into a synchronous one, allows us to describe systems at various levels of temporal...
AbstractA simple and elegant formulation of compositional proof systems for concurrent programs resu...
AbstractIn this paper, we describe a true-concurrent hierarchical logic interpreted over concurrent ...
Synchronous languages are well suited to implementation and verification of reactive systems. Large ...
This thesis is about mathematical structures and techniques related to formal specification and veri...
Formal methods to specify and verify concurrent programs with synchronous message passing are discus...
In this document we present intermediate results of our ongoing work in the field of the formal spec...
We develop a general framework for a variety of concurrent languages all b sed on a yn-chronous comm...
A technique for specifying concurrent systems is shown, that uses the algebraic specification langua...
Synchronization is the coordination of concurrent processes that occurs in most complex software sys...
AbstractIn this paper, systems which interact permanently with their environments are considered. Su...
Concurrency is ubiquitous in modern software. The computing base of systems software, including oper...
Synchronous programs are easy to specify because the side effects of an operation are finished by th...
Synchronous programs are easy to specify because the side effects of an operation are finished by th...
International audienceIn this paper, systems which interact permanently with their environments are ...
AbstractConcurrentMetateMis a programming language based on the notion of concurrent, communicating ...
AbstractA simple and elegant formulation of compositional proof systems for concurrent programs resu...
AbstractIn this paper, we describe a true-concurrent hierarchical logic interpreted over concurrent ...
Synchronous languages are well suited to implementation and verification of reactive systems. Large ...
This thesis is about mathematical structures and techniques related to formal specification and veri...
Formal methods to specify and verify concurrent programs with synchronous message passing are discus...
In this document we present intermediate results of our ongoing work in the field of the formal spec...
We develop a general framework for a variety of concurrent languages all b sed on a yn-chronous comm...
A technique for specifying concurrent systems is shown, that uses the algebraic specification langua...
Synchronization is the coordination of concurrent processes that occurs in most complex software sys...
AbstractIn this paper, systems which interact permanently with their environments are considered. Su...
Concurrency is ubiquitous in modern software. The computing base of systems software, including oper...
Synchronous programs are easy to specify because the side effects of an operation are finished by th...
Synchronous programs are easy to specify because the side effects of an operation are finished by th...
International audienceIn this paper, systems which interact permanently with their environments are ...
AbstractConcurrentMetateMis a programming language based on the notion of concurrent, communicating ...
AbstractA simple and elegant formulation of compositional proof systems for concurrent programs resu...
AbstractIn this paper, we describe a true-concurrent hierarchical logic interpreted over concurrent ...
Synchronous languages are well suited to implementation and verification of reactive systems. Large ...