Paola Giannini

According to our database1, Paola Giannini
  • authored at least 66 papers between 1984 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Type safe incremental rebinding.
Mathematical Structures in Computer Science, 2017

A type and effect system for sharing.
Proceedings of the Symposium on Applied Computing, 2017

Tracing sharing in an imperative pure calculus: extended abstract.
Proceedings of the 19th Workshop on Formal Techniques for Java-like Programs, 2017

Concurrent Reversible Sessions.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016
Formal Attributes Traceability in Modular Language Development Frameworks.
Electr. Notes Theor. Comput. Sci., 2016

Incremental Rebinding with Name Polymorphism.
Electr. Notes Theor. Comput. Sci., 2016

Reversible Multiparty Sessions with Checkpoints.
Proceedings of the Proceedings Combined 23rd International Workshop on Expressiveness in Concurrency and 13th Workshop on Structural Operational Semantics, 2016

Initialize-and-catch.
Proceedings of the 31st Annual ACM Symposium on Applied Computing, 2016

Exploring the Potential of Global Types for Adding a Choreography Perspective to the jABC Framework.
Proceedings of the MODELSWARD 2016, 2016

Runtime Checks as Nominal Types.
Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

Types for Immutability and Aliasing Control.
Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

Coupling catch clauses with local declarations.
Proceedings of the 18th Workshop on Formal Techniques for Java-like Programs, 2016

2015
Interactions between Computer Science and Biology.
Theor. Comput. Sci., 2015

A computational modeling language for complex laboratory experiments.
Nano Comm. Netw., 2015

2014
State-Sensitive Computational Modeling.
Proceedings of the 8th International Conference on Bio-inspired Information and Communications Technologies, 2014

2013
Type Directed Semantics for the Calculus of Looping Sequences.
Int. J. Software and Informatics, 2013

Preface.
Electr. Notes Theor. Comput. Sci., 2013

A Calculus of Located Entities.
Proceedings of the Proceedings 9th International Workshop on Developments in Computational Models, 2013

Compiling Functional to Scripting Languages.
Proceedings of the Software Technologies - 8th International Joint Conference, 2013

An Intermediate Language for Compilation to Scripting Languages.
Proceedings of the ICSOFT 2013, 2013

2012
Typed stochastic semantics for the calculus of looping sequences.
Theor. Comput. Sci., 2012

Standard Type Soundness for Agents and Artifacts.
Sci. Ann. Comp. Sci., 2012

Parallel BioScape: A Stochastic and Parallel Language for Mobile and Spatial Interactions
Proceedings of the Proceedings 6th Workshop on Membrane Computing and Biologically Inspired Process Calculi, 2012

Reconciling positional and nominal binding.
Proceedings of the Proceedings Sixth Workshop on Intersection Types and Related Systems, 2012

2011
Extending the lambda-calculus with unbind and rebind.
RAIRO - Theor. Inf. and Applic., 2011

Preface.
Electr. Notes Theor. Comput. Sci., 2011

A Calculus of Looping Sequences with Local Rules
Proceedings of the Proceedings 7th International Workshop on Developments of Computational Methods, 2011

Annotated Stochastic Context Free Grammars for Analysis and Synthesis of Proteins.
Proceedings of the Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics, 2011

2010
Intersection types for unbind and rebind
Proceedings of the Proceedings Fifth Workshop on Intersection Types and Related Systems, 2010

2009
A Type System for a Stochastic CLS
Proceedings of the Proceedings Third Workshop on Membrane Computing and Biologically Inspired Process Calculi, 2009

A Type System for Required/Excluded Elements in CLS
Proceedings of the Proceedings Fifth Workshop on Developments in Computational Models--Computational Models From Nature, 2009

The essence of static and dynamic bindings.
Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

FEATHERWEIGHT AGENT LANGUAGE - A Core Calculus for Agents and Artifacts.
Proceedings of the ICSOFT 2009, 2009

Intersection, Universally Quantified, and Reference Types.
Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

2008
Alias Types and Effects for "Environment-aware" Computations.
Fundam. Inform., 2008

A Calculus of Evolving Objects.
Sci. Ann. Comp. Sci., 2008

A type safe state abstraction for coordination in Java -like languages.
Acta Inf., 2008

2007
A provenly correct translation of Fickle into Java.
ACM Trans. Program. Lang. Syst., 2007

2006
Safe Ambients: Abstract machine and distributed implementation.
Sci. Comput. Program., 2006

On state classes and their dynamic semantics.
Proceedings of the ICSOFT 2006, 2006

2005
Type Checking for JavaScript.
Electr. Notes Theor. Comput. Sci., 2005

Towards Type Inference for JavaScript.
Proceedings of the ECOOP 2005, 2005

2004
On Re-classification and Multi-threading.
Journal of Object Technology, 2004

Re-classification and multi-threading: FickleMT.
Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), 2004

2003
Alias types for "environment-aware" computations.
Electr. Notes Theor. Comput. Sci., 2003

Refined Effects for Unanticipated Object Re-classification: Fickle3.
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

2002
More dynamic object reclassification: Fickle||
ACM Trans. Program. Lang. Syst., 2002

Strictness, totality, and non-standard-type inference.
Theor. Comput. Sci., 2002

A Calculus for "Environment-Aware" Computation.
Electr. Notes Theor. Comput. Sci., 2002

2001
A type preserving translation of Fickle into Java.
Electr. Notes Theor. Comput. Sci., 2001

An Effective Translation of Fickle into Java.
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

Fickle : Dynamic Object Re-classification.
Proceedings of the ECOOP 2001, 2001

2000
Automatic useless-code elimination for HOT functional programs.
J. Funct. Program., 2000

Type-Based Useless-Code Elimination for Functional Programs.
Proceedings of the Semantics, 2000

1999
A filter model for mobile processes.
Mathematical Structures in Computer Science, 1999

1997
An Inference Algorithm for Strictness.
Proceedings of the Typed Lambda Calculi and Applications, 1997

On Strictness and Totality.
Proceedings of the Theoretical Aspects of Computer Software, Third International Symposium, 1997

1996
Refinement Types for Program Analysis.
Proceedings of the Static Analysis, Third International Symposium, 1996

1995
Principal Types and Unification for a Simple Intersection Type System
Inf. Comput., October, 1995

1994
A Type Inference Algorithm for a Stratified Polymorphic Type Discipline
Inf. Comput., 1994

A Decidable Intersection Type System based on Relevance.
Proceedings of the Theoretical Aspects of Computer Software, 1994

1993
Type Inference: Some Results, Some Problems.
Fundam. Inform., 1993

1992
A Complete Type Inference Algorithm for Simple Intersection Types.
Proceedings of the CAAP '92, 1992

1991
Type Inference in Polymorphic Type Discipline.
Proceedings of the Theoretical Aspects of Computer Software, 1991

1988
Characterization of typings in polymorphic type discipline
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

1984
Effectively Given Domains and Lambda-Calculus Models
Information and Control, July, 1984


  Loading...