Implementing a static analyzer of concurrent programs: Problems and perspectives

Cridlig, Régis

doi:10.1007/3-540-62503-8_11

Cited by 11 publications

(7 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Cridlig & Goubault [36] provide a semantics of Linda in terms of higher dimensional automata. Applications of higher dimensional automata to scheduling problems and wait-free protocols for distributed systems are studied by Goubault [48,49,51], and model checking applications by Cridlig [34,35]. Algorithms for deadlock detection in terms of higher dimensional automata appear in Fajstrup et al [38,37].…”

Section: Higher Dimensional Automatamentioning

confidence: 99%

On the Expressiveness of Higher Dimensional Automata

Glabbeek

2005

Electronic Notes in Theoretical Computer Science

125

View full text Add to dashboard Cite

In this paper I compare the expressive power of several models of concurrency based on their ability to represent causal dependence. To this end, I translate these models, in behaviour preserving ways, into the model of higher dimensional automata, which is the most expressive model under investigation. In particular, I propose four different translations of Petri nets, corresponding to the four different computational interpretations of nets found in the literature. I also extend various equivalence relations for concurrent systems to higher dimensional automata. These include the history preserving bisimulation, which is the coarsest equivalence that fully respects branching time, causality and their interplay, as well as the ST-bisimulation, a branching time respecting equivalence that takes causality into account to the extent that it is expressible by actions overlapping in time. Through their embeddings in higher dimensional automata, it is now well-defined whether members of different models of concurrency are equivalent.

show abstract

Section: Higher Dimensional Automatamentioning

confidence: 99%

On the Expressiveness of Higher Dimensional Automata

Glabbeek

2005

Electronic Notes in Theoretical Computer Science

125

View full text Add to dashboard Cite

show abstract

“…The prefix "pre" means that there are no degeneracy maps at all in the data. R. Cridlig presents in [7] an implementation with CaML of the semantics of a real concurrent language in terms of precubical sets, demonstrating the relevance of this approach. Since this category is sufficient to model HDA, why not deal directly with precubical sets ?…”

mentioning

confidence: 97%

A model category for the homotopy theory of concurrency

Gaucher

2003

Homology, Homotopy and Applications

135

View full text Add to dashboard Cite

We construct a cofibrantly generated model structure on the category of flows such that any flow is fibrant and such that two cofibrant flows are homotopy equivalent for this model structure if and only if they are S-homotopy equivalent. This result provides an interpretation of the notion of S-homotopy equivalence in the framework of model categories.1991 Mathematics Subject Classification. 55P99, 68Q85.

show abstract

“…It is not hard to see that the same would have been possible with any reasonable sequential language (e.g. Parallel Pascal in Cridlig (1995Cridlig ( , 1997). The PV language allows parallel composition to occur anywhere in a program so they can be nested.…”

Section: Introductionmentioning

confidence: 94%

The geometry of conservative programs

Haucourt

2017

Math. Struct. Comp. Sci.

View full text Add to dashboard Cite

The programs, we consider are written in a restricted form of the language introduced by Dijkstra (1968). A program is said to beconservativewhen each of its loops restores all the resources it consumes. We define the geometric model of such a program and prove that the collection of directed paths on it is a reasonable over-approximation of its set of execution traces. In particular, two directed paths that are close enough with respect to theuniform distanceresult in the same action on the memory states of the system. The same holds forweakly dihomotopicdirected paths. As a by-product, we obtain a notion of independence, which is favourably compared to more common ones. The geometric models actually belong to a handy class oflocal pospaceswhose elements are calledisothetic regions. The local pospaces we use differ from the original ones, we carefully explain why the alternative notion should be preferred. The title intentionally echoes the article by Carson and Reynolds (1987).

show abstract

Implementing a static analyzer of concurrent programs: Problems and perspectives

Cited by 11 publications

References 8 publications

On the Expressiveness of Higher Dimensional Automata

On the Expressiveness of Higher Dimensional Automata

A model category for the homotopy theory of concurrency

The geometry of conservative programs

Contact Info

Product

Resources

About