The following pages link to Giorgio Delzanno (Q198013):
Displaying 50 items.
- Reachability problems in BioAmbients (Q418830) (← links)
- Validating XML document adaptations via hedge automata transformations (Q477202) (← links)
- A classification of the expressive power of well-structured transition systems (Q553290) (← links)
- On the verification of membrane systems with dynamic structure (Q609035) (← links)
- Parameterized verification of time-sensitive models of ad hoc network protocols (Q896913) (← links)
- Reachability analysis of fragments of mobile ambients in AC term rewriting (Q939167) (← links)
- Approximated parameterized verification of infinite-state processes with global conditions (Q1039841) (← links)
- An abstract machine for asynchronous programs with closures and priority queues (Q1685782) (← links)
- Reachability predicates for graph assertions (Q1708656) (← links)
- Constraint-based verification of parameterized cache coherence protocols (Q1878907) (← links)
- On the coverability and reachability languages of monotonic extensions of Petri nets (Q1935777) (← links)
- Parameterised verification of publish/subscribe networks with exception handling (Q2330595) (← links)
- Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols (Q2643568) (← links)
- (Q2754073) (← links)
- (Q2763635) (← links)
- (Q2763695) (← links)
- (Q2769606) (← links)
- (Q2847412) (← links)
- On Reachability and Spatial Reachability in Fragments of BioAmbients (Q2864197) (← links)
- Push-Down Automata with Gap-Order Constraints (Q2948245) (← links)
- (Q2957507) (← links)
- Adding Data Registers to Parameterized Networks with Broadcast (Q2968525) (← links)
- On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks (Q3000628) (← links)
- AUTOMATIC VERIFICATION OF DIRECTORY-BASED CONSISTENCY PROTOCOLS WITH GRAPH CONSTRAINTS (Q3016215) (← links)
- On the Verification of Timed Ad Hoc Networks (Q3172855) (← links)
- Parameterized Verification and Model Checking for Distributed Broadcast Protocols (Q3192219) (← links)
- Constraint-based automatic verification of abstract models of multithreaded programs (Q3430665) (← links)
- Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations (Q3447696) (← links)
- Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols (Q3522925) (← links)
- Reachability Analysis of Mobile Ambients in Fragments of AC Term Rewriting (Q3525157) (← links)
- A Biologically Inspired Model with Fusion and Clonation of Membranes (Q3543334) (← links)
- Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data (Q3564891) (← links)
- Static Analysis, Abstract Interpretation and Verification in (Constraint Logic) Programming (Q3578394) (← links)
- Constrained Monotonic Abstraction: A CEGAR for Parameterized Verification (Q3584923) (← links)
- Parameterized Verification of Ad Hoc Networks (Q3584939) (← links)
- Comparing the Expressive Power of Well-Structured Transition Systems (Q3608407) (← links)
- A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations (Q3618568) (← links)
- MONOTONIC ABSTRACTION: ON EFFICIENT VERIFICATION OF PARAMETERIZED SYSTEMS (Q3646165) (← links)
- Automatic Verification of Directory-Based Consistency Protocols (Q3646250) (← links)
- (Q4223026) (← links)
- An effective fixpoint semantics for linear logic programs (Q4452612) (← links)
- (Q4472236) (← links)
- (Q4472240) (← links)
- (Q4473980) (← links)
- (Q4475639) (← links)
- (Q4518906) (← links)
- (Q4551160) (← links)
- Model checking linear logic specifications (Q4669651) (← links)
- Logic-based Verification of the Distributed Dining Philosophers Protocol (Q4686516) (← links)
- (Q4737126) (← links)
