7 citations · 12 across the 7 of their papers we have counts for
8 papers
GenAI for Systems: Recurring Challenges and Design Principles from Software to Silicon
Arya Tschand, Chenyu Wang, Zishen Wan +21
Generative AI is reshaping how computing systems are designed, optimized, and built, yet research remains fragmented across software, architecture, and chip design communities. Thi…
Structural Equivalences for Reversible Calculi of Communicating Systems (Oral communication)
Clément Aubert, Ioana Cristescu
The formalization of process algebras usually starts with a minimal core of operators and rules for its transition system, and then relax the system to improve its usability and ea…
How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation
Clément Aubert, Ioana Cristescu
Reversible computation opens up the possibility of overcoming some of the hardware's current physical limitations. It also offers theoretical insights, as it enriches multiple para…
Interactions between Causal Structures in Graph Rewriting Systems
Ioana Cristescu, Walter Fontana, Jean Krivine
Graph rewrite formalisms are a powerful approach to modeling complex molecular systems. They capture the intrinsic concurrency of molecular interactions, thereby enabling a formal…
History-Preserving Bisimulations on Reversible Calculus of Communicating Systems
Clément Aubert, Ioana Cristescu
History-and hereditary history-preserving bisimulation (HPB and HHPB) are equivalences relations for denotational models of concurrency. Finding their counterpart in process algebr…
When rule-based models need to count
Pierre Boutillier, Ioana Cristescu
Rule-based modelers dislike direct enumeration of cases when more efficient means of enumeration are available. We present an extension of the Kappa language which attaches to agen…
Contextual equivalences in configuration structures and reversibility
Clément Aubert, Ioana Cristescu
Contextual equivalence equate terms that have the same observable behaviour in any context. A standard contextual equivalence for CCS is the strong barbed congruence. Configuration…
Reversible Barbed Congruence on Configuration Structures
Clément Aubert, Ioana Cristescu
A standard contextual equivalence for process algebras is strong barbed congruence. Configuration structures are a denotational semantics for processes in which one can define equi…