Gennaro Parlato

Orcid: 0000-0002-8697-2980

According to our database1, Gennaro Parlato authored at least 60 papers between 2003 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Verifying Programs by Bounded Tree-Width Behavior Graphs.
Proceedings of the Multi-Agent Systems - 20th European Conference, 2023

Reachability Games Modulo Theories with a Bounded Safety Player.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Bounded Verification of Multi-threaded Programs via Lazy Sequentialization.
ACM Trans. Program. Lang. Syst., 2022

CBMC-SSM: Bounded Model Checking of C Programs with Symbolic Shadow Memory.
Proceedings of the 37th IEEE/ACM International Conference on Automated Software Engineering, 2022

Reasoning About Data Trees Using CHCs.
Proceedings of the Computer Aided Verification - 34th International Conference, 2022

2021
Automated Planning Through Program Verification.
Proceedings of the 3rd Workshop on Artificial Intelligence and Formal Verification, 2021

2020
Reachability of scope-bounded multistack pushdown systems.
Inf. Comput., 2020

A Fixed-point Model-checker for BDI Logics over Finite-state Worlds.
Proceedings of the 2nd Workshop on Artificial Intelligence and Formal Verification, 2020

On the Model-Checking of Branching-time Temporal Logic with BDI Modalities.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019
VeriSmart 2.0: Swarm-Based Bug-Finding for Multi-threaded Programs with Lazy-CSeq.
Proceedings of the 34th IEEE/ACM International Conference on Automated Software Engineering, 2019

Model Checking BDI Logics over Finite-state Worlds.
Proceedings of the 1st Workshop on Artificial Intelligence and Formal Verification, 2019

2017
Lazy-CSeq 2.0: Combining Lazy Sequentialization with Abstract Interpretation - (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Using Shared Memory Abstractions to Design Eager Sequentializations for Weak Memory Models.
Proceedings of the Software Engineering and Formal Methods - 15th International Conference, 2017

Concurrent Program Verification with Lazy Sequentialization and Interval Analysis.
Proceedings of the Networked Systems - 5th International Conference, 2017

Parallel bug-finding in concurrent programs via reduced interleaving instances.
Proceedings of the 32nd IEEE/ACM International Conference on Automated Software Engineering, 2017

Preventing Unauthorized Data Flows.
Proceedings of the Data and Applications Security and Privacy XXXI, 2017

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

MU-CSeq 0.4: Individual Memory Location Unwindings - (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

Lazy sequentialization for TSO and PSO via shared memory abstractions.
Proceedings of the 2016 Formal Methods in Computer-Aided Design, 2016

Lazy Sequentialization for the Safety Verification of Unbounded Concurrent Programs.
Proceedings of the Automated Technology for Verification and Analysis, 2016

2015
Verifying Concurrent Programs by Memory Unwinding.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

MU-CSeq 0.3: Sequentialization by Read-Implicit and Coarse-Grained Memory Unwindings - (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

Unbounded Lazy-CSeq: A Lazy Sequentialization Tool for C Programs with Unbounded Context Switches - (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

Lazy-CSeq: A Context-Bounded Model Checking Tool for Multi-threaded C-Programs.
Proceedings of the 30th IEEE/ACM International Conference on Automated Software Engineering, 2015

2014
Security analysis for temporal role based access control.
J. Comput. Secur., 2014

On the Path-Width of Integer Linear Programming.
Proceedings of the Proceedings Fifth International Symposium on Games, 2014

MU-CSeq: Sequentialization of C Programs by Shared Memory Unwindings - (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2014

Lazy-CSeq: A Lazy Sequentialization Tool for C - (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2014

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

Context-Bounded Analysis of TSO Systems.
Proceedings of the From Programs to Systems. The Systems perspective in Computing, 2014

Bounded Model Checking of Multi-threaded C Programs via Lazy Sequentialization.
Proceedings of the Computer Aided Verification - 26th International Conference, 2014

Vac - Verifier of Administrative Role-Based Access Control Policies.
Proceedings of the Computer Aided Verification - 26th International Conference, 2014

2013
Policy Analysis for Self-administrated Role-Based Access Control.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

CSeq: A Sequentialization Tool for C - (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

Quantified Data Automata on Skinny Trees: An Abstract Domain for Lists.
Proceedings of the Static Analysis - 20th International Symposium, 2013

CSeq: A concurrency pre-processor for sequential C verification tools.
Proceedings of the 2013 28th IEEE/ACM International Conference on Automated Software Engineering, 2013

2012
Sequentializing Parameterized Programs
Proceedings of the Proceedings Fourth Workshop on Foundations of Interface Technologies, 2012

Analyzing temporal role based access control models.
Proceedings of the 17th ACM Symposium on Access Control Models and Technologies, 2012

Scope-bounded Multistack Pushdown Systems: Fixed-Point, Sequentialization, and Tree-Width.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

Security Analysis of Role-Based Access Control through Program Verification.
Proceedings of the 25th IEEE Computer Security Foundations Symposium, 2012

2011
On Sequentializing Concurrent Programs.
Proceedings of the Static Analysis - 18th International Symposium, 2011

Decidable logics combining heap structures and data.
Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

The tree width of auxiliary storage.
Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem.
Proceedings of the Network Optimization - 5th International Conference, 2011

Getting Rid of Store-Buffers in TSO Analysis.
Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

2010
The Language Theory of Bounded Context-Switching.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Model-Checking Parameterized Concurrent Programs Using Linear Interfaces.
Proceedings of the Computer Aided Verification, 22nd International Conference, 2010

2009
Fast payment schemes for truthful mechanisms with verification.
Theor. Comput. Sci., 2009

Analyzing recursive programs using a fixed-point calculus.
Proceedings of the 2009 ACM SIGPLAN Conference on Programming Language Design and Implementation, 2009

Reducing Context-Bounded Concurrent Reachability to Sequential Reachability.
Proceedings of the Computer Aided Verification, 21st International Conference, 2009

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

Context-Bounded Analysis of Concurrent Queue Systems.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2008

An Infinite Automaton Characterization of Double Exponential Time.
Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

2007
A Robust Class of Context-Sensitive Languages.
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 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

On the Complexity of LtlModel-Checking of Recursive State Machines.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2005
A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds.
Inf. Process. Lett., 2005

Improvements for Truthful Mechanisms with Verifiable One-Parameter Selfish Agents.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

2004
Minimum Weighted Feedback Vertex Set on Diamonds.
Electron. Notes Discret. Math., 2004

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


  Loading...