The following pages link to Elvira Albert (Q232928):
Displaying 50 items.
- Quantified abstract configurations of distributed systems (Q493525) (← links)
- Cost analysis of object-oriented bytecode programs (Q764297) (← links)
- Lower-bound synthesis using loop specialization and Max-SMT (Q832313) (← links)
- Resource-usage-aware configuration in software product lines (Q898611) (← links)
- Abstraction-carrying code: a model for mobile code safety (Q949170) (← links)
- Type-based homeomorphic embedding for online termination (Q989516) (← links)
- A residualizing semantics for the partial evaluation of functional logic programs. (Q1853170) (← links)
- May-happen-in-parallel analysis with condition synchronization (Q1990482) (← links)
- Actor-based model checking for software-defined networks (Q1996852) (← links)
- SDN-actors: modeling and verification of SDN programs (Q2024371) (← links)
- Resource analysis of distributed systems (Q2026780) (← links)
- Certified abstract cost analysis (Q2044174) (← links)
- Using automated reasoning techniques for enhancing the efficiency and security of (Ethereum) smart contracts (Q2104490) (← links)
- Context-sensitive dynamic partial order reduction (Q2151268) (← links)
- A multi-domain incremental analysis engine and its application to incremental resource analysis (Q2346994) (← links)
- Rely-guarantee termination and cost analyses of loops with concurrent interleavings (Q2398172) (← links)
- A formal, resource consumption-preserving translation of actors to Haskell (Q2409724) (← links)
- Closed-form upper bounds in static cost analysis (Q2429987) (← links)
- Operational semantics for declarative multi-paradigm languages (Q2456574) (← links)
- (Q2743695) (← links)
- (Q2763647) (← links)
- (Q2766540) (← links)
- (Q2767032) (← links)
- (Q2843603) (← links)
- May-Happen-in-Parallel Analysis for Priority-Based Scheduling (Q2870112) (← links)
- Automatic Inference of Resource Consumption Bounds (Q2891436) (← links)
- Certificate size reduction in abstraction-carrying code (Q2909518) (← links)
- On the Inference of Resource Usage Upper and Lower Bounds (Q2946710) (← links)
- More Precise Yet Widely Applicable Cost Analysis (Q3075469) (← links)
- Efficient local unfolding with ancestor stacks (Q3087806) (← links)
- A Transformational Approach to Resource Analysis with Typed-Norms (Q3453647) (← links)
- Test Case Generation of Actor Systems (Q3460568) (← links)
- Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis (Q3522073) (← links)
- Test case generation for object-oriented imperative languages in CLP (Q3585175) (← links)
- Abstract Interpretation with Specialized Definitions (Q3613381) (← links)
- Test Data Generation of Bytecode by CLP Partial Evaluation (Q3617426) (← links)
- (Q4217931) (← links)
- (Q4413065) (← links)
- (Q4421874) (← links)
- Parallel Cost Analysis (Q4617976) (← links)
- (Q4808813) (← links)
- Resource-Driven CLP-Based Test Case Generation (Q4909311) (← links)
- From Object Fields to Local Variables: A Practical Approach to Field-Sensitive Analysis (Q4930719) (← links)
- A Transformational Approach to Resource Analysis with Typed-norms Inference (Q4957197) (← links)
- A Formal, Resource Consumption-Preserving Translation from Actors with Cooperative Scheduling to Haskell* (Q4988924) (← links)
- May-Happen-in-Parallel Analysis with Returned Futures (Q5096077) (← links)
- Resource Analysis driven by (Conditional) Termination Proofs (Q5108498) (← links)
- Termination and Cost Analysis of Loops with Concurrent Interleavings (Q5166699) (← links)
- May-Happen-in-Parallel Analysis for Actor-Based Concurrency (Q5277912) (← links)
- Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates (Q5302883) (← links)
