Stem parameter$ (all stems)

209 papers:

ICALP-v1-2015-FominKLPS #algorithm #polynomial

Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (FVF, PK, DL, FP, SS), pp. 494–505.

ICALP-v1-2015-LokshtanovRS #algorithm #feedback #linear #set

Linear Time Parameterized Algorithms for Subset Feedback Vertex Set (DL, MSR, SS), pp. 935–946.

ICALP-v2-2015-AminofRZS #liveness #network

Liveness of Parameterized Timed Networks (BA, SR, FZ, FS), pp. 375–387.

LATA-2015-CreignouKMMOV #problem

Parameterized Enumeration for Modification Problems (NC, RK, AM, JSM, FO, HV), pp. 524–536.

LATA-2015-LuckMS #complexity #theorem

Parameterized Complexity of CTL — A Generalization of Courcelle’s Theorem (ML, AM, IS), pp. 549–560.

FM-2015-ConchonMZ #model checking

Certificates for Parameterized Model Checking (SC, AM, FZ), pp. 126–142.

FM-2015-LiSLD #protocol #security #verification

Verifying Parameterized Timed Security Protocols (LL, JS, YL, JSD), pp. 342–359.

ICML-2015-BlechschmidtGL #approximate #multi #optimisation #parametricity #problem

Tracking Approximate Solutions of Parameterized Optimization Problems over Multi-Dimensional (Hyper-)Parameter Domains (KB, JG, SL), pp. 438–447.

SAC-2015-PenhaW #design pattern

Parameterization of fail-operational architectural patterns (DOdP, GW), pp. 471–473.

CAV-2015-Durand-Gasselin #model checking

Model Checking Parameterized Asynchronous Shared-Memory Systems (ADG, JE, PG, RM), pp. 67–84.

CAV-2015-KonnovVW #abstraction #algorithm #distributed #model checking #smt

SMT and POR Beat Counter Abstraction: Parameterized Model Checking of Threshold-Based Distributed Algorithms (IK, HV, JW), pp. 85–102.

DAC-2014-JavaidYSBP #component #framework #metric #named

FALCON: A Framework for HierarchicAL Computation of Metrics for CompONent-Based Parameterized SoCs (HJ, YY, SMMS, HB, SP), p. 6.

SAS-2014-AbdullaHH #exclamation #verification

Block Me If You Can! — Context-Sensitive Parameterized Verification (PAA, FH, LH), pp. 1–17.

ICALP-v1-2014-BasavarajuFGMRS #algorithm

Parameterized Algorithms to Preserve Connectivity (MB, FVF, PAG, PM, MSR, SS), pp. 800–811.

ICALP-v1-2014-DregiL #complexity

Parameterized Complexity of Bandwidth on Trees (MSD, DL), pp. 405–416.

ICALP-v1-2014-Lampis #approximate #graph #using

Parameterized Approximation Schemes Using Graph Widths (ML), pp. 775–786.

ICALP-v1-2014-ReidlRVS #algorithm #performance

A Faster Parameterized Algorithm for Treedepth (FR, PR, FSV, SS), pp. 931–942.

LATA-2014-GantyR #order #verification

Ordered Counter-Abstraction — Refinable Subword Relations for Parameterized Verification (PG, AR), pp. 396–408.

SEFM-2014-ChristakisMW #detection #invariant #testing

Synthesizing Parameterized Unit Tests to Detect Object Invariant Violations (MC, PM, VW), pp. 65–80.

SFM-2014-GmeinerKSVW #algorithm #distributed #fault tolerance #model checking #tutorial

Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms (AG, IK, US, HV, JW), pp. 122–171.

ICGT-2014-Delzanno #distributed #model checking #protocol #verification

Parameterized Verification and Model Checking for Distributed Broadcast Protocols (GD), pp. 1–16.

ICML-c2-2014-SilvaKB #learning

Active Learning of Parameterized Skills (BCdS, GK, AGB), pp. 1737–1745.

ICPR-2014-PengHHZM #estimation

Head Pose Estimation by Instance Parameterization (XP, JH, QH, SZ, DNM), pp. 1800–1805.

KR-2014-HaanS #complexity #problem #reasoning

