Stem csp$ (all stems)

96 papers:

ICALP-v1-2015-DvorakK #csp #on the

On Planar Boolean CSP (ZD, MK), pp. 432–443.

ICALP-v1-2015-GaspersS #algorithm #performance #set

Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets (SG, GBS), pp. 567–579.

SEFM-2015-CarvalhoBCCMS #csp #natural language #requirements #testing

NAT2TEST Tool: From Natural Language Requirements to Test Cases Based on CSP (GC, FAB, AC, AC, AM, AS), pp. 283–290.

ICSE-v1-2015-FazziniSO #automation #csp #named #web

AutoCSP: Automatically Retrofitting CSP to Web Applications (MF, PS, AO), pp. 336–346.

SAT-2015-ChenS #algorithm #satisfiability

Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP (RC, RS), pp. 33–45.

TACAS-2014-Gibson-RobinsonABR #csp #named #refinement

FDR3 — A Modern Refinement Checker for CSP (TGR, PJA, AB, AWR), pp. 187–201.

FM-2014-AntoninoSW #analysis #concurrent #csp #network #process #refinement

A Refinement Based Strategy for Local Deadlock Analysis of Networks of CSP Processes (PRGA, AS, JW), pp. 62–77.

PODS-2013-BienvenuCLW #case study #csp #data access #datalog #ontology

Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP (MB, BtC, CL, FW), pp. 213–224.

FASE-2013-CavalcantiH #csp #testing

Testing with Inputs and Outputs in CSP (AC, RMH), pp. 359–374.

ICALP-v1-2013-GuoW #complexity #csp

The Complexity of Planar Boolean #CSP with Complex Weights (HG, TW), pp. 516–527.

SEFM-2013-OliveiraJW #csp #multi #protocol

A Verified Protocol to Implement Multi-way Synchronisation and Interleaving in CSP (MVMO, ISdMJ, JW), pp. 46–60.

DATE-2012-KatzRZ #csp #generative #using

Generating instruction streams using abstract CSP (YK, MR, AZ), pp. 15–20.

STOC-2012-CaiC #complexity #csp

Complexity of counting CSP with complex weights (JYC, XC), pp. 909–920.

IFM-2012-IsobeMNR #approach #capacity #csp #safety

Safety and Line Capacity in Railways — An Approach in Timed CSP (YI, FM, HNN, MR), pp. 54–68.

FSE-2012-ShaikhW #diagrams #ocl #performance #slicing #uml #verification

UMLtoCSP (UOST): a tool for efficient verification of UML/OCL class diagrams through model slicing (AS, UKW), p. 37.

ICLP-2012-Ostrowski #csp

ASP modulo CSP: The clingcon system (MO), pp. 458–463.

ICLP-J-2012-OstrowskiS #csp

ASP modulo CSP: The clingcon system (MO, TS), pp. 485–503.

SAT-2012-TanjoTB #csp #encoding #named #order #satisfiability #using

Azucar: A SAT-Based CSP Solver Using Compact Order Encoding — (Tool Presentation) (TT, NT, MB), pp. 456–462.

STOC-2011-Yoshida #algorithm #approximate #bound #csp

Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree CSP (YY), pp. 665–674.

IFM-J-2009-ColvinH11 #behaviour #csp #semantics #specification #using

A semantics for Behavior Trees using CSP with specification commands (RC, IJH), pp. 891–914.

IFM-J-2009-SchneiderT11 #csp #interface #refinement

Changing system interfaces consistently: A new refinement strategy for CSP||B (SS, HT), pp. 837–860.

FM-2011-Dunne #csp #termination

Termination without √ in CSP (SD), pp. 278–292.

ICTSS-2011-CavalcantiGH #consistency #csp #distributed #testing

Conformance Relations for Distributed Testing Based on CSP (AC, MCG, RMH), pp. 48–63.

SAT-2011-CreignouOS #csp

Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight (NC, FO, JS), pp. 120–133.

