Stem unfold$ (all stems)

80 papers:

KDD-2014-GhassemiNDBJRS #modelling

Unfolding physiological state: mortality modelling in intensive care units (MG, TN, FDV, NB, RJ, AR, PS), pp. 75–84.

KEOD-2014-TriantafyllouA #classification

Definition and Classification of Primitives for the Robotic Unfolding of a Piece of Clothing (DT, NAA), pp. 417–422.

CASE-2013-MohajeraniMF #automaton #composition #finite #using #verification

Compositional nonblocking verification for extended finite-state automata using partial unfolding (SM, RM, MF), pp. 930–935.

IFL-2013-HackettHJ #approach #optimisation #recursion #source code

The Under-Performing Unfold: A new approach to optimising corecursive programs (JH, GH, MJ), p. 1.

ICML-c3-2013-IshtevaPS #order #using

Unfolding Latent Tree Structures using 4th Order Tensors (MI, HP, LS), pp. 316–324.

ICTSS-2013-LeonHL #concurrent #consistency #testing

Unfolding-Based Test Selection for Concurrent Conformance (HPdL, SH, DL), pp. 98–113.

ASE-2012-KahkonenSH #automation #parallel #source code #testing #thread #using

Using unfoldings in automated testing of multithreaded programs (KK, OS, KH), pp. 150–159.

CSCW-2012-ChoudhuryDN #category theory #classification #twitter

Unfolding the event landscape on twitter: classification and exploration of user categories (MDC, ND, MN), pp. 241–244.

LOPSTR-2011-Seki #logic programming #proving #source code

Proving Properties of Co-Logic Programs by Unfold/Fold Transformations (HS), pp. 205–220.

PEPM-2010-AlpuenteBBF #framework

A fold/unfold transformation framework for rewrite theories extended to CCT (MA, DB, MB, MF), pp. 43–52.

ICGT-2010-Khomenko #behaviour

A New Type of Behaviour-Preserving Transition Insertions in Unfolding Prefixes (VK), pp. 75–90.

ICGT-2010-Qayum #automation #graph transformation #refactoring #search-based #using

Automated Assistance for Search-Based Refactoring Using Unfolding of Graph Transformation Systems (FQ), pp. 407–409.

LOPSTR-2010-Seki #induction #on the #proving

On Inductive Proofs by Extended Unfold/Fold Transformation Rules (HS), pp. 117–132.

LOPSTR-2009-Seki #induction #on the #proving

On Inductive and Coinductive Proofs via Unfold/Fold Transformations (HS), pp. 82–96.

ICPR-2008-XieHS #recognition

Unfolding warping for object recognition (JX, MH, MS), pp. 1–4.

LOPSTR-2008-Seki #on the #semantics #set

On Negative Unfolding in the Answer Set Semantics (HS), pp. 168–184.

TACAS-2007-HerbreteauST #concurrent

Unfolding Concurrent Well-Structured Transition Systems (FH, GS, TQT), pp. 706–720.

PPDP-2007-TacchellaGM

Unfolding in CHR (PT, MG, MCM), pp. 179–186.

FoSSaCS-2006-BaldanHK #distributed #petri net

Distributed Unfolding of Petri Nets (PB, SH, BK), pp. 126–141.

LOPSTR-2006-Payet #detection #term rewriting #using

Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator (ÉP), pp. 194–209.

FM-2005-LeiI #approach #communication #protocol

An Approach to Unfolding Asynchronous Communication Protocols (YL, SPI), pp. 334–349.

LOPSTR-2005-AlbertPG #logic programming #partial evaluation #source code

Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates (EA, GP, JPG), pp. 115–132.

FATES-2005-AiguierABGM #algebra #axiom #specification #testing

Testing from Algebraic Specifications: Test Data Set Selection by Unfolding Axioms (MA, AA, CB, PLG, BM), pp. 203–217.

ICGT-2004-BaldanKS #code generation #generative #graph transformation #testing

Generating Test Cases for Code Generators by Unfolding Graph Transformation Systems (PB, BK, IS), pp. 194–209.

LOPSTR-2004-PueblaAH #performance #prolog

Efficient Local Unfolding with Ancestor Stacks for Full Prolog (GP, EA, MVH), pp. 149–165.

PDCL-2004-RoychoudhuryR #automation #concurrent #verification

