Result 1 to 20 of 572 total
What makes Atl* decidable? A decidable fragment of strategy logic. (English)
Koutny, Maciej (ed.) et al., CONCUR 2012 ‒ concurrency theory. 23rd international conference, CONCUR 2012, Newcastle upon Tyne, UK, September 4‒7, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32939-5/pbk). Lecture Notes in Computer Science 7454, 193-208 (2012).
1
{\sc Bma}: visual tool for modeling and analyzing biological networks. (English)
Madhusudan, P. (ed.) et al., Computer aided verification. 24th international conference, CAV 2012, Berkeley, CA, USA, July 7‒13, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31423-0/pbk). Lecture Notes in Computer Science 7358, 686-692 (2012).
2
Once and for all. (English)
J. Comput. Syst. Sci. 78, No. 3, 981-996 (2012).
3
Synthesizing probabilistic composers. (English)
Birkedal, Lars (ed.), Foundations of software science and computational structures. 15th international conference, FOSSACS 2012, held as part of the European joint conferences on theory and practice of software, ETAPS 2012, Tallinn, Estonia, March 24‒April 1, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-28728-2/pbk). Lecture Notes in Computer Science 7213, 421-436 (2012).
4
Büchi complementation and size-change termination. (English)
Log. Methods Comput. Sci. 8, No. 1, Paper No. 13, 33 p., electronic only (2012).
5
Synthesis from probabilistic components. (English)
Bezem, Marc (ed.), Computer science logic (CSL’11). 25th international workshop, 20th annual conference of the EACSL, Bergen, Norway, September 12‒15, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-32-3). LIPICS ‒ Leibniz International Proceedings in Informatics 12, 412-427, electronic only (2011).
6
Unifying Büchi complementation constructions. (English)
Bezem, Marc (ed.), Computer science logic (CSL’11). 25th international workshop, 20th annual conference of the EACSL, Bergen, Norway, September 12‒15, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-32-3). LIPICS ‒ Leibniz International Proceedings in Informatics 12, 248-263, electronic only (2011).
7
Branching vs. linear time: semantical perspective. (English)
Bezem, Marc (ed.), Computer science logic (CSL’11). 25th international workshop, 20th annual conference of the EACSL, Bergen, Norway, September 12‒15, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-32-3). LIPICS ‒ Leibniz International Proceedings in Informatics 12, 3, electronic only (2011).
8
Temporal synthesis for bounded systems and environments. (English)
Schwentick, Thomas (ed.) et al., STACS 2011. 28th international symposium on theoretical aspects of computer science, Dortmund, Germany, March 10‒12, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-25-5). LIPICS ‒ Leibniz International Proceedings in Informatics 9, 615-626, electronic only (2011).
9
Dynamic reactive modules. (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, 404-418 (2011).
10
Temporal property verification as a program analysis task. (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, 333-348 (2011).
11
Solving the unsolvable. (English)
Commun. ACM 54, No. 7, 5 (2011).
12
Technology has social consequences. (English)
Commun. ACM 54, No. 5, 5 (2011).
13
A multi-encoding approach for LTL symbolic satisfiability checking. (English)
Butler, Michael (ed.) et al., FM 2011: formal methods. 17th international symposium on formal methods, Limerick, Ireland, June 20‒24, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21436-3/pbk). Lecture Notes in Computer Science 6664, 417-431 (2011).
14
The only way is up. (English)
Butler, Michael (ed.) et al., FM 2011: formal methods. 17th international symposium on formal methods, Limerick, Ireland, June 20‒24, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21436-3/pbk). Lecture Notes in Computer Science 6664, 3-11 (2011).
15
Fumbling the future. (English)
Commun. ACM 54, No. 3, 5 (2011).
16
Where have all the workshops gone? (English)
Commun. ACM 54, No. 1, 5 (2011).
17
The complexity of integer bound propagation. (English)
J. Artif. Intell. Res. (JAIR) 40, 657-676 (2011).
18
State of Büchi complementation. (English)
Domaratzki, Michael (ed.) et al., Implementation and application of automata. 15th international conference, CIAA 2010, Winnipeg, MB, Canada, August 12‒15, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-18097-2/pbk). Lecture Notes in Computer Science 6482, 261-271 (2011).
19
Synthesis from recursive-components libraries (English)
GandALF, 1-16 (2011).
20
Result 1 to 20 of 572 total
Start
Contact
Print
General Help
