BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Czech Republic
1 × Denmark
1 × Germany
1 × Hungary
1 × Ireland
1 × New Zealand
1 × Russia
1 × The Netherlands
2 × France
2 × Italy
2 × United Kingdom
3 × Poland
3 × USA
Collaborated with:
G.Parlato P.Madhusudan M.Napoli B.Fischer R.Alur O.Inverso M.Parente E.Tomasco A.Murano L.Bozzelli P.Madhusudan M.Faella T.L.Nguyen B.D.Giampaolo A.Peron J.Gruska K.Etessami D.Peled P.Schrammel B.F.0002
Talks about:
program (9) lazi (7) sequenti (6) context (6) recurs (6) bound (6) time (6) seq (6) concurr (5) model (5)

Person: Salvatore La Torre

DBLP DBLP: Torre:Salvatore_La

Contributed to:

TACAS 20152015
CAV 20142014
DLT 20142014
TACAS 20142014
CAV 20102010
LATA 20102010
CAV 20092009
PLDI 20092009
CSL 20082008
TACAS 20082008
ICALP 20072007
LATA 20072007
LICS 20072007
VMCAI 20062006
DLT 20042004
CAV 20032003
ICALP 20032003
TACAS 20032003
LICS 20022002
VMCAI 20022002
LICS 20012001
ICALP 19991999
ASE 20152015
ASE 20172017
ASE 20192019
TAPSOFT CAAP/FASE 19971997

Wrote 31 papers:

TACAS-2015-Nguyen0TP #bound #c #contest #lazy evaluation #source code
Unbounded Lazy-CSeq: A Lazy Sequentialization Tool for C Programs with Unbounded Context Switches — (Competition Contribution) (TLN, BF, SLT, GP), pp. 461–463.
TACAS-2015-TomascoI0TP #contest #memory management
MU-CSeq 0.3: Sequentialization by Read-Implicit and Coarse-Grained Memory Unwindings — (Competition Contribution) (ET, OI, BF, SLT, GP), pp. 436–438.
TACAS-2015-TomascoI0TP15a #concurrent #memory management #source code #verification
Verifying Concurrent Programs by Memory Unwinding (ET, OI, BF, SLT, GP), pp. 551–565.
CAV-2014-InversoT0TP #bound #c #concurrent #lazy evaluation #model checking #multi #source code #thread
Bounded Model Checking of Multi-threaded C Programs via Lazy Sequentialization (OI, ET, BF, SLT, GP), pp. 585–602.
DLT-2014-TorreNP #automaton #bound
Scope-Bounded Pushdown Languages (SLT, MN, GP), pp. 116–128.
TACAS-2014-InversoT0TP #c #contest #lazy evaluation #named
Lazy-CSeq: A Lazy Sequentialization Tool for C — (Competition Contribution) (OI, ET, BF, SLT, GP), pp. 398–401.
TACAS-2014-TomascoI0TP #c #contest #memory management #named #source code
MU-CSeq: Sequentialization of C Programs by Shared Memory Unwindings — (Competition Contribution) (ET, OI, BF, SLT, GP), pp. 402–404.
CAV-2010-TorreMP #concurrent #interface #linear #model checking #source code #using
Model-Checking Parameterized Concurrent Programs Using Linear Interfaces (SLT, PM, GP), pp. 629–644.
LATA-2010-GiampaoloTN #logic #metric #parametricity
Parametric Metric Interval Temporal Logic (BDG, SLT, MN), pp. 249–260.
CAV-2009-TorreMP #bound #concurrent #reachability
Reducing Context-Bounded Concurrent Reachability to Sequential Reachability (SLT, PM, GP), pp. 477–492.
PLDI-2009-TorreMP #calculus #fixpoint #recursion #source code #using
Analyzing recursive programs using a fixed-point calculus (SLT, PM, GP), pp. 211–222.
CSL-2008-TorreMP #automaton #exponential #infinity
An Infinite Automaton Characterization of Double Exponential Time (SLT, PM, GP), pp. 33–48.
TACAS-2008-TorreMP #analysis #bound #concurrent #queue
Context-Bounded Analysis of Concurrent Queue Systems (SLT, PM, GP), pp. 299–314.
ICALP-2007-BozzelliT #automaton #bound #parametricity #problem
Decision Problems for Lower/Upper Bound Parametric Timed Automata (LB, SLT), pp. 925–936.
ICALP-2007-TorreP #complexity #model checking #on the #recursion #state machine
On the Complexity of LtlModel-Checking of Recursive State Machines (SLT, GP), pp. 937–948.
LATA-2007-TorreNPP #state machine #verification
Verification of Succinct Hierarchical State Machines (SLT, MN, MP, GP), pp. 485–496.
LICS-2007-TorreMP #context-sensitive grammar #robust
A Robust Class of Context-Sensitive Languages (SLT, PM, GP), pp. 161–170.
VMCAI-2006-BozzelliTP #communication #recursion #state machine #verification
Verification of Well-Formed Communicating Recursive State Machines (LB, SLT, AP), pp. 412–426.
DLT-2004-GruskaTP #array #communication #problem
Optimal Time and Communication Solutions of Firing Squad Synchronization Problems on Square Arrays, Toruses and Rings (JG, SLT, MP), pp. 200–211.
CAV-2003-AlurTM #composition #game studies #graph #infinity #recursion
Modular Strategies for Infinite Games on Recursive Graphs (RA, SLT, PM), pp. 67–79.
ICALP-2003-TorreNPP #recursion #state machine
Hierarchical and Recursive State Machines with Context-Dependent Properties (SLT, MN, MP, GP), pp. 776–789.
TACAS-2003-AlurTM #composition #game studies #graph #recursion
Modular Strategies for Recursive Game Graphs (RA, SLT, PM), pp. 363–378.
LICS-2002-FaellaTM #game studies #realtime
Dense Real-Time Games (MF, SLT, AM), pp. 167–176.
VMCAI-2002-FaellaTM #game studies
Automata-Theoretic Decision of Timed Games (MF, SLT, AM), pp. 94–108.
VMCAI-2002-TorreMN #automaton
Weak Muller Acceptance Conditions for Tree Automata (SLT, AM, MN), pp. 240–254.
LICS-2001-AlurT #game studies #generative #ltl
Deterministic Generators and Games for LTL Fragments (RA, SLT), pp. 291–300.
ICALP-1999-AlurTEP #logic #parametricity
Parametric Temporal Logic for “Model Measuring” (RA, KE, SLT, DP), pp. 159–168.
ASE-2015-InversoN0TP #bound #concurrent #model checking #multi #named #thread
Lazy-CSeq: A Context-Bounded Model Checking Tool for Multi-threaded C-Programs (OI, TLN, BF, SLT, GP), pp. 807–812.
ASE-2017-NguyenS0TP #concurrent #parallel #source code
Parallel bug-finding in concurrent programs via reduced interleaving instances (TLN, PS, BF0, SLT, GP), pp. 753–764.
ASE-2019-FischerTP #concurrent #multi #source code #thread
VeriSmart 2.0: Swarm-Based Bug-Finding for Multi-threaded Programs with Lazy-CSeq (BF, SLT, GP), pp. 1150–1153.
TAPSOFT-1997-TorreNP
Synchronization of a Line of Identical Processors at a Given Time (SLT, MN, MP), pp. 405–416.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.