Pierpaolo Degano

Orcid: 0000-0002-8070-4838

Affiliations:
  • University of Pisa, Italy


According to our database1, Pierpaolo Degano authored at least 200 papers between 1979 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Formally verifying security protocols built on watermarking and jamming.
Comput. Secur., May, 2023

2022
Automatic Fair Exchanges.
CoRR, 2022

IFCIL: An Information Flow Configuration Language for SELinux (Extended Version).
CoRR, 2022

Can my firewall system enforce this policy?
Comput. Secur., 2022

Towards effective preservation of robust safety properties.
Proceedings of the SAC '22: The 37th ACM/SIGAPP Symposium on Applied Computing, Virtual Event, April 25, 2022

IFCIL: An Information Flow Configuration Language for SELinux.
Proceedings of the 35th IEEE Computer Security Foundations Symposium, 2022

2021
Securing Interruptible Enclaved Execution on Small Microprocessors.
ACM Trans. Program. Lang. Syst., 2021

Mechanical incrementalization of typing algorithms.
Sci. Comput. Program., 2021

Modelling and analysing IoT systems.
J. Parallel Distributed Comput., 2021

FWS: Analyzing, maintaining and transcompiling firewalls.
J. Comput. Secur., 2021

Supervisory Synthesis of Configurable Behavioural Contracts with Modalities.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2021

Verifying a Blockchain-Based Remote Debugging Protocol for Bug Bounty.
Proceedings of the Protocols, Strands, and Logic, 2021

2020
Controller synthesis of service contracts with variability.
Sci. Comput. Program., 2020

Natural Projection as Partial Model Checking.
J. Autom. Reason., 2020

Control-flow Flattening Preserves the Constant-Time Policy (Extended Version).
CoRR, 2020

Provably Secure Isolation for Interruptible Enclaved Execution on Small Microprocessors: Extended Version.
CoRR, 2020

MuAC: Access Control Language for Mutual Benefits.
Proceedings of the Fourth Italian Conference on Cyber Security, 2020

Control-flow Flattening Preserves the Constant-Time Policy.
Proceedings of the Fourth Italian Conference on Cyber Security, 2020

Provably Secure Isolation for Interruptible Enclaved Execution on Small Microprocessors.
Proceedings of the 33rd IEEE Computer Security Foundations Symposium, 2020

Security Metrics at Work on the Things in IoT Systems.
Proceedings of the From Lambda Calculus to Cybersecurity Through Program Analysis, 2020

2019
Programming in a context-aware language.
J. Supercomput., 2019

Translation Validation for Security Properties.
CoRR, 2019

Using Standard Typing Algorithms Incrementally.
Proceedings of the NASA Formal Methods - 11th International Symposium, 2019

Are All Firewall Systems Equally Powerful?
Proceedings of the 14th ACM SIGSAC Workshop on Programming Languages and Analysis for Security, 2019

Checking the Expressivity of Firewall Languages.
Proceedings of the Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy, 2019

Robust Declassification by Incremental Typing.
Proceedings of the Foundations of Security, Protocols, and Equational Reasoning, 2019

Revealing the Trajectories of KLAIM Tuples, Statically.
Proceedings of the Models, Languages, and Tools for Concurrent and Distributed Programming, 2019

Automata-Based Behavioural Contracts with Action Correlation.
Proceedings of the From Software Engineering to Formal Methods and Tools, and Back, 2019

2018
Process calculi for biological processes.
Nat. Comput., 2018

From Natural Projection to Partial Model Checking and Back.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2018

Transcompiling Firewalls.
Proceedings of the Principles of Security and Trust - 7th International Conference, 2018

Firewall Management With FireWall Synthesizer.
Proceedings of the Second Italian Conference on Cyber Security, Milan, Italy, February 6th - to, 2018

Language-Independent Synthesis of Firewall Policies.
Proceedings of the 2018 IEEE European Symposium on Security and Privacy, 2018

2017
Tracing where IoT data are collected and aggregated.
Log. Methods Comput. Sci., 2017

Tool Supported Analysis of IoT.
Proceedings of the Proceedings 10th Interaction and Concurrency Experience, 2017

Regular and context-free nominal traces.
Acta Informatica, 2017

Specifying variability in service contracts.
Proceedings of the Eleventh International Workshop on Variability Modelling of Software-intensive Systems, 2017