The Parameterized Complexity of Reasoning Problems Beyond NP (RdH, SS).

LOPSTR-2014-TahatE #hybrid #protocol #self #synthesis #verification

A Hybrid Method for the Verification and Synthesis of Parameterized Self-Stabilizing Protocols (AT, AE), pp. 201–218.

CC-2014-TavaresBPR #analysis #data flow

Parameterized Construction of Program Representations for Sparse Dataflow Analyses (ALCT, BB, FMQP, FR), pp. 18–39.

LICS-CSL-2014-Bollig #automaton #communication #logic

Logic for communicating automata with parameterized topology (BB), p. 10.

VMCAI-2014-AminofJKR #model checking

Parameterized Model Checking of Token-Passing Systems (BA, SJ, AK, SR), pp. 262–281.

DATE-2013-MurugappaBJ #multi #standard

Parameterized area-efficient multi-standard turbo decoder (PM, AB, MJ), pp. 109–114.

PODS-2013-ChenM #classification #complexity #query

The fine classification of conjunctive queries and parameterized logarithmic space complexity (HC, MM), pp. 309–320.

FoSSaCS-2013-AvniK

Parameterized Weighted Containment (GA, OK), pp. 369–384.

ICALP-v1-2013-BodlaenderCKN #algorithm #exponential #problem

Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth (HLB, MC, SK, JN), pp. 196–207.

PPDP-2013-AsadaHKHN #branch #calculus #finite #graph #graph transformation #monad

A parameterized graph transformation calculus for finite graphs with monadic branches (KA, SH, HK, ZH, KN), pp. 73–84.

POPL-2013-HurNDV #induction #power of #proving

The power of parameterization in coinductive proof (CKH, GN, DD, VV), pp. 193–206.

CAV-2013-EsparzaGM #verification

Parameterized Verification of Asynchronous Shared-Memory Systems (JE, PG, RM), pp. 124–140.

CAV-2013-KhalimovJB #synthesis

PARTY Parameterized Synthesis of Token Rings (AK, SJ, RB), pp. 928–933.

CAV-2013-SosnovichGN #network #protocol #security #using

Finding Security Vulnerabilities in a Network Protocol Using Parameterized Systems (AS, OG, GN), pp. 724–739.

VMCAI-2013-KhalimovJB #performance #synthesis #towards

Towards Efficient Parameterized Synthesis (AK, SJ, RB), pp. 108–127.

TACAS-2012-JacobsB #synthesis

Parameterized Synthesis (SJ, RB), pp. 362–376.

ICALP-v1-2012-CrowstonJM #bound

Max-Cut Parameterized above the Edwards-Erdős Bound (RC, MJ, MM), pp. 242–253.

ICALP-v1-2012-FellowsKRS #approximate

Parameterized Approximation via Fidelity Preserving Transformations (MRF, AK, FAR, HS), pp. 351–362.

ICALP-v1-2012-LinC #complexity

The Parameterized Complexity of k-Edge Induced Subgraphs (BL, YC), pp. 641–652.

ICALP-v1-2012-LokshtanovR #constraints #multi

Parameterized Tractability of Multiway Cut with Parity Constraints (DL, MSR), pp. 750–761.

LATA-2012-Downey #complexity #tutorial

A Parameterized Complexity Tutorial (RD), pp. 38–56.

LATA-2012-MeierSTV #complexity #logic #on the

On the Parameterized Complexity of Default Logic and Autoepistemic Logic (AM, JS, MT, HV), pp. 389–400.

ICML-2012-SilvaKB #learning

Learning Parameterized Skills (BCdS, GK, AGB), p. 187.

ICPR-2012-SharmaCL #3d

A free viewpoint 3DTV system based on parameterized variety model (MS, SC, BL), pp. 1026–1029.

POPL-2012-FarzanK #composition #concurrent #reasoning #source code #verification

Verification of parameterized concurrent programs by modular reasoning about data and control (AF, ZK), pp. 297–308.

CAV-2012-ConchonGKMZ #model checking #named #parallel #smt

Cubicle: A Parallel SMT-Based Model Checker for Parameterized Systems — Tool Paper (SC, AG, SK, AM, FZ), pp. 718–724.

ICTSS-2012-ArltBSP #testing #user interface

