default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMargherita Napoli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j24]Salvatore La Torre, Margherita Napoli, Gennaro Parlato:
Reachability of scope-bounded multistack pushdown systems. Inf. Comput. 275: 104588 (2020)
2010 – 2019
- 2016
- [j23]Salvatore La Torre, Margherita Napoli, Gennaro Parlato
:
Scope-Bounded Pushdown Languages. Int. J. Found. Comput. Sci. 27(2): 215-234 (2016) - 2015
- [j22]Barbara Di Giampaolo, Salvatore La Torre, Margherita Napoli:
Parametric metric interval temporal logic. Theor. Comput. Sci. 564: 131-148 (2015) - 2014
- [c32]Margherita Napoli, Mimmo Parente:
Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem. Computing with New Resources 2014: 114-128 - [c31]Salvatore La Torre, Margherita Napoli, Gennaro Parlato:
Scope-Bounded Pushdown Languages. Developments in Language Theory 2014: 116-128 - [c30]Salvatore La Torre, Margherita Napoli, Gennaro Parlato:
A Unifying Approach for Multistack Pushdown Automata. MFCS (1) 2014: 377-389 - 2013
- [c29]Dario Della Monica, Margherita Napoli, Mimmo Parente:
Model checking coalitional games in shortage resource scenarios. GandALF 2013: 240-255 - 2012
- [j21]Angelo Montanari, Margherita Napoli, Mimmo Parente:
Preface. Int. J. Found. Comput. Sci. 23(3) (2012) - [c28]Salvatore La Torre, Margherita Napoli:
A Temporal Logic for Multi-threaded Programs. IFIP TCS 2012: 225-239 - 2011
- [c27]Dario Della Monica, Margherita Napoli, Mimmo Parente:
Coalitional Games with Priced-Resource Agents. CILC 2011: 341-347 - [c26]Salvatore La Torre, Margherita Napoli:
Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations. CONCUR 2011: 203-218 - [c25]Margherita Napoli, Mimmo Parente:
Graded CTL model checking for test generation. SpringSim (TMS-DEVS) 2011: 59-66 - [c24]Dario Della Monica, Margherita Napoli, Mimmo Parente:
On a Logic for Coalitional Games with Priced-Resource Agents. M4M/LAMAS 2011: 215-228 - [i2]Margherita Napoli, Mimmo Parente:
Graded CTL Model Checking for Test Generation. CoRR abs/1111.2768 (2011) - 2010
- [j20]Marco Faella, Margherita Napoli, Mimmo Parente:
Graded Alternating-Time Temporal Logic. Fundam. Informaticae 105(1-2): 189-210 (2010) - [c23]Alessandro Ferrante, Maurizio Memoli, Margherita Napoli, Mimmo Parente, Francesco Sorrentino:
A NuSMV Extension for Graded-CTL Model Checking. CAV 2010: 670-673 - [c22]Barbara Di Giampaolo, Salvatore La Torre, Margherita Napoli:
Parametric Metric Interval Temporal Logic. LATA 2010: 249-260 - [c21]Marco Faella, Margherita Napoli, Mimmo Parente:
Graded Alternating-Time Temporal Logic. LPAR (Dakar) 2010: 192-211 - [e1]Angelo Montanari, Margherita Napoli, Mimmo Parente:
Proceedings First Symposium on Games, Automata, Logic, and Formal Verification, GANDALF 2010, Minori (Amalfi Coast), Italy, 17-18th June 2010. EPTCS 25, 2010 [contents]
2000 – 2009
- 2009
- [j19]Alessandro Ferrante, Margherita Napoli, Mimmo Parente:
Model Checking for Graded CTL. Fundam. Informaticae 96(3): 323-339 (2009) - [c20]Alessandro Ferrante, Margherita Napoli, Mimmo Parente:
Graded-CTL: Satisfiability and Symbolic Model Checking. ICFEM 2009: 306-325 - 2008
- [j18]Salvatore La Torre, Margherita Napoli, Mimmo Parente, Gennaro Parlato:
Verification of scope-dependent hierarchical state machines. Inf. Comput. 206(9-10): 1161-1177 (2008) - [c19]Alessandro Ferrante, Margherita Napoli, Mimmo Parente:
CTLModel-Checking with Graded Quantifiers. ATVA 2008: 18-32 - [c18]Aniello Murano, Margherita Napoli, Mimmo Parente:
Program Complexity in Hierarchical Module Checking. LPAR 2008: 318-332 - 2007
- [j17]Salvatore La Torre, Margherita Napoli, Mimmo Parente:
The word problem for visibly pushdown languages described by grammars. Formal Methods Syst. Des. 31(3): 265-279 (2007) - [c17]Salvatore La Torre, Margherita Napoli, Mimmo Parente, Gennaro Parlato:
Verification of Succinct Hierarchical State Machines. LATA 2007: 485-496 - 2006
- [j16]Jozef Gruska, Salvatore La Torre, Margherita Napoli, Mimmo Parente:
Different time solutions for the firing squad synchronization problem on basic grid networks. RAIRO Theor. Informatics Appl. 40(2): 177-206 (2006) - [c16]Salvatore La Torre, Margherita Napoli, Mimmo Parente:
On the Membership Problem for Visibly Pushdown Languages. ATVA 2006: 96-109 - 2005
- [j15]Salvatore La Torre, Aniello Murano, Margherita Napoli:
Weak Muller acceptance conditions for tree automata. Theor. Comput. Sci. 332(1-3): 233-250 (2005) - [i1]Jozef Gruska, Salvatore La Torre, Margherita Napoli, Mimmo Parente:
Various Solutions to the Firing Squad Synchronization Problems. CoRR abs/cs/0511044 (2005) - 2003
- [j14]Salvatore La Torre, Margherita Napoli:
Finite automata on timed omega-trees. Theor. Comput. Sci. 293(3): 479-505 (2003) - [c15]Salvatore La Torre, Margherita Napoli, Mimmo Parente, Gennaro Parlato:
Hierarchical and Recursive State Machines with Context-Dependent Properties. ICALP 2003: 776-789 - [c14]Margherita Napoli, Mimmo Parente, Adriano Peron:
Specification and Verification of Protocols With Time Constraints. MEFISTO 2003: 205-227 - 2002
- [c13]Salvatore La Torre, Aniello Murano, Margherita Napoli:
Weak Muller Acceptance Conditions for Tree Automata. VMCAI 2002: 240-254 - 2001
- [j13]Salvatore La Torre, Margherita Napoli:
Timed tree automata with an application to temporal logic. Acta Informatica 38(2): 89-116 (2001) - [j12]Salvatore La Torre, Margherita Napoli:
Automata-based Representations for Infinite Graphs. RAIRO Theor. Informatics Appl. 35(4): 311-330 (2001) - [c12]Salvatore La Torre, Margherita Napoli, Mimmo Parente:
Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints. MCU 2001: 264-275 - [c11]Salvatore La Torre, Margherita Napoli:
A Model of Finite Automata on Timed omega-Trees. CATS 2001: 158-173 - 2000
- [j11]Salvatore La Torre, Margherita Napoli, Mimmo Parente:
A compositional approach to synchronize two dimensional networks of processors. RAIRO Theor. Informatics Appl. 34(6): 549-564 (2000) - [c10]Salvatore La Torre, Margherita Napoli:
A Decidable Dense Branching-Time Temporal Logic. FSTTCS 2000: 139-150
1990 – 1999
- 1998
- [j10]Salvatore La Torre, Margherita Napoli, Domenico Parente:
Synchronization of a Line of Identical Processors at a Given Time. Fundam. Informaticae 34(1-2): 103-128 (1998) - [c9]Salvatore La Torre, Margherita Napoli:
Representing Hyper-Graphs by Regular Languages. MFCS 1998: 571-579 - 1997
- [j9]Jozef Gruska, Angelo Monti, Margherita Napoli, Domenico Parente:
Succinctness of Descriptions of SBTA-Languages. Theor. Comput. Sci. 179(1-2): 251-271 (1997) - [c8]Salvatore La Torre, Margherita Napoli, Mimmo Parente:
Synchronization of 1-Way Connected Processors. FCT 1997: 293-304 - [c7]Salvatore La Torre, Margherita Napoli, Mimmo Parente:
Synchronization of a Line of Identical Processors at a Given Time. TAPSOFT 1997: 405-416 - 1996
- [j8]Salvatore La Torre, Margherita Napoli, Mimmo Parente:
Synchronization of One-way Connected Processors. Complex Syst. 10(4) (1996) - [j7]Salvatore La Torre, Margherita Napoli, Domenico Parente:
Parallel Word Substitution. Fundam. Informaticae 27(1): 27-36 (1996) - 1995
- [j6]Emanuela Fachini, Jozef Gruska, Margherita Napoli, Domenico Parente:
Power of Interconnections and of Nondeterminism in Regular Y-Tree Systolic Automata. Math. Syst. Theory 28(3): 245-266 (1995) - [c6]Jozef Gruska, Angelo Monti, Margherita Napoli, Domenico Parente:
State Complexity of SBTA Languages. LATIN 1995: 346-357 - 1994
- [c5]Jozef Gruska, Margherita Napoli, Domenico Parente:
Optimization of Systolic Tree Automata. IFIP Congress (1) 1994: 247-252 - 1993
- [j5]Jozef Gruska, Margherita Napoli, Domenico Parente:
On the Minimization and Succintness of Systolic Binary Tree Automata. Sci. Ann. Cuza Univ. 2: 13-26 (1993) - [c4]Andrea De Lucia, Margherita Napoli, Genny Tortora, Maurizio Tucci:
The Tool Development Language TDL for the Software Development Environment WSDW. SEKE 1993: 421-428 - 1992
- [j4]Emanuela Fachini, Angelo Monti, Margherita Napoli, Domenico Parente:
Languages Accepted by Systolic Y-Tree Automata: Structural Characterizations. Acta Informatica 29(8): 761-778 (1992) - [c3]Andrea De Lucia, A. Imperatore, Margherita Napoli, Genny Tortora, Maurizio Tucci:
The Software Development Workbench WSDW. SEKE 1992: 213-221 - 1991
- [c2]Emanuela Fachini, Angelo Monti, Margherita Napoli, Domenico Parente:
Systolic Y-Tree Automata: Closure Properties and Decision Problems. FCT 1991: 210-219
1980 – 1989
- 1988
- [j3]Emanuela Fachini, Margherita Napoli:
C-Tree Systolic Automata. Theor. Comput. Sci. 56: 155-186 (1988) - [j2]Andrea Maggiolo-Schettini, Margherita Napoli, Genoveffa Tortora:
Web Structures: A Tool for Representing and Manipulating Programs. IEEE Trans. Software Eng. 14(11): 1621-1639 (1988) - 1985
- [c1]Emanuela Fachini, Margherita Napoli:
Synchronized Bottom-Up Tree Automata and L-Systems. TAPSOFT, Vol.1 1985: 298-307 - 1984
- [j1]Emanuela Fachini, Margherita Napoli:
Hierarchies of Primitive Recursive Wordsequence Functions: Comparisons and Decision Problems. Theor. Comput. Sci. 29: 185-227 (1984)
Coauthor Index
aka: Domenico Parente
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
