Anna Philippou

According to our database1, Anna Philippou authored at least 55 papers between 1995 and 2020.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Reversibility in Chemical Reactions.
Proceedings of the Reversible Computation: Extending Horizons of Computing, 2020

Towards fault adaptive routing in metasurface controller networks.
J. Syst. Archit., 2020

DiálogoP - A Language and a Graphical Tool for Formally Defining GDPR Purposes.
Proceedings of the Research Challenges in Information Science, 2020

Encoding Reversing Petri Nets in Answer Set Programming.
Proceedings of the Reversible Computation - 12th International Conference, 2020

2019
Distributed Antenna Selection for Massive MIMO Using Reversing Petri Nets.
IEEE Wirel. Commun. Lett., 2019

Controlling Reversibility in Reversing Petri Nets with Application to Wireless Communications.
CoRR, 2019

GDPR Compliance in the Design of the INFORM e-Learning Platform: a Case Study.
Proceedings of the 13th International Conference on Research Challenges in Information Science, 2019

Controlling Reversibility in Reversing Petri Nets with Application to Wireless Communications - Work-in-Progress Paper.
Proceedings of the Reversible Computation - 11th International Conference, 2019

Towards GDPR Compliant Software Design: A Formal Framework for Analyzing System Models.
Proceedings of the Evaluation of Novel Approaches to Software Engineering, 2019

A Formal Modeling Scheme for Analyzing a Software System Design against the GDPR.
Proceedings of the 14th International Conference on Evaluation of Novel Approaches to Software Engineering, 2019

2018
Reversible Computation in Petri Nets.
Proceedings of the Reversible Computation - 10th International Conference, 2018

Fault Adaptive Routing in Metasurface Controller Networks.
Proceedings of the 11th International Workshop on Network on Chip Architectures, 2018

Formal Verification of a Programmable Hypersurface.
Proceedings of the Formal Methods for Industrial Critical Systems, 2018

Reversing Computations Modelled by Coloured Petri Nets.
Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data 2018 Satellite event of the conferences: 39th International Conference on Application and Theory of Petri Nets and Concurrency Petri Nets 2018 and 18th International Conference on Application of Concurrency to System Design ACSD 2018, 2018

2017
Privacy by typing in the π-calculus.
Log. Methods Comput. Sci., 2017

2015
Mean-Field Semantics for a Process Calculus for Spatially-Explicit Ecological Models.
Proceedings of the Eleventh International Workshop on Developments in Computational Models, 2015

Type Checking Purpose-Based Privacy Policies in the π-Calculus.
Proceedings of the Web Services, Formal Methods, and Behavioral Types, 2015

Risk Modeling and Analysis of Interdependencies of Critical Infrastructures Using Colored Timed Petri Nets.
Proceedings of the Human Aspects of Information Security, Privacy, and Trust, 2015

Type Checking Privacy Policies in the π-calculus.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2015

2014
Synchronous Parallel Composition in a Process Calculus for Ecological Models.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2014, 2014

2013
Model checking and abstract interpretation as building blocks of advanced program analysis techniques - Selected papers from TACAS 2009.
Int. J. Softw. Tools Technol. Transf., 2013

Simulation and Verification in a Process Calculus for Spatially-Explicit Ecological Models.
Sci. Ann. Comput. Sci., 2013

Process Ordering in a Process Calculus for Spatially-Explicit Ecological Models.
Proceedings of the Software Engineering and Formal Methods, 2013

A Typing System for Privacy.
Proceedings of the Software Engineering and Formal Methods, 2013

2012
PADS: An approach to modeling resource demand and supply for the formal analysis of hierarchical scheduling.
Theor. Comput. Sci., 2012

A Process Calculus for Spatially-explicit Ecological Models
Proceedings of the Proceedings 6th Workshop on Membrane Computing and Biologically Inspired Process Calculi, 2012

2011
A Process Calculus for Dynamic Networks.
Proceedings of the Formal Techniques for Distributed Systems, 2011

2010
A Process Algebraic Framework for Modeling Resource Demand and Supply.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2010

2009
Selfish Routing in the Presence of Network Uncertainty.
Parallel Process. Lett., 2009

2008
A graph-theoretic network security game.
Int. J. Auton. Adapt. Commun. Syst., 2008

A Network Game with Attackers and a Defender.
Algorithmica, 2008

On the Application of Formal Methods for Specifying and Verifying Distributed Protocols.
Proceedings of The Seventh IEEE International Symposium on Networking Computing and Applications, 2008

2007
Process-Algebraic Analysis of Timing and Schedulability Properties.
Proceedings of the Handbook of Real-Time and Embedded Systems., 2007

Resources in process algebra.
J. Log. Algebraic Methods Program., 2007

2006
A Family of Resource-Bound Real-Time Process Algebras.
Electron. Notes Theor. Comput. Sci., 2006

Verification Techniques for Distributed Algorithms.
Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

The Price of Defense.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Network uncertainty in selfish routing.
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

The Power of the Defender.
Proceedings of the 26th International Conference on Distributed Computing Systems Workshops (ICDCS 2006 Workshops), 2006

The Price of Defense and Fractional Matchings.
Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006

2005
Network Game with Attacker and Protector Entities.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2003
Modeling and Analysis of Power-Aware Systems.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2003

2002
A General Resource Framework for Real-Time Systems.
Proceedings of the Radical Innovations of Software and Systems Engineering in the Future, 2002

2001
A Process-Calculus Analysis of Concurrent Operations on B-Trees.
J. Comput. Syst. Sci., 2001

Hiding resources that can fail: An axiomatic perspective.
Inf. Process. Lett., 2001

A Family of Resource-Bound Real-Time Process Algebras.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2001

2000
Weak Bisimulation for Probabilistic Systems.
Proceedings of the CONCUR 2000, 2000

1998
On Transformations of Concurrent-Object Programs.
Theor. Comput. Sci., 1998

Symbolic Schedulability Analysis of Real-Time Systems.
Proceedings of the 19th IEEE Real-Time Systems Symposium, 1998

Praobabilistic Resource Failure in Real-Time Process Algebra.
Proceedings of the CONCUR '98: Concurrency Theory, 1998

1997
On Confluence in the pi-Calculus.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

A Rigorous Analysis of Concurrent Operations on B-Trees.
Proceedings of the CONCUR '97: Concurrency Theory, 1997

1996
Reasoning about systems with evolving structure.
PhD thesis, 1996

Social Confluence in Client-Server Systems.
Proceedings of the Computer Science Logic, 10th International Workshop, 1996

1995
On Sharing and Determinacy in Concurrent Systems.
Proceedings of the CONCUR '95: Concurrency Theory, 1995


  Loading...