Parameterized GUI Tests (SA, PB, MS, AP), pp. 247–262.

SAT-2012-CreignouV #complexity #problem #satisfiability

Parameterized Complexity of Weighted Satisfiability Problems (NC, HV), pp. 341–354.

DAC-2011-ZhaiNS #adaptation #modelling #network #process #streaming

Modeling adaptive streaming applications with parameterized polyhedral process networks (JTZ, HN, TS), pp. 116–121.

FASE-2011-ThummalapentaMXTH #testing

Retrofitting Unit Tests for Parameterized Unit Testing (ST, MRM, TX, NT, JdH), pp. 294–309.

FoSSaCS-2011-DelzannoSZ #ad hoc #clique #network #on the #power of #verification

On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks (GD, AS, GZ), pp. 441–455.

STOC-2011-MarxR #multi #parametricity

Fixed-parameter tractability of multicut parameterized by the size of the cutset (DM, IR), pp. 469–478.

ICALP-v1-2011-BeyersdorffGLR #bound

Parameterized Bounded-Depth Frege Is Not Optimal (OB, NG, ML, AAR), pp. 630–641.

ICALP-v1-2011-BulatovM #constraints

Constraint Satisfaction Parameterized by Solution Size (AAB, DM), pp. 424–436.

LATA-2011-BareckaC #automaton #complexity #finite #problem

The Parameterized Complexity of Chosen Problems for Finite Automata on Trees (AB, WC), pp. 129–141.

SIGIR-2011-BenderskyMC #concept #query

Parameterized concept weighting in verbose queries (MB, DM, WBC), pp. 605–614.

ESEC-FSE-2011-Bodden #approach #monitoring #runtime

Stateful breakpoints: a practical approach to defining parameterized runtime monitors (EB), pp. 492–495.

CGO-2011-Yi #automation #compilation #optimisation #programmable

Automated programmable control and parameterization of compiler optimizations (QY), pp. 97–106.

ISSTA-2011-FraserZ #generative #testing

Generating parameterized unit tests (GF, AZ), pp. 364–374.

SAT-2011-BeyersdorffGL #complexity

Parameterized Complexity of DPLL Search Procedures (OB, NG, ML), pp. 5–18.

QoSA-2010-BroschKBR #architecture #component #predict #reliability

Parameterized Reliability Prediction for Component-Based Software Architectures (FB, HK, BB, RHR), pp. 36–51.

SIGMOD-2010-ChaudhuriLN #optimisation #query

Variance aware optimization of parameterized queries (SC, HL, VRN), pp. 531–542.

ESOP-2010-FerreiraFS #concurrent #logic #memory management #modelling

Parameterized Memory Models and Concurrent Separation Logic (RF, XF, ZS), pp. 267–286.

PLDI-2010-EmmiMM #transaction #verification

Parameterized verification of transactional memories (ME, RM, RM), pp. 134–145.

DLT-2010-Ibarra #on the #problem

On Decision Problems for Simple and Parameterized Machines (OHI), p. 31.

ICALP-v2-2010-AchilleosLM #satisfiability

Parameterized Modal Satisfiability (AA, ML, VM), pp. 369–380.

LATA-2010-FlorencioF #approach #bound #consistency

Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach (CCF, HF), pp. 202–213.

SEFM-2010-GothelG #automation #invariant #network #realtime #towards #using #verification

Towards the Semi-Automatic Verification of Parameterized Real-Time Systems Using Network Invariants (TG, SG), pp. 310–314.

ICPR-2010-HanerH #estimation #novel #online

On-Line Structure and Motion Estimation Based on a Novel Parameterized Extended Kalman Filter (SH, AH), pp. 1836–1839.

ICSE-2010-TillmannHX #testing #theory and practice

Parameterized unit testing: theory and practice (NT, JdH, TX), pp. 483–484.

ICSE-2010-YangL #approach #bound #verification

A cut-off approach for bounded verification of parameterized systems (QY, ML), pp. 345–354.

CGO-2010-BaskaranHTHRS #revisited

Parameterized tiling revisited (MMB, AH, ST, TH, JR, PS), pp. 200–209.

CAV-2010-KaiserKW #concurrent #detection #source code

