default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGennaro Parlato
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c56]Marco Faella
, Gennaro Parlato:
A Unified Automata-Theoretic Approach to LTLf Modulo Theories. ECAI 2024: 1254-1261- [c55]Bernd Fischer, Giulio Garbi, Salvatore La Torre, Gennaro Parlato, Peter Schrammel:
Static Data Race Detection via Lazy Sequentialization. NETYS 2024: 124-141 - [i3]Marco Faella, Gennaro Parlato:
A Unified Automata-Theoretic Approach to LTLf Modulo Theories (Extended Version). CoRR abs/2408.08817 (2024) - [i2]Marco Faella, Gennaro Parlato:
Automated Verification of Tree-Manipulating Programs Using Constrained Horn Clauses. CoRR abs/2410.09668 (2024) - 2023
- [c54]Marco Faella, Gennaro Parlato:
Reachability Games Modulo Theories with a Bounded Safety Player. AAAI 2023: 6330-6337 - [c53]Omar Inverso, Salvatore La Torre, Gennaro Parlato, Ermenegildo Tomasco:
Verifying Programs by Bounded Tree-Width Behavior Graphs. EUMAS 2023: 116-132 - 2022
- [j9]Omar Inverso, Ermenegildo Tomasco, Bernd Fischer, Salvatore La Torre, Gennaro Parlato:
Bounded Verification of Multi-threaded Programs via Lazy Sequentialization. ACM Trans. Program. Lang. Syst. 44(1): 1:1-1:50 (2022) - [c52]Marco Faella, Gennaro Parlato:
Reasoning About Data Trees Using CHCs. CAV (2) 2022: 249-271 - [c51]Bernd Fischer, Salvatore La Torre, Gennaro Parlato, Peter Schrammel:
CBMC-SSM: Bounded Model Checking of C Programs with Symbolic Shadow Memory. ASE 2022: 156:1-156:5 - 2021
- [c50]Salvatore La Torre, Gennaro Parlato:
Automated Planning Through Program Verification. OVERLAY@GandALF 2021: 13-17 - 2020
- [j8]Salvatore La Torre, Margherita Napoli, Gennaro Parlato:
Reachability of scope-bounded multistack pushdown systems. Inf. Comput. 275: 104588 (2020) - [c49]Salvatore La Torre, Gennaro Parlato:
On the Model-Checking of Branching-time Temporal Logic with BDI Modalities. AAMAS 2020: 681-689 - [c48]Salvatore La Torre, Gennaro Parlato:
A Fixed-point Model-checker for BDI Logics over Finite-state Worlds. OVERLAY 2020: 47-52
2010 – 2019
- 2019
- [c47]Salvatore La Torre, Gennaro Parlato:
Model Checking BDI Logics over Finite-state Worlds. OVERLAY@AI*IA 2019: 11-16 - [c46]Bernd Fischer, Salvatore La Torre, Gennaro Parlato:
VeriSmart 2.0: Swarm-Based Bug-Finding for Multi-threaded Programs with Lazy-CSeq. ASE 2019: 1150-1153 - 2017
- [j7]Constantin Enea, Peter Habermehl, Omar Inverso, Gennaro Parlato:
On the path-width of integer linear programming. Inf. Comput. 253: 257-271 (2017) - [c45]Emre Uzun, Gennaro Parlato, Vijayalakshmi Atluri, Anna Lisa Ferrara, Jaideep Vaidya, Shamik Sural, David Lorenzi:
Preventing Unauthorized Data Flows. DBSec 2017: 41-62 - [c44]Truc L. Nguyen, Peter Schrammel, Bernd Fischer, Salvatore La Torre, Gennaro Parlato:
Parallel bug-finding in concurrent programs via reduced interleaving instances. ASE 2017: 753-764 - [c43]Truc L. Nguyen, Bernd Fischer, Salvatore La Torre, Gennaro Parlato:
Concurrent Program Verification with Lazy Sequentialization and Interval Analysis. NETYS 2017: 255-271 - [c42]Ermenegildo Tomasco, Truc Lam Nguyen, Bernd Fischer, Salvatore La Torre, Gennaro Parlato:
Using Shared Memory Abstractions to Design Eager Sequentializations for Weak Memory Models. SEFM 2017: 185-202 - [c41]Truc L. Nguyen, Omar Inverso, Bernd Fischer, Salvatore La Torre, Gennaro Parlato:
Lazy-CSeq 2.0: Combining Lazy Sequentialization with Abstract Interpretation - (Competition Contribution). TACAS (2) 2017: 375-379 - 2016
- [j6]Salvatore La Torre, Margherita Napoli, Gennaro Parlato:
Scope-Bounded Pushdown Languages. Int. J. Found. Comput. Sci. 27(2): 215-234 (2016) - [c40]Truc L. Nguyen, Bernd Fischer, Salvatore La Torre, Gennaro Parlato:
Lazy Sequentialization for the Safety Verification of Unbounded Concurrent Programs. ATVA 2016: 174-191 - [c39]Ermenegildo Tomasco, Truc L. Nguyen, Omar Inverso, Bernd Fischer, Salvatore La Torre, Gennaro Parlato:
Lazy sequentialization for TSO and PSO via shared memory abstractions. FMCAD 2016: 193-200 - [c38]Ermenegildo Tomasco, Truc L. Nguyen, Omar Inverso, Bernd Fischer, Salvatore La Torre, Gennaro Parlato:
MU-CSeq 0.4: Individual Memory Location Unwindings - (Competition Contribution). TACAS 2016: 938-941 - 2015
- [c37]Omar Inverso, Truc L. Nguyen, Bernd Fischer, Salvatore La Torre, Gennaro Parlato:
Lazy-CSeq: A Context-Bounded Model Checking Tool for Multi-threaded C-Programs. ASE 2015: 807-812 - [c36]Ermenegildo Tomasco, Omar Inverso, Bernd Fischer, Salvatore La Torre, Gennaro Parlato:
MU-CSeq 0.3: Sequentialization by Read-Implicit and Coarse-Grained Memory Unwindings - (Competition Contribution). TACAS 2015: 436-438 - [c35]Truc L. Nguyen, Bernd Fischer, Salvatore La Torre, Gennaro Parlato:
Unbounded Lazy-CSeq: A Lazy Sequentialization Tool for C Programs with Unbounded Context Switches - (Competition Contribution). TACAS 2015: 461-463 - [c34]Ermenegildo Tomasco, Omar Inverso, Bernd Fischer, Salvatore La Torre, Gennaro Parlato:
Verifying Concurrent Programs by Memory Unwinding. TACAS 2015: 551-565 - 2014
- [j5]Emre Uzun, Vijayalakshmi Atluri, Jaideep Vaidya, Shamik Sural, Anna Lisa Ferrara, Gennaro Parlato, P. Madhusudan:
Security analysis for temporal role based access control. J. Comput. Secur. 22(6): 961-996 (2014) - [c33]Anna Lisa Ferrara, P. Madhusudan, Truc L. Nguyen, Gennaro Parlato:
Vac - Verifier of Administrative Role-Based Access Control Policies. CAV 2014: 184-191 - [c32]Omar Inverso, Ermenegildo Tomasco, Bernd Fischer, Salvatore La Torre, Gennaro Parlato:
Bounded Model Checking of Multi-threaded C Programs via Lazy Sequentialization. CAV 2014: 585-602 - [c31]Salvatore La Torre, Margherita Napoli, Gennaro Parlato:
Scope-Bounded Pushdown Languages. Developments in Language Theory 2014: 116-128 - [c30]Mohamed Faouzi Atig, Ahmed Bouajjani, Gennaro Parlato:
Context-Bounded Analysis of TSO Systems. FPS@ETAPS 2014: 21-38 - [c29]Salvatore La Torre, Margherita Napoli, Gennaro Parlato:
A Unifying Approach for Multistack Pushdown Automata. MFCS (1) 2014: 377-389 - [c28]Omar Inverso, Ermenegildo Tomasco, Bernd Fischer, Salvatore La Torre, Gennaro Parlato:
Lazy-CSeq: A Lazy Sequentialization Tool for C - (Competition Contribution). TACAS 2014: 398-401 - [c27]Ermenegildo Tomasco, Omar Inverso, Bernd Fischer, Salvatore La Torre, Gennaro Parlato:
MU-CSeq: Sequentialization of C Programs by Shared Memory Unwindings - (Competition Contribution). TACAS 2014: 402-404 - [c26]Constantin Enea, Peter Habermehl, Omar Inverso, Gennaro Parlato:
On the Path-Width of Integer Linear Programming. GandALF 2014: 74-87 - 2013
- [c25]Bernd Fischer, Omar Inverso, Gennaro Parlato:
CSeq: A concurrency pre-processor for sequential C verification tools. ASE 2013: 710-713 - [c24]Pranav Garg, P. Madhusudan, Gennaro Parlato:
Quantified Data Automata on Skinny Trees: An Abstract Domain for Lists. SAS 2013: 172-193 - [c23]Anna Lisa Ferrara, P. Madhusudan, Gennaro Parlato:
Policy Analysis for Self-administrated Role-Based Access Control. TACAS 2013: 432-447 - [c22]Bernd Fischer, Omar Inverso, Gennaro Parlato:
CSeq: A Sequentialization Tool for C - (Competition Contribution). TACAS 2013: 616-618 - [i1]Pranav Garg, P. Madhusudan, Gennaro Parlato:
Quantified Data Automata on Skinny Trees: an Abstract Domain for Lists. CoRR abs/1304.0660 (2013) - 2012
- [c21]Anna Lisa Ferrara, P. Madhusudan, Gennaro Parlato:
Security Analysis of Role-Based Access Control through Program Verification. CSF 2012: 113-125 - [c20]Salvatore La Torre, Gennaro Parlato:
Scope-bounded Multistack Pushdown Systems: Fixed-Point, Sequentialization, and Tree-Width. FSTTCS 2012: 173-184 - [c19]Emre Uzun, Vijayalakshmi Atluri, Shamik Sural, Jaideep Vaidya, Gennaro Parlato, Anna Lisa Ferrara, Parthasarathy Madhusudan:
Analyzing temporal role based access control models. SACMAT 2012: 177-186 - [c18]Salvatore La Torre, P. Madhusudan, Gennaro Parlato:
Sequentializing Parameterized Programs. FIT 2012: 34-47 - 2011
- [c17]Mohamed Faouzi Atig, Ahmed Bouajjani, Gennaro Parlato:
Getting Rid of Store-Buffers in TSO Analysis. CAV 2011: 99-115 - [c16]Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato:
A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem. INOC 2011: 589-602 - [c15]P. Madhusudan, Gennaro Parlato:
The tree width of auxiliary storage. POPL 2011: 283-294 - [c14]P. Madhusudan, Gennaro Parlato, Xiaokang Qiu:
Decidable logics combining heap structures and data. POPL 2011: 611-622 - [c13]Ahmed Bouajjani, Michael Emmi, Gennaro Parlato:
On Sequentializing Concurrent Programs. SAS 2011: 129-145 - 2010
- [c12]Salvatore La Torre, P. Madhusudan, Gennaro Parlato:
Model-Checking Parameterized Concurrent Programs Using Linear Interfaces. CAV 2010: 629-644 - [c11]Salvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato:
The Language Theory of Bounded Context-Switching. LATIN 2010: 96-107
2000 – 2009
- 2009
- [j4]Alessandro Ferrante, Gennaro Parlato, Francesco Sorrentino, Carmine Ventre:
Fast payment schemes for truthful mechanisms with verification. Theor. Comput. Sci. 410(8-10): 886-899 (2009) - [c10]Salvatore La Torre, P. Madhusudan, Gennaro Parlato:
Reducing Context-Bounded Concurrent Reachability to Sequential Reachability. CAV 2009: 477-492 - [c9]Salvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato:
Analyzing recursive programs using a fixed-point calculus. PLDI 2009: 211-222 - 2008
- [j3]Salvatore La Torre, Margherita Napoli, Mimmo Parente, Gennaro Parlato:
Verification of scope-dependent hierarchical state machines. Inf. Comput. 206(9-10): 1161-1177 (2008) - [c8]Salvatore La Torre, P. Madhusudan, Gennaro Parlato:
An Infinite Automaton Characterization of Double Exponential Time. CSL 2008: 33-48 - [c7]Salvatore La Torre, P. Madhusudan, Gennaro Parlato:
Context-Bounded Analysis of Concurrent Queue Systems. TACAS 2008: 299-314 - 2007
- [c6]Salvatore La Torre, Gennaro Parlato:
On the Complexity of LtlModel-Checking of Recursive State Machines. ICALP 2007: 937-948 - [c5]Salvatore La Torre, Margherita Napoli, Mimmo Parente, Gennaro Parlato:
Verification of Succinct Hierarchical State Machines. LATA 2007: 485-496 - [c4]Salvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato:
A Robust Class of Context-Sensitive Languages. LICS 2007: 161-170 - 2005
- [j2]Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato:
A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds. Inf. Process. Lett. 94(1): 29-35 (2005) - [c3]Alessandro Ferrante, Gennaro Parlato, Francesco Sorrentino, Carmine Ventre:
Improvements for Truthful Mechanisms with Verifiable One-Parameter Selfish Agents. WAOA 2005: 147-160 - 2004
- [j1]Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato:
Minimum Weighted Feedback Vertex Set on Diamonds. Electron. Notes Discret. Math. 17: 87-91 (2004) - [c2]Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato:
Minimum Weighted Feedback Vertex Set on Diamonds. CTW 2004: 81-85 - 2003
- [c1]Salvatore La Torre, Margherita Napoli, Mimmo Parente, Gennaro Parlato:
Hierarchical and Recursive State Machines with Context-Dependent Properties. ICALP 2003: 776-789
Coauthor Index
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-11-25 23:39 CET 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:
