Stem guard$ (all stems)

73 papers:

PODS-2015-AlvianoP

Default Negation for Non-Guarded Existential Rules (MA, AP), pp. 79–90.

PODS-2015-CalauttiGP #termination

Chase Termination for Guarded Existential Rules (MC, GG, AP), pp. 91–103.

SIGMOD-2015-MozafariGY #database #design #framework #named #robust

CliffGuard: A Principled Framework for Finding Robust Database Designs (BM, EZYG, DYY), pp. 1167–1182.

FoSSaCS-2015-CloustonBGB #induction #programming #reasoning #recursion

Programming and Reasoning with Guarded Recursion for Coinductive Types (RC, AB, HBG, LB), pp. 407–421.

SAS-2015-CattaruzzaASK #analysis #bound

Unbounded-Time Analysis of Guarded LTI Systems with Inputs by Abstract Acceleration (DC, AA, PS, DK), pp. 312–331.

ICFP-2015-KarachaliasSVJ #data type #lazy evaluation #pattern matching

GADTs meet their match: pattern-matching warnings that account for GADTs, guards, and laziness (GK, TS, DV, SLPJ), pp. 424–436.

ASPLOS-2015-YetimMM #communication #execution #fault #named #parallel

CommGuard: Mitigating Communication Errors in Error-Prone Parallel Execution (YY, SM, MM), pp. 311–323.

SOSP-2015-Hoffmann #approximate #energy #named

JouleGuard: energy guarantees for approximate applications (HH), pp. 198–214.

CAV-2015-Saha0M #learning #named

Alchemist: Learning Guarded Affine Functions (SS, PG, PM), pp. 440–446.

CAV-2015-Leslie-HurdCF #verification

Verifying Linearizability of Intel® Software Guard Extensions (RLH, DC, MF), pp. 144–160.

LICS-2015-BenediktCCB #bound #complexity #logic

The Complexity of Boundedness for Guarded Logics (MB, BtC, TC, MVB), pp. 293–304.

DAC-2014-ZhangKIBWH #configuration management #named #reliability

GUARD: GUAranteed Reliability in Dynamically Reconfigurable Systems (HZ, MAK, MEI, LB, HJW, JH), p. 6.

PODS-2014-GottlobRS

Expressiveness of guarded existential rule languages (GG, SR, MS), pp. 27–38.

KR-2014-GottlobHKL #logic #semantics

Stable Model Semantics for Guarded Existential Rules and Description Logics (GG, AH, CK, TL).

CAV-2014-DilligDC #memory management #safety #synthesis

Optimal Guard Synthesis for Memory Safety (TD, ID, SC), pp. 491–507.

LICS-CSL-2014-BenediktCB #effectiveness #logic

Effective interpolation and preservation in guarded logics (MB, BtC, MVB), p. 10.

LICS-CSL-2014-Mogelberg #effectiveness #recursion #type system

A type theory for productive coprogramming via guarded recursion (REM), p. 10.

RTA-TLCA-2014-BizjakBM #nondeterminism #type system

A Model of Countable Nondeterminism in Guarded Type Theory (AB, LB, MM), pp. 108–123.

TACAS-2013-BackesGHMS #android #named #requirements

AppGuard — Enforcing User Requirements on Android Apps (MB, SG, CH, MM, PvSR), pp. 543–548.

ICALP-v2-2013-GottlobPT #query #transitive

Querying the Guarded Fragment with Transitivity (GG, AP, LT), pp. 287–298.

ICFP-2013-AtkeyM #effectiveness #recursion

Productive coprogramming with guarded recursion (RA, CM), pp. 197–208.

LICS-2013-BirkedalM #fixpoint #recursion #type system

Intensional Type Theory with Guarded Recursive Types qua Fixed Points on Universes (LB, REM), pp. 213–222.

VLDB-2012-BaranyCO #query

Queries with Guarded Negation (VB, BtC, MO), pp. 1328–1339.

CHI-2012-GuyT #named #navigation #visual notation

CrossingGuard: exploring information content in navigation aids for visually impaired pedestrians (RTG, KNT), pp. 405–414.

VLDB-2011-JinLLH #data mining #detection #named #network #social #social media

SocialSpamGuard: A Data Mining-Based Spam Detection System for Social Media Networks (XJ, CXL, JL, JH), pp. 1458–1461.

ICALP-v2-2011-BaranyCS

Guarded Negation (VB, BtC, LS), pp. 356–367.

HPCA-2011-MadanBBA #manycore #power management

A case for guarded power gating for multi-core processors (NM, AB, PB, MA), pp. 291–300.

CSL-2011-Otto #bisimulation

The Freedoms of Guarded Bisimulation (MO), p. 2.

LICS-2011-BirkedalMSS

First Steps in Synthetic Guarded Domain Theory: Step-Indexing in the Topos of Trees (LB, REM, JS, KS), pp. 55–64.

LCTES-2010-BrandtSS #concurrent #specification

Translating concurrent action oriented specifications to synchronous guarded actions (JB, KS, SKS), pp. 47–56.

LICS-2010-BaranyGO #query

Querying the Guarded Fragment (VB, GG, MO), pp. 1–10.

LICS-2010-Otto

Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment (MO), pp. 11–20.

ICALP-v2-2009-Michaliszyn #decidability #transitive

Decidability of the Guarded Fragment with the Transitive Closure (JM), pp. 261–272.

MoDELS-2009-DrusinskyS #logic #uml #using

Using UML Statecharts with Knowledge Logic Guards (DD, MtS), pp. 586–590.

MoDELS-2009-DrusinskyS #logic #uml #using

Using UML Statecharts with Knowledge Logic Guards (DD, MtS), pp. 586–590.