Dynamic Cutoff Detection in Parameterized Concurrent Programs (AK, DK, TW), pp. 645–659.

CAV-2010-TorreMP #concurrent #interface #linear #model checking #source code #using

Model-Checking Parameterized Concurrent Programs Using Linear Interfaces (SLT, PM, GP), pp. 629–644.

CSL-2010-ChenF #on the #problem #proving #slicing

On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT (YC, JF), pp. 200–214.

DAC-2009-ShojaeiGBGSH #composition #heuristic #multi #runtime

A parameterized compositional multi-dimensional multiple-choice knapsack heuristic for CMP run-time management (HS, AHG, TB, MG, SS, RH), pp. 917–922.

DAC-2009-Zhu #simulation

A parameterized mask model for lithography simulation (ZZ), pp. 963–968.

SIGMOD-2009-GhazalSBCKG #generative #query

Dynamic plan generation for parameterized queries (AG, DYS, RB, AC, MK, VG), pp. 909–916.

ITiCSE-2009-HsiaoSB #java #personalisation #problem

Extending parameterized problem-tracing questions for Java with personalized guidance (IHH, SAS, PB), p. 392.

PLDI-2009-KunduTL #equivalence #optimisation #proving #using

Proving optimizations correct using parameterized program equivalence (SK, ZT, SL), pp. 327–337.

ICALP-v1-2009-KoutisW #algebra #problem

Limits and Applications of Group Algebras for Parameterized Problems (IK, RW), pp. 653–664.

LATA-2009-IIBT #array

Counting Parameterized Border Arrays for a Binary Alphabet (TI, SI, HB, MT), pp. 422–433.

FM-2009-JaffarS #abstraction #recursion

Recursive Abstractions for Parameterized Systems (JJ, AES), pp. 72–88.

ESEC-FSE-2009-HannaBR #automation #automaton #behaviour #composition #independence #verification

Behavioral automata composition for automatic topology independent verification of parameterized systems (YH, SB, HR), pp. 325–334.

LICS-2009-ChenF #logic #problem

A Logic for PTIME and a Parameterized Halting Problem (YC, JF), pp. 397–406.

SAT-2009-Szeider #complexity #satisfiability

The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT (SS), pp. 276–283.

DAC-2008-HeloueN #analysis #modelling

Parameterized timing analysis with general delay models and arbitrary variation sources (KRH, FNN), pp. 403–408.

SAC-2008-AgulhariSB #using

Compressing electrocardiogram signals using parameterized wavelets (CMA, RMRS, ISB), pp. 1348–1352.

ISMM-2008-JungY #detection #memory management #summary

Practical memory leak detector based on parameterized procedural summaries (YJ, KY), pp. 131–140.

LICS-2008-Kahlon #abstraction #analysis #approach #concurrent #data flow #source code

Parameterization as Abstraction: A Tractable Approach to the Dataflow Analysis of Concurrent Programs (VK), pp. 181–192.

TAP-2008-HalleuxT #testing

Parameterized Unit Testing with Pex (JdH, NT), pp. 171–181.

VMCAI-2008-AbdullaHDR

Handling Parameterized Systems with Non-atomic Global Conditions (PAA, NBH, GD, AR), pp. 22–36.

DAC-2007-WangLP #design #megamodelling

Parameterized Macromodeling for Analog System-Level Design Exploration (JW, XL, LTP), pp. 940–943.

TACAS-2007-AbdullaDHR #model checking #performance #transducer #verification

Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems) (PAA, GD, NBH, AR), pp. 721–736.

PLDI-2007-RenganarayananKRS #for free

Parameterized tiled loops for free (LR, DK, SVR, MMS), pp. 405–414.

ICALP-2007-AlonFGKS #algorithm #problem

Parameterized Algorithms for Directed Maximum Leaf Problems (NA, FVF, GG, MK, SS), pp. 352–362.

ICALP-2007-DornFT #algorithm

Subexponential Parameterized Algorithms (FD, FVF, DMT), pp. 15–27.

ICALP-2007-GroheG #problem

Parameterized Approximability of the Disjoint Cycle Problem (MG, MG), pp. 363–374.

IFM-2007-CouchotD #specification