Experimenting with a Context-Aware Language.
Proceedings of the Parallel Computing Technologies, 2017

2016
A Two-Component Language for Adaptation: Design, Semantics and Program Analysis.
IEEE Trans. Software Eng., 2016

Relating two automata-based models of orchestration and choreography.
J. Log. Algebraic Methods Program., 2016

Context-aware security: Linguistic mechanisms and static analysis.
J. Comput. Secur., 2016

Event-driven Adaptation in COP.
Proceedings of the Ninth workshop on Programming Language Approaches to Concurrency- and Communication-cEntric Software, 2016

A Step Towards Checking Security in IoT.
Proceedings of the Proceedings 9th Interaction and Concurrency Experience, 2016

Automata for Specifying and Orchestrating Service Contracts.
Log. Methods Comput. Sci., 2016

A Semantics for Disciplined Concurrency in COP.
Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

Playing with Our CAT and Communication-Centric Applications.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2016

Where Do Your IoT Ingredients Come From?
Proceedings of the Coordination Models and Languages, 2016

Last Mile's Resources.
Proceedings of the Semantics, Logics, and Calculi, 2016

2015
Model checking usage policies.
Math. Struct. Comput. Sci., 2015

On the information leakage of differentially-private mechanisms.
J. Comput. Secur., 2015

A Context-Oriented Extension of F#.
Proceedings of the Proceedings 14th International Workshop on Foundations of Coordination Languages and Self-Adaptive Systems, 2015

Debits and Credits in Petri Nets and Linear Logic.
Proceedings of the Logic, Rewriting, and Concurrency, 2015

2014
A formal framework for secure and complying services.
J. Supercomput., 2014

From Models to Languages.
Fundam. Informaticae, 2014

From Orchestration to Choreography through Contract Automata.
Proceedings of the Proceedings 7th Interaction and Concurrency Experience, 2014

Automata for Analysing Service Contracts.
Proceedings of the Trustworthy Global Computing - 9th International Symposium, 2014

A Two-Phase Static Analysis for Reliable Adaptation.
Proceedings of the Software Engineering and Formal Methods - 12th International Conference, 2014

Linguistic Mechanisms for Context-Aware Security.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2014, 2014

A Two-Component Language for COP.
Proceedings of 6th International Workshop on Context-Oriented Programming, 2014

2013
Security in Pervasive Applications: A Survey.
Eur. J. Law Technol., 2013

Preface.
J. Comput. Secur., 2013

Towards Nominal Context-Free Model-Checking.
Proceedings of the Implementation and Application of Automata, 2013

Secure and Unfailing Services.
Proceedings of the Parallel Computing Technologies - 12th International Conference, 2013

2012
Process Calculi, Systems Biology and Artificial Chemistry.
Proceedings of the Handbook of Natural Computing, 2012

Modular plans for secure service composition.
J. Comput. Secur., 2012

Typing Context-Dependent Behavioural Variation
Proceedings of the Proceedings Fifth Workshop on Programming Language Approaches to Concurrency- and Communication-cEntric Software, 2012

Nominal Automata for Resource Usage Control.
Proceedings of the Implementation and Application of Automata, 2012

Types for Coordinating Secure Behavioural Variations.
Proceedings of the Coordination Models and Languages - 14th International Conference, 2012

Formalising Security in Ubiquitous and Cloud Scenarios.
Proceedings of the Computer Information Systems and Industrial Management, 2012

2011
Preface.
Theor. Comput. Sci., 2011

Secure service orchestration in open networks.
J. Syst. Archit., 2011

On Quantitative Security Policies.
Proceedings of the Parallel Computing Technologies - 11th International Conference, 2011

Differential Privacy: On the Trade-Off between Utility and Information Leakage.
Proceedings of the Formal Aspects of Security and Trust - 8th International Workshop, 2011

Call-by-Contract for Service Discovery, Orchestration and Recovery.
Proceedings of the Rigorous Software Engineering for Service-Oriented Systems, 2011

2010
Detecting and preventing type flaws at static time.
J. Comput. Secur., 2010

Differential Privacy versus Quantitative Information Flow
CoRR, 2010

2009
Local policies for resource usage analysis.
ACM Trans. Program. Lang. Syst., 2009

Securing Java with Local Policies.
J. Object Technol., 2009

Planning and verifying service composition.
J. Comput. Secur., 2009

