CONCUR 2005 – Concurrency Theory

DOI10.1007/11539452zbMath1134.68405OpenAlexW1737342522MaRDI QIDQ5897505

Stéphane P. Demri, Régis Gascon

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11539452

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (6)

On the freeze quantifier in Constraint LTL: Decidability and complexity ⋮ An automata-theoretic approach to constraint LTL ⋮ Constraint LTL satisfiability checking without automata ⋮ Verification of qualitative \(\mathbb Z\) constraints ⋮ An Automata-based Approach for CTL⋆ With Constraints ⋮ LTL over integer periodicity constraints

This page was built for publication: CONCUR 2005 – Concurrency Theory