Result 1 to 20 of 51 total
Alternating automata on data trees and xpath satisfiability (English)
ACM Trans. Comput. Log. 12, No. 3, 19 (2011).
1
Safety alternating automata on data words (English)
ACM Trans. Comput. Log. 12, No. 2, 10 (2011).
2
The reachability problem for branching vector addition systems requires doubly-exponential space. (English)
Inf. Process. Lett. 110, No. 17, 740-745 (2010).
3
Data-abstraction refinement: a game semantic approach. (English)
Int. J. Softw. Tools Technol. Transf. 12, No. 5, 373-389 (2010).
4
Model checking memoryful linear-time logics over one-counter automata. (English)
Theor. Comput. Sci. 411, No. 22-24, 2298-2316 (2010).
5
The covering and boundedness problems for branching vector addition systems. (English)
Kannan, Ravi (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2009), December 15‒17, 2009, Kanpur, India. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-13-2). LIPICS ‒ Leibniz International Proceedings in Informatics 4, 181-192, electronic only (2009).
6
Average-price-per-reward games on hybrid automata with strong resets. (English)
Jones, Neil D. (ed.) et al., Verification, model checking, and abstract interpretation. 10th international conference, VMCAI 2009, Savannah, GA, USA, January 18‒20, 2009. Proceedings. Berlin: Springer (ISBN 978-3-540-93899-6/pbk). Lecture Notes in Computer Science 5403, 167-181 (2009).
7
LTL with the freeze quantifier and register automata (English)
ACM Trans. Comput. Log. 10, No. 3 (2009).
8
Average-price-per-reward games on hybrid automata with strong resets (English)
VMCAI, 167-181 (2009).
9
The covering and boundedness problems for branching vector addition systems (English)
FSTTCS, 181-192 (2009).
10
Model checking memoryful linear-time logics over one-counter automata. (English)
Comput. Res. Repos. 2008, Article No. 0810.5517 (2008).
11
Nets with tokens which carry data. (English)
Fundam. Inform. 88, No. 3, 251-274 (2008).
12
Alternating automata on data trees and xpath satisfiability. (English)
Comput. Res. Repos. 2008, Article No. 0805.0330 (2008).
13
Safety alternating automata on data words. (English)
Comput. Res. Repos. 2008, Article No. 0802.4237 (2008).
14
Average-price and reachability-price games on hybrid automata with strong resets. (English)
Cassez, Franck (ed.) et al., Formal modeling and analysis of timed systems. 6th international conference, FORMATS 2008, Saint Malo, France, September 15‒17, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85777-8/pbk). Lecture Notes in Computer Science 5215, 63-77 (2008).
15
Model checking freeze LTL over one-counter automata. (English)
Amadio, Roberto (ed.), Foundations of software science and computational structures. 11th international conference, FOSSACS 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-78497-5/pbk). Lecture Notes in Computer Science 4962, 490-504 (2008).
16
Average-price and reachability-price games on hybrid automata with strong resets (English)
FORMATS, 63-77 (2008).
17
Model checking freeze LTL over one-counter automata (English)
FoSSaCS, 490-504 (2008).
18
Nets with tokens which carry data. (English)
Kleijn, Jetty (ed.) et al., Petri nets and other models of concurrency ‒ ICATPN 2007. 28th international conference on applications and theory of Petri nets and other models of concurrency, ICATPN 2007, Siedlce, Poland, June 25‒29, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73093-4/pbk). Lecture Notes in Computer Science 4546, 301-320 (2007).
19
Compositional software verification based on game semantics and process algebra. (English)
Int. J. Softw. Tools Technol. Transf. 9, No. 1, 37-51 (2007).
20
Result 1 to 20 of 51 total
Start
Contact
Print
General Help