SAT-2011-PetkeJ #csp #encoding #order #satisfiability

The Order Encoding: From Tractable CSP to Tractable SAT (JP, PJ), pp. 371–372.

SAT-2011-TanjoTB #csp #encoding #finite #performance

A Compact and Efficient SAT-Encoding of Finite Domain CSP (TT, NT, MB), pp. 375–376.

STOC-2010-DyerR #complexity #csp #on the

On the complexity of #CSP (MED, DR), pp. 725–734.

IFM-2010-SchneiderTW #approach #csp

A CSP Approach to Control in Event-B (SS, HT, HW), pp. 260–274.

LOPSTR-2010-LlorensOST #csp #generative #graph #process

Graph Generation to Statically Represent CSP Processes (ML, JO, JS, ST), pp. 52–66.

LICS-2010-BartoK #csp

New Conditions for Taylor Varieties and CSP (LB, MK), pp. 100–109.

SCAM-2009-LangeM #communication #csp #named #process #thread #towards

thr2csp: Toward Transforming Threads into Communicating Sequential Processes (RCL, SM), pp. 3–12.

PEPM-2009-LeuschelLOST #csp #named #slicing #specification

SOC: a slicer for CSP specifications (ML, ML, JO, JS, ST), pp. 165–168.

STOC-2009-CaiLX #csp #problem

Holant problems and counting CSP (JyC, PL, MX), pp. 715–724.

STOC-2009-Tulsiani #csp #reduction

CSP gaps and reductions in the lasserre hierarchy (MT), pp. 303–312.

IFM-2009-ColvinH #csp

CSP with Hierarchical State (RC, IJH), pp. 118–135.

IFM-2009-SchneiderT #csp #interface #refinement

Changing System Interfaces Consistently: A New Refinement Strategy for CSP||B (SS, HT), pp. 103–117.

MoDELS-2009-HorvathV #constraints #csp #modelling #problem

CSP(M): Constraint Satisfaction Problem over Models (ÁH, DV), pp. 107–121.

MoDELS-2009-HorvathV #constraints #csp #modelling #problem

CSP(M): Constraint Satisfaction Problem over Models (ÁH, DV), pp. 107–121.

SAT-2009-ArgelichCLM #encoding #satisfiability

Sequential Encodings from Max-CSP into Partial Max-SAT (JA, AC, IL, FM), pp. 161–166.

STOC-2008-Raghavendra #algorithm #csp #question

Optimal algorithms and inapproximability results for every CSP? (PR), pp. 245–254.

SEFM-2008-Roggenbach #csp #tool support

Tools for CSP (MR), pp. 213–214.

LOPSTR-2008-LeuschelLOST #csp #specification #static analysis

The MEB and CEB Static Analysis for CSP Specifications (ML, ML, JO, JS, ST), pp. 103–118.

ICLP-2008-Gosti #csp #game studies

Resolving CSP with Naming Games (GG), pp. 807–808.

SAT-2008-ArgelichCLM #modelling #satisfiability

Modelling Max-CSP as Partial Max-SAT (JA, AC, IL, FM), pp. 1–14.

ASE-2007-CabotCR #constraints #modelling #named #ocl #programming #uml #using #verification

UMLtoCSP: a tool for the formal verification of UML/OCL models using constraint programming (JC, RC, DR), pp. 547–548.

IFM-2007-FaberJS #data type #parametricity #specification #verification

Verifying CSP-OZ-DC Specifications with Complex Data Types and Timing Parameters (JF, SJ, VSS), pp. 233–252.

IFM-2007-Marr #csp

Capturing Conflict and Confusion in CSP (CM), pp. 413–438.

AGTIVE-2007-VarroABBDGGGKNRW #case study #csp #graph transformation #modelling #tool support #uml