Unfold/Fold Transformations for Automated Verification of Parameterized Concurrent Systems (AR, CRR), pp. 261–290.

CAV-2004-SchroterK #model checking #parallel #petri net

Parallel LTL-X Model Checking of High-Level Petri Nets Based on Unfoldings (CS, VK), pp. 109–121.

LOPSTR-2003-WeberC

Constructively Characterizing Fold and Unfold (TW, JLC), pp. 110–127.

TACAS-2002-BornotMNZ #black box

Black Box Unfolding with Local First Search (SB, RM, PN, SZ), pp. 386–400.

TACAS-2002-HeljankoKK #algorithm #parallel #petri net

Parallelisation of the Petri Net Unfolding Algorithm (KH, VK, MK), pp. 371–385.

AFP-2002-BirdG02

Arithmetic Coding with Folds and Unfolds (RSB, JG), pp. 1–26.

CAV-2002-KhomenkoKV #canonical #petri net

Canonical Prefixes of Petri Net Unfoldings (VK, MK, WV), pp. 582–595.

PPDP-2001-TurbakW

Cycle Therapy: A Prescription for Fold and Unfold on Regular Trees (FAT, JBW), pp. 137–149.

ICALP-2000-EsparzaH #approach #ltl #model checking

A New Unfolding Approach to LTL Model Checking (JE, KH), pp. 475–486.

KR-2000-JanhunenNSY #semantics

Unfolding Partiality and Disjunctions in Stable Model Semantics (TJ, IN, PS, JHY), pp. 411–422.

CAV-2000-AbdullaIN #bound #petri net

Unfoldings of Unbounded Petri Nets (PAA, SPI, AN), pp. 495–507.

CL-2000-PettorossiP #model checking

Perfect Model Checking via Unfold/Fold Transformations (AP, MP), pp. 613–628.

FoSSaCS-1999-BaldranCM #graph grammar #semantics

Unfolding and Event Structure Semantics for Graph Grammars (PB, AC, UM), pp. 73–89.

PPDP-1999-RoychoudhuryKRR #framework #logic programming #source code

A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs (AR, KNK, CRR, IVR), pp. 396–413.

ICLP-1999-RoychoudhuryKR #logic programming #source code

Generalized Unfold/fold Transformation Systems for Normal Logic Programs (AR, KNK, IVR), p. 616.

SAS-1998-Gouranton #case study #semantics #slicing

Deriving Analysers by Folding/Unfolding of Natural Semantics and a Case Study: Slicing (VG), pp. 115–133.

ICFP-1998-GibbonsJ

The Under-Appreciated Unfold (JG, GJ), pp. 273–279.

ICFP-1998-Hutton #semantics

Fold and Unfold for Program Semantics (GH), pp. 280–288.

TAGT-1998-BaldanCM #graph grammar

Unfolding of Double-Pushout Graph Grammars is a Coreflection (PB, AC, UM), pp. 145–163.

DAC-1997-SemenovYPPC #independence #synthesis

Synthesis of Speed-Independent Circuits from STG-Unfolding Segment (ALS, AY, EP, MAP, JC), pp. 16–21.

ALP-1997-AlpuenteFMV

Safe Folding/Unfolding with Conditional Narrowing (MA, MF, GM, GV), pp. 1–15.

LOPSTR-1997-LeuschelMS #logic programming #source code #termination

Preserving Termination of Tabled Logic Programs While Unfolding (ML, BM, KFS), pp. 189–205.

LOPSTR-1997-LindenstraussSS

Unfolding the Mystery of Mergesort (NL, YS, AS), pp. 206–225.

CAV-1997-MelzerR #concurrent #using

Deadlock Checking Using Net Unfoldings (SM, SR), pp. 352–363.

DAC-1996-SemenovY #petri net #using #verification

Verification of asynchronous circuits using Time Petri Net unfolding (ALS, AY), pp. 59–62.

TACAS-1996-EsparzaRV #algorithm

An Improvement of McMillan’s Unfolding Algorithm (JE, SR, WV), pp. 87–106.

WPC-1996-KloeschM #comprehension

Improving Program Understanding by Unfolding Layers of Interacting Patterns (RK, RM), pp. 208–217.

LOPSTR-1996-FribourgO #logic programming #petri net #reduction #source code

