Silvia Crafa

Orcid: 0000-0003-0993-4734

According to our database1, Silvia Crafa authored at least 50 papers between 2000 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Smart contract languages: A comparative analysis.
Future Gener. Comput. Syst., 2025

2024
Algorithmic Thinking for the Legal Writing: The Case of Italian Election Law.
Digit. Soc., August, 2024

2023
Pacta sunt servanda: Legal contracts in <i>Stipula</i>.
Sci. Comput. Program., 2023

ALGOMOVE - A Move Embedding for Algorand.
Proceedings of the IEEE International Conference on Blockchain, 2023

Moral Exercises for Human Oversight of Algorithmic Decision-Making.
Proceedings of the Discussion Papers, 2023

2022
From Legal Contracts to Legal Calculi: the code-driven normativity.
Proceedings of the Proceedings Combined 29th International Workshop on Expressiveness in Concurrency and 19th Workshop on Structural Operational Semantics, 2022

Liquidity Analysis in Resource-Aware Programming.
Proceedings of the Formal Aspects of Component Software - 18th International Conference, 2022

Programming Legal Contracts - A Beginners Guide to Stipula.
Proceedings of the Logic of Software. A Tasting Menu of Formal Methods, 2022

2021
Pacta sunt servanda: legal contracts in Stipula.
CoRR, 2021

2019
Solidity 0.5: when typed does not mean type safe.
CoRR, 2019

Is Solidity Solid Enough?
Proceedings of the Financial Cryptography and Data Security, 2019

2018
Proof search in a context-sensitive logic for molecular biology.
J. Log. Comput., 2018

On the Reactive Nature of Financial Networks.
Proceedings of the 19th Italian Conference on Theoretical Computer Science, 2018

2017
The Chemical Approach to Typestate-Oriented Programming.
ACM Trans. Program. Lang. Syst., 2017

2016
A quarter of a century of CONCUR - Report on the 2014 and 2015 editions of the Conference on Concurrency Theory.
Bull. EATCS, 2016

On the chemistry of typestate-oriented actors.
CoRR, 2016

2015
The role of concurrency in an evolutionary view of programming abstractions.
J. Log. Algebraic Methods Program., 2015

Actors vs Shared Memory: two models at work on Big Data application frameworks.
CoRR, 2015

Modelling the Evolution of Programming Languages.
CoRR, 2015

Fine-Grained Detection of Privilege Escalation Attacks on Browser Extensions.
Proceedings of the Programming Languages and Systems, 2015

2014
Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions.
ACM Trans. Comput. Log., 2014

A Logic for True Concurrency.
J. ACM, 2014

Semantics of (Resilient) X10.
Proceedings of the ECOOP 2014 - Object-Oriented Programming - 28th European Conference, Uppsala, Sweden, July 28, 2014

Hereditary History-Preserving Bisimilarity: Logics and Automata.
Proceedings of the Programming Languages and Systems - 12th Asian Symposium, 2014

2013
Causality in concurrent systems
CoRR, 2013

2012
Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation.
Formal Methods Syst. Des., 2012

Behavioural Types for Actor Systems
CoRR, 2012

Event Structure Semantics of Parallel Extrusion in the Pi-Calculus.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

2011
Saving Space in a Time Efficient Simulation Algorithm.
Fundam. Informaticae, 2011

Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

A Spectrum of Behavioral Relations over LTSs on Probability Distributions.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

2009
A type system for Discretionary Access Control.
Math. Struct. Comput. Sci., 2009

2008
PicNIc - Pi-calculus non-interference checker.
Proceedings of the 8th International Conference on Application of Concurrency to System Design (ACSD 2008), 2008

2007
Controlling information release in the pi-calculus.
Inf. Comput., 2007

Compositional Event Structure Semantics for the Internal <i>pi</i> -Calculus.
Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

2006
P-congruences as non-interference for the pi-calculus.
Proceedings of the 2006 ACM workshop on Formal methods in security engineering, 2006

2005
Communication and mobility control in boxed ambients.
Inf. Comput., 2005

A Theory of Noninterference for the pi-Calculus.
Proceedings of the Trustworthy Global Computing, International Symposium, 2005

2004
Access control for mobile agents: The calculus of boxed ambients.
ACM Trans. Program. Lang. Syst., 2004

Type Based Discretionary Access Control.
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003
Secrecy in Untrusted Networks.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
Typed interpretations of extensible objects.
ACM Trans. Comput. Log., 2002

Information Flow Security for Boxed Ambients.
Proceedings of the Foundations of Wide Area Network Computing, 2002

Communication Interference in Mobile Boxed Ambients.
Proceedings of the FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 2002

A Survey of Name-Passing Calculi and Crypto-Primitives.
Proceedings of the Foundations of Security Analysis and Design II, 2002

2001
An overview of Boxed Ambients.
Proceedings of the Theory of Concurrency, Higher Order Languages and Types, 2001

Boxed Ambients.
Proceedings of the Theoretical Aspects of Computer Software, 4th International Symposium, 2001

Subtyping and Matching for Mobile Objects.
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

Reasoning about Security in Mobile Ambients.
Proceedings of the CONCUR 2001, 2001

2000
Typed Mobile Objects.
Proceedings of the CONCUR 2000, 2000


  Loading...