Guiding the Correction of Parameterized Specifications (JFC, FD), pp. 176–194.

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.

ICSE-2007-KiezunETF #java #refactoring

Refactoring for Parameterizing Java Classes (AK, MDE, FT, RMF), pp. 437–446.

CAV-2007-AbdullaDR #infinity #process #verification

Parameterized Verification of Infinite-State Processes with Global Conditions (PAA, GD, AR), pp. 145–157.

TestCom-FATES-2007-ShahbazLG #component #integration #learning #testing

Learning and Integration of Parameterized Components Through Testing (MS, KL, RG), pp. 319–334.

VMCAI-2007-Namjoshi #analysis #symmetry

Symmetry and Completeness in the Analysis of Parameterized Systems (KSN), pp. 299–313.

DAC-2006-XiongZVV #statistics

Criticality computation in parameterized statistical timing (JX, VZ, NV, CV), pp. 63–68.

DATE-2006-MamagkakisAPCSM #automation #embedded #memory management

Automated exploration of pareto-optimal configurations in parameterized dynamic memory allocation for embedded systems (SM, DA, CP, FC, DS, JMM), pp. 874–875.

TACAS-2006-BrownP #protocol #verification

Easy Parameterized Verification of Biphase Mark and 8N1 Protocols (GMB, LP), pp. 58–72.

TACAS-2006-DeshmukhEG #automation #data type #verification

Automatic Verification of Parameterized Data Structures (JVD, EAE, PG), pp. 27–41.

TACAS-2006-YangBR #verification #π-calculus

Parameterized Verification of π-Calculus Systems (PY, SB, CRR), pp. 42–57.

ICALP-v1-2006-Marx #optimisation #problem

A Parameterized View on Matroid Optimization Problems (DM), pp. 655–666.

CIKM-2006-Metzler #estimation #modelling #retrieval

Estimation, sensitivity, and generalization in parameterized retrieval models (DM), pp. 812–813.

ECOOP-2006-LeeC

Parameterized Modules for Classes and Extensible Functions (KL, CC), pp. 353–378.

SAC-2006-Ferrer-TroyanoAS #classification #data type #incremental #learning

Data streams classification by incremental rule learning with parameterized generalization (FJFT, JSAR, JCRS), pp. 657–661.

VMCAI-2006-ClarkeTV #abstraction #verification

Environment Abstraction for Parameterized Verification (EMC, MT, HV), pp. 126–141.

ASE-2005-CouchotGK #approach #deduction #protocol #safety

A uniform deductive approach for parameterized protocol safety (JFC, AG, NK), pp. 364–367.

ASE-2005-UbayashiMMT #aspect-oriented #interpreter #modelling

A parameterized interpreter for modeling different AOP mechanisms (NU, GM, HM, TT), pp. 194–203.

DAC-2005-ChangZNV #analysis #parametricity #statistics

Parameterized block-based statistical timing analysis with non-gaussian parameters, nonlinear delay functions (HC, VZ, SN, CV), pp. 71–76.

DAC-2005-SouMD #approach #optimisation #order #reduction

A quasi-convex optimization approach to parameterized model order reduction (KCS, AM, LD), pp. 933–938.

ICDAR-2005-SternbyE #framework

Core Points — A Framework For Structural Parameterization (JS, AE), pp. 217–221.

CIKM-2005-MouzaRS #evaluation #performance #query

Efficient evaluation of parameterized pattern queries (CdM, PR, MS), pp. 728–735.

ECMDA-FA-2005-MullerCCV #on the

On Some Properties of Parameterized Model Application (AM, OC, BC, GV), pp. 130–144.

LOPSTR-2005-PettorossiPS #array #protocol #using #verification

Transformational Verification of Parameterized Protocols Using Array Formulas (AP, MP, VS), pp. 23–43.

ESEC-FSE-2005-TillmannS #testing

Parameterized unit tests with unit meister (NT, WS), pp. 241–244.

ESEC-FSE-2005-TillmannS05a #testing

Parameterized unit tests (NT, WS), pp. 253–262.

SAT-2005-Goldberg #equivalence #specification

Equivalence Checking of Circuits with Parameterized Specifications (EG), pp. 107–121.

