Pages that link to "Item:Q163528"
From MaRDI portal
The following pages link to Electronic Notes in Theoretical Computer Science (Q163528):
Displaying 50 items.
- Scoped dynamic rewrite rules (Q2841252) (← links)
- Parameterized complexity: the main ideas and connections to practical computing (Q2841253) (← links)
- Declarative programming: a logical view (Q2841254) (← links)
- A category-theoretic approach to social network analysis (Q2841255) (← links)
- Computing over \(K\)-modules (Q2841256) (← links)
- Sketch data models, relational schema and data specifications (Q2841257) (← links)
- Towards an arithmetic theory of consistency enforcement based on preservation of \(\delta\)-constraints (Q2841258) (← links)
- On the structure of counterexamples to symmetric orderings for BDD's (Q2841260) (← links)
- Don't care non-determinism in logic program refinement (Q2841262) (← links)
- Typed behavioural equivalences for processes in the presence of subtyping (Q2841263) (← links)
- Dedekind completion as a method for constructing new Scott domains (Q2841264) (← links)
- Bisimulation-based non-deterministic admissible interference and its application to the analysis of cryptographic protocols (Q2841265) (← links)
- Drawing ruled surfaces using the dual De Boor algorithm (Q2841267) (← links)
- Efficient algorithms for the maximum subarray problem by distance matrix multiplication (Q2841268) (← links)
- Zooming-out on higraph-based diagrams: syntactic and semantic issues (Q2841269) (← links)
- An overview of boxed ambients (abstract) (Q2841270) (← links)
- Cryptographic analysis in cubic time (Q2841271) (← links)
- A type inference algorithm for secure ambients (Q2841272) (← links)
- Comparative analysis of the expressiveness of shared dataspace coordination (Q2841273) (← links)
- The theory of contexts for first order and higher order abstract syntax (Q2841274) (← links)
- Comparing higher-order encodings in logical frameworks and tile logic (Q2841275) (← links)
- Comparing cospan-spans and tiles via a Hoare-style process calculus (Q2841276) (← links)
- A fully abstract model for mobile ambients (Q2841277) (← links)
- Synchronized regular expressions (Q2841278) (← links)
- Techniques for security checking: non-interference vs control flow analysis (Q2841279) (← links)
- Formal models of timing attacks on web privacy (Q2841280) (← links)
- Specifying and verifying reactive systems in a multi-language environment (Q2841282) (← links)
- A debugging scheme for functional logic programs (Q2841284) (← links)
- Type inference using constraint handling rules (Q2841285) (← links)
- Improving the efficiency of non-deterministic computations (Q2841287) (← links)
- Timed term rewrite systems (Q2841289) (← links)
- A declarative debugging system for lazy functional logic programs (Q2841290) (← links)
- Defining actions in concurrent declarative programming (Q2841291) (← links)
- Model checking Erlang programs -- abstracting recursive function calls (Q2841292) (← links)
- Specification of logic programming languages from reusable semantic building blocks (Q2841297) (← links)
- Lazy rewriting and context-sensitive rewriting (Q2841298) (← links)
- Comparing Meseguer's rewriting logic with the logic CRWL (Q2841300) (← links)
- Specialisation of higher-order functions for debugging (Q2841302) (← links)
- An implementation model of the typed \(\lambda\)-calculus based on linear chemical abstract machine (Q2841304) (← links)
- On the specification of higher dimensional automata (Q2841306) (← links)
- Rule formats for timed processes (Q2841307) (← links)
- Towards weak bisimulation for coalgebras (Q2841308) (← links)
- A categorical framework for typing CCS-style process communication (Q2841310) (← links)
- Concrete process categories (Q2841311) (← links)
- Formal techniques for analysing scenarios using message sequence charts (Q2841314) (← links)
- Message sequence charts in the development process -- roles and limitations (Q2841315) (← links)
- Specifying services with UML and UML-RT: foundations, challenges and limitations (Q2841316) (← links)
- Specification and verification using message sequence charts (Q2841317) (← links)
- Implied scenario detection in the presence of behaviour constraints (Q2841318) (← links)
- A semantics for timed MSC (Q2841319) (← links)