Transformation of UML Models to CSP: A Case Study for Graph Transformation Tools (DV, MA, DB, AB, DHD, RG, JG, PVG, OK, AN, ER, EW), pp. 540–565.

GT-VMT-2007-BisztrayH #csp #process #using #verification

Rule-Level Verification of Business Process Transformations using CSP (DB, RH).

SAT-2007-AnsoteguiBLM #csp #satisfiability

Mapping CSP into Many-Valued SAT (CA, MLB, JL, FM), pp. 10–15.

SAC-2006-DantsinWK #algorithm #constraints #problem #quantum #towards

Quantum versions of k-CSP algorithms: a first step towards quantum algorithms for interval-related constraint satisfaction problems (ED, AW, VK), pp. 1640–1644.

SAC-2006-ZytnickiGS #consistency #csp

A new local consistency for weighted CSP dedicated to long domains (MZ, CG, TS), pp. 394–398.

TACAS-2005-IsobeR #csp #proving #refinement #theorem proving

A Generic Theorem Prover of CSP Refinement (YI, MR), pp. 108–123.

STOC-2005-Hastad #approximate

Every 2-CSP allows nontrivial approximation (JH), pp. 740–746.

FM-2005-Bolton #csp

Adding Conflict and Confusion to CSP (CB), pp. 205–220.

FM-2005-ButlerL #csp #specification #verification

Combining CSP and B for Specification and Property Verification (MJB, ML), pp. 221–236.

IFM-2005-SchneiderTE #component #csp #named #verification

Chunks: Component Verification in CSP||B (SAS, HT, NE), pp. 89–108.

IFM-2005-WeiH #csp

Embedding the Stable Failures Model of CSP in PVS (KW, JH), pp. 246–265.

AdaEurope-2005-AtiyaK #csp

Extending Ravenscar with CSP Channels (DAA, SK), pp. 79–90.

ICEIS-v3-2005-CapelH #csp #modelling #specification #visual notation

Transforming SA/RT Graphical Specifications into CSP+T Formalism — Obtaining a Formal Specification from Semi-Formal SA/RT Essential Models (MIC, JAHT), pp. 65–72.

GTTSE-2005-BenavidesSMC #analysis #automation #csp #feature model #java #modelling #using

Using Java CSP Solvers in the Automated Analyses of Feature Models (DB, SS, PTMA, ARC), pp. 399–408.

ASE-2004-HopcroftB #csp #development

Combining the Box Structure Development Method and CSP (PJH, GHB), pp. 340–345.

IFM-2004-MollerORW #case study #java #uml

Linking CSP-OZ with UML and Java: A Case Study (MM, ERO, HR, HW), pp. 267–286.

IFM-2004-WangRL #csp #independence #reachability

Relating Data Independent Trace Checks in CSP with UNITY Reachability under a Normality Assumption (XW, AWR, RL), pp. 247–266.

IFM-2004-Winter #behaviour #csp #formal method

Formalising Behaviour Trees with CSP (KW), pp. 148–167.

SEFM-2003-NgB #csp #diagrams #formal method #towards #uml

Towards Formalizing UML State Diagrams in CSP (MYN, MJB), p. 138–?.

STOC-2002-AlonVKK #approximate #problem #random

Random sampling and approximation of MAX-CSP problems (NA, WFdlV, RK, MK), pp. 232–239.

ICALP-2002-BermanK #approximate #bound

Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION (PB, MK), pp. 623–632.

IFM-2002-BoltonD #csp #refinement

Refinement in Object-Z and CSP (CB, JD), pp. 225–244.

IFM-2002-BrookeP #csp #design #visual notation

The Design of a Tool-Supported Graphical Notation for Timed CSP (PJB, RFP), pp. 299–318.

IFM-2002-Smith #concurrent #csp #integration #realtime #specification

An Integration of Real-Time Object-Z and CSP for Specifying Concurrent Real-Time Systems (GS), pp. 267–285.

FASE-J-1998-MotaS01 #industrial #model checking #tool support

