Correct performance of transaction capabilities

Arts, Thomas; Langevelde, Izak van

doi:10.1109/csd.2001.981762

Cited by 7 publications

(4 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Their requirements are that (1) there is no infinite sequence of progressing τ -actions, (2) non-progressing τ -actions are only executed at a focus point, and (3) a focus point cannot perform progressing τ -actions. A pre-abstraction function divides occurrences of τ -actions in the implementation into progressing and non-progressing ones, and only progressing τ 's are abstracted away; in many cases it is far from trivial to define the proper pre-abstraction.…”

Section: External Actionsmentioning

confidence: 99%

“…The µCRL toolset [7] supports the generation of labeled transition systems of µCRL specifications, together with reduction modulo branching bisimulation equivalence and model checking of temporal logic formulas. This approach has been used to analyze a wide range of protocols and distributed systems (e.g., [1,18,31,33]). …”

Section: Definition 1 (Labeled Transition System) a Labeled Transitimentioning

confidence: 99%

See 1 more Smart Citation

Cones and Foci for Protocol Verification Revisited

Fokkink

Pang

2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We define a cones and foci proof method, which rephrases the question whether two system specifications are branching bisimilar in terms of proof obligations on relations between data objects. Compared to the original cones and foci method from Groote and Springintveld [22], our method is more generally applicable, and does not require a preprocessing step to eliminate τ -loops. We prove soundness of our approach and give an application.

show abstract

Section: External Actionsmentioning

confidence: 99%

Section: Definition 1 (Labeled Transition System) a Labeled Transitimentioning

confidence: 99%

Cones and Foci for Protocol Verification Revisited

Fokkink

Pang

2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…In order to use the state space generation tool for µCRL, a 'compiler' had been developed in an earlier project [2]. At the time this compiler was developed, we chose for µCRL over LOTOS, because we had more experience with it [3] and we were impressed by the little redundance it produced in the generation of the state space. The language µCRL and LOTOS are very similar though.…”

Section: Erlang To µCrlmentioning

confidence: 99%

Global scheduler properties derived from local restrictions

Arts¹,

Penas

2002

Proceedings of the 2002 ACM SIGPLAN Workshop on Erlang

View full text Add to dashboard Cite

The VoDka server is a video-on-demand system for a Spanish cable company. We look at the distributed scheduler of this system. This scheduler enables that whenever a user agent is asking for a certain movie, this request is transferred through the system and a set of possible play-back qualities is returned to the agent. In case of a non-empty set, the agent selects one and the movie is streamed to the user.The storage subsystem of the server is composed by a hierarchy of different storage systems, i.e. disks, CD players or tapes. These devices all have restrictions of which the process controlling the device is aware of. A second layer of processes controls a set of devices in one machine and has restrictions, for example, the bandwidth of its connection. A third layer may be further out in the network and serve as a cache to store more popular movies.Every process in the scheduler of the system has a function determining local restrictions, given the configuration and present state of the system. We have built a tool to construct complete models of several configurations. With techniques from the area of formal methods (in particular model checking) these models are used to determine global properties of the system, such as the maximum number of a certain class of movies that can be served in parallel.

show abstract

“…µCRL and its toolset have been successfully used to analyze a wide range of protocols and distributed systems (e.g., [1,7,10,13,19]). …”

Section: µCrlmentioning

confidence: 99%

Model checking a cache coherence protocol for a Java DSM implementation

Pang

Fokkink

Hofman³

et al.

Proceedings International Parallel and Distributed Processing Symposium

View full text Add to dashboard Cite

Jackal is a fine-grained distributed shared memory implementation of the Java programming language. It aims to implement Java's memory model and allows multithreaded Java programs to run unmodified on a distributed memory system. It employs a multiple-writer cache coherence protocol. In this paper, we report on our analysis of this protocol. We present its formal specification in µCRL, and discuss the abstractions that were made to avoid state explosion. Requirements were formulated and model checked with respect to several configurations. Our analysis revealed two errors in the implementation. * This research is partly supported by the Dutch Technology Foundation STW under the project CES5008: Improving the quality of embedded systems using formal design and systematic testing.

show abstract

Correct performance of transaction capabilities

Cited by 7 publications

References 7 publications

Cones and Foci for Protocol Verification Revisited

Cones and Foci for Protocol Verification Revisited

Global scheduler properties derived from local restrictions

Model checking a cache coherence protocol for a Java DSM implementation

Contact Info

Product

Resources

About