BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
CSP
communicating sequential processes
Google CSP
Wikidata Q1120460
WikipediaEnglish Communicating sequential processes

Tag #csp

90 papers:

FMFM-2019-GomesB19a #model checking #named #using
Circus2CSP: A Tool for Model-Checking Circus Using FDR (AOG, AB), pp. 235–242.
TAPTAP-2019-CavalcantiBHL #testing #using
Testing Robots Using CSP (AC, JB, RMH, RL), pp. 21–38.
ICTSSICTSS-2017-CavalcantiS #refinement #testing
Fault-Based Testing for Refinement in CSP (AC, AdSS), pp. 21–37.
FMFM-2016-YanJLWZ #approximate #bisimulation #hybrid
Approximate Bisimulation and Discretization of Hybrid CSP (GY, LJ, YL, SW, NZ), pp. 702–720.
AdaEuropeAdaEurope-2016-Wittiger #using
Eliminating Data Race Warnings Using CSP (MW), pp. 30–43.
ICALPICALP-v1-2015-DvorakK #on the
On Planar Boolean CSP (ZD, MK), pp. 432–443.
SEFMSEFM-2015-CarvalhoBCCMS #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.
ICSEICSE-v1-2015-FazziniSO #automation #named #web
AutoCSP: Automatically Retrofitting CSP to Web Applications (MF, PS, AO), pp. 336–346.
FMFM-2014-AntoninoSW #analysis #concurrent #network #process #refinement
A Refinement Based Strategy for Local Deadlock Analysis of Networks of CSP Processes (PRGA, AS, JW), pp. 62–77.
HOFMHOFM-2014-LadenbergerDL #approach #modelling #visualisation
An Approach for Creating Domain Specific Visualisations of CSP Models (LL, ID, ML), pp. 20–35.
TACASTACAS-2014-Gibson-RobinsonABR #named #refinement
FDR3 — A Modern Refinement Checker for CSP (TGR, PJA, AB, AWR), pp. 187–201.
PODSPODS-2013-BienvenuCLW #case study #data access #datalog #ontology
Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP (MB, BtC, CL, FW), pp. 213–224.
ICALPICALP-v1-2013-GuoW #complexity
The Complexity of Planar Boolean #CSP with Complex Weights (HG, TW), pp. 516–527.
SEFMSEFM-2013-OliveiraJW #multi #protocol
A Verified Protocol to Implement Multi-way Synchronisation and Interleaving in CSP (MVMO, ISdMJ, JW), pp. 46–60.
FASEFASE-2013-CavalcantiH #testing
Testing with Inputs and Outputs in CSP (AC, RMH), pp. 359–374.
IFMIFM-2012-IsobeMNR #approach #capacity #safety
Safety and Line Capacity in Railways — An Approach in Timed CSP (YI, FM, HNN, MR), pp. 54–68.
DATEDATE-2012-KatzRZ #generative #using
Generating instruction streams using abstract CSP (YK, MR, AZ), pp. 15–20.
STOCSTOC-2012-CaiC #complexity
Complexity of counting CSP with complex weights (JYC, XC), pp. 909–920.
ICLPICLP-2012-Ostrowski
ASP modulo CSP: The clingcon system (MO), pp. 458–463.
ICLPICLP-J-2012-OstrowskiS
ASP modulo CSP: The clingcon system (MO, TS), pp. 485–503.
ICSTSAT-2012-TanjoTB #encoding #named #order #satisfiability #using
Azucar: A SAT-Based CSP Solver Using Compact Order Encoding — (TT, NT, MB), pp. 456–462.
IFMIFM-J-2009-ColvinH11 #behaviour #semantics #specification #using
A semantics for Behavior Trees using CSP with specification commands (RC, IJH), pp. 891–914.
IFMIFM-J-2009-SchneiderT11 #interface #refinement
Changing system interfaces consistently: A new refinement strategy for CSP||B (SS, HT), pp. 837–860.
FMFM-2011-Dunne #termination
Termination without √ in CSP (SD), pp. 278–292.
STOCSTOC-2011-Yoshida #algorithm #approximate #bound
Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree CSP (YY), pp. 665–674.
ICTSSICTSS-2011-CavalcantiGH #consistency #distributed #testing
Conformance Relations for Distributed Testing Based on CSP (AC, MCG, RMH), pp. 48–63.
ICSTSAT-2011-CreignouOS
Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight (NC, FO, JS), pp. 120–133.
ICSTSAT-2011-PetkeJ #encoding #order #satisfiability
The Order Encoding: From Tractable CSP to Tractable SAT (JP, PJ), pp. 371–372.
ICSTSAT-2011-TanjoTB #encoding #finite #performance
A Compact and Efficient SAT-Encoding of Finite Domain CSP (TT, NT, MB), pp. 375–376.
IFMIFM-2010-SchneiderTW #approach
A CSP Approach to Control in Event-B (SS, HT, HW), pp. 260–274.
LOPSTRLOPSTR-2010-LlorensOST #generative #graph #process
Graph Generation to Statically Represent CSP Processes (ML, JO, JS, ST), pp. 52–66.
STOCSTOC-2010-DyerR #complexity #on the
On the complexity of #CSP (MED, DR), pp. 725–734.
LICSLICS-2010-BartoK
New Conditions for Taylor Varieties and CSP (LB, MK), pp. 100–109.
SCAMSCAM-2009-LangeM #communication #named #process #thread #towards
thr2csp: Toward Transforming Threads into Communicating Sequential Processes (RCL, SM), pp. 3–12.
IFMIFM-2009-ColvinH
CSP with Hierarchical State (RC, IJH), pp. 118–135.
IFMIFM-2009-SchneiderT #interface #refinement
Changing System Interfaces Consistently: A New Refinement Strategy for CSP||B (SS, HT), pp. 103–117.
MODELSMoDELS-2009-HorvathV #constraints #modelling #problem
CSP(M): Constraint Satisfaction Problem over Models (ÁH, DV), pp. 107–121.
MODELSMoDELS-2009-HorvathV #constraints #modelling #problem
CSP(M): Constraint Satisfaction Problem over Models (ÁH, DV), pp. 107–121.
PEPMPEPM-2009-LeuschelLOST #named #slicing #specification
SOC: a slicer for CSP specifications (ML, ML, JO, JS, ST), pp. 165–168.
STOCSTOC-2009-CaiLX #problem
Holant problems and counting CSP (JyC, PL, MX), pp. 715–724.
STOCSTOC-2009-Tulsiani #reduction
CSP gaps and reductions in the lasserre hierarchy (MT), pp. 303–312.
SEFMSEFM-2008-Roggenbach #tool support
Tools for CSP (MR), pp. 213–214.
LOPSTRLOPSTR-2008-LeuschelLOST #specification #static analysis
The MEB and CEB Static Analysis for CSP Specifications (ML, ML, JO, JS, ST), pp. 103–118.
STOCSTOC-2008-Raghavendra #algorithm #question
Optimal algorithms and inapproximability results for every CSP? (PR), pp. 245–254.
ICLPICLP-2008-Gosti #game studies
Resolving CSP with Naming Games (GG), pp. 807–808.
IFMIFM-2007-Marr
Capturing Conflict and Confusion in CSP (CM), pp. 413–438.
AGTIVEAGTIVE-2007-VarroABBDGGGKNRW #case study #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-VMTGT-VMT-2007-BisztrayH #process #using #verification
Rule-Level Verification of Business Process Transformations using CSP (DB, RH).
ICSTSAT-2007-AnsoteguiBLM #satisfiability
Mapping CSP into Many-Valued SAT (CA, MLB, JL, FM), pp. 10–15.
SACSAC-2006-ZytnickiGS #consistency
A new local consistency for weighted CSP dedicated to long domains (MZ, CG, TS), pp. 394–398.
FMFM-2005-Bolton
Adding Conflict and Confusion to CSP (CB), pp. 205–220.
FMFM-2005-ButlerL #specification #verification
Combining CSP and B for Specification and Property Verification (MJB, ML), pp. 221–236.
IFMIFM-2005-SchneiderTE #component #named #verification
Chunks: Component Verification in CSP||B (SAS, HT, NE), pp. 89–108.
IFMIFM-2005-WeiH
Embedding the Stable Failures Model of CSP in PVS (KW, JH), pp. 246–265.
ICEISICEIS-v3-2005-CapelH #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.
AdaEuropeAdaEurope-2005-AtiyaK
Extending Ravenscar with CSP Channels (DAA, SK), pp. 79–90.
GTTSEGTTSE-2005-BenavidesSMC #analysis #automation #feature model #java #modelling #using
Using Java CSP Solvers in the Automated Analyses of Feature Models (DB, SS, PTMA, ARC), pp. 399–408.
TACASTACAS-2005-IsobeR #proving #refinement #theorem proving
A Generic Theorem Prover of CSP Refinement (YI, MR), pp. 108–123.
IFMIFM-2004-WangRL #independence #reachability
Relating Data Independent Trace Checks in CSP with UNITY Reachability under a Normality Assumption (XW, AWR, RL), pp. 247–266.
IFMIFM-2004-Winter #behaviour #formal method
Formalising Behaviour Trees with CSP (KW), pp. 148–167.
ASEASE-2004-HopcroftB #development
Combining the Box Structure Development Method and CSP (PJH, GHB), pp. 340–345.
SEFMSEFM-2003-NgB #diagrams #formal method #towards #uml
Towards Formalizing UML State Diagrams in CSP (MYN, MJB), p. 138–?.
IFMIFM-2002-BoltonD #refinement
Refinement in Object-Z and CSP (CB, JD), pp. 225–244.
IFMIFM-2002-BrookeP #design #visual notation
The Design of a Tool-Supported Graphical Notation for Timed CSP (PJB, RFP), pp. 299–318.
IFMIFM-2002-Smith #concurrent #integration #realtime #specification
An Integration of Real-Time Object-Z and CSP for Specifying Concurrent Real-Time Systems (GS), pp. 267–285.
FMFME-2001-LeuschelMC #how #ltl #model checking #refinement
How to Make FDR Spin LTL Model Checking of CSP by Refinement (ML, TM, AC), pp. 99–118.
PADLPADL-2001-Leuschel #design #implementation #prolog #specification
Design and Implementation of the High-Level Specification Language CSP(LP) in Prolog (ML), pp. 14–28.
FASEFASE-2001-FischerOW #diagrams #uml
A CSP View on UML-RT Structure Diagrams (CF, ERO, HW), pp. 91–108.
IFMIFM-2000-DerrickS #refinement
Structural Refinement in Object-Z/CSP (JD, GS), pp. 194–213.
SACSAC-2000-MillerS #concurrent #process
Eclectic CSP: A Language of Concurrent Processes (QM, BS), pp. 840–842.
FMFM-v1-1999-Butler #approach #named
csp2B: A Practical Approach to Combining CSP and B (MJB), pp. 490–508.
IFMIFM-1999-MacCollC #interactive #specification
Specifying Interactive Systems in Object-Z and CSP (IM, DAC), pp. 335–352.
IFMIFM-1999-Suhl #integration #named
RT-Z: An Integration of Z and timed CSP (CS), pp. 29–48.
TOOLSTOOLS-ASIA-1999-LiZL #communication #process #type system
The Typing of Communicating Sequential Processes (WL, XZ, SL), pp. 61–66.
FMFM-1998-GoldsmithZ #validation #verification
Critical Systems Validation and Verification with CSP and FDR (MG, IZ), pp. 243–250.
ICSEICSE-1998-MahonyD
Blending Object-Z and Timed CSP: An Introduction to TCOZ (BPM, JSD), pp. 95–104.
FMFME-1997-Smith #concurrent #integration #semantics #specification
A Semantic Integration of Object-Z and CSP for the Specification of Concurrent Systems (GS), pp. 62–81.
FMFME-1997-TejW #higher-order
A Corrected Failure Divergence Model for CSP in Isabelle/HOL (HT, BW), pp. 318–337.
WRLARWLW-1996-Castro #using
Solving binary CSP using computational systems (CC), pp. 246–265.
TACASTACAS-1995-RoscoeGGHJS #concurrent #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.
FMVDME-1991-Butler #behaviour
Behavioural Extension for CSP (MJB), pp. 254–267.
ICMLML-1991-Day #heuristic #learning #problem
Learning Variable Descriptors for Applying Heuristics Across CSP Problems (DSD), pp. 127–131.
PPoPPPPoPP-1991-BaconS #communication #parallel #process
Optimistic Parallelization of Communicating Sequential Processes (DFB, RES), pp. 155–166.
ICALPICALP-1986-ReedR #communication #process
A Timed Model for Communicating Sequential Processes (GMR, AWR), pp. 314–323.
LICSLICS-1986-Brookes #concurrent #correctness #proving #semantics
A Semantically Based Proof System for Partial Correctness and Deadlock in CSP (SDB), pp. 58–65.
ICALPICALP-1985-Bouge #implementation
Repeated Synchronous Snapshots and Their Implementation in CSP (LB), pp. 63–70.
ICALPICALP-1984-RonRP #hardware #implementation #verification
A Hardware Implementation of the CSP Primitives and its Verification (DR, FR, AP), pp. 423–435.
ICALPICALP-1983-Brookes #on the
On the Relationship of CCS and CSP (SDB), pp. 83–96.
ICALPICALP-1980-CousotC #analysis #communication #process #semantics
Semantic Analysis of Communicating Sequential Processes (Shortened Version) (PC, RC), pp. 119–133.
STOCSTOC-1979-Ladner #communication #complexity #problem #process
The Complexity of Problems in Systems of Communicating Sequential Processes (REL), pp. 214–223.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.