Margherita Napoli

According to our database1, Margherita Napoli
  • authored at least 57 papers between 1984 and 2016.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
Scope-Bounded Pushdown Languages.
Int. J. Found. Comput. Sci., 2016

2015
Parametric metric interval temporal logic.
Theor. Comput. Sci., 2015

2014
A Unifying Approach for Multistack Pushdown Automata.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Scope-Bounded Pushdown Languages.
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem.
Proceedings of the Computing with New Resources, 2014

2013
Model checking coalitional games in shortage resource scenarios.
Proceedings of the Proceedings Fourth International Symposium on Games, 2013

2012
Preface.
Int. J. Found. Comput. Sci., 2012

A Temporal Logic for Multi-threaded Programs.
Proceedings of the Theoretical Computer Science, 2012

2011
On a Logic for Coalitional Games with Priced-Resource Agents.
Electr. Notes Theor. Comput. Sci., 2011

Graded CTL Model Checking for Test Generation
CoRR, 2011

Graded CTL model checking for test generation.
Proceedings of the 2011 Spring Simulation Multi-conference, 2011

Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

Coalitional Games with Priced-Resource Agents.
Proceedings of the 26th Italian Conference on Computational Logic, Pescara, Italy, August 31, 2011

2010
Graded Alternating-Time Temporal Logic.
Fundam. Inform., 2010

Graded Alternating-Time Temporal Logic.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Parametric Metric Interval Temporal Logic.
Proceedings of the Language and Automata Theory and Applications, 2010

A NuSMV Extension for Graded-CTL Model Checking.
Proceedings of the Computer Aided Verification, 22nd International Conference, 2010

2009
Model Checking for Graded CTL.
Fundam. Inform., 2009

Graded-CTL: Satisfiability and Symbolic Model Checking.
Proceedings of the Formal Methods and Software Engineering, 2009

2008
Verification of scope-dependent hierarchical state machines.
Inf. Comput., 2008

Program Complexity in Hierarchical Module Checking.
Proceedings of the Logic for Programming, 2008

CTLModel-Checking with Graded Quantifiers.
Proceedings of the Automated Technology for Verification and Analysis, 2008

2007
The word problem for visibly pushdown languages described by grammars.
Formal Methods in System Design, 2007

Verification of Succinct Hierarchical State Machines.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

2006
Different time solutions for the firing squad synchronization problem on basic grid networks.
ITA, 2006

On the Membership Problem for Visibly Pushdown Languages.
Proceedings of the Automated Technology for Verification and Analysis, 2006

2005
Weak Muller acceptance conditions for tree automata.
Theor. Comput. Sci., 2005

Various Solutions to the Firing Squad Synchronization Problems
CoRR, 2005

2004
Specification and Verification of Protocols With Time Constraints.
Electr. Notes Theor. Comput. Sci., 2004

2003
Finite automata on timed omega-trees.
Theor. Comput. Sci., 2003

Hierarchical and Recursive State Machines with Context-Dependent Properties.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
Weak Muller Acceptance Conditions for Tree Automata.
Proceedings of the Verification, 2002

2001
A Model of Finite Automata on Timed omega-Trees.
Electr. Notes Theor. Comput. Sci., 2001

Automata-based Representations for Infinite Graphs.
ITA, 2001

Timed tree automata with an application to temporal logic.
Acta Inf., 2001

Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints.
Proceedings of the Machines, 2001

2000
A compositional approach to synchronize two dimensional networks of processors.
ITA, 2000

A Decidable Dense Branching-Time Temporal Logic.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

1998
Synchronization of a Line of Identical Processors at a Given Time.
Fundam. Inform., 1998

Representing Hyper-Graphs by Regular Languages.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997
Succinctness of Descriptions of SBTA-Languages.
Theor. Comput. Sci., 1997

Synchronization of a Line of Identical Processors at a Given Time.
Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

Synchronization of 1-Way Connected Processors.
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

1996
Parallel Word Substitution.
Fundam. Inform., 1996

Synchronization of One-way Connected Processors.
Complex Systems, 1996

1995
Power of Interconnections and of Nondeterminism in Regular Y-Tree Systolic Automata.
Mathematical Systems Theory, 1995

State Complexity of SBTA Languages.
Proceedings of the LATIN '95: Theoretical Informatics, 1995

1994
Optimization of Systolic Tree Automata.
Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

1993
On the Minimization and Succintness of Systolic Binary Tree Automata.
Sci. Ann. Cuza Univ., 1993

The Tool Development Language TDL for the Software Development Environment WSDW.
Proceedings of the SEKE'93, 1993

1992
Languages Accepted by Systolic Y-Tree Automata: Structural Characterizations.
Acta Inf., 1992

The Software Development Workbench WSDW.
Proceedings of the SEKE'92, 1992

1991
Systolic Y-Tree Automata: Closure Properties and Decision Problems.
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1988
Web Structures: A Tool for Representing and Manipulating Programs.
IEEE Trans. Software Eng., 1988

C-Tree Systolic Automata.
Theor. Comput. Sci., 1988

1985
Synchronized Bottom-Up Tree Automata and L-Systems.
Proceedings of the Mathematical Foundations of Software Development, 1985

1984
Hierarchies of Primitive Recursive Wordsequence Functions: Comparisons and Decision Problems.
Theor. Comput. Sci., 1984


  Loading...