An automata-theoretic approach to reasoning about parameterized systems and specifications

DOI10.1007/978-3-319-02444-8_28zbMATH Open1410.68228OpenAlexW142519030MaRDI QIDQ5166702FDOQ5166702

Sarai Sheinvald, Orna Kupferman, Orna Grumberg

Publication date: 8 July 2014

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-02444-8_28

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Cited In (8)

• On Synthesis of Specifications with Arithmetic
• An automata-based view on configurability and uncertainty
• Title not available (Why is that?)
• Formal Approaches to Software Testing
• On temporal logics with data variable quantifications: decidability and complexity
• First order Büchi automata and their application to verification of LTL specifications
• Title not available (Why is that?)
• On the complexity of decision problems for parameterized finite state synchronous transducers

   Recommendations

• Title not available (Why is that?) 👍 👎
• An automata-theoretic approach to infinite-state systems 👍 👎
• An automata-theoretic approach to model-checking systems and specifications over infinite data domains 👍 👎
• Model checking systems and specifications with parameterized atomic propositions 👍 👎
• Variable automata over infinite alphabets 👍 👎

This page was built for publication: An automata-theoretic approach to reasoning about parameterized systems and specifications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166702)