International audienceKong, the Koncurrent places Grinder, is a tool designed to compute the concurrency relation of a Petri net by taking advantage of structural reductions. The specificity of Kong is to rely on a state space abstraction, called polyhedral abstraction in previous works, that involves a combination of structural reductions and linear arithmetic constraints between the marking of places
High-level loop transformations change the order in which basic computations in a program are execut...
In computer science, concurrency is a property of systems in which several computations are executin...
The Workshop on Petri Nets and Graph Transformations, which is currently at its second edition, is f...
International audienceKong, the Koncurrent places Grinder, is a tool designed to compute the concurr...
International audienceWe propose a new method for accelerating the computation of a concurrency rela...
Despite decades of work in this area, the construction of effective loop nest optimizers and paralle...
Petri nets and statecharts can model concurrent systems in a succinct way. While translations from s...
International audienceWe introduce a multi-token machine for Idealized Parallel Algol (IPA), a highe...
Loop-nests in most scientific applications perform repetitive operations on array(s) and account for...
International audienceWe propose a new programming control structure called ''multifor'', allowing t...
Semantics of programming languages and interactive environments for the development of proofs and pr...
AbstractPetri nets are widely used to model concurrent systems. However, their composition and abstr...
Despite recent advances in reasoning about concurrent data structure libraries, the largest implemen...
International audienceIn order to gain a better understanding of the state space of programs, with t...
CHARM (for concurrency and hiding in an abstract rewriting machine) is an abstract machine which all...
High-level loop transformations change the order in which basic computations in a program are execut...
In computer science, concurrency is a property of systems in which several computations are executin...
The Workshop on Petri Nets and Graph Transformations, which is currently at its second edition, is f...
International audienceKong, the Koncurrent places Grinder, is a tool designed to compute the concurr...
International audienceWe propose a new method for accelerating the computation of a concurrency rela...
Despite decades of work in this area, the construction of effective loop nest optimizers and paralle...
Petri nets and statecharts can model concurrent systems in a succinct way. While translations from s...
International audienceWe introduce a multi-token machine for Idealized Parallel Algol (IPA), a highe...
Loop-nests in most scientific applications perform repetitive operations on array(s) and account for...
International audienceWe propose a new programming control structure called ''multifor'', allowing t...
Semantics of programming languages and interactive environments for the development of proofs and pr...
AbstractPetri nets are widely used to model concurrent systems. However, their composition and abstr...
Despite recent advances in reasoning about concurrent data structure libraries, the largest implemen...
International audienceIn order to gain a better understanding of the state space of programs, with t...
CHARM (for concurrency and hiding in an abstract rewriting machine) is an abstract machine which all...
High-level loop transformations change the order in which basic computations in a program are execut...
In computer science, concurrency is a property of systems in which several computations are executin...
The Workshop on Petri Nets and Graph Transformations, which is currently at its second edition, is f...
DOI
Add to ORKG