The following pages link to Paola Inverardi (Q672233):
Displaying 29 items.
- Infinite normal forms for non-linear term rewriting systems (Q672235) (← links)
- Deciding observational congruence of finite-state CCS expressions by rewriting (Q673974) (← links)
- A rewriting strategy to verify observational congruence (Q915472) (← links)
- Failure-free coordinators synthesis for component-based architectures (Q931099) (← links)
- Automatic verification of distributed systems: the process algebra approach. (Q960505) (← links)
- Complete sets of axioms for finite basic LOTOS behavioural equivalences (Q1199556) (← links)
- Proving finiteness of CCS processes by non-standard semantics (Q1323345) (← links)
- Automatizing parametric reasoning on distributed concurrent systems (Q1346610) (← links)
- Software architectures and coordination models (Q1395702) (← links)
- Uncovering architectural mismatch in component behavior (Q1806123) (← links)
- Static analysis of real-time component-based systems configurations (Q1870849) (← links)
- Automated synthesis of application-layer connectors from automata-based specifications (Q2424673) (← links)
- On relating functional specifications to architectural specifications: A case study (Q2581539) (← links)
- Finite Approximations for Model Checking Non-finite-state Processes (Q2747754) (← links)
- (Q2764108) (← links)
- Automated Synthesis of Application-Layer Connectors from Automata-Based Specifications (Q2799159) (← links)
- Dynamically Evolvable Dependable Software: From Oxymoron to Reality (Q3507373) (← links)
- (Q3814799) (← links)
- (Q3814841) (← links)
- (Q4005177) (← links)
- (Q4035244) (← links)
- (Q4413730) (← links)
- (Q4437021) (← links)
- (Q4458491) (← links)
- (Q4934252) (← links)
- Yeast: A case study for a practical use of formal methods (Q5044729) (← links)
- Rational rewriting (Q5096902) (← links)
- Coordination Models and Languages (Q5717737) (← links)
- A strategy to deal with divergent rewrite systems (Q5881210) (← links)
