Result 1 to 20 of 33 total
On sequentializing concurrent programs. (English)
Yahav, Eran (ed.), Static analysis. 18th international symposium, SAS 2011, Venice, Italy, September 14-16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23701-0/pbk). Lecture Notes in Computer Science 6887, 129-145 (2011).
1
A tabu search heuristic based on $k$-diamonds for the weighted feedback vertex set problem. (English)
Pahl, Julia (ed.) et al., Network optimization. 5th international conference, INOC 2011, Hamburg, Germany, June 13‒16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21526-1/pbk). Lecture Notes in Computer Science 6701, 589-602 (2011).
2
Getting rid of store-buffers in TSO analysis. (English)
Gopalakrishnan, Ganesh (ed.) et al., Computer aided verification. 23rd international conference, CAV 2011, Snowbird, UT, USA, July 14‒20, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22109-5/pbk). Lecture Notes in Computer Science 6806, 99-115 (2011).
3
A tabu search heuristic based on k-diamonds for the weighted feedback vertex set problem (English)
INOC, 589-602 (2011).
4
Decidable logics combining heap structures and data (English)
POPL, 611-622 (2011).
5
The tree width of auxiliary storage (English)
POPL, 283-294 (2011).
6
Getting rid of store-buffers in TSO analysis (English)
CAV, 99-115 (2011).
7
On sequentializing concurrent programs (English)
SAS, 129-145 (2011).
8
Model-checking parameterized concurrent programs using linear interfaces. (English)
Touili, Tayssir (ed.) et al., Computer aided verification. 22nd international conference, CAV 2010, Edinburgh, UK, July 15‒19, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14294-9/pbk). Lecture Notes in Computer Science 6174, 629-644 (2010).
9
The language theory of bounded context-switching. (English)
López-Ortiz, Alejandro (ed.), LATIN 2010: Theoretical informatics. 9th Latin American symposium, Oaxaca, Mexico, April 19‒23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-12199-9/pbk). Lecture Notes in Computer Science 6034, 96-107 (2010).
10
The language theory of bounded context-switching (English)
LATIN, 96-107 (2010).
11
Model-checking parameterized concurrent programs using linear interfaces (English)
CAV, 629-644 (2010).
12
Reducing context-bounded concurrent reachability to sequential reachability. (English)
Bouajjani, Ahmed (ed.) et al., Computer aided verification. 21st international conference, CAV 2009, Grenoble, France, June 26‒July 2, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02657-7/pbk). Lecture Notes in Computer Science 5643, 477-492 (2009).
13
Fast payment schemes for truthful mechanisms with verification. (English)
Theor. Comput. Sci. 410, No. 8-10, 886-899 (2009).
14
Analyzing recursive programs using a fixed-point calculus (English)
PLDI, 211-222 (2009).
15
Reducing context-bounded concurrent reachability to sequential reachability (English)
CAV, 477-492 (2009).
16
An infinite automaton characterization of double exponential time. (English)
Kaminski, Michael (ed.) et al., Computer science logic. 22nd international workshop, CSL 2008, 17th annual conference of the EACSL, Bertinoro, Italy, September 16‒19, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-87530-7/pbk). Lecture Notes in Computer Science 5213, 33-48 (2008).
17
Verification of scope-dependent hierarchical state machines. (English)
Inf. Comput. 206, No. 9-10, 1161-1177 (2008).
18
Context-bounded analysis of concurrent queue systems. (English)
Ramakrishnan, C. R. (ed.) et al., Tools and algorithms for the construction and analysis of systems. 14th international conference, TACAS 2008, held as part of the joint European conferences on theory and practice of software, ETAPS 2008, Budapest, Hungary, March 29‒April 6, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78799-0/pbk). Lecture Notes in Computer Science 4963, 299-314 (2008).
19
Context-bounded analysis of concurrent queue systems (English)
TACAS, 299-314 (2008).
20
Result 1 to 20 of 33 total
Start
Contact
Print
General Help