Reductions of Petri Nets and Unfolding of Propositional Logic Programs (LF, HO), pp. 187–203.

LOPSTR-1996-PettorossiPR #deduction

Enhancing Partial Deduction via Unfold/Fold Rules (AP, MP, SR), pp. 146–168.

PLILP-1996-FrancescoS #concurrent #process

Unfold/Fold Transformations of Concurrent Processes (NDF, AS), pp. 167–181.

FPCA-1995-MeijerH #exponential

Bananas in Space: Extending Fold and Unfold to Exponential Types (EM, GH), pp. 324–333.

CAV-1995-McMillan #using #verification

Trace Theoretic Verification of Asynchronous Circuits Using Unfoldings (KLM), pp. 180–195.

ALP-1994-BossiC #termination

Preserving Universal Termination through Unfold/Fold (AB, NC), pp. 269–286.

LOPSTR-1994-BossiE #semantics #source code

More on Unfold/Fold Transformations of Normal Programs: Preservation of Fitting’s Semantics (AB, SE), pp. 311–331.

PLILP-1994-Bsaies #implementation #synthesis

Implementing the Synthesis of Properties in Unfold/Fold Transformations (KB), pp. 459–460.

PLILP-1994-GergatsoulisK #source code

Unfold/Fold Transformations For Definite Clause Programs (MG, MK), pp. 340–354.

PLILP-1994-MetzemakersMSS #performance #using

Improving Arithmetic Performance using Fine-Grain Unfolding (TM, AM, DS, RS), pp. 324–339.

LOPSTR-1993-MartensS #finite

Some Further Issues in Finite Unfolding (Abstract) (BM, DDS), pp. 159–161.

LOPSTR-1993-ProiettiP #proving #source code #synthesis

Synthesis of Programs from Unfold/Fold Proofs (MP, AP), pp. 141–158.

PEPM-1992-ShermanS #equation #logic programming #source code

Call Unfolding Strategies for Equational Logic Programs (DS, RS), pp. 48–53.

LOPSTR-1992-Jones #programming #prolog

Applications of Unfolding in Prolog Programming (JJ), pp. 184–198.

LOPSTR-1992-Prestwich #prolog

An Unfold Rule for Full Prolog (SDP), pp. 199–213.

PLILP-1992-Alexandre #logic programming #source code

A technique for Transforming Logic Programs by Fold-Unfold Transformations (FA), pp. 202–216.

PLILP-1992-Amtoft #termination

Unfold/fold Transformations Preserving Termination Properties (TA), pp. 187–201.

CAV-1992-McMillan #explosion #problem #using #verification

Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits (KLM), pp. 164–177.

PEPM-1991-Hansen

Properties of Unfolding-based Meta-level Systems (TAH), pp. 243–254.

WSA-1991-DenisD #fixpoint #logic programming #semantics #source code

Unfolding, Procedural and Fixpoint Semantics of Logic Programs (FD, JPD), pp. 157–164.

PLILP-1991-ProiettiP #logic programming #named #order #source code

Unfolding — Definition — Folding, in this Order, for Avaoiding Unnecessary Variables in Logic Programs (MP, AP), pp. 347–358.

ISLP-1991-BruynoogheSM #deduction #infinity #logic programming #source code

A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic Programs (MB, DDS, BM), pp. 117–131.

ALP-1990-GabbrielliL #concurrent #constraints #fixpoint #logic programming #semantics #source code

Unfolding and Fixpoint Semantics of Concurrent Constraint Logic Programs (MG, GL), pp. 204–216.

ALP-1990-Sato #equivalence #first-order

An Equivalence Preserving First Order Unfold/fold Transformation System (TS), pp. 173–188.

PLDI-1988-Debray #logic programming #optimisation #source code

Unfold/Fold Transformations and Loop Optimization of Logic Programs (SKD), pp. 297–307.

JICSCP-1988-Levi88 #fixpoint #modelling #semantics

Models, Unfolding Rules and Fixpoint Semantics (GL), pp. 1649–1665.

ICLP-1987-KanamoriH87 #logic programming #source code

Construction of Logic Programs Based on Generalized Unfold/Fold Rules (TK, KH), pp. 744–768.

ILPC-1984-TamakiS84 #logic programming #source code

Unfold/Fold Transformation of Logic Programs (HT, TS), pp. 127–138.