Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Bollig, Benedikt
Cyriac, Aiswarya
Gastin, Paul
and
Zeitoun, Marc
2011.
Mathematical Foundations of Computer Science 2011.
Vol. 6907,
Issue. ,
p.
132.
Fletcher, George H. L.
Gyssens, Marc
Leinders, Dirk
Van den Bussche, Jan
Van Gucht, Dirk
Vansummeren, Stijn
and
Wu, Yuqing
2011.
Relative expressive power of navigational querying on graphs.
p.
197.
Goldblatt, Robert
and
Jackson, Marcel
2012.
Well-structured program equivalence is highly undecidable.
ACM Transactions on Computational Logic,
Vol. 13,
Issue. 3,
p.
1.
Boral, Anudhyan
and
Schmitz, Sylvain
2013.
Model-Checking Parse Trees.
p.
153.
Aiswarya, C.
Gastin, Paul
and
Narayan Kumar, K.
2014.
Automated Technology for Verification and Analysis.
Vol. 8837,
Issue. ,
p.
1.
Bollig, Benedikt
Cyriac, Aiswarya
Gastin, Paul
and
Zeitoun, Marc
2014.
Temporal logics for concurrent recursive programs: Satisfiability and model checking.
Journal of Applied Logic,
Vol. 12,
Issue. 4,
p.
395.
Fletcher, George H.L.
Gyssens, Marc
Leinders, Dirk
Surinx, Dimitri
Van den Bussche, Jan
Van Gucht, Dirk
Vansummeren, Stijn
and
Wu, Yuqing
2015.
Relative expressive power of navigational querying on graphs.
Information Sciences,
Vol. 298,
Issue. ,
p.
390.
Chekol, Melisachew Wudage
and
Pirrò, Giuseppe
2016.
The Semantic Web – ISWC 2016.
Vol. 9981,
Issue. ,
p.
86.
Nakamura, Yoshiki
2017.
Partial derivatives on graphs for Kleene allegories.
p.
1.
Aiswarya, C.
Bollig, Benedikt
and
Gastin, Paul
2018.
An automata-theoretic approach to the verification of distributed algorithms.
Information and Computation,
Vol. 259,
Issue. ,
p.
305.
Balbiani, Philippe
and
Boudou, Joseph
2018.
Iteration-free PDL with storing, recovering and parallel composition: a complete axiomatization.
Journal of Logic and Computation,
Vol. 28,
Issue. 4,
p.
705.
Akshay, S.
Gastin, Paul
Juge, Vincent
and
Krishna, Shankara Narayanan
2019.
Timed Systems through the Lens of Logic.
p.
1.
Bollig, Benedikt
Fortin, Marie
and
Gastin, Paul
2021.
Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic.
Journal of Computer and System Sciences,
Vol. 115,
Issue. ,
p.
22.
Aiswarya, C
2022.
How treewidth helps in verification.
ACM SIGLOG News,
Vol. 9,
Issue. 1,
p.
6.
Nakamura, Yoshiki
2023.
Existential Calculi of Relations with Transitive Closure: Complexity and Edge Saturations.
p.
1.
Figueira, Diego
Figueira, Santiago
and
Pin, Edwin
2023.
PDL on Steroids: on Expressive Extensions of PDL with Intersection and Converse.
p.
1.