History


Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 41 61 | next | last

Result 1 to 20 of 68 total

Reachability analysis of communicating pushdown systems. (English)
Log. Methods Comput. Sci. 8, No. 3, Paper No. 23, 20 p. (2012).
WorldCat.org
1
Model checking vector addition systems with one zero-test. (English)
Log. Methods Comput. Sci. 8, No. 2, Paper No. 11, 25 p., electronic only (2012).
WorldCat.org
2
Vector addition system reversible reachability problem. (English)
Katoen, Joost-Pieter (ed.) et al., CONCUR 2011 ‒ concurrency theory. 22nd international conference, CONCUR 2011, Aachen, Germany, September 6‒9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23216-9/pbk). Lecture Notes in Computer Science 6901, 327-341 (2011).
WorldCat.org
3
The BINCOA framework for binary code 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, 165-170 (2011).
WorldCat.org
4
Vector addition system reachability problem: A short self-contained proof. (English)
Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 5th international conference, LATA 2011, Tarragona, Spain, May 26‒31, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21253-6/pbk). Lecture Notes in Computer Science 6638, 41-64 (2011).
WorldCat.org
5
Share the gain, share the pain? almost transferable utility, changes in production possibilities, and bargaining solutions (English)
Mathematical Social Sciences 62, No. 3, 133-143 (2011).
WorldCat.org
6
Vector addition system reversible reachability problem (English)
CONCUR, 327-341 (2011).
WorldCat.org
7
Vector addition system reachability problem: A short self-contained proof (English)
LATA, 41-64 (2011).
WorldCat.org
8
Vector addition system reachability problem: a short self-contained proof (English)
POPL, 307-316 (2011).
WorldCat.org
9
The BINCOA framework for binary code analysis (English)
CAV, 165-170 (2011).
WorldCat.org
10
Place-boundedness for vector addition systems with one zero-test. (English)
Lodaya, Kamal (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2010), December 15‒18, 2010, Chennai, India. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-23-1). LIPICS ‒ Leibniz International Proceedings in Informatics 8, 192-203, electronic only (2010).
WorldCat.org
11
Interpolating quantifier-free Presburger Arithmetic. (English)
Fermüller, Christian G. (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 17th international conference, LPAR-17, Yogyakarta, Indonesia, October 10‒15, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-16241-1/pbk). Lecture Notes in Computer Science 6397, 489-503 (2010).
WorldCat.org
12
The general vector addition system reachability problem by Presburger inductive invariants. (English)
Log. Methods Comput. Sci. 6, No. 3, Paper No. 22, 25 p., electronic only (2010).
WorldCat.org
13
Reachability analysis of communicating pushdown systems. (English)
Ong, Luke (ed.), Foundations of software science and computational structures. 13th international conference, FOSSACS 2010, held as part of the joint European conferences on theory and practice of software, ETAPS 2010, Paphos, Cyprus, March 20‒28, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-12031-2/pbk). Lecture Notes in Computer Science 6014, 267-281 (2010).
WorldCat.org
14
Updating claims in bankruptcy problems (English)
Mathematical Social Sciences 60, No. 2, 144-148 (2010).
WorldCat.org
15
Interpolating quantifier-free Presburger arithmetic (English)
LPAR (Yogyakarta), 489-503 (2010).
WorldCat.org
16
Reachability analysis of communicating pushdown systems (English)
FOSSACS, 267-281 (2010).
WorldCat.org
17
Place-boundedness for vector addition systems with one zero-test (English)
FSTTCS, 192-203 (2010).
WorldCat.org
18
Polynomial precise interval analysis revisited. (English)
Albers, Susanne (ed.) et al., Efficient algorithms. Essays dedicated to Kurt Mehlhorn on the occasion of his 60th birthday. Berlin: Springer (ISBN 978-3-642-03455-8/pbk). Lecture Notes in Computer Science 5760, 422-437 (2009).
WorldCat.org
19
A generalization of Semenov’s theorem to automata over real numbers. (English)
Schmidt, Renate A. (ed.), Automated deduction ‒ CADE-22. 22nd international conference on automated deduction, Montreal, Canada, August 2‒7, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02958-5/pbk). Lecture Notes in Computer Science 5663. Lecture Notes in Artificial Intelligence, 469-484 (2009).
WorldCat.org
20
first | previous | 1 21 41 61 | next | last

Result 1 to 20 of 68 total

Valid XHTML 1.0 Transitional Valid CSS!