17 papers:
LATA-2015-BabariD #automaton #logic #theorem- A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic (PB, MD), pp. 703–715.
CSL-2015-Kaiser0LL #approach #bound- A Unified Approach to Boundedness Properties in MSO (LK, ML, SL, CL), pp. 441–456.
LICS-2015-DasR #axiom #infinity- A Complete Axiomatization of MSO on Infinite Trees (AD, CR), pp. 390–401.
ICALP-v2-2014-Bojanczyk14a #infinity #quantifier- Weak MSO+U with Path Quantifiers over Infinite Trees (MB), pp. 38–49.
- ICALP-v2-2014-BojanczykGMS #decidability #infinity #on the
- On the Decidability of MSO+U on Infinite Trees (MB, TG, HM, MS), pp. 50–61.
- LICS-CSL-2014-CarreiroFVZ #automaton #similarity
- Weak MSO: automata and expressiveness modulo bisimilarity (FC, AF, YV, FZ), p. 27.
- LICS-CSL-2014-LosemannM #query
- MSO queries on trees: enumerating answers under updates (KL, WM), p. 10.
ICFP-2013-TraytelN #regular expression #word- Verified decision procedures for MSO on words based on derivatives of regular expressions (DT, TN), pp. 3–12.
- LICS-2013-Riba #infinity #word
- Forcing MSO on Infinite Words in Weak MSO (CR), pp. 448–457.
GT-VMT-2012-Heussner #communication #graph #graph grammar #model checking #process- Model Checking Communicating Processes: Run Graphs, Graph Grammars, and MSO (AH).
FoSSaCS-2009-AntonopoulosD #graph #logic- Separating Graph Logic from MSO (TA, AD), pp. 63–77.
DLT-2009-Quaas #logic- Weighted Timed MSO Logics (KQ), pp. 419–430.
- DLT-2008-Morin #ambiguity #logic
- MSO Logic for Unambiguous Shared-Memory Systems (RM), pp. 516–528.
- CSL-2007-CarayolL #infinity #order
- MSO on the Infinite Binary Tree: Choice and Order (AC, CL), pp. 161–176.
- LICS-2007-MontanariP
- A Contraction Method to Decide MSO Theories of Deterministic Trees (AM, GP), pp. 141–150.
- CSL-2006-Bagan #linear #query
- MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay (GB), pp. 167–181.
CAV-2004-AbdullaJNdS #ltl #model checking- Regular Model Checking for LTL(MSO) (PAA, BJ, MN, Jd, MS), pp. 348–360.