ASE-2004-BlundellFKH #interface #product line #verification

Parameterized Interfaces for Open System Verification of Product Lines (CB, KF, SK, PVH), pp. 258–267.

DATE-v1-2004-ShinKCCKE #architecture #design #performance

Fast Exploration of Parameterized Bus Architecture for Communication-Centric SoC Design (CS, YTK, EYC, KMC, JTK, SKE), pp. 352–357.

FASE-2004-KimRFL #data access #modelling #uml #using

Modeling Role-Based Access Control Using Parameterized UML Models (DKK, IR, RBF, NL), pp. 180–193.

DLT-2004-DowneyM #complexity

Some New Directions and Questions in Parameterized Complexity (RGD, CM), pp. 12–26.

ICALP-2004-FominT #algorithm #exponential #graph #kernel #linear #performance

Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up (FVF, DMT), pp. 581–592.

ICPR-v3-2004-LangsRRC #3d #modelling #visualisation

Building and Registering Parameterized 3D Models of Vessel Trees for Visualization during Intervention (GL, PR, DR, FC), pp. 726–729.

SIGIR-2004-DavidovGM #categorisation #dataset #generative

Parameterized generation of labeled datasets for text categorization based on a hierarchical directory (DD, EG, SM), pp. 250–257.

PDCL-2004-RoychoudhuryR #automation #concurrent #verification

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

POPL-2004-GiacobazziM #abstract interpretation

Abstract non-interference: parameterizing non-interference by abstract interpretation (RG, IM), pp. 186–197.

LDTA-2004-ThiemannN #lr #parsing

Parameterized LR Parsing (PT, MN), pp. 115–132.

CSL-2004-EmersonK #message passing #model checking

Parameterized Model Checking of Ring-Based Message Passing Systems (EAE, VK), pp. 325–339.

LICS-2004-FlumG #model checking #problem

Model-Checking Problems as a Basis for Parameterized Intractability (JF, MG), pp. 388–397.

LICS-2004-SeshiaB #bound #quantifier #using

Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds (SAS, REB), pp. 100–109.

VMCAI-2004-AgarwalS #java #type inference

Type Inference for Parameterized Race-Free Java (RA, SDS), pp. 149–160.

FoSSaCS-2003-AronsPZ #abstraction #probability #verification

Parameterized Verification by Probabilistic Abstraction (TA, AP, LDZ), pp. 87–102.

TACAS-2003-BasuR #analysis #composition #verification

Compositional Analysis for Verification of Parameterized Systems (SB, CRR), pp. 315–330.

TACAS-2003-EmersonK #agile #model checking #protocol

Rapid Parameterized Model Checking of Snoopy Cache Coherence Protocols (EAE, VK), pp. 144–159.

AGTIVE-2003-KraftN #concept #design #specification #tool support

Parameterized Specification of Conceptual Design Tools in Civil Engineering (BK, MN), pp. 90–105.

SAT-2003-Szeider #on the #parametricity #satisfiability

On Fixed-Parameter Tractable Parameterizations of SAT (SS), pp. 188–202.

TLCA-2003-KakutaniH #category theory #fixpoint

Parameterizations and Fixed-Point Operators on Control Categories (YK, MH), pp. 180–194.

VMCAI-2003-PnueliZ #abstraction #model checking

Model-Checking and Abstraction to the Aid of Parameterized Systems (AP, LDZ), p. 4.

SIGMOD-2002-TaoP #database #query

Time-parameterized queries in spatio-temporal databases (YT, DP), pp. 334–345.

TACAS-2002-BozzanoD #verification

Beyond Parameterized Verification (MB, GD), pp. 221–235.

TACAS-2002-EmersonK #model checking #resource management #scalability

Model Checking Large-Scale and Parameterized Resource Allocation Systems (EAE, VK), pp. 251–265.

ISSTA-2002-MilanovaRR #analysis #java #points-to

Parameterized object sensitivity for points-to and side-effect analyses for Java (AM, AR, BGR), pp. 1–11.

VMCAI-2002-BaukusLS #liveness #protocol #safety #verification

Parameterized Verification of a Cache Coherence Protocol: Safety and Liveness (KB, YL, KS), pp. 317–330.

