Pages that link to "Item:Q456462"
From MaRDI portal
The following pages link to Computer Languages, Systems \& Structures (Q456462):
Displayed 50 items.
- Core FOBS: A hybrid functional and object-oriented language (Q456463) (← links)
- First-order reasoning for higher-order concurrency (Q456466) (← links)
- Abstract interpretation of database query languages (Q456469) (← links)
- Maintaining distributed logic programs incrementally (Q456472) (← links)
- Program equivalence in a simple language with state (Q456473) (← links)
- Binary trees as a computational framework (Q461478) (← links)
- Horn clause verification with convex polyhedral abstraction and tree automata-based refinement (Q681335) (← links)
- Special issue on the 16th international conference on verification, model checking, and abstract interpretation (Q681336) (← links)
- A hierarchy of proof rules for checking positive invariance of algebraic and semi-algebraic sets (Q681340) (← links)
- Automatic synthesis of \(k\)-inductive piecewise quadratic invariants for switched affine control programs (Q681342) (← links)
- Effective abstractions for verification under relaxed memory models (Q681346) (← links)
- Inference of ranking functions for proving temporal properties by abstract interpretation (Q681349) (← links)
- An array content static analysis based on non-contiguous partitions (Q681352) (← links)
- Security types preserving compilation (Q865705) (← links)
- Multiple dispatch in reflective runtime environment (Q865707) (← links)
- A calculus for parallel computations over multidimensional dense arrays (Q875953) (← links)
- A bulk-synchronous parallel process algebra (Q875955) (← links)
- Costing stepwise refinements of parallel programs (Q875957) (← links)
- Re-scheduling invocations of services for RPC grids (Q875959) (← links)
- Skeleton-based parallel programming: functional and parallel semantics in a single shot (Q875962) (← links)
- SIR: Inter-program concurrency support for SR programs (Q1398333) (← links)
- Fairness in shared invocation servicing (Q1398337) (← links)
- Data-race and concurrent-write freedom are undecidable. (Q1399005) (← links)
- Bidirectional data flow analysis for type inferencing. (Q1399007) (← links)
- Logic programs as compact denotations. (Q1426046) (← links)
- Elimination of parallel copies using code motion on data dependence graphs (Q1649320) (← links)
- A methodology for speeding up loop kernels by exploiting the software information and the memory architecture (Q1749110) (← links)
- Special issue on the programming languages track at the 29th ACM symposium on applied computing (Q1749111) (← links)
- A formal semantics of nested atomic sections with thread escape (Q1749114) (← links)
- Fully abstract trace semantics for protected module architectures (Q1749116) (← links)
- An on-the-fly grammar modification mechanism for composing and defining extensible languages (Q1749119) (← links)
- The abstract domain of trapezoid step functions (Q1749121) (← links)
- Grammar-based model transformations: definition, execution, and quality properties (Q1749124) (← links)
- Special issue on the 6th and 7th international conferences on software language engineering (SLE 2013 and SLE 2014) (Q1749125) (← links)
- Declarative rewriting through circular nonterminal attributes (Q1749127) (← links)
- Symbolic execution based on language transformation (Q1749128) (← links)
- Intra- and interdiagram consistency checking of behavioral multiview models (Q1749133) (← links)
- Preface: Editorial of special issue trends in functional programming 2011/12 (Q1749134) (← links)
- Combining deep and shallow embedding of domain-specific languages (Q1749137) (← links)
- Derivation and inference of higher-order strictness types (Q1749138) (← links)
- On the verification of architectural reconfigurations (Q1749140) (← links)
- Flexary connectives in Mizar (Q1749141) (← links)
- Compiling and verifying SC-SystemJ programs for safety-critical reactive systems (Q1749143) (← links)
- Specification and static enforcement of scheduler-independent noninterference in a middleweight Java (Q1749145) (← links)
- Efficient determinization of visibly and height-deterministic pushdown automata (Q1749148) (← links)
- Detection of redundant expressions: a precise, efficient, and pragmatic algorithm in SSA (Q1749150) (← links)
- Class invariants as abstract interpretation of trace semantics (Q1749225) (← links)
- Applying model-checking to solve queries on semistructured data (Q1749228) (← links)
- Efficient reconfigurable embedded parsers (Q1749233) (← links)
- Dynamic reordering of alternatives for definite logic programs (Q1749236) (← links)