Pages that link to "Item:Q5466544"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5466544):
Displaying 19 items.
- An approach to multicore parallelism using functional programming: a case study based on Presburger arithmetic (Q478379) (← links)
- Automata for unordered trees (Q515668) (← links)
- Automata-based verification of programs with tree updates (Q845236) (← links)
- XML schema, tree logic and sheaves automata (Q862561) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- What's decidable about weighted automata? (Q2064522) (← links)
- A practical approach to model checking duration calculus using Presburger arithmetic (Q2251131) (← links)
- Weighted logics for unranked tree automata (Q2429720) (← links)
- Context-free commutative grammars with integer counters and resets (Q2636518) (← links)
- Complexity of modal logics with Presburger constraints (Q2638188) (← links)
- Temporal Specifications with Accumulative Values (Q2946736) (← links)
- Chain-Free String Constraints (Q3297597) (← links)
- Invariant Checking for Programs with Procedure Calls (Q3392933) (← links)
- Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads (Q3617755) (← links)
- TAGED Approximations for Temporal Properties Model-Checking (Q3637350) (← links)
- Verifying quantitative temporal properties of procedural programs (Q5009429) (← links)
- Extending two-variable logic on data trees with order on data values and its automata (Q5410335) (← links)
- Regular Expressions with Counting: Weak versus Strong Determinism (Q5895105) (← links)
- On algebraic array theories (Q6192058) (← links)
