default search action
Salvatore La Torre
Person information
- affiliation: University of Salerno, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c70]Bernd Fischer
, Giulio Garbi
Static Data Race Detection via Lazy Sequentialization. NETYS 2024: 124-141 - 2023
- [c69]Omar Inverso, Salvatore La Torre, Gennaro Parlato, Ermenegildo Tomasco:
Verifying Programs by Bounded Tree-Width Behavior Graphs. EUMAS 2023: 116-132 - 2022
- [j27]Omar Inverso, Ermenegildo Tomasco
Bounded Verification of Multi-threaded Programs via Lazy Sequentialization. ACM Trans. Program. Lang. Syst. 44(1): 1:1-1:50 (2022) - [c68]Bernd Fischer
CBMC-SSM: Bounded Model Checking of C Programs with Symbolic Shadow Memory. ASE 2022: 156:1-156:5 - 2021
- [c67]Salvatore La Torre, Gennaro Parlato:
Automated Planning Through Program Verification. OVERLAY@GandALF 2021: 13-17 - 2020
- [j26]Salvatore La Torre, Margherita Napoli, Gennaro Parlato:
Reachability of scope-bounded multistack pushdown systems. Inf. Comput. 275: 104588 (2020) - [c66]Salvatore La Torre, Gennaro Parlato:
On the Model-Checking of Branching-time Temporal Logic with BDI Modalities. AAMAS 2020: 681-689 - [c65]Salvatore La Torre, Gennaro Parlato:
A Fixed-point Model-checker for BDI Logics over Finite-state Worlds. OVERLAY 2020: 47-52 - [c64]Dario Della Monica
Complexity of Qualitative Timeline-Based Planning. TIME 2020: 16:1-16:13
2010 – 2019
- 2019
- [c63]Salvatore La Torre, Gennaro Parlato:
Model Checking BDI Logics over Finite-state Worlds. OVERLAY@AI*IA 2019: 11-16 - [c62]Salvatore La Torre, Parthasarathy Madhusudan:
Reachability in Concurrent Uninterpreted Programs. FSTTCS 2019: 46:1-46:16 - [c61]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
- [j25]Ilaria De Crescenzo, Salvatore La Torre, Yaron Velner:
Visibly pushdown modular games, . Inf. Comput. 253: 204-223 (2017) - [c60]Truc L. Nguyen, Peter Schrammel
Parallel bug-finding in concurrent programs via reduced interleaving instances. ASE 2017: 753-764 - [c59]Truc L. Nguyen, Bernd Fischer
Concurrent Program Verification with Lazy Sequentialization and Interval Analysis. NETYS 2017: 255-271 - [c58]Ermenegildo Tomasco, Truc Lam Nguyen, Bernd Fischer
Using Shared Memory Abstractions to Design Eager Sequentializations for Weak Memory Models. SEFM 2017: 185-202 - [c57]Truc L. Nguyen, Omar Inverso
Lazy-CSeq 2.0: Combining Lazy Sequentialization with Abstract Interpretation - (Competition Contribution). TACAS (2) 2017: 375-379 - 2016
- [j24]Salvatore La Torre, Margherita Napoli, Gennaro Parlato
Scope-Bounded Pushdown Languages. Int. J. Found. Comput. Sci. 27(2): 215-234 (2016) - [c56]Truc L. Nguyen, Bernd Fischer
Lazy Sequentialization for the Safety Verification of Unbounded Concurrent Programs. ATVA 2016: 174-191 - [c55]Ermenegildo Tomasco, Truc L. Nguyen, Omar Inverso
Lazy sequentialization for TSO and PSO via shared memory abstractions. FMCAD 2016: 193-200 - [c54]Ermenegildo Tomasco, Truc L. Nguyen, Omar Inverso
MU-CSeq 0.4: Individual Memory Location Unwindings - (Competition Contribution). TACAS 2016: 938-941 - [c53]Ilaria De Crescenzo, Salvatore La Torre:
A General Modular Synthesis Problem for Pushdown Systems. VMCAI 2016: 495-513 - 2015
- [j23]Barbara Di Giampaolo, Salvatore La Torre
Parametric metric interval temporal logic. Theor. Comput. Sci. 564: 131-148 (2015) - [c52]Salvatore La Torre, Anca Muscholl, Igor Walukiewicz:
Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable. CONCUR 2015: 72-84 - [c51]Omar Inverso
Lazy-CSeq: A Context-Bounded Model Checking Tool for Multi-threaded C-Programs. ASE 2015: 807-812 - [c50]Ermenegildo Tomasco, Omar Inverso
MU-CSeq 0.3: Sequentialization by Read-Implicit and Coarse-Grained Memory Unwindings - (Competition Contribution). TACAS 2015: 436-438 - [c49]Truc L. Nguyen, Bernd Fischer
Unbounded Lazy-CSeq: A Lazy Sequentialization Tool for C Programs with Unbounded Context Switches - (Competition Contribution). TACAS 2015: 461-463 - [c48]Ermenegildo Tomasco, Omar Inverso
Verifying Concurrent Programs by Memory Unwinding. TACAS 2015: 551-565 - 2014
- [j22]Marco Faella, Salvatore La Torre, Aniello Murano
Automata-theoretic decision of timed games. Theor. Comput. Sci. 515: 46-63 (2014) - [c47]Omar Inverso
Bounded Model Checking of Multi-threaded C Programs via Lazy Sequentialization. CAV 2014: 585-602 - [c46]Salvatore La Torre, Margherita Napoli, Gennaro Parlato
Scope-Bounded Pushdown Languages. Developments in Language Theory 2014: 116-128 - [c45]Salvatore La Torre, Margherita Napoli, Gennaro Parlato
A Unifying Approach for Multistack Pushdown Automata. MFCS (1) 2014: 377-389 - [c44]Omar Inverso
Lazy-CSeq: A Lazy Sequentialization Tool for C - (Competition Contribution). TACAS 2014: 398-401 - [c43]Ermenegildo Tomasco, Omar Inverso
MU-CSeq: Sequentialization of C Programs by Shared Memory Unwindings - (Competition Contribution). TACAS 2014: 402-404 - [c42]Ilaria De Crescenzo, Salvatore La Torre, Yaron Velner:
Visibly Pushdown Modular Games. GandALF 2014: 260-274 - 2013
- [j21]Giovanna D'Agostino, Salvatore La Torre:
Games, Automata, Logic, and Formal Verification (GandALF 2011). Theor. Comput. Sci. 493: 1 (2013) - [c41]Ilaria De Crescenzo, Salvatore La Torre:
Modular Synthesis with Open Components. RP 2013: 96-108 - 2012
- [c40]Salvatore La Torre, Gennaro Parlato
Scope-bounded Multistack Pushdown Systems: Fixed-Point, Sequentialization, and Tree-Width. FSTTCS 2012: 173-184 - [c39]Salvatore La Torre, Margherita Napoli
A Temporal Logic for Multi-threaded Programs. IFIP TCS 2012: 225-239 - [c38]Salvatore La Torre, P. Madhusudan, Gennaro Parlato
Sequentializing Parameterized Programs. FIT 2012: 34-47 - 2011
- [c37]Ilaria De Crescenzo, Salvatore La Torre:
Winning CaRet Games with Modular Strategies. CILC 2011: 327-331 - [c36]Salvatore La Torre, Margherita Napoli
Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations. CONCUR 2011: 203-218 - [e1]Giovanna D'Agostino, Salvatore La Torre:
Proceedings of Second International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2011, Minori, Italy, 15-17th June 2011. EPTCS 54, 2011 [contents] - 2010
- [c35]Salvatore La Torre, P. Madhusudan, Gennaro Parlato
Model-Checking Parameterized Concurrent Programs Using Linear Interfaces. CAV 2010: 629-644 - [c34]Barbara Di Giampaolo, Salvatore La Torre, Margherita Napoli
Parametric Metric Interval Temporal Logic. LATA 2010: 249-260 - [c33]Salvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato
The Language Theory of Bounded Context-Switching. LATIN 2010: 96-107
2000 – 2009
- 2009
- [j20]Laura Bozzelli, Salvatore La Torre:
Decision problems for lower/upper bound parametric timed automata. Formal Methods Syst. Des. 35(2): 121-151 (2009) - [c32]Salvatore La Torre, P. Madhusudan, Gennaro Parlato
Reducing Context-Bounded Concurrent Reachability to Sequential Reachability. CAV 2009: 477-492 - [c31]Salvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato
Analyzing recursive programs using a fixed-point calculus. PLDI 2009: 211-222 - 2008
- [j19]Salvatore La Torre, Margherita Napoli
Verification of scope-dependent hierarchical state machines. Inf. Comput. 206(9-10): 1161-1177 (2008) - [j18]Laura Bozzelli, Salvatore La Torre, Adriano Peron:
Verification of well-formed communicating recursive state machines. Theor. Comput. Sci. 403(2-3): 382-405 (2008) - [c30]Salvatore La Torre, P. Madhusudan, Gennaro Parlato:
An Infinite Automaton Characterization of Double Exponential Time. CSL 2008: 33-48 - [c29]Salvatore La Torre, P. Madhusudan, Gennaro Parlato
Context-Bounded Analysis of Concurrent Queue Systems. TACAS 2008: 299-314 - 2007
- [j17]Salvatore La Torre, Margherita Napoli
The word problem for visibly pushdown languages described by grammars. Formal Methods Syst. Des. 31(3): 265-279 (2007) - [j16]Jozef Gruska, Salvatore La Torre, Mimmo Parente
The Firing Squad Synchronization Problem on Squares, Toruses and Rings. Int. J. Found. Comput. Sci. 18(3): 637-654 (2007) - [c28]Laura Bozzelli, Salvatore La Torre:
Decision Problems for Lower/Upper Bound Parametric Timed Automata. ICALP 2007: 925-936 - [c27]Salvatore La Torre, Gennaro Parlato:
On the Complexity of LtlModel-Checking of Recursive State Machines. ICALP 2007: 937-948 - [c26]Salvatore La Torre, Margherita Napoli, Mimmo Parente, Gennaro Parlato:
Verification of Succinct Hierarchical State Machines. LATA 2007: 485-496 - [c25]Salvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato
A Robust Class of Context-Sensitive Languages. LICS 2007: 161-170 - 2006
- [j15]Jozef Gruska, Salvatore La Torre, Margherita Napoli
Different time solutions for the firing squad synchronization problem on basic grid networks. RAIRO Theor. Informatics Appl. 40(2): 177-206 (2006) - [j14]Rajeev Alur, Salvatore La Torre, P. Madhusudan:
Modular strategies for recursive game graphs. Theor. Comput. Sci. 354(2): 230-249 (2006) - [c24]Salvatore La Torre, Margherita Napoli, Mimmo Parente:
On the Membership Problem for Visibly Pushdown Languages. ATVA 2006: 96-109 - [c23]Laura Bozzelli, Salvatore La Torre, Adriano Peron:
Verification of Well-Formed Communicating Recursive State Machines. VMCAI 2006: 412-426 - 2005
- [j13]Salvatore La Torre, Aniello Murano
Weak Muller acceptance conditions for tree automata. Theor. Comput. Sci. 332(1-3): 233-250 (2005) - [c22]Rajeev Alur, Salvatore La Torre, P. Madhusudan:
Perturbed Timed Automata. HSCC 2005: 70-85 - [i1]Jozef Gruska, Salvatore La Torre, Margherita Napoli, Mimmo Parente:
Various Solutions to the Firing Squad Synchronization Problems. CoRR abs/cs/0511044 (2005) - 2004
- [j12]Rajeev Alur, Sampath Kannan, Salvatore La Torre:
Polyhedral Flows in Hybrid Automata. Formal Methods Syst. Des. 24(3): 261-280 (2004) - [j11]Rajeev Alur, Salvatore La Torre, George J. Pappas
Optimal paths in weighted timed automata. Theor. Comput. Sci. 318(3): 297-322 (2004) - [j10]Rajeev Alur, Salvatore La Torre:
Deterministic generators and games for Ltl fragments. ACM Trans. Comput. Log. 5(1): 1-25 (2004) - [c21]Jozef Gruska, Salvatore La Torre, Mimmo Parente:
Optimal Time and Communication Solutions of Firing Squad Synchronization Problems on Square Arrays, Toruses and Rings. Developments in Language Theory 2004: 200-211 - [c20]Salvatore La Torre, Aniello Murano:
Reasoning About Co-Büchi Tree Automata. ICTAC 2004: 527-542 - 2003
- [j9]Jean H. Gallier, Salvatore La Torre, Supratik Mukhopadhyay:
Deterministic finite automata with recursive calls and DPDAs. Inf. Process. Lett. 87(4): 187-193 (2003) - [j8]Salvatore La Torre, Margherita Napoli
Finite automata on timed omega-trees. Theor. Comput. Sci. 293(3): 479-505 (2003) - [c19]Rajeev Alur, Salvatore La Torre, P. Madhusudan:
Modular Strategies for Infinite Games on Recursive Graphs. CAV 2003: 67-79 - [c18]Rajeev Alur, Salvatore La Torre, P. Madhusudan:
Playing Games with Boxes and Diamonds. CONCUR 2003: 127-141 - [c17]Salvatore La Torre, Margherita Napoli, Mimmo Parente, Gennaro Parlato:
Hierarchical and Recursive State Machines with Context-Dependent Properties. ICALP 2003: 776-789 - [c16]Rajeev Alur, Salvatore La Torre, P. Madhusudan:
Modular Strategies for Recursive Game Graphs. TACAS 2003: 363-378 - [c15]Salvatore La Torre, Aniello Murano
Model-checking the Secure Release of a Time-locked Secret over a Network. MEFISTO 2003: 229-243 - 2002
- [c14]Salvatore La Torre, Supratik Mukhopadhyay, Aniello Murano:
Optimal-Reachability and Control for Acyclic Weighted Timed Automata. IFIP TCS 2002: 485-497 - [c13]Marco Faella, Salvatore La Torre, Aniello Murano:
Dense Real-Time Games. LICS 2002: 167-176 - [c12]Marco Faella, Salvatore La Torre, Aniello Murano:
Automata-Theoretic Decision of Timed Games. VMCAI 2002: 94-108 - [c11]Salvatore La Torre, Aniello Murano, Margherita Napoli:
Weak Muller Acceptance Conditions for Tree Automata. VMCAI 2002: 240-254 - 2001
- [j7]Salvatore La Torre, Margherita Napoli
Timed tree automata with an application to temporal logic. Acta Informatica 38(2): 89-116 (2001) - [j6]Salvatore La Torre, Margherita Napoli
Automata-based Representations for Infinite Graphs. RAIRO Theor. Informatics Appl. 35(4): 311-330 (2001) - [j5]Rajeev Alur, Kousha Etessami, Salvatore La Torre
Parametric temporal logic for "model measuring". ACM Trans. Comput. Log. 2(3): 388-407 (2001) - [c10]Rajeev Alur, Salvatore La Torre, George J. Pappas
Optimal Paths in Weighted Timed Automata. HSCC 2001: 49-62 - [c9]Rajeev Alur, Salvatore La Torre:
Deterministic Generators and Games for LTL Fragments. LICS 2001: 291-300 - [c8]Salvatore La Torre, Margherita Napoli, Mimmo Parente:
Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints. MCU 2001: 264-275 - [c7]Salvatore La Torre, Margherita Napoli
A Model of Finite Automata on Timed omega-Trees. CATS 2001: 158-173 - 2000
- [j4]Salvatore La Torre, Margherita Napoli
A compositional approach to synchronize two dimensional networks of processors. RAIRO Theor. Informatics Appl. 34(6): 549-564 (2000) - [c6]Salvatore La Torre, Margherita Napoli:
A Decidable Dense Branching-Time Temporal Logic. FSTTCS 2000: 139-150
1990 – 1999
- 1999
- [c5]Rajeev Alur, Sampath Kannan, Salvatore La Torre:
Polyhedral Flows in Hybrid Automata. HSCC 1999: 5-18 - [c4]Rajeev Alur, Kousha Etessami, Salvatore La Torre, Doron A. Peled:
Parametric Temporal Logic for "Model Measuring". ICALP 1999: 159-168 - 1998
- [j3]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) - [c3]Salvatore La Torre
Representing Hyper-Graphs by Regular Languages. MFCS 1998: 571-579 - 1997
- [c2]Salvatore La Torre, Margherita Napoli, Mimmo Parente:
Synchronization of 1-Way Connected Processors. FCT 1997: 293-304 - [c1]Salvatore La Torre, Margherita Napoli, Mimmo Parente:
Synchronization of a Line of Identical Processors at a Given Time. TAPSOFT 1997: 405-416 - 1996
- [j2]Salvatore La Torre, Margherita Napoli, Mimmo Parente:
Synchronization of One-way Connected Processors. Complex Syst. 10(4) (1996) - [j1]Salvatore La Torre, Margherita Napoli, Domenico Parente:
Parallel Word Substitution. Fundam. Informaticae 27(1): 27-36 (1996)
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-09-22 00:34 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: