Silvia Ghilezan

Orcid: 0000-0003-2253-8285

Affiliations:
  • University of Novi Sad, Serbia


According to our database1, Silvia Ghilezan authored at least 58 papers between 1993 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A Simple Python Testbed for Federated Learning Algorithms.
CoRR, 2023

Correct Orchestration of Federated Learning Generic Algorithms: Formalisation and Verification in CSP.
Proceedings of the Engineering of Computer-Based Systems - 8th International Conference, 2023

2022
Semantics for Combinatory Logic With Intersection Types.
Frontiers Comput. Sci., 2022

Logic of Combinatory Logic.
CoRR, 2022

Federating digital contact tracing using structured overlay networks.
Comput. Sci. Inf. Syst., 2022

2021
Precise subtyping for asynchronous multiparty sessions.
Proc. ACM Program. Lang., 2021

L-types for resource awareness: an implicit name approach.
CoRR, 2021

Type Systems for Trustworthiness -- from Mathematics to Large-Scale Systems.
Proceedings of the ECBS 2021: 7th Conference on the Engineering of Computer Based Systems, 2021

2020
Kripke-style Semantics and Completeness for Full Simply Typed Lambda Calculus.
J. Log. Comput., 2020

Preserving Privacy in Caller ID Applications.
Proceedings of the Privacy and Identity Management: 15th IFIP WG 9.2, 2020

Towards Probabilistic Reasoning in Type Theory - The Intersection Type Case.
Proceedings of the Foundations of Information and Knowledge Systems, 2020

Logic and Applications - LAP Meeting.
Proceedings of the Logic, 2020

2019
Precise subtyping for synchronous multiparty sessions.
J. Log. Algebraic Methods Program., 2019

The Duality of Classical Intersection and Union Types.
Fundam. Informaticae, 2019

Formal Verification of Python Software Transactional Memory Serializability Based on the Push/Pull Semantic Model.
Proceedings of the 6th Conference on the Engineering of Computer Based Systems, 2019

2018
Probabilistic Reasoning About Simply Typed Lambda Terms.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2018

2017
Linked data privacy.
Math. Struct. Comput. Sci., 2017

Characterization of strong normalizability for a sequent lambda calculus with co-control.
Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming, Namur, Belgium, October 09, 2017

An approach to formal verification of python software transactional memory.
Proceedings of the Fifth European Conference on the Engineering of Computer-Based Systems, 2017

2016
Encoding of Multi Level <i>S</i>-Threshold Functions.
J. Multiple Valued Log. Soft Comput., 2016

Denotational and Operational Preciseness of Subtyping: A Roadmap - Dedicated to Frank de Boer on the Occasion of His 60th Birthday.
Proceedings of the Theory and Practice of Formal Methods, 2016

2015
Combining behavioural types with security analysis.
J. Log. Algebraic Methods Program., 2015

A Typed Model for Dynamic Authorizations.
Proceedings of the Proceedings Eighth International Workshop on Programming Language Approaches to Concurrency- and Communication-cEntric Software, 2015

Precise subtyping for synchronous multiparty sessions.
Proceedings of the Proceedings Eighth International Workshop on Programming Language Approaches to Concurrency- and Communication-cEntric Software, 2015

2014
Dynamic Role Authorization in Multiparty Conversations.
Proceedings of the Proceedings Third Workshop on Behavioural Types, 2014

Resource control and intersection types: an intrinsic connection.
CoRR, 2014

Preciseness of Subtyping on Intersection and Union Types.
Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

On the Number of S-Threshold Functions on Not Necessarily Binary Input.
Proceedings of the IEEE 44th International Symposium on Multiple-Valued Logic, 2014

2013
A journey through resource control lambda calculi and explicit substitution using intersection types (an account).
CoRR, 2013

2012
Preface.
Fundam. Informaticae, 2012

Computational interpretation of classical logic with explicit structural rules
CoRR, 2012

2011
Resource control and strong normalisation
CoRR, 2011

Intersection Types for the Resource Control Lambda Calculi.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2011 - 8th International Colloquium, Johannesburg, South Africa, August 31, 2011

2010
Types for Role-Based Access Control of Dynamic Web Data.
Proceedings of the Functional and Constraint Logic Programming, 2010

2009
Intuitionistic Sequent-Style Calculus with Explicit Structural Rules.
Proceedings of the Logic, Language, and Computation, 2009

2008
Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: Extending the Coppo-Dezani heritage.
Theor. Comput. Sci., 2008

Security types for dynamic web data.
Theor. Comput. Sci., 2008

An approach to call-by-name delimited continuations.
Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2008

2007
Partitioning Finite d-Dimensional Integer Grids with Applications.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Separating Points by Parallel Hyperplanes - Characterization Problem.
IEEE Trans. Neural Networks, 2007

Characterising Strongly Normalising Intuitionistic Sequent Terms.
Proceedings of the Types for Proofs and Programs, International Conference, 2007

2006
Security Types for Dynamic Web Data.
Proceedings of the Trustworthy Global Computing, Second Symposium, 2006

2005
Strong Normalization of the Dual Classical Sequent Calculus.
Proceedings of the Logic for Programming, 2005

2004
Behavioural inverse limit lambda-models.
Theor. Comput. Sci., 2004

Intersection and Union Types in the lambda-my-my/tilde-calculus.
Proceedings of the Third International Workshop on Intersection Types and Related Systems, 2004

Characterizing strong normalization in a language with control operators.
Proceedings of the 6th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2004

2003
Classical Proofs, Typed Processes, and Intersection Types: Extended Abstract.
Proceedings of the Types for Proofs and Programs, International Workshop, 2003

2002
Reducibility: A Ubiquitous Method in Lambda Calculus with Intersection Types.
Proceedings of the Intersection Types and Related Systems, 2002

Two Behavioural Lambda Models.
Proceedings of the Types for Proofs and Programs, Second International Workshop, 2002

2001
Full Intersection Types and Topologies in Lambda Calculus.
J. Comput. Syst. Sci., 2001

Confluence of Untyped Lambda Calculus via Simple Types.
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

2000
Lambda terms for natural deduction, sequent calculus and cut elimination.
J. Funct. Program., 2000

Intersection Types and Topologies and Lambda Calculus.
Proceedings of the ICALP Workshops 2000, 2000

1997
The "Relevance" of Intersection and Union Types.
Notre Dame J. Formal Log., 1997

1996
Strong Normalization and Typability with Intersection Types.
Notre Dame J. Formal Log., 1996

Generalized Finiteness of Developments in Typed Lambda Calculi.
J. Autom. Lang. Comb., 1996

1994
Application of Typed Lambda Calculi in the Untyped Lambda Calculus.
Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994

1993
Inhabitation in Intersection and Union Type Assignment Systems.
J. Log. Comput., 1993


  Loading...