Pages that link to "Item:Q163528"

The following pages link to Electronic Notes in Theoretical Computer Science (Q163528):

Displaying 43 items.

• Game Semantics for Access Control (Q2805155) (← links)
• An Overview of QML With a Concrete Implementation in Haskell (Q2825353) (← links)
• The Invariant Set Hypothesis: A New Geometric Framework for the Foundations of Quantum Theory and the Role Played by Gravity (Q2825367) (← links)
• Interpreting Abstract Interpretations in Membership Equational Logic (Q2841246) (← links)
• Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication (Q2841268) (← links)
• Modular Synthesis of Timed Circuits using Partial Orders on LPNs (Q2842584) (← links)
• Two formalisms of extended possibilistic logic programming with context-dependent fuzzy unification (Q2842591) (← links)
• Unique, guarded fixed points in an additive setting (Q2842814) (← links)
• Definability and Full Abstraction (Q2864154) (← links)
• Design, Analysis and Performance Evaluation of Group Key Establishment in Wireless Sensor Networks (Q2864178) (← links)
• Coding Mobile Synchronizing Petri Nets into Rewriting Logic (Q2864520) (← links)
• GeoThms — a Web System for Euclidean Constructive Geometry (Q2867934) (← links)
• Tinycals: Step by Step Tacticals (Q2867943) (← links)
• Formal Properties of Needed Narrowing with Similarity Relations (Q2867957) (← links)
• A Framework for Timed Concurrent Constraint Programming with External Functions (Q2867965) (← links)
• Bigraphs and Their Algebra (Q2870188) (← links)
• Exogenous Probabilistic Computation Tree Logic (Q2870286) (← links)
• A Congruence Rule Format with Universal Quantification (Q2871833) (← links)
• Comonadic Notions of Computation (Q2873672) (← links)
• Termination of Lazy Rewriting Revisited (Q2873676) (← links)
• Generic Tools via General Refinement (Q2873690) (← links)
• Guarded Operations, Refinement and Simulation (Q2994496) (← links)
• Towards Measurable Types for Dynamical Process Modeling Languages (Q3178249) (← links)
• On sparseness and Turing reducibility over the reals (Q4916198) (← links)
• Learning Strategies for Mechanised Building of Decision Procedures (Q4916230) (← links)
• Constructive Description Logics Hybrid-Style (Q4917077) (← links)
• Supermetrics over Apartness Lattice-Ordered Semigroup (Q4918037) (← links)
• Design for AJACS, yet another Java constraint programming framework1 1The authors would like to thank the anonymous referees for their constructive review of an earlier version of this article. Universidade de Évora, CENTRIA and FundaçLãTo da CiêCncia (Q4923524) (← links)
• Graph Transformations for the Specification of Access Control Policies (Q4923543) (← links)
• The Recursion Scheme from the Cofree Recursive Comonad (Q5166625) (← links)
• Product Form Approximation of Transient Probabilities in Stochastic Reaction Networks (Q5166639) (← links)
• Quantum Fault Tolerance in Systems with Restricted Control (Q5170188) (← links)
• A Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi (Q5179010) (← links)
• Control Flow Analysis for Brane Calculi (Q5179425) (← links)
• Bisimulation and Simulation Relations for Markov Chains (Q5262953) (← links)
• YMCA (Q5262955) (← links)
• Towards SOS Meta-Theory for Language-Based Security (Q5262972) (← links)
• Linking Event-B and Concurrent Object-Oriented Programs (Q5403467) (← links)
• General Refinement, Part One: Interfaces, Determinism and Special Refinement (Q5403470) (← links)
• Improved Continuous Approximation of PEPA Models through Epidemiological Examples (Q5404074) (← links)
• A Process Model of Actin Polymerisation (Q5404079) (← links)
• Process Algebra with Hooks for Models of Pattern Formation (Q5404085) (← links)
• Relating PDEs in Cylindrical Coordinates and CTMCs with Levels of Concentration (Q5404086) (← links)