PODS-2001-Grohe #complexity #database #query

The Parameterized Complexity of Database Queries (MG), pp. 82–92.

TACAS-2001-BallCR #library #parallel #thread #verification

Parameterized Verification of Multithreaded Software Libraries (TB, SC, SKR), pp. 158–173.

SAS-2001-LiangH #analysis #interprocedural #performance #pointer

Efficient Computation of Parameterized Pointer Information for Interprocedural Analyses (DL, MJH), pp. 279–298.

SAS-2001-Lu #analysis #logic programming #source code

Parameterizing a Groundness Analysis of Logic Programs (LL), pp. 146–164.

FLOPS-2001-Sato #learning #logic programming #source code

Parameterized Logic Programs where Computing Meets Learning (TS), pp. 40–60.

ICALP-2001-AlberFN #complexity #exponential #graph #problem

Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems (JA, HF, RN), pp. 261–272.

ICALP-2001-CaiJ #algorithm

Subexponential Parameterized Algorithms Collapse the W-Hierarchy (LC, DWJ), pp. 273–284.

ICFP-2001-Sheard #unification

Generic Unification via Two-Level Types and Parameterized Modules (TS), pp. 86–97.

OOPSLA-2001-BoyapatiR #java #source code #type system

A Parameterized Type System for Race-Free Java Programs (CB, MCR), pp. 56–69.

SAC-2001-Jamil #relational #unification

A case for parameterized views and relational unification (HMJ), pp. 275–279.

CAV-2001-AronsPRXZ #automation #induction #verification

Parameterized Verification with Automatically Computed Inductive Assertions (TA, AP, SR, JX, LDZ), pp. 221–234.

CAV-2001-Maidl #approach #model checking #safety

A Unifying Model Checking Approach for Safety Properties of Parameterized Systems (MM), pp. 311–323.

CAV-2001-RoychoudhuryR #automation #induction #protocol #verification

Automated Inductive Verification of Parameterized Protocols (AR, IVR), pp. 25–37.

DATE-2000-HenkeGV #design #estimation #performance

Fast Cache and Bus Power Estimation for Parameterized System-on-a-Chip Design (JH, TG, FV), pp. 333–338.

TACAS-2000-BaukusBLS #network #verification

Abstracting WS1S Systems to Verify Parameterized Networks (KB, SB, YL, KS), pp. 188–203.

TACAS-2000-RoychoudhuryKRRS #logic programming #program transformation #using #verification

Verification of Parameterized Systems Using Logic Program Transformations (AR, KNK, CRR, IVR, SAS), pp. 172–187.

WRLA-2000-DuranM #maude

Parameterized Theories and Views in Full Maude 2.0 (FD, JM), pp. 316–338.

CIAA-2000-Wareham #automaton #complexity #composition #finite #set

The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata (TW), pp. 302–310.

ICPR-v1-2000-IsgroT #matrix

A General Rank-2 Parameterization of the Fundamental Matrix (FI, ET), pp. 1868–1871.

CAV-2000-AbdullaJ #infinity #tutorial #verification

Invited Tutorial: Verification of Infinite-State and Parameterized Systems (PAA, BJ), p. 4.

CAV-2000-Delzanno #automation #protocol #verification

Automatic Verification of Parameterized Cache Coherence Protocols (GD), pp. 53–68.

CAV-2000-PnueliS #liveness #verification

Liveness and Acceleration in Parameterized Verification (AP, ES), pp. 328–343.

CL-2000-KameyaS #learning #logic programming #performance #source code

Efficient EM Learning with Tabulation for Parameterized Logic Programs (YK, TS), pp. 269–284.

ECOOP-1999-ThorupT

Unifying Genericity — Combining the Benefits of Virtual Types and Parameterized Classes (KKT, MT), pp. 186–204.

OOPSLA-1999-Duggan #composition #java #reverse engineering #type system

Modular Type-Based Reverse Engineering of Parameterized Types in Java Code (DD), pp. 97–113.

TOOLS-ASIA-1999-CrespoRM #automation

Obtaining Generic Classes Automatically through a Parameterization Operator: A Focus on Constrained Genericity (YC, JJR, JMMC), pp. 166–176.

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.

