First unified benchmark finds GLR family has only 3x median slowdown over LR(1) on deterministic grammars and is the fastest among generalized parsers.
Sound and complete timed CTL model checking of timed Kripke structures and real-time rewrite theories
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
A Maude-with-SMT framework for sound and complete formal analysis and parameter synthesis of parametric time Petri nets, including a folding approach that terminates on finite parametric state-class graphs and support for LTL model checking.
Advocates logical pluralism at the object level inside a unifying HOL meta-framework to enable interdisciplinary reuse and warns against single-logic imperialism.
citing papers explorer
-
An Empirical Comparison of General Context-Free Parsers
First unified benchmark finds GLR family has only 3x median slowdown over LR(1) on deterministic grammars and is the fastest among generalized parsers.
-
A rewriting-logic-with-SMT-based formal analysis and parameter synthesis framework for parametric time Petri nets
A Maude-with-SMT framework for sound and complete formal analysis and parameter synthesis of parametric time Petri nets, including a folding approach that terminates on finite parametric state-class graphs and support for LTL model checking.
-
Many Logics, One Methodology: A Plea for Logical Pluralism in Formalised Reasoning (preprint)
Advocates logical pluralism at the object level inside a unifying HOL meta-framework to enable interdisciplinary reuse and warns against single-logic imperialism.