A logic you can count on

DOI10.1145/964001.964013zbMath1325.03032OpenAlexW1982213843MaRDI QIDQ3452257

Charles Meyssonnier, Silvano Dal Zilio, Denis Lugiez

Publication date: 11 November 2015

Published in: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/964001.964013

zbMATH Keywords

ambientsubstructural logictree automataPresburger arithmeticsemi-structured datamodel checking satisfiability

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25)

Related Items (7)

One-unambiguity of regular expressions with numeric occurrence indicators ⋮ XML schema, tree logic and sheaves automata ⋮ Expressiveness and complexity of graph logic ⋮ Exploiting schemas in data synchronization ⋮ Deciding safety properties in infinite-state pi-calculus via behavioural types ⋮ On regular paths with counting and data tests ⋮ Name-passing in an ambient-like calculus and its proof using spatial logic

This page was built for publication: A logic you can count on