## Stem ccs$ (all stems)

### 21 papers:

- FoSSaCS-2009-ArandaVV #on the #power of #replication #strict
- On the Expressive Power of Restriction and Priorities in CCS with Replication (JA, FDV, CV), pp. 242–256.
- FoSSaCS-2007-HirschkoffP #congruence #π-calculus
- A Distribution Law for CCS and a New Congruence Result for the π-Calculus (DH, DP), pp. 228–242.
- ICALP-v2-2006-AcetoFIL #communication #equation #finite
- A Finite Equational Base for CCS with Left Merge and Communication Merge (LA, WF, AI, BL), pp. 492–503.
- WRLA-2004-CiobanuL05 #communication #concurrent
- Communicating Concurrent Objects in HiddenCCS (GC, DL), pp. 353–373.
- WRLA-2002-VerdejoM #implementation #maude
- Implementing CCS in Maude 2 (AV, NMO), pp. 282–300.
- IFM-1999-Grosse-Rhode #algebra #comparison #composition #protocol #specification
- A Compositional Comparison of Specifications of the Alternating Bit Protocol in CCS and UNITY Based on Algebra Transformation Systems (MGR), pp. 253–272.
- ASE-1998-MonroyBG #equation #verification
- Planning Equational Verification in CCS (RM, AB, IG), pp. 43–52.
- WRLA-1998-CarabettaDG #logic #semantics
- CCS semantics via proved transition systems and rewriting logic (GC, PD, FG), pp. 369–387.
- RWLW-1996-GadducciM
- Tiles, rewriting rules and CCS (FG, UM), pp. 1–19.
- ISSTA-1996-BarjaktarovicCJ #functional #kernel #protocol #specification #using #verification
- Formal Specification and Verification of the Kernel Functional Unit of the OSI Session Layer Protocol and Service Using CCS (MB, SKC, KJ), pp. 270–279.
- DAC-1995-Albrecht #concurrent #configuration management #design #simulation
- Concurrent Design Methodology and Configuration Management of the SIEMENS EWSD — CCS7E Processor System Simulation (TWA), pp. 222–227.
- ICALP-1991-Yi #realtime
- CCS + Time = An Interleaving Model for Real Time Systems (WY0), pp. 217–228.
- CAV-1991-EndersFT #generative #model checking
- Generating BDDs for Symbolic Model Checking in CCS (RE, TF, DT), pp. 203–213.
- CAV-1991-FrancescoI #process #semantics
- A Semantic Driven Method to Check the Finiteness of CCS Processes (NDF, PI), pp. 266–276.
- LICS-1991-CamilleriW
- CCS with Priority Choice (JC, GW), pp. 246–255.
- LICS-1990-Moller #axiom #finite
- The Nonexistence of Finite Axiomatisations for CCS Congruences (FM), pp. 142–153.
- ICALP-1985-Stirling #composition #proving #set
- A Complete Compositional Model Proof System for a Subset of CCS (CS), pp. 475–486.
- ICALP-1984-GoltzM #on the #petri net
- On the Relationship of CCS and Petri Nets (UG, AM), pp. 196–208.
- ICALP-1984-GrafS #congruence #finite
- A Modal Characterization of Observational Congruence on Finite Terms of CCS (SG, JS), pp. 222–234.
- ICALP-1983-Brookes #csp #on the
- On the Relationship of CCS and CSP (SDB), pp. 83–96.
- ICALP-1982-Winskel #semantics
- Event Structure Semantics for CCS and Related Languages (GW), pp. 561–576.