140 citations · 224 across the 13 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2018★ 2 cited
The language preservation problem is undecidable for parametric event-recording automata
Étienne André, Shang-Wei Lin
Parametric timed automata (PTA) extend timed automata with unknown constants ("parameters"), at the price of undecidability of most interesting problems. The (untimed) language pre…
cs.FL2016
Compositional Reasoning for Shared-variable Concurrent Programs
Fuyuan Zhang, Yongwang Zhao, David Sanan +4
Scalable and automatic formal verification for concurrent systems is always demanding. In this paper, we propose a verification framework to support automated compositional reasoni…