<i>nu</i>-Types for Effects and Freshness Analysis.
Proceedings of the Theoretical Aspects of Computing, 2009

Formal Models of the Calyx of Held.
Proceedings of the Algorithmic Bioprocesses, 2009

2008
Semantics-Based Design for Secure Web Services.
IEEE Trans. Software Eng., 2008

Synapses as stochastic concurrent systems.
Theor. Comput. Sci., 2008

Preface.
Int. J. Inf. Sec., 2008

Joint workshop on foundations of computer security and automated reasoning for security protocol analysis (FCS-ARSPA '06).
Inf. Comput., 2008

Hard Life with Weak Binders.
Proceedings of the 15th Workshop on Expressiveness in Concurrency, 2008

Stochastic models for the in silico simulation of synaptic processes.
BMC Bioinform., 2008

Cells in Silico: A Holistic Approach.
Proceedings of the Formal Methods for Computational Systems Biology, 2008

Ugo Montanari in a Nutshell.
Proceedings of the Concurrency, 2008

A Formal Analysis of Complex Type Flaw Attacks on Security Protocols.
Proceedings of the Algebraic Methodology and Software Technology, 2008

2007
A Computational Approach to the Functional Screening of Genomes.
PLoS Comput. Biol., 2007

Detecting and Preventing Type flaws: a Control Flow Analysis with Tags.
Proceedings of the Fifth Workshop on Security Issues in Concurrency, 2007

A Stochastic Semantics for BioAmbients.
Proceedings of the Parallel Computing Technologies, 2007

Types and Effects for Resource Usage Analysis.
Proceedings of the Foundations of Software Science and Computational Structures, 2007

Secure Service Orchestration.
Proceedings of the Foundations of Security Analysis and Design IV, 2007

Expressive Models for Synaptic Plasticity.
Proceedings of the Computational Methods in Systems Biology, International Conference, 2007

A Formal Analysis for Capturing Replay Attacks in Cryptographic Protocols.
Proceedings of the Advances in Computer Science, 2007

2006
Beta-binders for Biological Quantitative Experiments.
Proceedings of the 4th International Workshop on Quantitative Aspects of Programming Languages, 2006

Handling exp, × (and Timestamps) in Protocol Analysis.
Proceedings of the Foundations of Software Science and Computation Structures, 2006

Security Issues in Service Composition.
Proceedings of the Formal Methods for Open Object-Based Distributed Systems, 2006

Types and Effects for Secure Service Orchestration.
Proceedings of the 19th IEEE Computer Security Foundations Workshop, 2006

Feedbacks and Oscillations in the Virtual Cell VICE.
Proceedings of the Computational Methods in Systems Biology, International Conference, 2006

2005
Weakening the perfect encryption assumption in Dolev-Yao adversaries.
Theor. Comput. Sci., 2005

Checking security policies through an enhanced Control Flow Analysis.
J. Comput. Secur., 2005

Static validation of security protocols.
J. Comput. Secur., 2005

Authentication primitives for secure protocol specifications.
Future Gener. Comput. Syst., 2005

Policy framings for access control.
Proceedings of the POPL 2005 Workshop on Issues in the Theory of Security, 2005

On Evaluating the Performance of Security Protocols.
Proceedings of the Parallel Computing Technologies, 2005

Checking Risky Events Is Enough for Local Policies.
Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

History-Based Access Control with Local Policies.
Proceedings of the Foundations of Software Science and Computational Structures, 2005

Enforcing Secure Service Composition.
Proceedings of the 18th IEEE Computer Security Foundations Workshop, 2005

2004
Modelling biochemical pathways through enhanced pi-calculus.
Theor. Comput. Sci., 2004

Stack inspection and secure program transformations.
Int. J. Inf. Sec., 2004

A Quantitative Study of Two Attacks.
Proceedings of the 2nd International Workshop on Security Issues with Petri Nets and other Computational Models, 2004

Performance Evaluation of Security Protocols Specified in LySa.
Proceedings of the Second Workshop on Quantitative Aspects of Programming Languages, 2004

A Note on the Perfect Encryption Assumption in a Process Calculus.
Proceedings of the Foundations of Software Science and Computation Structures, 2004

VICE: A VIrtual CEll.
Proceedings of the Computational Methods in Systems Biology, International Conference, 2004

2003
Program Transformations under Dynamic Security Policies.
Proceedings of the Formal Methods for Security and Time: Proceedings of the MEFISTO Project 2003, 2003

Authentication Primitives for Protocol Specifications.
Proceedings of the Parallel Computing Technologies, 2003

Security-Aware Program Transformations.
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

Reflecting Mobile Ambients into the p-Calculus.
Proceedings of the Global Computing. Programming Environments, 2003

Performance Evaluation for Global Computation.
Proceedings of the Global Computing. Programming Environments, 2003

Causality and Replication in Concurrent Processes.
Proceedings of the Perspectives of Systems Informatics, 2003

Automatic Validation of Protocol Narration.
Proceedings of the 16th IEEE Computer Security Foundations Workshop (CSFW-16 2003), 30 June, 2003

Enhanced Operational Semantics in Systems Biology.
Proceedings of the Computational Methods in Systems Biology, First International Workshop, 2003

Causal pi-Calculus for Biochemical Modelling.
Proceedings of the Computational Methods in Systems Biology, First International Workshop, 2003

2002
A causal semantics for CCS via rewriting logic.
Theor. Comput. Sci., 2002

Primitives for authentication in process algebras.
Theor. Comput. Sci., 2002

Flow logic for Dolev-Yao secrecy in cryptographic processes.
Future Gener. Comput. Syst., 2002

2001
Performance Evaluation of Mobile Processes via Abstract Machines.
IEEE Trans. Software Eng., 2001

Names of the -calculus agents handled locally.
Theor. Comput. Sci., 2001

Static Analysis for the pi-Calculus with Applications to Security.
Inf. Comput., 2001

Techniques for Security Checking: Non-Interference vs Control Flow Analysis.
Proceedings of the Theory of Concurrency, Higher Order Languages and Types, 2001

Static Analysis for Stack Inspection.
Proceedings of the International Workshop on Concurrency and Coordination, 2001

Enhanced operational semantics.
ACM Comput. Surv., 2001

Static Analysis for Secrecy and Non-interference in Networks of Processes.
Proceedings of the Parallel Computing Technologies, 2001

Security Analysis Using Flow Logics.
Proceedings of the Current Trends in Theoretical Computer Science, 2001

2000
Security Analysis using Flow Logics.
Bull. EATCS, 2000

A tool for quantitative analysis of calculus processes.
Proceedings of the ICALP Workshops 2000, 2000

Safe Ambients: Control Flow Analysis and Security.
Proceedings of the Advances in Computing Science, 2000

1999
Non-Interleaving Semantics for Mobile Processes.
Theor. Comput. Sci., 1999

Computing Surveys' Electronic Symposium on the Theory of Computation.
ACM Comput. Surv., 1999

Causality for Debugging Mobile Agents.
Acta Informatica, 1999

Static Analysis of Processes for No and Read-Up nad No Write-Down.
Proceedings of the Foundations of Software Science and Computation Structure, 1999

Semantic-Driven Performance Evaluation (Extended Abstract).
Proceedings of the Fundamental Approaches to Software Engineering, 1999

Authentication via Localized Names.
Proceedings of the 12th IEEE Computer Security Foundations Workshop, 1999

1998
CCS semantics via proved transition systems and rewriting logic.
Proceedings of the 1998 International Workshop on Rewriting Logic and its Applications, 1998

LR Techniques for Handling Syntax Errors.
Comput. Lang., 1998

Constructing Specific SOS Semantics for Concurrency via Abstract Interpretation.
Proceedings of the Static Analysis, 5th International Symposium, 1998

Control Flow Analysis for the pi-calculus.
Proceedings of the CONCUR '98: Concurrency Theory, 1998

1996
Axiomatizing the Algebra of Net Computations and Processes.
Acta Informatica, 1996

Understanding Mobile Agents via a Non-Interleaving Semantics for Facile.
Proceedings of the Static Analysis, Third International Symposium, 1996

Logical and Operational Methods in the Analysis of Programs and Systems.
Proceedings of the Analysis and Verification of Multiple-Agent Languages, 1996

Analysis of Facile Programs: A Case Study.
Proceedings of the Analysis and Verification of Multiple-Agent Languages, 1996

Mobile Processes with Local Clocks.
Proceedings of the Analysis and Verification of Multiple-Agent Languages, 1996

Mobile Processes with a Distributed Environment.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

1995
A Causal Operational Semantics of Action Refinement
Inf. Comput., October, 1995

Comparison of Syntactic Error Handling in LR Parsers.
Softw. Pract. Exp., 1995

Fairness and Priority.
Fundam. Informaticae, 1995

An Efficient Verifier of Truly Concurrent Properties.
Proceedings of the Parallel Computing Technologies, 1995

Causality for Mobile Processes.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Complexity as a Basis for Comparing Semantic Models of Concurrency.
Proceedings of the Algorithms, 1995

A Transitional Semantics of Full Prolog.
Proceedings of the 1995 Joint Conference on Declarative Programming, 1995

1993
Refinement of Actions in Event Structures and Causal Trees.
Theor. Comput. Sci., 1993

Universal Axioms for Bisimulations.
Theor. Comput. Sci., 1993

Generating the analytic component parts of syntax-directed editors with efficient-error recovery.
J. Syst. Softw., 1993

On Relating Some Models for Concurrency.
Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993

1992
A Categorial View of Process Refinement.
Proceedings of the Sematics: Foundations and Applications, 1992

Observation Trees.
Proceedings of the NAPAW 92, 1992

Proved Trees.
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

1991
About semantic action refinement.
Fundam. Informaticae, 1991

Atomic Refinement in Process Description Languages.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

Applications of the Calculus of Trees to Process Description Languages.
Proceedings of the Category Theory and Computer Science, 1991

1990
A Partial Ordering Semantics for CCS.
Theor. Comput. Sci., 1990

Event Structures, Causal Trees, and Refinements.
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Causal Trees: Interleaving + Causality.
Proceedings of the Semantics of Systems of Concurrent Processes, 1990

1989
A Normal Form for Restricted Exponential Functions.
RAIRO Theor. Informatics Appl., 1989

Axiomatizing Net Computations and Processes
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

Causal Trees.
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

1988
Efficient Incremental LR Parsing for Syntax-Directed Editors.
ACM Trans. Program. Lang. Syst., 1988

A Distributed Operational Semantics for CCS Based on Condition/Event Systems.
Acta Informatica, 1988

Partial orderings descriptions and observations of nondeterministic concurrent processes.
Proceedings of the Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands, May 30, 1988

On the Consistency of "Truly Concurrent" Operational and Denotational Semantics (Extended Abstract)
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

1987
Concurrent Histories: A Basis for Observing Distributed Systems.
J. Comput. Syst. Sci., 1987

A model for distributed systems based on graph rewriting.
J. ACM, 1987

Partial ordering models for concurrency can be defined operationally.
Int. J. Parallel Program., 1987

Observational equivalences for concurrency models.
Proceedings of the Formal Description of Programming Concepts - III: Proceedings of the IFIP TC 2/WG 2.2 Working Conference on Formal Description of Programming Concepts, 1987

An Exercise in Concurrency: a CSP Process as a Condition/ event System.
Proceedings of the Advances in Petri Nets 1988, 1987

1986
CCS is an (Augmented) Contact Free C/E System.
Proceedings of the Mathematical Models for the Semantics of Parallelism, Advanced School, Rome, Italy, September 24, 1986

1985
An Evaluation Based Theorem Prover.
IEEE Trans. Pattern Anal. Mach. Intell., 1985

Specification Languages for Distributed Systems.
Proceedings of the Mathematical Foundations of Software Development, 1985

Partial ordering derivations for CCS.
Proceedings of the Fundamentals of Computation Theory, 1985

1984
Liveness Properties as Convergence in Metric Spaces
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

A Formal Model for Lazy Implementations of a Prolog-Compatible Functional Language.
Proceedings of the Implementations of Prolog. , 1984

1983
A First Order Semantics of a Connective Suitable to Express Concurrency.
Proceedings of the Logic Programming Workshop '83, Praia da Falésia, Algarve, Portugal, 26 June, 1983

1982
Applicative communicating processes in first order logic.
Proceedings of the International Symposium on Programming, 1982

Toward an Inductionless Technique for Proving Properties of Logic Programs.
Proceedings of the First International Logic Programming Conference, 1982

1980
On Finding the Optimal Access Path to Resolve a Relational Data Base Query.
Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

1979
Inducing Function Properties from Computation Traces.
Proceedings of the Sixth International Joint Conference on Artificial Intelligence, 1979

A Flexible Environment for Program Development Based on a Symbolic Interpreter.
Proceedings of the 4th International Conference on Software Engineering, 1979


  Loading...