Stem unrestrict$ (all stems)

16 papers:

CASE-2015-TanakaM #algorithm #bound #problem #strict

Dominance properties for the unrestricted block relocation problem and their application to a branch-and-bound algorithm (ST, FM), pp. 509–514.

ESOP-2015-DavidKL #source code #strict #termination

Unrestricted Termination and Non-termination Arguments for Bit-Vector Programs (CD, DK, ML), pp. 183–204.

SIGMOD-2013-ChenZ #difference #privacy #recursion #strict #towards

Recursive mechanism: towards node differential privacy and unrestricted joins (SC, SZ), pp. 653–664.

ICSE-2011-PukallGSKCG #adaptation #java #named #strict

JavAdaptor: unrestricted dynamic software updates for Java (MP, AG, RS, CK, WC, SG), pp. 989–991.

CC-2010-DingO #algorithm #representation #strict

Unrestricted Code Motion: A Program Representation and Transformation Algorithms Based on Future Values (SD, SÖ), pp. 26–45.

PADL-2008-CasasCH #execution #implementation #independence #strict #towards

Towards a High-Level Implementation of Execution Primitives for Unrestricted, Independent And-Parallelism (AC, MC, MVH), pp. 230–247.

ICLP-2008-CasasCH #implementation #independence #nondeterminism #strict

A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism (AC, MC, MVH), pp. 651–666.

ICALP-2007-BellareNN #strict

Unrestricted Aggregate Signatures (MB, CN, GN), pp. 411–422.

LOPSTR-2007-CasasCH #algorithm #independence #logic programming #source code #strict

Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs (AC, MC, MVH), pp. 138–153.

PLDI-2006-TriantafyllisBROA #framework #optimisation #strict

A framework for unrestricted whole-program optimization (ST, MJB, ER, GO, DIA), pp. 61–71.

SAT-2002-LynceM1 #algorithm #backtracking #satisfiability #strict

Complete unrestricted backtracking algorithms for satisfiability (IL, JMS), p. 29.

ICALP-2001-BenediktGR #model checking #state machine #strict

Model Checking of Unrestricted Hierarchical State Machines (MB, PG, TWR), pp. 652–666.

SIGIR-2001-Zechner #automation #generative #strict #summary

Automatic Generation of Concise Summaries of Spoken Dialogues in Unrestricted Domains (KZ), pp. 199–207.

CSL-1989-Goerdt #strict

Davis-Putnam Resolution versus Unrestricted Resolution (AG), pp. 143–162.

POPL-1978-CartwrightO #hoare #logic #strict

Unrestricted Procedure Calls in Hoare’s Logic (RC, DCO), pp. 131–140.

STOC-1971-Buttelmann #automaton #finite #generative #on the #strict

On Generalized Finite Automata and Unrestricted Generative Grammars (HWB), pp. 63–77.