Result 1 to 20 of 43 total
Enforceable security policies revisited. (English)
Degano, Pierpaolo (ed.) et al., Principles of security and trust. First international conference, POST 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-28640-7/pbk). Lecture Notes in Computer Science 7215, 309-328 (2012).
1
A trace-based model for multiparty contracts. (English)
J. Log. Algebr. Program. 81, No. 2, 72-98 (2012).
2
Alternation elimination for automata over nested words. (English)
Hofmann, Martin (ed.), Foundations of software science and computational structures. 14th international conference, FOSSACS 2011, held as part of the joint European conferences on theory and practice of software, ETAPS 2011, Saarbrücken, Germany, March 26 ‒ April 3, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19804-5/pbk). Lecture Notes in Computer Science 6604, 168-183 (2011).
3
Monitoring usage-control policies in distributed systems (English)
TIME, 88-95 (2011).
4
Alternation elimination for automata over nested words (English)
FOSSACS, 168-183 (2011).
5
Ehrenfeucht-Fraïssé goes automatic for real addition. (English)
Inf. Comput. 208, No. 11, 1283-1295 (2010).
6
Policy monitoring in first-order temporal logic. (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, 1-18 (2010).
7
On regular temporal logics with past. (English)
Acta Inf. 47, No. 4, 251-277 (2010).
8
Monitoring security policies with metric first-order temporal logic (English)
SACMAT, 23-34 (2010).
9
Policy monitoring in first-order temporal logic (English)
CAV, 1-18 (2010).
10
Specification languages for stutter-invariant regular properties. (English)
Liu, Zhiming (ed.) et al., Automated technology for verification and analysis. 7th international symposium, ATVA 2009, Macao, China, October 14‒16, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04760-2/pbk). Lecture Notes in Computer Science 5799, 244-254 (2009).
11
On regular temporal logics with past. (English)
Albers, Susanne (ed.) et al., Automata, languages and programming. 36th international colloquium, ICALP 2009, Rhodes, Greece, July 5‒12, 2009. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-02929-5/pbk). Lecture Notes in Computer Science 5556, 175-187 (2009).
12
On regular temporal logics with past (English)
ICALP (2), 175-187 (2009).
13
Specification languages for stutter-invariant regular properties (English)
ATVA, 244-254 (2009).
14
Runtime monitoring of metric first-order temporal properties. (English)
Hariharan, Ramesh (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2008), December 9‒11, 2008, Bangalore, India. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-08-8). LIPICS ‒ Leibniz International Proceedings in Informatics 2, 49-60, electronic only (2008).
15
Don’t care words with an application to the automata-based approach for real addition. (English)
Form. Methods Syst. Des. 33, No. 1-3, 85-115 (2008).
16
Alternation elimination by complementation. (Extended abstract). (English)
Cervesato, Iliano (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 15th international conference, LPAR 2008, Doha, Qatar, November 22‒27, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-89438-4/pbk). Lecture Notes in Computer Science 5330. Lecture Notes in Artificial Intelligence, 214-229 (2008).
17
Bounds on the automata size for presburger arithmetic. (English)
ACM Trans. Comput. Log. 9, No. 2 (2008).
18
Alternation elimination by complementation (Extended abstract) (English)
LPAR, 214-229 (2008).
19
Ehrenfeucht-fraïssé goes automatic for real addition (English)
STACS, 445-456 (2008).
20
Result 1 to 20 of 43 total
Start
Contact
Print
General Help
