History


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

Result 1 to 20 of 51 total

Regular transformations of data words through origin information. (English)
Jacobs, Bart (ed.) et al., Foundations of software science and computation structures. 19th international conference, FOSSACS 2016, held as part of the European joint conferences on theory and practice of software, ETAPS 2016, Eindhoven, The Netherlands, April 2‒8, 2016. Proceedings. Berlin: Springer (ISBN 978-3-662-49629-9/pbk; 978-3-662-49630-5/ebook). Lecture Notes in Computer Science 9634, 285-300 (2016).
WorldCat.org
1
On Presburger arithmetic extended with modulo counting quantifiers. (English)
Pitts, Andrew (ed.), Foundations of software science and computation structures. 18th international conference, FOSSACS 2015, held as part of the European joint conferences on theory and practice of software, ETAPS 2015, London, UK, April 11‒18, 2015. Proceedings. Berlin: Springer (ISBN 978-3-662-46677-3/pbk; 978-3-662-46678-0/ebook). Lecture Notes in Computer Science 9034, 375-389 (2015).
WorldCat.org
2
A robust class of data languages and an application to learning. (English)
Log. Methods Comput. Sci. 10, No. 4, Paper No. 19, 23 p., electronic only (2014).
WorldCat.org
3
Ordered navigation on multi-attributed data words. (English)
Baldan, Paolo (ed.) et al., CONCUR 2014 ‒ concurrency theory. 25th international conference, CONCUR 2014, Rome, Italy, September 2‒5, 2014. Proceedings. Berlin: Springer (ISBN 978-3-662-44583-9/pbk). Lecture Notes in Computer Science 8704, 497-511 (2014).
WorldCat.org
4
Ordered navigation on multi-attributed data words. (English)
Baldan, Paolo (ed.) et al., CONCUR 2014 ‒ concurrency theory. 25th international conference, CONCUR 2014, Rome, Italy, September 2‒5, 2014. Proceedings. Berlin: Springer (ISBN 978-3-662-44583-9/pbk). Lecture Notes in Computer Science 8704, 497-511 (2014).
WorldCat.org
5
Learning transparent data automata. (English)
Ciardo, Gianfranco (ed.) et al., Application and theory of Petri nets and concurrency. 35th international conference, PETRI NETS 2014, Tunis, Tunisia, June 23‒27, 2014. Proceedings. Berlin: Springer (ISBN 978-3-319-07733-8/pbk). Lecture Notes in Computer Science 8489, 130-149 (2014).
WorldCat.org
6
A fresh approach to learning register automata. (English)
Béal, Marie-Pierre (ed.) et al., Developments in language theory. 17th international conference, DLT 2013, Marne-la-Vallée, France, June 18‒21, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38770-8/pbk). Lecture Notes in Computer Science 7907, 118-130 (2013).
WorldCat.org
7
Forest automata for verification of heap manipulation. (English)
Form. Methods Syst. Des. 41, No. 1, 83-106 (2012).
WorldCat.org
8
Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree. (English)
Dürr, Christoph (ed.) et al., STACS 2012. 29th international symposium on theoretical aspects of computer science, Paris, France, February 29th ‒ March 3rd, 2012. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-35-4). LIPICS ‒ Leibniz International Proceedings in Informatics 14, 242-253, electronic only (2012).
WorldCat.org
9
Abstract regular (tree) model checking. (English)
STTT 14, N0. 2, 167-191(2012)
WorldCat.org
10
Forest automata for verification of heap manipulation. (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, 424-440 (2011).
WorldCat.org
11
On Yen’s path logic for Petri nets. (English)
Int. J. Found. Comput. Sci. 22, No. 4, 783-799 (2011).
WorldCat.org
12
Programs with lists are counter automata. (English)
Form. Methods Syst. Des. 38, No. 2, 158-192 (2011).
WorldCat.org
13
The downward-closure of Petri net languages. (English)
Abramsky, Samson (ed.) et al., Automata, languages and programming. 37th international colloquium, ICALP 2010, Bordeaux, France, July 6‒10, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-14161-4/pbk). Lecture Notes in Computer Science 6199, 466-477 (2010).
WorldCat.org
14
On the use of non-deterministic automata for Presburger arithmetic. (English)
Gastin, Paul (ed.) et al., CONCUR 2010 ‒ concurrency theory. 21st international conference, CONCUR 2010, Paris, France, August 31 ‒ September 3, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15374-7/pbk). Lecture Notes in Computer Science 6269, 373-387 (2010).
WorldCat.org
15
Automata-based verification of programs with tree updates. (English)
Acta Inf. 47, No. 1, 1-31 (2010).
WorldCat.org
16
Preface. (English)
Habermehl, P. (ed.) et al., Proceedings of the 8th, 9th, and 10th international workshops on verification of infinite-state systems (INFINITY 2006, 2007, 2008), Bonn, Germany, August 26, 2006, Lisbon, Portugal, September 8, 2007, Toronto, Canada, August 23, 2008. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 239, 1-3 (2009).
WorldCat.org
17
Proceedings of the 8th, 9th, and 10th international workshops on verification of infinite-state systems (INFINITY 2006, 2007, 2008), Bonn, Germany, August 26, 2006, Lisbon, Portugal, September 8, 2007, Toronto, Canada, August 23, 2008. (English)
Electronic Notes in Theoretical Computer Science 239. Amsterdam: Elsevier. 211~p., electronic only. (2009).
WorldCat.org
18
Preface. (English)
Electron. Notes Theor. Comput. Sci. 239, 1-3 (2009).
WorldCat.org
19
On Yen’s path logic for Petri nets. (English)
Bournez, Olivier (ed.) et al., Reachability problems. 3rd international workshop, RP 2009, Palaiseau, France, September 23‒25, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04419-9/pbk). Lecture Notes in Computer Science 5797, 51-63 (2009).
WorldCat.org
20
first | previous | 1 21 41 | next | last

Result 1 to 20 of 51 total

Valid XHTML 1.0 Transitional Valid CSS!