LOPSTR 2023 Contributors

co-located with SPLASH 2023

Filter

Role Type

Contributing to

Number of Roles

Country

Results (38)

B Anna BambergerBamberger, Anna From Static to Dynamic Access Control Policies via Attribute-Based Category Mining
Dmitri BoulytchevBoulytchev, Dmitri Saint Petersburg State UniversityRussia Relational Solver for Java Generics Type System
Juliana BowlesBowles, Juliana University of St Andrews, St Andrews, UK Session Chair of Session VI (part of LOPSTR) A Novel EGs-Based Framework for Systematic Propositional-Formula Simplification
C Marco CarboneCarbone, Marco IT University of Copenhagen A Logical Interpretation of Asynchronous Multiparty Compatibility
Emmanuel ChaillouxChailloux, Emmanuel UPMC, France A Reusable Machine-Calculus for Automated Resource Analyses
D Emanuele De AngelisDe Angelis, Emanuele CNR-IASIItaly Constrained Horn Clauses Satisfiability via Catamorphic Abstractions
Remi DesmartinDesmartin, Remi Heriot-Watt University Towards a Certified Proof Checker for Deep Neural Network Verification
E Santiago EscobarEscobar, Santiago Session Chair of Session I (part of LOPSTR)
F Maribel FernandezFernandez, Maribel King's College LondonUnited Kingdom From Static to Dynamic Access Control Policies via Attribute-Based Category Mining Unification Modulo Equational Theories in Languages with Binding Operators
Fabio FioravantiFioravanti, Fabio University of Chieti-PescaraItaly Constrained Horn Clauses Satisfiability via Catamorphic Abstractions
Jordina Francès de MasFrancès de Mas, Jordina University of St Andrews, St Andrews, UK A Novel EGs-Based Framework for Systematic Propositional-Formula Simplification
G John P. GallagherGallagher, John P. Roskilde University Session Chair of Session IV (part of LOPSTR) Transforming Big-Step to Small-Step Semantics Using Interpreter Specialisation
Robert GlückGlück, Robert University of CopenhagenDenmark Session Chair of Session I (part of LOPSTR) Opening Remarks
H Michael HanusHanus, Michael Kiel UniversityGermany Session Chair of Session II (part of LOPSTR)
Manuel HermenegildoHermenegildo, Manuel Technical University of Madrid (UPM) and IMDEA Software InstituteSpain A Rule-Based Approach for Designing and Composing Abstract Domains On-The-Fly Verification via Incremental, Interactive Abstract Interpretation with CiaoPP and VeriFly Transforming Big-Step to Small-Step Semantics Using Interpreter Specialisation
Zhenjiang HuHu, Zhenjiang Peking UniversityChina Design Datalog Templates for Synthesizing Bidirectional Programs from Tabular Examples
I Omri IsacIsac, Omri The Hebrew University of Jerusalem Towards a Certified Proof Checker for Deep Neural Network Verification
Dmitry IvanovIvanov, Dmitry TomTom Relational Solver for Java Generics Type System
J Daniel Jurjo RivasJurjo Rivas, Daniel IMDEA Software Institute and T.U. of Madrid (UPM)Spain A Rule-Based Approach for Designing and Composing Abstract Domains
K Guy KatzKatz, Guy Hebrew UniversityIsrael Towards a Certified Proof Checker for Deep Neural Network Verification
Chantal KellerKeller, Chantal Université Paris SaclayFrance Session Chair of Session III (part of LOPSTR)
Ekaterina KomandantskayaKomandantskaya, Ekaterina Heriot-Watt University, UKUnited Kingdom Towards a Certified Proof Checker for Deep Neural Network Verification
Dmitry KosarevKosarev, Dmitry Saint-Petersburg State University Relational Solver for Java Generics Type System
Marija KulašKulaš, Marija Fernuniversität in HagenGermany A Term Matching Algorithm and Substitution Generality
L Petr LozovLozov, Petr Sain Petersburg State University, SPbGU Relational Solver for Java Generics Type System
Pedro López-GarcíaLópez-García, Pedro IMDEA Software Institute A Rule-Based Approach for Designing and Composing Abstract Domains Transforming Big-Step to Small-Step Semantics Using Interpreter Specialisation
M Sonia MarinMarin, Sonia University of BirminghamUnited Kingdom A Logical Interpretation of Asynchronous Multiparty Compatibility
José MoralesMorales, José IMDEA Software InstituteSpain A Rule-Based Approach for Designing and Composing Abstract Domains Transforming Big-Step to Small-Step Semantics Using Interpreter Specialisation
N Bach Nguyen TrongNguyen Trong, Bach Design Datalog Templates for Synthesizing Bidirectional Programs from Tabular Examples
P Grant PassmorePassmore, Grant Imandra Inc. Towards a Certified Proof Checker for Deep Neural Network Verification
Alberto PettorossiPettorossi, Alberto University of Rome Tor Vergata, Italy Constrained Horn Clauses Satisfiability via Catamorphic Abstractions
Maurizio ProiettiProietti, Maurizio CNR-IASIItaly Session Chair of Session V (part of LOPSTR) Constrained Horn Clauses Satisfiability via Catamorphic Abstractions
S Carsten SchürmannSchürmann, Carsten IT University of CopenhagenDenmark A Logical Interpretation of Asynchronous Multiparty Compatibility
Kathrin StarkStark, Kathrin Heriot-Watt UniversityUnited Kingdom Towards a Certified Proof Checker for Deep Neural Network Verification
Hector SuzanneSuzanne, Hector LIP6 - Sorbonne Université & CNRSFrance A Reusable Machine-Calculus for Automated Resource Analyses
T Kanae TsushimaTsushima, Kanae National Institute of Informatics, JapanJapan Design Datalog Templates for Synthesizing Bidirectional Programs from Tabular Examples
V Wim VanhoofVanhoof, Wim University of Namur Predicate Anti-unification in (Constraint) Logic Programming
Y Gonzague YernauxYernaux, Gonzague University of Namur Predicate Anti-unification in (Constraint) Logic Programming