Result 1 to 20 of 29 total
Interactive small-step algorithms II: Abstract state machines and the$br$ characterization theorem. (English)
Comput. Res. Repos. 2007, Article No. 0707.3789 (2007).
1
Interactive small-step algorithms I: Axiomatization. (English)
Comput. Res. Repos. 2007, Article No. 0707.3782 (2007).
2
Interactive small-step algorithms. II: Abstract state machines and the characterization theorem. (English)
Log. Methods Comput. Sci. 3, No. 4, Paper 4, 35 p., electronic only (2007).
3
Interactive small-step algorithms. I: Axiomatization. (English)
Log. Methods Comput. Sci. 3, No. 4, Paper 3, 29 p., electronic only (2007).
4
Model-based testing of cryptographic protocols. (English)
De Nicola, Rocco (ed.) et al., Trustworthy global computing. International symposium, TGC 2005, Edinburgh, UK, April 7‒9, 2005. Revised selected papers. Berlin: Springer (ISBN 3-540-30007-4/pbk). Lecture Notes in Computer Science 3705, 33-60 (2005).
5
Model-based testing of cryptographic protocols (English)
TGC, 33-60 (2005).
6
The cryptographic abstract machine. (English)
Zimmermann, Wolf (ed.) et al., Abstract state machines 2004. Advances in theory and practice. 11th international workshop, ASM 2004, Lutherstadt Wittenberg, Germany, May 24‒28, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22094-1/pbk). Lecture Notes in Computer Science 3052, 202-217 (2004).
7
The cryptographic abstract machine (English)
Abstract State Machines, 202-217 (2004).
8
Privacy, abstract encryption and protocols: An ASM model. I. (English)
Börger, Egon (ed.) et al., Abstract state machines 2003. Advances in theory and practice. 10th international workshop, ASM 2003, Taormina, Italy, March 3-7, 2003. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2589, 372-390 (2003).
9
Privacy, abstract encryption and protocols: an ASM model - part I (English)
Abstract State Machines, 372-390 (2003).
10
Partially ordered runs: A case study. (English)
Gurevich, Yuri (ed.) et al., Abstract state machines. Theory and applications. International workshop, ASM 2000, Monte Verità, Switzerland, March 19-24, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1912, 131-150 (2000).
11
Partially ordered runs: A case study (English)
Abstract State Machines, 131-150 (2000).
12
The bakery algorithm: Yet another specification and verification. (English)
Börger, Egon (ed.), Specification and validation methods. Oxford: Clarendon Press. International Schools for Computer Scientists. 231-243 (1995).
13
A mathematical definition of full Prolog. (English)
Sci. Comput. Program. 24, No.3, 249-286 (1995).
14
The WAM ‒ definition and compiler correctness. (English)
Beierle, Christoph (ed.) et al., Logic programming: formal methods and practical applications. Amsterdam: Elsevier. Stud. Comput. Sci. Artif. Intell. 11, 21-90 (1995).
15
The WAM - definition and compiler correctness (English)
Logic Programming: Formal Methods and Practical Applications, 20-90 (1995).
16
Occam: specification and compiler correctness - part I: The primary model (English)
PROCOMET, 489-508 (1994).
17
Towards a mathematical specification of the APE100 architecture: the APESE model (English)
IFIP Congress (1), 396-401 (1994).
18
Evolving algebra model of programming language semantics (English)
IFIP Congress (1), 416-422 (1994).
19
Distributed computations: evolving algebra approach (English)
IFIP Congress (1), 440-441 (1994).
20
Result 1 to 20 of 29 total
Start
Contact
Print
General Help
