The following pages link to Nicoletta De Francesco (Q816204):
Displaying 26 items.
- Reduced models for efficient CCS verification (Q816205) (← links)
- (Q974110) (redirect page) (← links)
- Using abstract interpretation to add type checking for interfaces in Java bytecode verification (Q974112) (← links)
- (Q990117) (redirect page) (← links)
- Partial model checking via abstract interpretation (Q990121) (← links)
- A framework for data-flow distributed processing (Q1156480) (← links)
- A transformation system for concurrent processes (Q1284702) (← links)
- Axiomatizing CCS, nets and processes (Q1314538) (← links)
- Proving finiteness of CCS processes by non-standard semantics (Q1323345) (← links)
- Abstract interpretation of trace semantics for concurrent calculi (Q1606931) (← links)
- Towards a logical semantics for pure Prolog (Q1818324) (← links)
- Abstract interpretation of operational semantics for secure information flow. (Q1853040) (← links)
- A Petri nets semantics for data flow networks (Q1894678) (← links)
- Algebraic computational models of OR-parallel execution of Prolog (Q1920217) (← links)
- Selective mu-calculus and formula-based equivalence of transition systems (Q1970206) (← links)
- Instruction-level security analysis for information flow in stack-based assembly languages (Q2381502) (← links)
- Efficient Verification of a Multicast Protocol for Mobile Computing (Q2747744) (← links)
- Finite Approximations for Model Checking Non-finite-state Processes (Q2747754) (← links)
- (Q2775857) (← links)
- A FORMULA-DRIVEN MODULAR ATTACK ON STATE EXPLOSION (Q3021982) (← links)
- (Q3146271) (← links)
- Development of a debugger for a concurrent language (Q3713583) (← links)
- (Q4461956) (← links)
- (Q4493883) (← links)
- (Q4818731) (← links)
- Analyzing Information Flow Properties in Assembly Code by Abstract Interpretation (Q4828445) (← links)
