Results 1  10
of
73
Modeling Component Connectors in Reo by Constraint Automata (Extended Abstract)
, 2004
"... Reo is an exogenous coordination language for compositional construction of component connectors based on a calculus of channels. Building automated tools to address such concerns as equivalence or containment of the behavior of two given connectors, verification of the behavior of a connector, etc. ..."
Abstract

Cited by 58 (26 self)
 Add to MetaCart
Reo is an exogenous coordination language for compositional construction of component connectors based on a calculus of channels. Building automated tools to address such concerns as equivalence or containment of the behavior of two given connectors, verification of the behavior of a connector, etc. requires an operational semantic model suitable for model checking. In this paper we introduce constraint automata and propose them as a semantic model for Reo.
Finite equational bases in process algebra: Results and open questions
 Processes, Terms and Cycles: Steps on the Road to Infinity, LNCS 3838
, 2005
"... Abstract. Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equivalences for finitely branching, concrete, sequential processes. He studied these semantics in the setting of the basic process algebra BCCSP, and tried to give finite complete axiomatizations for them. ..."
Abstract

Cited by 29 (19 self)
 Add to MetaCart
Abstract. Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equivalences for finitely branching, concrete, sequential processes. He studied these semantics in the setting of the basic process algebra BCCSP, and tried to give finite complete axiomatizations for them. Obtaining such axiomatizations in concurrency theory often turns out to be difficult, even in the setting of simple languages like BCCSP. This has raised a host of open questions that have been the subject of intensive research in recent years. Most of these questions have been settled over BCCSP, either positively by giving a finite complete axiomatization, or negatively by proving that such an axiomatization does not exist. Still some open questions remain. This paper reports on these results, and on the stateoftheart in axiomatizations for richer process algebras with constructs like sequential and parallel composition. 1
Axiomatizing GSOS with Termination
 THE JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING
, 2004
"... ..."
Equational axioms for probabilistic bisimilarity
 IN PROCEEDINGS OF 9TH AMAST, LECTURE NOTES IN COMPUTER SCIENCE
, 2002
"... This paper gives an equational axiomatization of probabilistic bisimulation equivalence for a class of finitestate agents previously studied by Stark and Smolka ((2000) Proof, Language, and Interaction: Essays in Honour of Robin Milner, pp. 571595). The axiomatization is obtained by extending ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
This paper gives an equational axiomatization of probabilistic bisimulation equivalence for a class of finitestate agents previously studied by Stark and Smolka ((2000) Proof, Language, and Interaction: Essays in Honour of Robin Milner, pp. 571595). The axiomatization is obtained by extending the general axioms of iteration theories (or iteration algebras), which characterize the equational properties of the fixed point operator on (#)continuous or monotonic functions, with three axiom schemas that express laws that are specific to probabilistic bisimilarity.
Analysis of a distributed system for lifting trucks
 THE JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING
, 2003
"... ..."
Computer Assisted Manipulation of Algebraic Process Specifications
, 2001
"... Specifications of system behaviour tend to become large. Analysis of such specifications requires automated tools. Most attention hitherto has been invested in fully automatic tools. We however believe that in many cases human intervention is required and we therefore propose a number of computer to ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
Specifications of system behaviour tend to become large. Analysis of such specifications requires automated tools. Most attention hitherto has been invested in fully automatic tools. We however believe that in many cases human intervention is required and we therefore propose a number of computer tools to transform process specifications. The concrete manipulation tools that we describe can eliminate constants, redundant sum variables and parameters, and allow to split variables ranging over complex datatypes. These tools can transform specifications with large finite state spaces to variants with state spaces being a fraction of their original size, and transform specifications with infinite state spaces to those with finite state spaces. 2000 Mathematics Subject Classification: 68M14, 68Q60, 68Q85 Keywords and Phrases: Automated Reasoning, Distributed systems, Linear Process Equations, Model Checking, Verification Note: Research carried out in SEN2, with financial support of the "Systems Validation Center". 1.
Generalised Coinduction
, 2001
"... We introduce the lambdacoiteration schema for a distributive law lambda of a functor T over a functor F. Under certain conditions it can be shown to uniquely characterise functions into the carrier of a final Fcoalgebra, generalising the basic coiteration schema as given by finality. The duals of ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
We introduce the lambdacoiteration schema for a distributive law lambda of a functor T over a functor F. Under certain conditions it can be shown to uniquely characterise functions into the carrier of a final Fcoalgebra, generalising the basic coiteration schema as given by finality. The duals of primitive recursion and courseofvalue iteration, which are known extensions of coiteration, arise as instances of our framework. One can furthermore obtain schemata justifying recursive specifications that involve operators such as addition of power series, regular operators on languages, or parallel and sequential composition of processes. Next...
Development of a verified Erlang program for resource locking
 Formal Methods in Industrial Critical Systems
, 2001
"... We have designed a tool to simplify model checking of Erlang programs by translating Erlang into a process algebra with data, called µCRL. As a casestudy for this tool we focused on a simplied locker implementation after the locker that is present in the control software of the AXD 301 switch. The ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
We have designed a tool to simplify model checking of Erlang programs by translating Erlang into a process algebra with data, called µCRL. As a casestudy for this tool we focused on a simplied locker implementation after the locker that is present in the control software of the AXD 301 switch. The translation algorithm has been developed to handle this productionlike code. We use the tools accompanying CRL to generate the transition systems from the specification generated by our tool. With the Caesar/Aldebaran tool set, we verified properties for our casestudy.
Instruction sequences with indirect jumps
, 2007
"... Abstract. We study sequential programs that are instruction sequences with direct and indirect jump instructions. The intuition is that indirect jump instructions are jump instructions where the position of the instruction to jump to is the content of some memory cell. We consider several kinds of i ..."
Abstract

Cited by 10 (10 self)
 Add to MetaCart
Abstract. We study sequential programs that are instruction sequences with direct and indirect jump instructions. The intuition is that indirect jump instructions are jump instructions where the position of the instruction to jump to is the content of some memory cell. We consider several kinds of indirect jump instructions. For each kind, we define the meaning of programs with indirect jump instructions of that kind by means of a translation into programs without indirect jump instructions. For each kind, the intended behaviour of a program with indirect jump instructions of that kind under execution is the behaviour of the translated program under execution on interaction with some memory device.
Capabilities as alias control: Secure cooperation in dynamically extensible systems
 DEPARTMENT OF COMPUTER SCIENCE, UNIVERSITY OF REGINA
, 2004
"... Secure cooperation is the problem of protecting mutually suspicious code units within the same execution environment from their potentially malicious peers. A statically enforceable capability type system is proposed for the JVM bytecode language to provide finegrained access control of shared reso ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
Secure cooperation is the problem of protecting mutually suspicious code units within the same execution environment from their potentially malicious peers. A statically enforceable capability type system is proposed for the JVM bytecode language to provide finegrained access control of shared resources among peer code units. The design of the type system is inspired by recent advances in alias control type systems for objectoriented programming languages. The exercise of access rights and the propagation of capabilities are given a uniform interpretation as alias creation events. Each capability type assigns to a reference a dataflow trajectory, prescribing the set of aliases that is allowed to be created from the reference. An orthogonal and complementary type system for controlling object creation and downcasting is also designed to avoid a class of capability spoofing attacks. The combined type system successfully addresses a number of classical protection problems recast in a programming language context. This work therefore demonstrates the need and the feasibility of a languagebased approach to enforce applicationlevel security among peer code units.