CAV-1999-AbdullaBJN #verification

Handling Global Conditions in Parameterized System Verification (PAA, AB, BJ, MN), pp. 134–145.

CAV-1999-MannaS #diagrams #induction #verification

Verification of Parameterized Systems by Dynamic Induction on Diagrams (ZM, HS), pp. 25–41.

CSL-1999-Grohe #complexity

Descriptive and Parameterized Complexity (MG), pp. 14–31.

DATE-1998-OgawaKK #memory management #named

PASTEL: A Parameterized Memory Characterization System (KO, MK, FK), pp. 15–20.

CAV-1998-EmersonN #protocol #verification

Verification of Parameterized Bus Arbitration Protocol (EAE, KSN), pp. 452–463.

SAS-1997-Cousot #abstract interpretation #semantics #static analysis

Abstract Interpretation Based Static Analysis Parameterized by Semantics (PC), pp. 388–394.

OOPSLA-1997-AgesenFM #java

Adding Type Parameterization to the Java Language (OA, SNF, JCM), pp. 49–65.

POPL-1997-BankLM #java

Parameterized Types for Java (ACM, JAB, BL), pp. 132–145.

POPL-1997-Halbwachs #automation #linear #network #process #verification

Automatic Verification of Parameterized Linear Networks of Processes (DL, NH, PR), pp. 346–357.

DAC-1996-HuttonGRC #generative #random

Characterization and Parameterized Random Generation of Digital Circuits (MDH, JPG, JR, DGC), pp. 94–99.

TACAS-1996-Margaria #automation #detection #fault

Fully Automatic Verifcation and Error Detection for Parameterized Iterative Sequential Circuits (TMS), pp. 258–277.

POPL-1996-Jones #composition #using

Using Parameterized Signatures to Express Modular Structure (MPJ), pp. 68–78.

CAV-1996-EmersonN #automation #verification

Automatic Verification of Parameterized Synchronous Systems (Extended Abstract) (EAE, KSN), pp. 87–98.

ALP-1994-Bouhoula #induction #proving

Sufficient Completeness and Parameterized Proofs by Induction (AB), pp. 23–40.

CADE-1994-Bouhoula #induction #named #proving

SPIKE: a System for Sufficient Completeness and Parameterized Inductive Proofs (AB), pp. 836–840.

STOC-1993-Baker #algorithm #formal method #pattern matching

A theory of parameterized pattern matching: algorithms and applications (BSB), pp. 71–80.

PLDI-1991-ConselK #partial evaluation

Parameterized Partial Evaluation (CC, SCK), pp. 92–106.

RTA-1991-Kirchner #proving #specification

Proofs in Parameterized Specification (HK), pp. 174–187.

ESOP-1990-JeffersonLF

A Syntactic Theory of Transparent Parameterization (SJ, SDL, DPF), pp. 212–226.

DAC-1988-BarthSS

Parameterized Schematics (RB, BS, PSS), pp. 243–249.

LFP-1988-Lamping #programming language

A Unified System of Parameterization for Programming Languages (JL), pp. 316–326.

ALP-1988-JouannaudKKM #named #programming

OBJ: Programming with Equalities, Subsorts, Overloading and Parameterization (JPJ, CK, HK, AM), pp. 41–52.

ICSE-1988-LieberherrR #case study #named

Demeter: A Case Study of Software Growth through Parameterized Classes (KJL, AJR), pp. 254–264.

DAC-1987-CesearIT #named #synthesis

PAMS: An Expert System for Parameterized Module Synthesis (TC, EI, CT), pp. 666–671.

ICSE-1987-FutatsugiGMO #programming

Parameterized Programming in OBJ2 (KF, JAG, JM, KO), pp. 51–60.

DAC-1984-Lieberherr84a #random testing #testing

Parameterized random testing (KJL), pp. 510–516.

ICALP-1980-EhrigKTWW #algebra #data type #specification

Parameterized Data Types in Algebraic Specification Languages (Short Version) (HE, HJK, JWT, EGW, JBW), pp. 157–168.

STOC-1978-ThatcherWW #data type #power of #specification

Data Type Specification: Parameterization and the Power of Specification Techniques (JWT, EGW, JBW), pp. 119–132.