#### Filter Results:

- Full text PDF available (43)

#### Publication Year

2003

2017

- This year (0)
- Last 5 years (33)
- Last 10 years (51)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Salvatore La Torre, P. Madhusudan, Gennaro Parlato
- 22nd Annual IEEE Symposium on Logic in Computerâ€¦
- 2007

We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolean operations. Thisâ€¦ (More)

We propose an approach for reducing the TSO reachability analysis of concurrent programs to their SC reachability analysis, under some conditions on the explored behaviors. First, we propose a linearâ€¦ (More)

- P. Madhusudan, Gennaro Parlato
- POPL
- 2011

We propose a generalization of results on the decidability of emptiness for several restricted classes of sequential and distributed automata with auxiliary storage (stacks, queues) that haveâ€¦ (More)

- Omar Inverso, Truc L. Nguyen, Bernd Fischer, Salvatore La Torre, Gennaro Parlato
- 2015 30th IEEE/ACM International Conference onâ€¦
- 2015

Lazy-CSeq is a context-bounded verification tool for sequentially consistent C programs using POSIX threads. It first translates a multi-threaded C program into a bounded nondeterministic sequentialâ€¦ (More)

Bounded model checking (BMC) has successfully been used for many practical program verification problems, but concurrency still poses a challenge. Here we describe a new approach to BMC ofâ€¦ (More)

We give a translation from concurrent programs to sequential programs that reduces the context-bounded reachability problem in the concurrent program to a reachability problem in the sequential one.â€¦ (More)

We consider the verification of parameterized Boolean programsâ€” abstractions of shared-memory concurrent programs with an unbounded number of threads. We propose that such programs can beâ€¦ (More)

- Salvatore La Torre, P. Madhusudan, Gennaro Parlato
- TACAS
- 2008

We show that the bounded context-switching reachability problem for concurrent finite systems communicating using unbounded FIFO queues is decidable, where in each context a process reads from onlyâ€¦ (More)

- Salvatore La Torre, P. Madhusudan, Gennaro Parlato
- PLDI
- 2009

We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a fixed-point calculus.â€¦ (More)

- Bernd Fischer, Omar Inverso, Gennaro Parlato
- TACAS
- 2013

Sequentialization translates concurrent programs into equivalent nondeterministic sequential programs so that the different concurrent schedules no longer need to be handled explicitly. It can thusâ€¦ (More)