VLDB-2008-LuM #database #named #strict

AuditGuard: a system for database auditing under retention restrictions (WL, GM), pp. 1484–1487.

TOOLS-EUROPE-2008-CohenGM #program transformation #using

Guarded Program Transformations Using JTL (TC, JYG, IM), pp. 100–120.

WCRE-2007-KomondoorR #dependence #modelling

Recovering Data Models via Guarded Dependences (RK, GR), pp. 110–119.

PLDI-2007-CheremPR #analysis #detection #memory management #using

Practical memory leak detection using guarded value-flow analysis (SC, LP, RR), pp. 480–491.

SAC-2007-Li #abstraction #parametricity #protocol #proving #verification

Mechanized proofs for the parameter abstraction and guard strengthening principle in parameterized verification of cache coherence protocols (YL), pp. 1534–1535.

SAC-2007-NoordendeBT #mobile #security #using

Guarding security sensitive content using confined mobile agents (Gv'N, FMTB, AST), pp. 48–55.

OSDI-2006-ErlingssonAVBN #named

XFI: Software Guards for System Address Spaces (ÚE, MA, MV, MB, GCN), pp. 75–88.

ICALP-2005-Nilsson #approximate

Approximate Guarding of Monotone and Rectilinear Polygons (BJN), pp. 1362–1373.

FM-2005-PierikCB #using

Controlling Object Allocation Using Creation Guards (CP, DC, FSdB), pp. 59–74.

QAPL-2004-HurdMM05 #probability

Probabilistic Guarded Commands Mechanized in HOL (JH, AM, CM), pp. 95–111.

GPCE-2005-Mogensen #equation

Semi-inversion of Guarded Equations (TÆM), pp. 189–204.

CSL-2005-Kieronski #equivalence #transitive

Results on the Guarded Fragment with Equivalence or Transitive Relations (EK), pp. 309–324.

ICLP-2005-SneyersSD #continuation #optimisation

Guard and Continuation Optimization for Occurrence Representations of CHR (JS, TS, BD), pp. 83–97.

DAC-2004-RosenbandA #composition #scheduling

Modular scheduling of guarded atomic actions (DLR, A), pp. 55–60.

SEFM-2004-SistlaWZ #using

Checking Extended CTL properties Using Guarded Quotient Structures (APS, XW, MZ), pp. 87–94.

LOPSTR-2004-Fruhwirth #concurrent #multi

Specialization of Concurrent Guarded Multi-set Transformation Rules (TWF), pp. 133–148.

SAC-2004-CarvalhoCSBF #mobile #network #security #using

Using mobile agents as roaming security guards to test and improve security of hosts and networks (MMC, TBC, NS, MRB, KMF), pp. 87–93.

IJCAR-2004-KazakovN #transitive

A Resolution Decision Procedure for the Guarded Fragment with Transitive Guards (YK, HdN), pp. 122–136.

FoSSaCS-2003-Kieronski #transitive

The Two-Variable Guarded Fragment with Transitive Guards Is 2EXPTIME-Hard (EK), pp. 299–312.

TACAS-2003-BehrmannBFL #analysis #automaton #verification

Static Guard Analysis in Timed Automata Verification (GB, PB, EF, KGL), pp. 254–277.

POPL-2003-XiCC #data type #recursion

Guarded recursive datatype constructors (HX, CC, GC), pp. 224–235.

LICS-2003-EmersonK #model checking #protocol

Model Checking Guarded Protocols (EAE, VK), pp. 361–370.

ECOOP-2002-ArnoldR #effectiveness

Thin Guards: A Simple and Effective Technique for Reducing the Penalty of Dynamic Class Loading (MA, BGR), pp. 498–524.

LICS-2002-Otto #finite #theorem

Modal and Guarded Characterisation Theorems over Finite Transition Systems (MO), p. 371–?.

PODS-2001-GottlobLS #game studies #logic

Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width (GG, NL, FS).

LICS-2001-SzwastT #on the #problem #transitive

On the Decision Problem for the Guarded Fragment with Transitivity (WS, LT), pp. 147–156.

TOOLS-USA-2000-MaleyS #question

But Who Will Guard the Guardians? (DM, ITAS), pp. 227–238.

CL-2000-Dierkes

An Application of Model Building in a Resolution Decision Procedure for Guarded Formulas (MD), pp. 583–597.

LICS-2000-GradelHO #logic

Back and Forth between Guarded and Modal Logics (EG, CH, MO), pp. 217–228.

CADE-1999-Gradel #logic

Invited Talk: Decision procedures for guarded logics (EG), pp. 31–51.

CSL-1999-SeidlN #fixpoint #on the

On Guarding Nested Fixpoints (HS, AN), pp. 484–498.

LICS-1999-GanzingerMV #transitive

The Two-Variable Guarded Fragment with Transitive Relations (HG, CM, MV), pp. 24–34.

LICS-1999-GanzingerN #similarity

A Superposition Decision Procedure for the Guarded Fragment with Equality (HG, HdN), pp. 295–303.

LICS-1999-GradelW #fixpoint #logic

Guarded Fixed Point Logic (EG, IW), pp. 45–54.

FoSSaCS-1998-AmadioC #analysis #type system

Analysis of a Guard Condition in Type Theory (Extended Abstract) (RMA, SCG), pp. 48–62.

ICFP-1998-Kiselyov

LAND*: an AND with local bindings, a guarded LET* special form (OK), p. 336.

CADE-1998-Nivelle

A Resolution Decision Procedure for the Guarded Fragment (HdN), pp. 191–204.

JICSCP-1988-Nystrom88 #horn clause

Control Structures for Guarded Horn Clauses (SON), pp. 1351–1370.