Model-checking CSP-Z: strategy, tool support and industrial application (AM, AS), pp. 59–96.

FASE-2001-FischerOW #csp #diagrams #uml

A CSP View on UML-RT Structure Diagrams (CF, ERO, HW), pp. 91–108.

FME-2001-LeuschelMC #csp #how #ltl #model checking #refinement

How to Make FDR Spin LTL Model Checking of CSP by Refinement (ML, TM, AC), pp. 99–118.

PADL-2001-Leuschel #csp #design #implementation #prolog #specification

Design and Implementation of the High-Level Specification Language CSP(LP) in Prolog (ML), pp. 14–28.

IFM-2000-DerrickS #csp #refinement

Structural Refinement in Object-Z/CSP (JD, GS), pp. 194–213.

SAC-2000-MillerS #concurrent #csp #process

Eclectic CSP: A Language of Concurrent Processes (QM, BS), pp. 840–842.

FM-v1-1999-Butler #approach #csp #named

csp2B: A Practical Approach to Combining CSP and B (MJB), pp. 490–508.

FM-v2-1999-Wehrheim #abstraction

Data Abstraction for CSP-OZ (HW), pp. 1028–1047.

IFM-1999-FischerW #model checking #specification

Model-Checking CSP-OZ Specifications with FDR (CF, HW), pp. 315–334.

IFM-1999-MacCollC #csp #interactive #specification

Specifying Interactive Systems in Object-Z and CSP (IM, DAC), pp. 335–352.

IFM-1999-Suhl #csp #integration #named

RT-Z: An Integration of Z and timed CSP (CS), pp. 29–48.

FASE-1998-MotaS #model checking

Model-Checking CSP-Z (AM, AS), pp. 205–220.

FM-1998-GoldsmithZ #csp #validation #verification

Critical Systems Validation and Verification with CSP and FDR (MG, IZ), pp. 243–250.

ICSE-1998-MahonyD #csp

Blending Object-Z and Timed CSP: An Introduction to TCOZ (BPM, JSD), pp. 95–104.

FME-1997-Smith #concurrent #csp #integration #semantics #specification

A Semantic Integration of Object-Z and CSP for the Specification of Concurrent Systems (GS), pp. 62–81.

FME-1997-TejW #csp #higher-order

A Corrected Failure Divergence Model for CSP in Isabelle/HOL (HT, BW), pp. 318–337.

RWLW-1996-Castro #csp #using

Solving binary CSP using computational systems (CC), pp. 246–265.

TACAS-1995-RoscoeGGHJS #concurrent #csp #how #model checking

Hierarchical Compression for Model-Checking CSP or How to Check 1020 Dining Philosophers for Deadlock (AWR, PHBG, MG, JRH, DMJ, JBS), pp. 133–152.

VDME-1991-1-Butler #behaviour #csp

Behavioural Extension for CSP (MJB), pp. 254–267.

ML-1991-Day #csp #heuristic #learning #problem

Learning Variable Descriptors for Applying Heuristics Across CSP Problems (DSD), pp. 127–131.

LICS-1986-Brookes #concurrent #correctness #csp #proving #semantics

A Semantically Based Proof System for Partial Correctness and Deadlock in CSP (SDB), pp. 58–65.

ICALP-1985-Bouge #csp #implementation

Repeated Synchronous Snapshots and Their Implementation in CSP (Extended Abstract) (LB), pp. 63–70.

ICALP-1984-Reisig #partial order #semantics

Partial Order Semantics versus Interleaving Semantics for CSP-like Languages and its Impact on Fairness (WR), pp. 403–413.

ICALP-1984-RonRP #csp #hardware #implementation #verification

A Hardware Implementation of the CSP Primitives and its Verification (DR, FR, AP), pp. 423–435.

ICALP-1983-Brookes #csp #on the

On the Relationship of CCS and CSP (SDB), pp. 83–96.