Pages that link to "Item:Q2786118"
From MaRDI portal
The following pages link to Logical Methods in Computer Science (Q2786118):
Displayed 50 items.
- Prioritise the best variation (Q2117016) (← links)
- Offline and online monitoring of scattered uncertain logs using uncertain linear dynamical systems (Q2165213) (← links)
- Fault-tolerant multiparty session types (Q2165214) (← links)
- Positive Supercompilation for a Higher-Order Call-By-Value Language (Q2786119) (← links)
- Automated Verification of Practical Garbage Collectors (Q2786120) (← links)
- Spatial logics with connectedness predicates (Q2786121) (← links)
- Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories (Q2786124) (← links)
- Domain Representable Spaces Defined by Strictly Positive Induction (Q2786126) (← links)
- Expressiveness and Closure Properties for Quantitative Languages (Q2786127) (← links)
- Acyclic Solos and Differential Interaction Nets (Q2786128) (← links)
- Algorithms for Game Metrics (Q2786130) (← links)
- Sampled Semantics of Timed Automata (Q2786131) (← links)
- Initial Algebra Semantics for Cyclic Sharing Tree Structures (Q2786132) (← links)
- Propositional Dynamic Logic for Message-Passing Systems (Q2786133) (← links)
- Unification in the Description Logic EL (Q2786134) (← links)
- Modularity of Convergence and Strong Convergence in Infinitary Rewriting (Q2786135) (← links)
- Interactive Learning-Based Realizability for Heyting Arithmetic with EM1 (Q2786136) (← links)
- Local Termination: theory and practice (Q2786137) (← links)
- Well-definedness of Streams by Transformation and Termination (Q2786138) (← links)
- The General Vector Addition System Reachability Problem by Presburger Inductive Invariants (Q2786139) (← links)
- Non-Deterministic Kleene Coalgebras (Q2786140) (← links)
- Weak omega-categories from intensional type theory (Q2786141) (← links)
- On Second-Order Monadic Monoidal and Groupoidal Quantifiers (Q2786142) (← links)
- Type-checking Liveness for Collaborative Processes with Bounded and Unbounded Recursion (Q2790164) (← links)
- Proof equivalence in MLL is PSPACE-complete (Q2790165) (← links)
- Weak topologies for Linear Logic (Q2794670) (← links)
- (Leftmost-Outermost) Beta Reduction is Invariant, Indeed (Q2794671) (← links)
- Separating Regular Languages with First-Order Logic (Q2794672) (← links)
- Simulation Problems Over One-Counter Nets (Q2800968) (← links)
- History-Register Automata (Q2800969) (← links)
- A Sorted Semantic Framework for Applied Process Calculi (Q2800971) (← links)
- Order-Invariant Types and Their Applications (Q2800972) (← links)
- Generic algorithms for halting problem and optimal machines revisited (Q2800974) (← links)
- Non-Obfuscated Unprovable Programs & Many Resultant Subtleties (Q2804199) (← links)
- FO2(<,+1,~) on data trees, data tree automata and branching vector addition systems (Q2804201) (← links)
- On the characterization of models of H*: The semantical aspect (Q2804203) (← links)
- Reasoning about Data Repetitions with Counter Systems (Q2818761) (← links)
- Admissibility in Finitely Generated Quasivarieties (Q2838238) (← links)
- Unifying the Linear Time-Branching Time Spectrum of Process Semantics (Q2838240) (← links)
- Markov two-components processes (Q2838243) (← links)
- Graph Logics with Rational Relations (Q2846573) (← links)
- Well-Pointed Coalgebras (Q2846574) (← links)
- Regular Cost Functions, Part I: Logic and Algebra over Words (Q2846575) (← links)
- Computably regular topological spaces (Q2846577) (← links)
- Universal codes of the natural numbers (Q2846579) (← links)
- Computability of Probability Distributions and Characteristic Functions (Q2846581) (← links)
- Cartesian closed 2-categories and permutation equivalence in higher-order rewriting (Q2846582) (← links)
- Coalgebraic Characterizations of Context-Free Languages (Q2848359) (← links)
- Pebble Games, Proof Complexity, and Time-Space Trade-offs (Q2848360) (← links)
- Connector algebras for C/E and P/T nets' interactions (Q2848361) (← links)