Salvatore La Torre

According to our database1, Salvatore La Torre
  • authored at least 86 papers between 1996 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Visibly pushdown modular games, .
Inf. Comput., 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

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

A General Modular Synthesis Problem for Pushdown Systems.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 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
Parametric metric interval temporal logic.
Theor. Comput. Sci., 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

Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014
Automata-theoretic decision of timed games.
Theor. Comput. Sci., 2014

Visibly Pushdown Modular Games.
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

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

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

2013
Games, Automata, Logic, and Formal Verification (GandALF 2011).
Theor. Comput. Sci., 2013

Modular Synthesis with Open Components.
Proceedings of the Reachability Problems - 7th International Workshop, 2013

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

A Temporal Logic for Multi-threaded Programs.
Proceedings of the Theoretical Computer Science, 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

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

Winning CaRet Games with Modular Strategies.
Proceedings of the 26th Italian Conference on Computational Logic, Pescara, Italy, August 31, 2011

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

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

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

2009
Decision problems for lower/upper bound parametric timed automata.
Formal Methods in System Design, 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 well-formed communicating recursive state machines.
Theor. Comput. Sci., 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
The Firing Squad Synchronization Problem on Squares, Toruses and Rings.
Int. J. Found. Comput. Sci., 2007

The word problem for visibly pushdown languages described by grammars.
Formal Methods in System Design, 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

Decision Problems for Lower/Upper Bound Parametric Timed Automata.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006
Modular strategies for recursive game graphs.
Theor. Comput. Sci., 2006

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

Verification of Well-Formed Communicating Recursive State Machines.
Proceedings of the Verification, 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

Perturbed Timed Automata.
Proceedings of the Hybrid Systems: Computation and Control, 8th International Workshop, 2005

2004
Deterministic generators and games for Ltl fragments.
ACM Trans. Comput. Log., 2004

Optimal paths in weighted timed automata.
Theor. Comput. Sci., 2004

Polyhedral Flows in Hybrid Automata.
Formal Methods in System Design, 2004

Model-checking the Secure Release of a Time-locked Secret over a Network.
Electr. Notes Theor. Comput. Sci., 2004

Reasoning About Co-Büchi Tree Automata.
Proceedings of the Theoretical Aspects of Computing, 2004

Optimal Time and Communication Solutions of Firing Squad Synchronization Problems on Square Arrays, Toruses and Rings.
Proceedings of the Developments in Language Theory, 2004

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

Deterministic finite automata with recursive calls and DPDAs.
Inf. Process. Lett., 2003

Modular Strategies for Recursive Game Graphs.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2003

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

Playing Games with Boxes and Diamonds.
Proceedings of the CONCUR 2003, 2003

Modular Strategies for Infinite Games on Recursive Graphs.
Proceedings of the Computer Aided Verification, 15th International Conference, 2003

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

Automata-Theoretic Decision of Timed Games.
Proceedings of the Verification, 2002

Dense Real-Time Games.
Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

Optimal-Reachability and Control for Acyclic Weighted Timed Automata.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

2001
Parametric temporal logic for "model measuring".
ACM Trans. Comput. Log., 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

Deterministic Generators and Games for LTL Fragments.
Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

Optimal Paths in Weighted Timed Automata.
Proceedings of the Hybrid Systems: Computation and Control, 4th International Workshop, 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

1999
Parametric Temporal Logic for "Model Measuring".
Proceedings of the Automata, 1999

Polyhedral Flows in Hybrid Automata.
Proceedings of the Hybrid Systems: Computation and Control, Second International Workshop, 1999

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
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


  Loading...